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/overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-e6fd87c [2018-07-25 08:41:20,767 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-25 08:41:20,769 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-25 08:41:20,788 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-25 08:41:20,788 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-25 08:41:20,790 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-25 08:41:20,791 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-25 08:41:20,794 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-25 08:41:20,796 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-25 08:41:20,797 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-25 08:41:20,800 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-25 08:41:20,800 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-25 08:41:20,802 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-25 08:41:20,803 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-25 08:41:20,804 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-25 08:41:20,808 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-25 08:41:20,809 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-25 08:41:20,819 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-25 08:41:20,822 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-25 08:41:20,823 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-25 08:41:20,826 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-25 08:41:20,828 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-25 08:41:20,831 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-25 08:41:20,831 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-25 08:41:20,831 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-25 08:41:20,833 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-25 08:41:20,834 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-25 08:41:20,835 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-25 08:41:20,836 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-25 08:41:20,840 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-25 08:41:20,840 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-25 08:41:20,841 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-25 08:41:20,843 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-25 08:41:20,843 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-25 08:41:20,844 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-25 08:41:20,846 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-25 08:41:20,846 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:41:20,871 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-25 08:41:20,872 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-25 08:41:20,873 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-25 08:41:20,876 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-25 08:41:20,877 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-25 08:41:20,877 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-25 08:41:20,877 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-25 08:41:20,878 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-25 08:41:20,943 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-25 08:41:20,957 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-25 08:41:20,961 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-25 08:41:20,962 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-25 08:41:20,963 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-25 08:41:20,964 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl [2018-07-25 08:41:20,964 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl' [2018-07-25 08:41:21,015 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-25 08:41:21,017 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-07-25 08:41:21,018 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-25 08:41:21,018 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-25 08:41:21,019 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-25 08:41:21,040 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:41:21" (1/1) ... [2018-07-25 08:41:21,053 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:41:21" (1/1) ... [2018-07-25 08:41:21,060 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-25 08:41:21,061 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-25 08:41:21,061 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-25 08:41:21,061 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-25 08:41:21,072 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:41:21" (1/1) ... [2018-07-25 08:41:21,072 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:41:21" (1/1) ... [2018-07-25 08:41:21,073 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:41:21" (1/1) ... [2018-07-25 08:41:21,073 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:41:21" (1/1) ... [2018-07-25 08:41:21,076 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:41:21" (1/1) ... [2018-07-25 08:41:21,078 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:41:21" (1/1) ... [2018-07-25 08:41:21,079 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:41:21" (1/1) ... [2018-07-25 08:41:21,080 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-25 08:41:21,081 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-25 08:41:21,081 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-25 08:41:21,081 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-25 08:41:21,082 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:41:21" (1/1) ... [2018-07-25 08:41:21,167 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-07-25 08:41:21,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-25 08:41:21,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-25 08:41:21,285 INFO L273 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-25 08:41:21,285 INFO L202 PluginConnector]: Adding new model overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 08:41:21 BoogieIcfgContainer [2018-07-25 08:41:21,286 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-25 08:41:21,287 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-25 08:41:21,287 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-25 08:41:21,290 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-25 08:41:21,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:41:21" (1/2) ... [2018-07-25 08:41:21,292 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12fd94eb and model type overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.07 08:41:21, skipping insertion in model container [2018-07-25 08:41:21,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 08:41:21" (2/2) ... [2018-07-25 08:41:21,296 INFO L112 eAbstractionObserver]: Analyzing ICFG overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl [2018-07-25 08:41:21,306 INFO L133 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-25 08:41:21,315 INFO L145 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-25 08:41:21,360 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-25 08:41:21,361 INFO L374 AbstractCegarLoop]: Interprodecural is true [2018-07-25 08:41:21,361 INFO L375 AbstractCegarLoop]: Hoare is true [2018-07-25 08:41:21,361 INFO L376 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-25 08:41:21,362 INFO L377 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-25 08:41:21,362 INFO L378 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-25 08:41:21,362 INFO L379 AbstractCegarLoop]: Difference is false [2018-07-25 08:41:21,362 INFO L380 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-25 08:41:21,362 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-25 08:41:21,374 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-07-25 08:41:21,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-07-25 08:41:21,384 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:21,385 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-07-25 08:41:21,386 INFO L415 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:21,392 INFO L82 PathProgramCache]: Analyzing trace with hash 30017, now seen corresponding path program 1 times [2018-07-25 08:41:21,398 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:21,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:21,470 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:41:21,473 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:41:21,473 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-25 08:41:21,477 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 08:41:21,489 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 08:41:21,490 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 08:41:21,492 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-07-25 08:41:21,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:21,518 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2018-07-25 08:41:21,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 08:41:21,520 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-07-25 08:41:21,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:21,531 INFO L225 Difference]: With dead ends: 8 [2018-07-25 08:41:21,531 INFO L226 Difference]: Without dead ends: 5 [2018-07-25 08:41:21,534 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:41:21,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-07-25 08:41:21,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-07-25 08:41:21,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-07-25 08:41:21,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-07-25 08:41:21,572 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-07-25 08:41:21,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:21,573 INFO L472 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-07-25 08:41:21,573 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 08:41:21,573 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-07-25 08:41:21,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-25 08:41:21,574 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:21,574 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-25 08:41:21,574 INFO L415 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:21,575 INFO L82 PathProgramCache]: Analyzing trace with hash 928552, now seen corresponding path program 1 times [2018-07-25 08:41:21,575 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:21,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:21,604 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:41:21,604 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:21,605 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-25 08:41:21,606 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 08:41:21,607 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 08:41:21,607 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-25 08:41:21,608 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2018-07-25 08:41:21,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:21,627 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-07-25 08:41:21,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 08:41:21,628 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-07-25 08:41:21,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:21,628 INFO L225 Difference]: With dead ends: 8 [2018-07-25 08:41:21,629 INFO L226 Difference]: Without dead ends: 6 [2018-07-25 08:41:21,630 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-25 08:41:21,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-07-25 08:41:21,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-07-25 08:41:21,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-07-25 08:41:21,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-07-25 08:41:21,633 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-07-25 08:41:21,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:21,633 INFO L472 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-07-25 08:41:21,633 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 08:41:21,634 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-07-25 08:41:21,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-07-25 08:41:21,634 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:21,634 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-07-25 08:41:21,635 INFO L415 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:21,635 INFO L82 PathProgramCache]: Analyzing trace with hash 28783137, now seen corresponding path program 2 times [2018-07-25 08:41:21,635 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:21,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:21,683 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:41:21,684 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:21,684 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-25 08:41:21,684 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 08:41:21,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 08:41:21,685 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-25 08:41:21,685 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2018-07-25 08:41:21,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:21,701 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-07-25 08:41:21,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-25 08:41:21,702 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-07-25 08:41:21,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:21,703 INFO L225 Difference]: With dead ends: 9 [2018-07-25 08:41:21,703 INFO L226 Difference]: Without dead ends: 7 [2018-07-25 08:41:21,704 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-25 08:41:21,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-07-25 08:41:21,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-07-25 08:41:21,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-07-25 08:41:21,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-07-25 08:41:21,707 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-07-25 08:41:21,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:21,708 INFO L472 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-07-25 08:41:21,708 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 08:41:21,708 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-07-25 08:41:21,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 08:41:21,708 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:21,709 INFO L354 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-07-25 08:41:21,709 INFO L415 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:21,709 INFO L82 PathProgramCache]: Analyzing trace with hash 892275272, now seen corresponding path program 3 times [2018-07-25 08:41:21,709 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:21,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:21,754 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:41:21,755 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:21,755 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-25 08:41:21,755 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 08:41:21,756 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 08:41:21,756 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-07-25 08:41:21,757 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-07-25 08:41:21,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:21,780 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-07-25 08:41:21,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-25 08:41:21,787 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-07-25 08:41:21,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:21,788 INFO L225 Difference]: With dead ends: 10 [2018-07-25 08:41:21,788 INFO L226 Difference]: Without dead ends: 8 [2018-07-25 08:41:21,789 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-07-25 08:41:21,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-07-25 08:41:21,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-07-25 08:41:21,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-07-25 08:41:21,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-07-25 08:41:21,798 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-07-25 08:41:21,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:21,798 INFO L472 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-07-25 08:41:21,798 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 08:41:21,799 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-07-25 08:41:21,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-25 08:41:21,799 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:21,799 INFO L354 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-07-25 08:41:21,800 INFO L415 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:21,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1890727681, now seen corresponding path program 4 times [2018-07-25 08:41:21,800 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:21,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:21,847 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:41:21,848 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:21,848 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 08:41:21,848 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 08:41:21,849 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 08:41:21,849 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:41:21,849 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-07-25 08:41:21,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:21,896 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-07-25 08:41:21,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-25 08:41:21,900 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-07-25 08:41:21,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:21,900 INFO L225 Difference]: With dead ends: 11 [2018-07-25 08:41:21,901 INFO L226 Difference]: Without dead ends: 9 [2018-07-25 08:41:21,903 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:41:21,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-07-25 08:41:21,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-07-25 08:41:21,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-25 08:41:21,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-07-25 08:41:21,909 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-07-25 08:41:21,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:21,909 INFO L472 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-07-25 08:41:21,909 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 08:41:21,910 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-07-25 08:41:21,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 08:41:21,910 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:21,910 INFO L354 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-07-25 08:41:21,911 INFO L415 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:21,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1516986008, now seen corresponding path program 5 times [2018-07-25 08:41:21,913 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:21,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:21,983 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:41:21,984 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:21,984 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:41:21,985 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:41:21,985 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:41:21,985 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:41:21,986 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-07-25 08:41:22,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:22,017 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-07-25 08:41:22,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-25 08:41:22,018 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-25 08:41:22,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:22,021 INFO L225 Difference]: With dead ends: 12 [2018-07-25 08:41:22,021 INFO L226 Difference]: Without dead ends: 10 [2018-07-25 08:41:22,022 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:41:22,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-07-25 08:41:22,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-07-25 08:41:22,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-07-25 08:41:22,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-07-25 08:41:22,029 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-07-25 08:41:22,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:22,029 INFO L472 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-07-25 08:41:22,030 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:41:22,030 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-07-25 08:41:22,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-07-25 08:41:22,030 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:22,031 INFO L354 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-07-25 08:41:22,031 INFO L415 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:22,031 INFO L82 PathProgramCache]: Analyzing trace with hash 218072033, now seen corresponding path program 6 times [2018-07-25 08:41:22,035 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:22,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:22,117 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:41:22,117 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:22,118 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 08:41:22,118 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 08:41:22,118 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 08:41:22,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:41:22,119 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2018-07-25 08:41:22,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:22,153 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-07-25 08:41:22,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-25 08:41:22,156 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-07-25 08:41:22,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:22,157 INFO L225 Difference]: With dead ends: 13 [2018-07-25 08:41:22,157 INFO L226 Difference]: Without dead ends: 11 [2018-07-25 08:41:22,158 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:41:22,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-25 08:41:22,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-07-25 08:41:22,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-25 08:41:22,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-07-25 08:41:22,172 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-07-25 08:41:22,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:22,172 INFO L472 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-07-25 08:41:22,173 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 08:41:22,173 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-07-25 08:41:22,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 08:41:22,173 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:22,174 INFO L354 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-07-25 08:41:22,174 INFO L415 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:22,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1829703544, now seen corresponding path program 7 times [2018-07-25 08:41:22,177 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:22,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:22,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:41:22,270 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:22,270 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 08:41:22,271 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 08:41:22,271 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 08:41:22,271 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-07-25 08:41:22,272 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2018-07-25 08:41:22,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:22,291 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-07-25 08:41:22,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 08:41:22,293 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-07-25 08:41:22,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:22,294 INFO L225 Difference]: With dead ends: 14 [2018-07-25 08:41:22,294 INFO L226 Difference]: Without dead ends: 12 [2018-07-25 08:41:22,295 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-07-25 08:41:22,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-07-25 08:41:22,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-07-25 08:41:22,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-07-25 08:41:22,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-07-25 08:41:22,299 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-07-25 08:41:22,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:22,299 INFO L472 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-07-25 08:41:22,300 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 08:41:22,300 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-07-25 08:41:22,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-25 08:41:22,300 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:22,301 INFO L354 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-07-25 08:41:22,301 INFO L415 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:22,301 INFO L82 PathProgramCache]: Analyzing trace with hash -886236991, now seen corresponding path program 8 times [2018-07-25 08:41:22,302 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:22,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:22,374 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:41:22,375 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:22,375 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 08:41:22,375 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:41:22,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:41:22,376 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:41:22,377 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2018-07-25 08:41:22,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:22,412 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-07-25 08:41:22,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 08:41:22,414 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-07-25 08:41:22,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:22,415 INFO L225 Difference]: With dead ends: 15 [2018-07-25 08:41:22,416 INFO L226 Difference]: Without dead ends: 13 [2018-07-25 08:41:22,417 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:41:22,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-07-25 08:41:22,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-07-25 08:41:22,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-25 08:41:22,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-07-25 08:41:22,425 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-07-25 08:41:22,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:22,426 INFO L472 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-07-25 08:41:22,426 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:41:22,432 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-07-25 08:41:22,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 08:41:22,432 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:22,433 INFO L354 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-07-25 08:41:22,433 INFO L415 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:22,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1703544920, now seen corresponding path program 9 times [2018-07-25 08:41:22,434 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:22,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:22,512 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:41:22,512 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:22,513 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 08:41:22,513 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 08:41:22,515 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 08:41:22,516 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:41:22,516 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2018-07-25 08:41:22,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:22,544 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-07-25 08:41:22,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 08:41:22,544 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-07-25 08:41:22,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:22,545 INFO L225 Difference]: With dead ends: 16 [2018-07-25 08:41:22,545 INFO L226 Difference]: Without dead ends: 14 [2018-07-25 08:41:22,546 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:41:22,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-07-25 08:41:22,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-07-25 08:41:22,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-07-25 08:41:22,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-07-25 08:41:22,553 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-07-25 08:41:22,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:22,555 INFO L472 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-07-25 08:41:22,555 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 08:41:22,555 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-07-25 08:41:22,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 08:41:22,556 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:22,556 INFO L354 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-07-25 08:41:22,558 INFO L415 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:22,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1270286943, now seen corresponding path program 10 times [2018-07-25 08:41:22,559 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:22,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:22,632 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:41:22,633 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:22,633 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 08:41:22,635 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 08:41:22,635 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 08:41:22,635 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-07-25 08:41:22,636 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2018-07-25 08:41:22,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:22,653 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-07-25 08:41:22,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 08:41:22,654 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-07-25 08:41:22,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:22,655 INFO L225 Difference]: With dead ends: 17 [2018-07-25 08:41:22,655 INFO L226 Difference]: Without dead ends: 15 [2018-07-25 08:41:22,656 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-07-25 08:41:22,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-07-25 08:41:22,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-07-25 08:41:22,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-25 08:41:22,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-07-25 08:41:22,660 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-07-25 08:41:22,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:22,660 INFO L472 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-07-25 08:41:22,661 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 08:41:22,661 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-07-25 08:41:22,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-25 08:41:22,662 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:22,662 INFO L354 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-07-25 08:41:22,662 INFO L415 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:22,662 INFO L82 PathProgramCache]: Analyzing trace with hash -724191544, now seen corresponding path program 11 times [2018-07-25 08:41:22,663 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:22,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:22,719 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:41:22,720 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:22,720 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 08:41:22,721 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 08:41:22,722 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 08:41:22,722 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-07-25 08:41:22,722 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2018-07-25 08:41:22,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:22,751 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-07-25 08:41:22,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 08:41:22,752 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-07-25 08:41:22,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:22,753 INFO L225 Difference]: With dead ends: 18 [2018-07-25 08:41:22,753 INFO L226 Difference]: Without dead ends: 16 [2018-07-25 08:41:22,754 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-07-25 08:41:22,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-07-25 08:41:22,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-07-25 08:41:22,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-07-25 08:41:22,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-07-25 08:41:22,762 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-07-25 08:41:22,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:22,763 INFO L472 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-07-25 08:41:22,763 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 08:41:22,763 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-07-25 08:41:22,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 08:41:22,764 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:22,764 INFO L354 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2018-07-25 08:41:22,764 INFO L415 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:22,765 INFO L82 PathProgramCache]: Analyzing trace with hash -975103359, now seen corresponding path program 12 times [2018-07-25 08:41:22,765 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:22,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:22,825 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:41:22,826 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:22,826 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-25 08:41:22,826 INFO L451 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-25 08:41:22,827 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-25 08:41:22,827 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-07-25 08:41:22,831 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2018-07-25 08:41:22,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:22,855 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-07-25 08:41:22,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 08:41:22,856 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-07-25 08:41:22,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:22,857 INFO L225 Difference]: With dead ends: 19 [2018-07-25 08:41:22,857 INFO L226 Difference]: Without dead ends: 17 [2018-07-25 08:41:22,858 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-07-25 08:41:22,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-07-25 08:41:22,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-07-25 08:41:22,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-07-25 08:41:22,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-07-25 08:41:22,862 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-07-25 08:41:22,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:22,863 INFO L472 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-07-25 08:41:22,864 INFO L473 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-25 08:41:22,864 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-07-25 08:41:22,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 08:41:22,865 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:22,865 INFO L354 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-07-25 08:41:22,865 INFO L415 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:22,866 INFO L82 PathProgramCache]: Analyzing trace with hash -163435032, now seen corresponding path program 13 times [2018-07-25 08:41:22,866 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:22,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:22,938 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:41:22,939 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:22,939 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-25 08:41:22,941 INFO L451 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-25 08:41:22,942 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-25 08:41:22,942 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-07-25 08:41:22,943 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2018-07-25 08:41:22,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:22,976 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-07-25 08:41:22,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-25 08:41:22,977 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2018-07-25 08:41:22,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:22,977 INFO L225 Difference]: With dead ends: 20 [2018-07-25 08:41:22,978 INFO L226 Difference]: Without dead ends: 18 [2018-07-25 08:41:22,978 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-07-25 08:41:22,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-07-25 08:41:22,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-07-25 08:41:22,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-07-25 08:41:22,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-07-25 08:41:22,984 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-07-25 08:41:22,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:22,984 INFO L472 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-07-25 08:41:22,984 INFO L473 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-25 08:41:22,985 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-07-25 08:41:22,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-25 08:41:22,985 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:22,985 INFO L354 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2018-07-25 08:41:22,986 INFO L415 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:22,986 INFO L82 PathProgramCache]: Analyzing trace with hash -771520671, now seen corresponding path program 14 times [2018-07-25 08:41:22,986 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:22,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:23,053 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:41:23,054 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:23,054 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-07-25 08:41:23,055 INFO L451 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-25 08:41:23,055 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-25 08:41:23,055 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-07-25 08:41:23,056 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2018-07-25 08:41:23,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:23,078 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-07-25 08:41:23,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 08:41:23,079 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2018-07-25 08:41:23,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:23,081 INFO L225 Difference]: With dead ends: 21 [2018-07-25 08:41:23,081 INFO L226 Difference]: Without dead ends: 19 [2018-07-25 08:41:23,082 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-07-25 08:41:23,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-07-25 08:41:23,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-07-25 08:41:23,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-07-25 08:41:23,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-07-25 08:41:23,088 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-07-25 08:41:23,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:23,088 INFO L472 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-07-25 08:41:23,088 INFO L473 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-25 08:41:23,090 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-07-25 08:41:23,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 08:41:23,090 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:23,091 INFO L354 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2018-07-25 08:41:23,091 INFO L415 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:23,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1852661000, now seen corresponding path program 15 times [2018-07-25 08:41:23,092 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:23,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:23,162 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:41:23,163 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:23,164 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-07-25 08:41:23,164 INFO L451 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-25 08:41:23,164 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-25 08:41:23,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-07-25 08:41:23,165 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2018-07-25 08:41:23,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:23,191 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-07-25 08:41:23,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-25 08:41:23,191 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-07-25 08:41:23,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:23,192 INFO L225 Difference]: With dead ends: 22 [2018-07-25 08:41:23,196 INFO L226 Difference]: Without dead ends: 20 [2018-07-25 08:41:23,196 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-07-25 08:41:23,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-07-25 08:41:23,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-07-25 08:41:23,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-07-25 08:41:23,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-07-25 08:41:23,201 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-07-25 08:41:23,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:23,202 INFO L472 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-07-25 08:41:23,202 INFO L473 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-25 08:41:23,202 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-07-25 08:41:23,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-25 08:41:23,203 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:23,203 INFO L354 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2018-07-25 08:41:23,203 INFO L415 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:23,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1597914177, now seen corresponding path program 16 times [2018-07-25 08:41:23,203 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:23,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:23,271 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:41:23,272 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:23,272 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-07-25 08:41:23,273 INFO L451 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-07-25 08:41:23,273 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-07-25 08:41:23,274 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-07-25 08:41:23,274 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2018-07-25 08:41:23,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:23,292 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-07-25 08:41:23,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-25 08:41:23,292 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2018-07-25 08:41:23,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:23,293 INFO L225 Difference]: With dead ends: 23 [2018-07-25 08:41:23,293 INFO L226 Difference]: Without dead ends: 21 [2018-07-25 08:41:23,295 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-07-25 08:41:23,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-07-25 08:41:23,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-07-25 08:41:23,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-07-25 08:41:23,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-07-25 08:41:23,299 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-07-25 08:41:23,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:23,299 INFO L472 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-07-25 08:41:23,299 INFO L473 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-07-25 08:41:23,300 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-07-25 08:41:23,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 08:41:23,300 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:23,300 INFO L354 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2018-07-25 08:41:23,301 INFO L415 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:23,301 INFO L82 PathProgramCache]: Analyzing trace with hash -2004270040, now seen corresponding path program 17 times [2018-07-25 08:41:23,301 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:23,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:23,373 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:41:23,375 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:23,376 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-07-25 08:41:23,376 INFO L451 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-07-25 08:41:23,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-07-25 08:41:23,377 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-07-25 08:41:23,377 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2018-07-25 08:41:23,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:23,408 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-07-25 08:41:23,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-25 08:41:23,409 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2018-07-25 08:41:23,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:23,409 INFO L225 Difference]: With dead ends: 24 [2018-07-25 08:41:23,410 INFO L226 Difference]: Without dead ends: 22 [2018-07-25 08:41:23,410 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-07-25 08:41:23,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-07-25 08:41:23,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-07-25 08:41:23,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-07-25 08:41:23,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-07-25 08:41:23,420 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-07-25 08:41:23,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:23,420 INFO L472 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-07-25 08:41:23,421 INFO L473 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-07-25 08:41:23,421 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-07-25 08:41:23,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-25 08:41:23,423 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:23,423 INFO L354 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2018-07-25 08:41:23,423 INFO L415 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:23,424 INFO L82 PathProgramCache]: Analyzing trace with hash -2002831071, now seen corresponding path program 18 times [2018-07-25 08:41:23,424 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:23,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:23,508 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:41:23,508 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:23,509 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-07-25 08:41:23,509 INFO L451 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-07-25 08:41:23,511 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-07-25 08:41:23,511 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-07-25 08:41:23,511 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2018-07-25 08:41:23,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:23,526 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-07-25 08:41:23,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-25 08:41:23,526 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2018-07-25 08:41:23,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:23,527 INFO L225 Difference]: With dead ends: 25 [2018-07-25 08:41:23,527 INFO L226 Difference]: Without dead ends: 23 [2018-07-25 08:41:23,528 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-07-25 08:41:23,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-07-25 08:41:23,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-07-25 08:41:23,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-07-25 08:41:23,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-07-25 08:41:23,534 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-07-25 08:41:23,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:23,537 INFO L472 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-07-25 08:41:23,537 INFO L473 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-07-25 08:41:23,538 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-07-25 08:41:23,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-25 08:41:23,538 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:23,539 INFO L354 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2018-07-25 08:41:23,539 INFO L415 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:23,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1958223032, now seen corresponding path program 19 times [2018-07-25 08:41:23,540 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:23,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:23,615 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:41:23,615 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:23,615 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-07-25 08:41:23,616 INFO L451 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-07-25 08:41:23,616 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-07-25 08:41:23,617 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-07-25 08:41:23,617 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2018-07-25 08:41:23,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:23,641 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-07-25 08:41:23,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-25 08:41:23,641 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2018-07-25 08:41:23,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:23,642 INFO L225 Difference]: With dead ends: 26 [2018-07-25 08:41:23,642 INFO L226 Difference]: Without dead ends: 24 [2018-07-25 08:41:23,643 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-07-25 08:41:23,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-07-25 08:41:23,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-07-25 08:41:23,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-07-25 08:41:23,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-07-25 08:41:23,648 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-07-25 08:41:23,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:23,649 INFO L472 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-07-25 08:41:23,649 INFO L473 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-07-25 08:41:23,649 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-07-25 08:41:23,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-25 08:41:23,650 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:23,650 INFO L354 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2018-07-25 08:41:23,651 INFO L415 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:23,651 INFO L82 PathProgramCache]: Analyzing trace with hash -575373823, now seen corresponding path program 20 times [2018-07-25 08:41:23,651 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:23,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:23,734 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:41:23,734 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:23,743 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-07-25 08:41:23,744 INFO L451 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-07-25 08:41:23,744 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-07-25 08:41:23,745 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-07-25 08:41:23,745 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2018-07-25 08:41:23,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:23,772 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-07-25 08:41:23,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-25 08:41:23,772 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2018-07-25 08:41:23,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:23,773 INFO L225 Difference]: With dead ends: 27 [2018-07-25 08:41:23,773 INFO L226 Difference]: Without dead ends: 25 [2018-07-25 08:41:23,774 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-07-25 08:41:23,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-07-25 08:41:23,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-07-25 08:41:23,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-07-25 08:41:23,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-07-25 08:41:23,781 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-07-25 08:41:23,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:23,782 INFO L472 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-07-25 08:41:23,782 INFO L473 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-07-25 08:41:23,782 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-07-25 08:41:23,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-07-25 08:41:23,783 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:23,783 INFO L354 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2018-07-25 08:41:23,783 INFO L415 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:23,784 INFO L82 PathProgramCache]: Analyzing trace with hash -656721304, now seen corresponding path program 21 times [2018-07-25 08:41:23,784 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:23,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:23,872 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:41:23,872 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:23,872 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-07-25 08:41:23,873 INFO L451 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-07-25 08:41:23,873 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-07-25 08:41:23,873 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-07-25 08:41:23,874 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2018-07-25 08:41:23,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:23,902 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-07-25 08:41:23,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 08:41:23,902 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2018-07-25 08:41:23,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:23,903 INFO L225 Difference]: With dead ends: 28 [2018-07-25 08:41:23,903 INFO L226 Difference]: Without dead ends: 26 [2018-07-25 08:41:23,908 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-07-25 08:41:23,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-07-25 08:41:23,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-07-25 08:41:23,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-07-25 08:41:23,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-07-25 08:41:23,916 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-07-25 08:41:23,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:23,916 INFO L472 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-07-25 08:41:23,916 INFO L473 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-07-25 08:41:23,917 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-07-25 08:41:23,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-25 08:41:23,917 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:23,918 INFO L354 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2018-07-25 08:41:23,918 INFO L415 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:23,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1116474081, now seen corresponding path program 22 times [2018-07-25 08:41:23,919 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:23,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:24,037 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:41:24,038 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:24,038 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-07-25 08:41:24,039 INFO L451 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-07-25 08:41:24,039 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-07-25 08:41:24,040 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-07-25 08:41:24,040 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2018-07-25 08:41:24,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:24,070 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-07-25 08:41:24,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-25 08:41:24,071 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2018-07-25 08:41:24,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:24,071 INFO L225 Difference]: With dead ends: 29 [2018-07-25 08:41:24,071 INFO L226 Difference]: Without dead ends: 27 [2018-07-25 08:41:24,072 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-07-25 08:41:24,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-07-25 08:41:24,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-07-25 08:41:24,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-07-25 08:41:24,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-07-25 08:41:24,078 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-07-25 08:41:24,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:24,079 INFO L472 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-07-25 08:41:24,079 INFO L473 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-07-25 08:41:24,079 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-07-25 08:41:24,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-07-25 08:41:24,080 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:24,080 INFO L354 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2018-07-25 08:41:24,080 INFO L415 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:24,080 INFO L82 PathProgramCache]: Analyzing trace with hash 250956168, now seen corresponding path program 23 times [2018-07-25 08:41:24,080 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:24,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:24,180 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:41:24,180 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:24,180 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-07-25 08:41:24,181 INFO L451 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-07-25 08:41:24,181 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-07-25 08:41:24,181 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-07-25 08:41:24,182 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2018-07-25 08:41:24,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:24,202 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-07-25 08:41:24,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-25 08:41:24,203 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2018-07-25 08:41:24,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:24,203 INFO L225 Difference]: With dead ends: 30 [2018-07-25 08:41:24,204 INFO L226 Difference]: Without dead ends: 28 [2018-07-25 08:41:24,204 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-07-25 08:41:24,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-07-25 08:41:24,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-07-25 08:41:24,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-07-25 08:41:24,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-07-25 08:41:24,211 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-07-25 08:41:24,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:24,211 INFO L472 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-07-25 08:41:24,211 INFO L473 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-07-25 08:41:24,214 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-07-25 08:41:24,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-07-25 08:41:24,215 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:24,215 INFO L354 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2018-07-25 08:41:24,215 INFO L415 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:24,215 INFO L82 PathProgramCache]: Analyzing trace with hash -810295359, now seen corresponding path program 24 times [2018-07-25 08:41:24,216 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:24,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:24,327 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:41:24,328 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:24,328 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-07-25 08:41:24,328 INFO L451 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-07-25 08:41:24,329 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-07-25 08:41:24,329 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-07-25 08:41:24,330 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2018-07-25 08:41:24,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:24,353 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-07-25 08:41:24,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-25 08:41:24,354 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2018-07-25 08:41:24,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:24,354 INFO L225 Difference]: With dead ends: 31 [2018-07-25 08:41:24,355 INFO L226 Difference]: Without dead ends: 29 [2018-07-25 08:41:24,356 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-07-25 08:41:24,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-07-25 08:41:24,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-07-25 08:41:24,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-07-25 08:41:24,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-07-25 08:41:24,361 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-07-25 08:41:24,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:24,361 INFO L472 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-07-25 08:41:24,362 INFO L473 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-07-25 08:41:24,362 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-07-25 08:41:24,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-07-25 08:41:24,363 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:24,363 INFO L354 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2018-07-25 08:41:24,363 INFO L415 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:24,368 INFO L82 PathProgramCache]: Analyzing trace with hash 650645672, now seen corresponding path program 25 times [2018-07-25 08:41:24,368 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:24,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:24,477 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:41:24,477 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:24,477 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-07-25 08:41:24,478 INFO L451 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-07-25 08:41:24,478 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-07-25 08:41:24,481 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-07-25 08:41:24,481 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2018-07-25 08:41:24,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:24,505 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-07-25 08:41:24,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-25 08:41:24,505 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2018-07-25 08:41:24,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:24,506 INFO L225 Difference]: With dead ends: 32 [2018-07-25 08:41:24,506 INFO L226 Difference]: Without dead ends: 30 [2018-07-25 08:41:24,508 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-07-25 08:41:24,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-07-25 08:41:24,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-07-25 08:41:24,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-07-25 08:41:24,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-07-25 08:41:24,512 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-07-25 08:41:24,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:24,513 INFO L472 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-07-25 08:41:24,513 INFO L473 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-07-25 08:41:24,513 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-07-25 08:41:24,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-07-25 08:41:24,514 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:24,514 INFO L354 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2018-07-25 08:41:24,514 INFO L415 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:24,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1304822623, now seen corresponding path program 26 times [2018-07-25 08:41:24,515 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:24,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:24,625 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:41:24,625 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:24,625 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-07-25 08:41:24,626 INFO L451 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-07-25 08:41:24,626 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-07-25 08:41:24,627 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-07-25 08:41:24,627 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2018-07-25 08:41:24,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:24,648 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-07-25 08:41:24,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-25 08:41:24,649 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2018-07-25 08:41:24,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:24,649 INFO L225 Difference]: With dead ends: 33 [2018-07-25 08:41:24,649 INFO L226 Difference]: Without dead ends: 31 [2018-07-25 08:41:24,650 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-07-25 08:41:24,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-07-25 08:41:24,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-07-25 08:41:24,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-07-25 08:41:24,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-07-25 08:41:24,654 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-07-25 08:41:24,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:24,654 INFO L472 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-07-25 08:41:24,654 INFO L473 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-07-25 08:41:24,654 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-07-25 08:41:24,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-07-25 08:41:24,655 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:24,655 INFO L354 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2018-07-25 08:41:24,655 INFO L415 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:24,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1794797624, now seen corresponding path program 27 times [2018-07-25 08:41:24,656 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:24,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:24,772 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:41:24,772 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:24,772 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-07-25 08:41:24,773 INFO L451 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-07-25 08:41:24,773 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-07-25 08:41:24,774 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-07-25 08:41:24,774 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2018-07-25 08:41:24,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:24,796 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-07-25 08:41:24,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-25 08:41:24,796 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2018-07-25 08:41:24,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:24,797 INFO L225 Difference]: With dead ends: 34 [2018-07-25 08:41:24,797 INFO L226 Difference]: Without dead ends: 32 [2018-07-25 08:41:24,798 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-07-25 08:41:24,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-07-25 08:41:24,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-07-25 08:41:24,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-07-25 08:41:24,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-07-25 08:41:24,801 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-07-25 08:41:24,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:24,802 INFO L472 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-07-25 08:41:24,802 INFO L473 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-07-25 08:41:24,802 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-07-25 08:41:24,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-07-25 08:41:24,803 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:24,803 INFO L354 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2018-07-25 08:41:24,803 INFO L415 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:24,803 INFO L82 PathProgramCache]: Analyzing trace with hash 195846529, now seen corresponding path program 28 times [2018-07-25 08:41:24,803 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:24,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:24,928 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:41:24,928 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:24,929 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-07-25 08:41:24,929 INFO L451 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-07-25 08:41:24,929 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-07-25 08:41:24,930 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-07-25 08:41:24,930 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2018-07-25 08:41:24,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:24,952 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-07-25 08:41:24,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-25 08:41:24,952 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2018-07-25 08:41:24,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:24,953 INFO L225 Difference]: With dead ends: 35 [2018-07-25 08:41:24,953 INFO L226 Difference]: Without dead ends: 33 [2018-07-25 08:41:24,954 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-07-25 08:41:24,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-07-25 08:41:24,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-07-25 08:41:24,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-07-25 08:41:24,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-07-25 08:41:24,957 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-07-25 08:41:24,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:24,958 INFO L472 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-07-25 08:41:24,958 INFO L473 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-07-25 08:41:24,958 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-07-25 08:41:24,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-07-25 08:41:24,961 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:24,961 INFO L354 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2018-07-25 08:41:24,961 INFO L415 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:24,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1776273128, now seen corresponding path program 29 times [2018-07-25 08:41:24,962 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:24,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:25,101 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:41:25,101 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:25,102 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-07-25 08:41:25,102 INFO L451 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-07-25 08:41:25,102 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-07-25 08:41:25,103 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-07-25 08:41:25,103 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2018-07-25 08:41:25,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:25,128 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-07-25 08:41:25,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-07-25 08:41:25,128 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2018-07-25 08:41:25,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:25,129 INFO L225 Difference]: With dead ends: 36 [2018-07-25 08:41:25,129 INFO L226 Difference]: Without dead ends: 34 [2018-07-25 08:41:25,131 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-07-25 08:41:25,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-07-25 08:41:25,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-07-25 08:41:25,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-07-25 08:41:25,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-07-25 08:41:25,135 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-07-25 08:41:25,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:25,136 INFO L472 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-07-25 08:41:25,136 INFO L473 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-07-25 08:41:25,136 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-07-25 08:41:25,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-07-25 08:41:25,137 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:25,137 INFO L354 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2018-07-25 08:41:25,137 INFO L415 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:25,138 INFO L82 PathProgramCache]: Analyzing trace with hash -770109855, now seen corresponding path program 30 times [2018-07-25 08:41:25,138 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:25,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:25,293 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:41:25,294 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:25,294 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-07-25 08:41:25,294 INFO L451 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-07-25 08:41:25,295 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-07-25 08:41:25,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 08:41:25,296 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2018-07-25 08:41:25,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:25,317 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-07-25 08:41:25,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-25 08:41:25,318 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2018-07-25 08:41:25,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:25,319 INFO L225 Difference]: With dead ends: 37 [2018-07-25 08:41:25,319 INFO L226 Difference]: Without dead ends: 35 [2018-07-25 08:41:25,320 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 08:41:25,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-07-25 08:41:25,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-07-25 08:41:25,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-07-25 08:41:25,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-07-25 08:41:25,323 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-07-25 08:41:25,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:25,324 INFO L472 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-07-25 08:41:25,324 INFO L473 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-07-25 08:41:25,324 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-07-25 08:41:25,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-07-25 08:41:25,324 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:25,324 INFO L354 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2018-07-25 08:41:25,325 INFO L415 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:25,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1896396296, now seen corresponding path program 31 times [2018-07-25 08:41:25,325 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:25,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:25,550 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:41:25,551 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:25,551 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-07-25 08:41:25,551 INFO L451 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-07-25 08:41:25,552 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-07-25 08:41:25,552 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 08:41:25,553 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2018-07-25 08:41:25,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:25,572 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-07-25 08:41:25,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-25 08:41:25,572 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2018-07-25 08:41:25,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:25,573 INFO L225 Difference]: With dead ends: 38 [2018-07-25 08:41:25,573 INFO L226 Difference]: Without dead ends: 36 [2018-07-25 08:41:25,574 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 08:41:25,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-07-25 08:41:25,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-07-25 08:41:25,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-07-25 08:41:25,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-07-25 08:41:25,582 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-07-25 08:41:25,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:25,587 INFO L472 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-07-25 08:41:25,587 INFO L473 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-07-25 08:41:25,587 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-07-25 08:41:25,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-07-25 08:41:25,588 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:25,588 INFO L354 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2018-07-25 08:41:25,588 INFO L415 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:25,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1341258943, now seen corresponding path program 32 times [2018-07-25 08:41:25,590 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:25,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:25,748 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:41:25,748 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:25,748 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-07-25 08:41:25,749 INFO L451 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-07-25 08:41:25,749 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-07-25 08:41:25,750 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 08:41:25,750 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2018-07-25 08:41:25,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:25,776 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-07-25 08:41:25,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-25 08:41:25,776 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2018-07-25 08:41:25,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:25,777 INFO L225 Difference]: With dead ends: 39 [2018-07-25 08:41:25,777 INFO L226 Difference]: Without dead ends: 37 [2018-07-25 08:41:25,778 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 08:41:25,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-07-25 08:41:25,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-07-25 08:41:25,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-07-25 08:41:25,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-07-25 08:41:25,786 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-07-25 08:41:25,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:25,786 INFO L472 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-07-25 08:41:25,787 INFO L473 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-07-25 08:41:25,787 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-07-25 08:41:25,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-07-25 08:41:25,787 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:25,787 INFO L354 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2018-07-25 08:41:25,788 INFO L415 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:25,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1370643752, now seen corresponding path program 33 times [2018-07-25 08:41:25,788 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:25,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:25,929 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:41:25,929 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:25,930 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-07-25 08:41:25,930 INFO L451 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-07-25 08:41:25,930 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-07-25 08:41:25,931 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-07-25 08:41:25,931 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2018-07-25 08:41:25,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:25,956 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-07-25 08:41:25,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-07-25 08:41:25,956 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2018-07-25 08:41:25,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:25,957 INFO L225 Difference]: With dead ends: 40 [2018-07-25 08:41:25,957 INFO L226 Difference]: Without dead ends: 38 [2018-07-25 08:41:25,958 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-07-25 08:41:25,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-07-25 08:41:25,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-07-25 08:41:25,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-07-25 08:41:25,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-07-25 08:41:25,962 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-07-25 08:41:25,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:25,962 INFO L472 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-07-25 08:41:25,962 INFO L473 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-07-25 08:41:25,962 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-07-25 08:41:25,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-07-25 08:41:25,962 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:25,963 INFO L354 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2018-07-25 08:41:25,963 INFO L415 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:25,963 INFO L82 PathProgramCache]: Analyzing trace with hash -459718623, now seen corresponding path program 34 times [2018-07-25 08:41:25,963 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:25,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:26,117 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:41:26,118 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:26,118 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-07-25 08:41:26,118 INFO L451 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-07-25 08:41:26,118 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-07-25 08:41:26,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 08:41:26,119 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2018-07-25 08:41:26,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:26,143 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-07-25 08:41:26,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-07-25 08:41:26,143 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2018-07-25 08:41:26,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:26,144 INFO L225 Difference]: With dead ends: 41 [2018-07-25 08:41:26,144 INFO L226 Difference]: Without dead ends: 39 [2018-07-25 08:41:26,145 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 08:41:26,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-07-25 08:41:26,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-07-25 08:41:26,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-07-25 08:41:26,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-07-25 08:41:26,147 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-07-25 08:41:26,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:26,148 INFO L472 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-07-25 08:41:26,148 INFO L473 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-07-25 08:41:26,148 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-07-25 08:41:26,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-07-25 08:41:26,148 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:26,149 INFO L354 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2018-07-25 08:41:26,149 INFO L415 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:26,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1366377400, now seen corresponding path program 35 times [2018-07-25 08:41:26,149 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:26,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:26,292 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:41:26,293 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:26,293 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-07-25 08:41:26,293 INFO L451 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-07-25 08:41:26,293 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-07-25 08:41:26,294 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-07-25 08:41:26,294 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2018-07-25 08:41:26,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:26,319 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-07-25 08:41:26,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-07-25 08:41:26,320 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2018-07-25 08:41:26,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:26,320 INFO L225 Difference]: With dead ends: 42 [2018-07-25 08:41:26,320 INFO L226 Difference]: Without dead ends: 40 [2018-07-25 08:41:26,321 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-07-25 08:41:26,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-07-25 08:41:26,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-07-25 08:41:26,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-07-25 08:41:26,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-07-25 08:41:26,324 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-07-25 08:41:26,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:26,324 INFO L472 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-07-25 08:41:26,325 INFO L473 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-07-25 08:41:26,325 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-07-25 08:41:26,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-07-25 08:41:26,325 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:26,325 INFO L354 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2018-07-25 08:41:26,325 INFO L415 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:26,326 INFO L82 PathProgramCache]: Analyzing trace with hash 591971585, now seen corresponding path program 36 times [2018-07-25 08:41:26,326 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:26,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:26,479 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:41:26,480 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:26,480 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-07-25 08:41:26,480 INFO L451 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-07-25 08:41:26,481 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-07-25 08:41:26,481 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-07-25 08:41:26,482 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2018-07-25 08:41:26,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:26,499 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-07-25 08:41:26,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-07-25 08:41:26,500 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2018-07-25 08:41:26,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:26,502 INFO L225 Difference]: With dead ends: 43 [2018-07-25 08:41:26,502 INFO L226 Difference]: Without dead ends: 41 [2018-07-25 08:41:26,503 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-07-25 08:41:26,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-07-25 08:41:26,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-07-25 08:41:26,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-07-25 08:41:26,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-07-25 08:41:26,505 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-07-25 08:41:26,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:26,506 INFO L472 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-07-25 08:41:26,506 INFO L473 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-07-25 08:41:26,506 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-07-25 08:41:26,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-07-25 08:41:26,506 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:26,506 INFO L354 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2018-07-25 08:41:26,507 INFO L415 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:26,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1171247976, now seen corresponding path program 37 times [2018-07-25 08:41:26,507 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:26,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:26,653 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:41:26,654 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:26,654 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-07-25 08:41:26,654 INFO L451 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-07-25 08:41:26,655 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-07-25 08:41:26,655 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-07-25 08:41:26,656 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2018-07-25 08:41:26,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:26,680 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-07-25 08:41:26,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-07-25 08:41:26,680 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2018-07-25 08:41:26,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:26,681 INFO L225 Difference]: With dead ends: 44 [2018-07-25 08:41:26,681 INFO L226 Difference]: Without dead ends: 42 [2018-07-25 08:41:26,682 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-07-25 08:41:26,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-07-25 08:41:26,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-07-25 08:41:26,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-07-25 08:41:26,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-07-25 08:41:26,684 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-07-25 08:41:26,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:26,684 INFO L472 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-07-25 08:41:26,684 INFO L473 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-07-25 08:41:26,685 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-07-25 08:41:26,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-07-25 08:41:26,685 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:26,685 INFO L354 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2018-07-25 08:41:26,685 INFO L415 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:26,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1948946913, now seen corresponding path program 38 times [2018-07-25 08:41:26,686 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:26,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:26,837 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:41:26,837 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:26,837 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-07-25 08:41:26,838 INFO L451 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-07-25 08:41:26,838 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-07-25 08:41:26,839 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-07-25 08:41:26,839 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2018-07-25 08:41:26,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:26,865 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-07-25 08:41:26,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-07-25 08:41:26,865 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2018-07-25 08:41:26,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:26,866 INFO L225 Difference]: With dead ends: 45 [2018-07-25 08:41:26,866 INFO L226 Difference]: Without dead ends: 43 [2018-07-25 08:41:26,867 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-07-25 08:41:26,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-07-25 08:41:26,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-07-25 08:41:26,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-07-25 08:41:26,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-07-25 08:41:26,869 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-07-25 08:41:26,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:26,870 INFO L472 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-07-25 08:41:26,870 INFO L473 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-07-25 08:41:26,870 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-07-25 08:41:26,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-07-25 08:41:26,870 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:26,870 INFO L354 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2018-07-25 08:41:26,871 INFO L415 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:26,871 INFO L82 PathProgramCache]: Analyzing trace with hash 287810184, now seen corresponding path program 39 times [2018-07-25 08:41:26,871 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:26,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:27,030 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:41:27,030 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:27,031 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-07-25 08:41:27,031 INFO L451 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-07-25 08:41:27,031 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-07-25 08:41:27,032 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-07-25 08:41:27,033 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2018-07-25 08:41:27,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:27,053 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-07-25 08:41:27,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-07-25 08:41:27,053 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2018-07-25 08:41:27,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:27,053 INFO L225 Difference]: With dead ends: 46 [2018-07-25 08:41:27,053 INFO L226 Difference]: Without dead ends: 44 [2018-07-25 08:41:27,055 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-07-25 08:41:27,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-07-25 08:41:27,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-07-25 08:41:27,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-07-25 08:41:27,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-07-25 08:41:27,057 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-07-25 08:41:27,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:27,057 INFO L472 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-07-25 08:41:27,057 INFO L473 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-07-25 08:41:27,057 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-07-25 08:41:27,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-07-25 08:41:27,058 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:27,058 INFO L354 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2018-07-25 08:41:27,058 INFO L415 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:27,058 INFO L82 PathProgramCache]: Analyzing trace with hash 332179137, now seen corresponding path program 40 times [2018-07-25 08:41:27,058 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:27,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:27,222 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:41:27,222 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:27,222 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-07-25 08:41:27,222 INFO L451 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-07-25 08:41:27,223 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-07-25 08:41:27,224 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-07-25 08:41:27,224 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2018-07-25 08:41:27,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:27,254 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-07-25 08:41:27,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-07-25 08:41:27,255 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2018-07-25 08:41:27,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:27,255 INFO L225 Difference]: With dead ends: 47 [2018-07-25 08:41:27,256 INFO L226 Difference]: Without dead ends: 45 [2018-07-25 08:41:27,257 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-07-25 08:41:27,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-07-25 08:41:27,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-07-25 08:41:27,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-07-25 08:41:27,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-07-25 08:41:27,259 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-07-25 08:41:27,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:27,260 INFO L472 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-07-25 08:41:27,260 INFO L473 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-07-25 08:41:27,260 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-07-25 08:41:27,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-07-25 08:41:27,260 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:27,260 INFO L354 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2018-07-25 08:41:27,261 INFO L415 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:27,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1707616680, now seen corresponding path program 41 times [2018-07-25 08:41:27,261 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:27,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:27,435 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:41:27,435 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:27,435 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-07-25 08:41:27,436 INFO L451 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-07-25 08:41:27,436 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-07-25 08:41:27,437 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-07-25 08:41:27,437 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2018-07-25 08:41:27,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:27,460 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-07-25 08:41:27,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-07-25 08:41:27,460 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2018-07-25 08:41:27,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:27,461 INFO L225 Difference]: With dead ends: 48 [2018-07-25 08:41:27,461 INFO L226 Difference]: Without dead ends: 46 [2018-07-25 08:41:27,462 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-07-25 08:41:27,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-07-25 08:41:27,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-07-25 08:41:27,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-07-25 08:41:27,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-07-25 08:41:27,464 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-07-25 08:41:27,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:27,465 INFO L472 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-07-25 08:41:27,465 INFO L473 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-07-25 08:41:27,465 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-07-25 08:41:27,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-07-25 08:41:27,465 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:27,466 INFO L354 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2018-07-25 08:41:27,466 INFO L415 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:27,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1396507553, now seen corresponding path program 42 times [2018-07-25 08:41:27,466 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:27,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:27,651 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:41:27,651 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:27,651 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-07-25 08:41:27,652 INFO L451 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-07-25 08:41:27,652 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-07-25 08:41:27,653 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-07-25 08:41:27,653 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2018-07-25 08:41:27,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:27,684 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-07-25 08:41:27,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-07-25 08:41:27,684 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2018-07-25 08:41:27,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:27,685 INFO L225 Difference]: With dead ends: 49 [2018-07-25 08:41:27,685 INFO L226 Difference]: Without dead ends: 47 [2018-07-25 08:41:27,686 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-07-25 08:41:27,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-07-25 08:41:27,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-07-25 08:41:27,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-07-25 08:41:27,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-07-25 08:41:27,689 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-07-25 08:41:27,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:27,689 INFO L472 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-07-25 08:41:27,689 INFO L473 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-07-25 08:41:27,690 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-07-25 08:41:27,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-07-25 08:41:27,690 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:27,690 INFO L354 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2018-07-25 08:41:27,690 INFO L415 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:27,691 INFO L82 PathProgramCache]: Analyzing trace with hash 342059208, now seen corresponding path program 43 times [2018-07-25 08:41:27,691 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:27,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:27,892 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:41:27,892 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:27,892 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-07-25 08:41:27,893 INFO L451 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-07-25 08:41:27,893 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-07-25 08:41:27,894 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-07-25 08:41:27,895 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2018-07-25 08:41:27,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:27,928 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-07-25 08:41:27,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-07-25 08:41:27,929 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2018-07-25 08:41:27,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:27,930 INFO L225 Difference]: With dead ends: 50 [2018-07-25 08:41:27,930 INFO L226 Difference]: Without dead ends: 48 [2018-07-25 08:41:27,931 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-07-25 08:41:27,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-07-25 08:41:27,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-07-25 08:41:27,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-07-25 08:41:27,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-07-25 08:41:27,934 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-07-25 08:41:27,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:27,934 INFO L472 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-07-25 08:41:27,934 INFO L473 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-07-25 08:41:27,934 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-07-25 08:41:27,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-07-25 08:41:27,935 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:27,935 INFO L354 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2018-07-25 08:41:27,935 INFO L415 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:27,936 INFO L82 PathProgramCache]: Analyzing trace with hash 2013898881, now seen corresponding path program 44 times [2018-07-25 08:41:27,936 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:27,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:28,157 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:41:28,157 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:28,157 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-07-25 08:41:28,158 INFO L451 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-07-25 08:41:28,158 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-07-25 08:41:28,159 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-07-25 08:41:28,160 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2018-07-25 08:41:28,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:28,186 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-07-25 08:41:28,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-07-25 08:41:28,187 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2018-07-25 08:41:28,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:28,187 INFO L225 Difference]: With dead ends: 51 [2018-07-25 08:41:28,187 INFO L226 Difference]: Without dead ends: 49 [2018-07-25 08:41:28,188 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-07-25 08:41:28,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-07-25 08:41:28,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-07-25 08:41:28,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-07-25 08:41:28,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-07-25 08:41:28,191 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-07-25 08:41:28,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:28,191 INFO L472 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-07-25 08:41:28,191 INFO L473 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-07-25 08:41:28,192 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-07-25 08:41:28,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-07-25 08:41:28,192 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:28,192 INFO L354 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2018-07-25 08:41:28,192 INFO L415 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:28,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1993646104, now seen corresponding path program 45 times [2018-07-25 08:41:28,193 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:28,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:28,443 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:41:28,444 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:28,444 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-07-25 08:41:28,444 INFO L451 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-07-25 08:41:28,445 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-07-25 08:41:28,445 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-07-25 08:41:28,445 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2018-07-25 08:41:28,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:28,468 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-07-25 08:41:28,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-07-25 08:41:28,469 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2018-07-25 08:41:28,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:28,469 INFO L225 Difference]: With dead ends: 52 [2018-07-25 08:41:28,469 INFO L226 Difference]: Without dead ends: 50 [2018-07-25 08:41:28,470 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-07-25 08:41:28,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-07-25 08:41:28,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-07-25 08:41:28,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-07-25 08:41:28,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-07-25 08:41:28,473 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-07-25 08:41:28,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:28,473 INFO L472 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-07-25 08:41:28,473 INFO L473 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-07-25 08:41:28,473 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-07-25 08:41:28,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-07-25 08:41:28,474 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:28,474 INFO L354 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2018-07-25 08:41:28,474 INFO L415 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:28,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1673489055, now seen corresponding path program 46 times [2018-07-25 08:41:28,475 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:28,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:28,670 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:41:28,670 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:28,670 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-07-25 08:41:28,671 INFO L451 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-07-25 08:41:28,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-07-25 08:41:28,672 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-07-25 08:41:28,672 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2018-07-25 08:41:28,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:28,695 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-07-25 08:41:28,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-07-25 08:41:28,695 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2018-07-25 08:41:28,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:28,696 INFO L225 Difference]: With dead ends: 53 [2018-07-25 08:41:28,696 INFO L226 Difference]: Without dead ends: 51 [2018-07-25 08:41:28,697 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-07-25 08:41:28,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-07-25 08:41:28,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-07-25 08:41:28,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-07-25 08:41:28,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-07-25 08:41:28,699 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-07-25 08:41:28,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:28,699 INFO L472 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-07-25 08:41:28,699 INFO L473 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-07-25 08:41:28,699 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-07-25 08:41:28,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-07-25 08:41:28,700 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:28,700 INFO L354 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2018-07-25 08:41:28,700 INFO L415 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:28,700 INFO L82 PathProgramCache]: Analyzing trace with hash -338555128, now seen corresponding path program 47 times [2018-07-25 08:41:28,701 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:28,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:28,896 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:41:28,897 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:28,897 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-07-25 08:41:28,897 INFO L451 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-07-25 08:41:28,898 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-07-25 08:41:28,898 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-07-25 08:41:28,899 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2018-07-25 08:41:28,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:28,922 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-07-25 08:41:28,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-07-25 08:41:28,922 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2018-07-25 08:41:28,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:28,923 INFO L225 Difference]: With dead ends: 54 [2018-07-25 08:41:28,923 INFO L226 Difference]: Without dead ends: 52 [2018-07-25 08:41:28,924 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-07-25 08:41:28,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-07-25 08:41:28,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-07-25 08:41:28,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-07-25 08:41:28,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-07-25 08:41:28,928 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-07-25 08:41:28,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:28,928 INFO L472 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-07-25 08:41:28,928 INFO L473 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-07-25 08:41:28,928 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-07-25 08:41:28,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-07-25 08:41:28,928 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:28,929 INFO L354 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2018-07-25 08:41:28,929 INFO L415 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:28,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1905276351, now seen corresponding path program 48 times [2018-07-25 08:41:28,929 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:28,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:29,133 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:41:29,133 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:29,133 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-07-25 08:41:29,134 INFO L451 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-07-25 08:41:29,134 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-07-25 08:41:29,135 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-07-25 08:41:29,135 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2018-07-25 08:41:29,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:29,167 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-07-25 08:41:29,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-07-25 08:41:29,167 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2018-07-25 08:41:29,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:29,167 INFO L225 Difference]: With dead ends: 55 [2018-07-25 08:41:29,168 INFO L226 Difference]: Without dead ends: 53 [2018-07-25 08:41:29,169 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-07-25 08:41:29,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-07-25 08:41:29,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-07-25 08:41:29,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-07-25 08:41:29,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-07-25 08:41:29,173 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-07-25 08:41:29,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:29,173 INFO L472 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-07-25 08:41:29,174 INFO L473 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-07-25 08:41:29,174 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-07-25 08:41:29,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-07-25 08:41:29,174 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:29,174 INFO L354 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2018-07-25 08:41:29,175 INFO L415 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:29,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1065973288, now seen corresponding path program 49 times [2018-07-25 08:41:29,175 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:29,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:29,383 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:29,383 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:29,383 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-07-25 08:41:29,384 INFO L451 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-07-25 08:41:29,384 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-07-25 08:41:29,385 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-07-25 08:41:29,385 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2018-07-25 08:41:29,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:29,418 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-07-25 08:41:29,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-07-25 08:41:29,418 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2018-07-25 08:41:29,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:29,419 INFO L225 Difference]: With dead ends: 56 [2018-07-25 08:41:29,419 INFO L226 Difference]: Without dead ends: 54 [2018-07-25 08:41:29,420 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-07-25 08:41:29,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-07-25 08:41:29,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-07-25 08:41:29,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-07-25 08:41:29,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-07-25 08:41:29,422 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-07-25 08:41:29,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:29,423 INFO L472 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-07-25 08:41:29,423 INFO L473 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-07-25 08:41:29,423 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-07-25 08:41:29,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-07-25 08:41:29,423 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:29,423 INFO L354 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2018-07-25 08:41:29,424 INFO L415 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:29,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1314568415, now seen corresponding path program 50 times [2018-07-25 08:41:29,424 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:29,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:29,636 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:29,636 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:29,636 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-07-25 08:41:29,637 INFO L451 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-07-25 08:41:29,637 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-07-25 08:41:29,638 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-07-25 08:41:29,639 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2018-07-25 08:41:29,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:29,679 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-07-25 08:41:29,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-07-25 08:41:29,679 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2018-07-25 08:41:29,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:29,680 INFO L225 Difference]: With dead ends: 57 [2018-07-25 08:41:29,680 INFO L226 Difference]: Without dead ends: 55 [2018-07-25 08:41:29,681 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-07-25 08:41:29,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-07-25 08:41:29,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-07-25 08:41:29,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-07-25 08:41:29,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-07-25 08:41:29,688 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2018-07-25 08:41:29,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:29,688 INFO L472 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-07-25 08:41:29,689 INFO L473 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-07-25 08:41:29,689 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-07-25 08:41:29,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-07-25 08:41:29,689 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:29,689 INFO L354 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2018-07-25 08:41:29,690 INFO L415 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:29,690 INFO L82 PathProgramCache]: Analyzing trace with hash -2096917176, now seen corresponding path program 51 times [2018-07-25 08:41:29,690 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:29,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:29,915 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:29,915 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:29,915 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-07-25 08:41:29,916 INFO L451 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-07-25 08:41:29,916 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-07-25 08:41:29,917 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-07-25 08:41:29,918 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2018-07-25 08:41:29,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:29,944 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-07-25 08:41:29,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-07-25 08:41:29,945 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2018-07-25 08:41:29,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:29,945 INFO L225 Difference]: With dead ends: 58 [2018-07-25 08:41:29,945 INFO L226 Difference]: Without dead ends: 56 [2018-07-25 08:41:29,946 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-07-25 08:41:29,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-07-25 08:41:29,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-07-25 08:41:29,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-07-25 08:41:29,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-07-25 08:41:29,949 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2018-07-25 08:41:29,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:29,949 INFO L472 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-07-25 08:41:29,949 INFO L473 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-07-25 08:41:29,950 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-07-25 08:41:29,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-07-25 08:41:29,950 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:29,950 INFO L354 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2018-07-25 08:41:29,950 INFO L415 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:29,951 INFO L82 PathProgramCache]: Analyzing trace with hash -579924991, now seen corresponding path program 52 times [2018-07-25 08:41:29,951 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:29,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:30,173 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:30,173 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:30,174 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-07-25 08:41:30,174 INFO L451 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-07-25 08:41:30,174 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-07-25 08:41:30,175 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-07-25 08:41:30,175 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2018-07-25 08:41:30,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:30,206 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-07-25 08:41:30,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-07-25 08:41:30,206 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2018-07-25 08:41:30,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:30,207 INFO L225 Difference]: With dead ends: 59 [2018-07-25 08:41:30,207 INFO L226 Difference]: Without dead ends: 57 [2018-07-25 08:41:30,208 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-07-25 08:41:30,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-07-25 08:41:30,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-07-25 08:41:30,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-07-25 08:41:30,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-07-25 08:41:30,210 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2018-07-25 08:41:30,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:30,210 INFO L472 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-07-25 08:41:30,211 INFO L473 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-07-25 08:41:30,211 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-07-25 08:41:30,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-07-25 08:41:30,211 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:30,211 INFO L354 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2018-07-25 08:41:30,212 INFO L415 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:30,212 INFO L82 PathProgramCache]: Analyzing trace with hash -797807512, now seen corresponding path program 53 times [2018-07-25 08:41:30,212 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:30,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:30,427 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:30,428 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:30,428 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-07-25 08:41:30,428 INFO L451 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-07-25 08:41:30,429 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-07-25 08:41:30,429 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-07-25 08:41:30,430 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2018-07-25 08:41:30,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:30,468 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-07-25 08:41:30,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-07-25 08:41:30,468 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2018-07-25 08:41:30,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:30,469 INFO L225 Difference]: With dead ends: 60 [2018-07-25 08:41:30,469 INFO L226 Difference]: Without dead ends: 58 [2018-07-25 08:41:30,470 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-07-25 08:41:30,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-07-25 08:41:30,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-07-25 08:41:30,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-07-25 08:41:30,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-07-25 08:41:30,472 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2018-07-25 08:41:30,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:30,473 INFO L472 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-07-25 08:41:30,473 INFO L473 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-07-25 08:41:30,473 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-07-25 08:41:30,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-07-25 08:41:30,473 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:30,473 INFO L354 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2018-07-25 08:41:30,474 INFO L415 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:30,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1037768929, now seen corresponding path program 54 times [2018-07-25 08:41:30,474 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:30,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:30,692 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:30,692 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:30,692 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-07-25 08:41:30,693 INFO L451 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-07-25 08:41:30,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-07-25 08:41:30,694 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-07-25 08:41:30,694 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2018-07-25 08:41:30,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:30,737 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-07-25 08:41:30,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-07-25 08:41:30,738 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2018-07-25 08:41:30,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:30,739 INFO L225 Difference]: With dead ends: 61 [2018-07-25 08:41:30,739 INFO L226 Difference]: Without dead ends: 59 [2018-07-25 08:41:30,740 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-07-25 08:41:30,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-07-25 08:41:30,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-07-25 08:41:30,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-07-25 08:41:30,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-07-25 08:41:30,743 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2018-07-25 08:41:30,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:30,744 INFO L472 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-07-25 08:41:30,744 INFO L473 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-07-25 08:41:30,744 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-07-25 08:41:30,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-07-25 08:41:30,745 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:30,745 INFO L354 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2018-07-25 08:41:30,745 INFO L415 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:30,745 INFO L82 PathProgramCache]: Analyzing trace with hash 2106063752, now seen corresponding path program 55 times [2018-07-25 08:41:30,745 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:30,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:31,002 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:31,002 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:31,003 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-07-25 08:41:31,003 INFO L451 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-07-25 08:41:31,004 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-07-25 08:41:31,005 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-07-25 08:41:31,005 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2018-07-25 08:41:31,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:31,036 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-07-25 08:41:31,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-07-25 08:41:31,036 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2018-07-25 08:41:31,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:31,037 INFO L225 Difference]: With dead ends: 62 [2018-07-25 08:41:31,037 INFO L226 Difference]: Without dead ends: 60 [2018-07-25 08:41:31,038 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-07-25 08:41:31,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-07-25 08:41:31,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-07-25 08:41:31,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-07-25 08:41:31,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-07-25 08:41:31,041 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2018-07-25 08:41:31,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:31,041 INFO L472 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-07-25 08:41:31,042 INFO L473 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-07-25 08:41:31,042 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-07-25 08:41:31,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-07-25 08:41:31,042 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:31,043 INFO L354 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2018-07-25 08:41:31,043 INFO L415 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:31,043 INFO L82 PathProgramCache]: Analyzing trace with hash 863464897, now seen corresponding path program 56 times [2018-07-25 08:41:31,043 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:31,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:31,339 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:31,340 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:31,340 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-07-25 08:41:31,340 INFO L451 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-07-25 08:41:31,340 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-07-25 08:41:31,341 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-07-25 08:41:31,341 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2018-07-25 08:41:31,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:31,388 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-07-25 08:41:31,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-07-25 08:41:31,388 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2018-07-25 08:41:31,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:31,389 INFO L225 Difference]: With dead ends: 63 [2018-07-25 08:41:31,389 INFO L226 Difference]: Without dead ends: 61 [2018-07-25 08:41:31,390 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-07-25 08:41:31,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-07-25 08:41:31,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-07-25 08:41:31,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-07-25 08:41:31,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-07-25 08:41:31,394 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2018-07-25 08:41:31,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:31,394 INFO L472 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-07-25 08:41:31,394 INFO L473 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-07-25 08:41:31,394 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-07-25 08:41:31,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-07-25 08:41:31,395 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:31,395 INFO L354 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2018-07-25 08:41:31,395 INFO L415 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:31,396 INFO L82 PathProgramCache]: Analyzing trace with hash 997606056, now seen corresponding path program 57 times [2018-07-25 08:41:31,396 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:31,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:31,610 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:31,610 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:31,610 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-07-25 08:41:31,611 INFO L451 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-07-25 08:41:31,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-07-25 08:41:31,612 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-07-25 08:41:31,613 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2018-07-25 08:41:31,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:31,657 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-07-25 08:41:31,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-07-25 08:41:31,657 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2018-07-25 08:41:31,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:31,658 INFO L225 Difference]: With dead ends: 64 [2018-07-25 08:41:31,658 INFO L226 Difference]: Without dead ends: 62 [2018-07-25 08:41:31,660 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-07-25 08:41:31,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-07-25 08:41:31,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-07-25 08:41:31,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-07-25 08:41:31,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-07-25 08:41:31,663 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2018-07-25 08:41:31,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:31,663 INFO L472 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-07-25 08:41:31,663 INFO L473 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-07-25 08:41:31,663 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-07-25 08:41:31,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-07-25 08:41:31,664 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:31,664 INFO L354 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2018-07-25 08:41:31,664 INFO L415 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:31,665 INFO L82 PathProgramCache]: Analyzing trace with hash 861014689, now seen corresponding path program 58 times [2018-07-25 08:41:31,665 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:31,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:31,916 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:31,917 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:31,917 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-07-25 08:41:31,917 INFO L451 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-07-25 08:41:31,918 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-07-25 08:41:31,919 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-07-25 08:41:31,919 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2018-07-25 08:41:31,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:31,962 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-07-25 08:41:31,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-07-25 08:41:31,963 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2018-07-25 08:41:31,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:31,963 INFO L225 Difference]: With dead ends: 65 [2018-07-25 08:41:31,964 INFO L226 Difference]: Without dead ends: 63 [2018-07-25 08:41:31,965 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-07-25 08:41:31,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-07-25 08:41:31,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-07-25 08:41:31,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-07-25 08:41:31,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-07-25 08:41:31,967 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2018-07-25 08:41:31,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:31,968 INFO L472 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-07-25 08:41:31,968 INFO L473 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-07-25 08:41:31,968 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-07-25 08:41:31,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-07-25 08:41:31,969 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:31,969 INFO L354 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2018-07-25 08:41:31,969 INFO L415 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:31,969 INFO L82 PathProgramCache]: Analyzing trace with hash 921649608, now seen corresponding path program 59 times [2018-07-25 08:41:31,969 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:31,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:32,225 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:32,225 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:32,225 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-07-25 08:41:32,226 INFO L451 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-07-25 08:41:32,226 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-07-25 08:41:32,227 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-07-25 08:41:32,228 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2018-07-25 08:41:32,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:32,276 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-07-25 08:41:32,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-07-25 08:41:32,276 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2018-07-25 08:41:32,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:32,277 INFO L225 Difference]: With dead ends: 66 [2018-07-25 08:41:32,277 INFO L226 Difference]: Without dead ends: 64 [2018-07-25 08:41:32,278 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-07-25 08:41:32,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-07-25 08:41:32,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-07-25 08:41:32,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-07-25 08:41:32,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-07-25 08:41:32,282 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2018-07-25 08:41:32,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:32,282 INFO L472 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-07-25 08:41:32,282 INFO L473 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-07-25 08:41:32,282 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-07-25 08:41:32,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-07-25 08:41:32,283 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:32,283 INFO L354 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2018-07-25 08:41:32,283 INFO L415 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:32,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1493635199, now seen corresponding path program 60 times [2018-07-25 08:41:32,284 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:32,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:32,527 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:32,527 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:32,528 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-07-25 08:41:32,528 INFO L451 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-07-25 08:41:32,529 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-07-25 08:41:32,529 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-07-25 08:41:32,530 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2018-07-25 08:41:32,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:32,569 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-07-25 08:41:32,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-07-25 08:41:32,570 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2018-07-25 08:41:32,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:32,570 INFO L225 Difference]: With dead ends: 67 [2018-07-25 08:41:32,570 INFO L226 Difference]: Without dead ends: 65 [2018-07-25 08:41:32,572 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-07-25 08:41:32,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-07-25 08:41:32,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-07-25 08:41:32,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-07-25 08:41:32,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-07-25 08:41:32,576 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2018-07-25 08:41:32,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:32,576 INFO L472 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-07-25 08:41:32,576 INFO L473 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-07-25 08:41:32,577 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-07-25 08:41:32,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-07-25 08:41:32,577 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:32,577 INFO L354 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2018-07-25 08:41:32,578 INFO L415 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:32,578 INFO L82 PathProgramCache]: Analyzing trace with hash 941947112, now seen corresponding path program 61 times [2018-07-25 08:41:32,578 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:32,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:32,822 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:32,823 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:32,823 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-07-25 08:41:32,823 INFO L451 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-07-25 08:41:32,824 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-07-25 08:41:32,825 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-07-25 08:41:32,825 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2018-07-25 08:41:32,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:32,877 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-07-25 08:41:32,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-07-25 08:41:32,878 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2018-07-25 08:41:32,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:32,879 INFO L225 Difference]: With dead ends: 68 [2018-07-25 08:41:32,879 INFO L226 Difference]: Without dead ends: 66 [2018-07-25 08:41:32,880 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-07-25 08:41:32,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-07-25 08:41:32,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-07-25 08:41:32,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-07-25 08:41:32,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-07-25 08:41:32,883 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2018-07-25 08:41:32,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:32,884 INFO L472 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-07-25 08:41:32,884 INFO L473 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-07-25 08:41:32,884 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-07-25 08:41:32,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-07-25 08:41:32,884 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:32,885 INFO L354 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2018-07-25 08:41:32,885 INFO L415 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:32,885 INFO L82 PathProgramCache]: Analyzing trace with hash -864412575, now seen corresponding path program 62 times [2018-07-25 08:41:32,885 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:32,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:33,145 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,146 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:33,146 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-07-25 08:41:33,146 INFO L451 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-07-25 08:41:33,147 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-07-25 08:41:33,149 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-07-25 08:41:33,149 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2018-07-25 08:41:33,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:33,204 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-07-25 08:41:33,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-07-25 08:41:33,205 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2018-07-25 08:41:33,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:33,205 INFO L225 Difference]: With dead ends: 69 [2018-07-25 08:41:33,206 INFO L226 Difference]: Without dead ends: 67 [2018-07-25 08:41:33,207 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-07-25 08:41:33,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-07-25 08:41:33,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-07-25 08:41:33,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-07-25 08:41:33,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-07-25 08:41:33,211 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2018-07-25 08:41:33,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:33,211 INFO L472 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-07-25 08:41:33,211 INFO L473 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-07-25 08:41:33,211 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-07-25 08:41:33,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-07-25 08:41:33,212 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:33,212 INFO L354 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2018-07-25 08:41:33,213 INFO L415 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:33,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1026988024, now seen corresponding path program 63 times [2018-07-25 08:41:33,213 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:33,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:33,474 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:33,475 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:33,475 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-07-25 08:41:33,475 INFO L451 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-07-25 08:41:33,478 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-07-25 08:41:33,479 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-07-25 08:41:33,480 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2018-07-25 08:41:33,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:33,521 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-07-25 08:41:33,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-07-25 08:41:33,521 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2018-07-25 08:41:33,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:33,523 INFO L225 Difference]: With dead ends: 70 [2018-07-25 08:41:33,523 INFO L226 Difference]: Without dead ends: 68 [2018-07-25 08:41:33,525 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-07-25 08:41:33,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-07-25 08:41:33,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-07-25 08:41:33,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-07-25 08:41:33,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-07-25 08:41:33,529 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2018-07-25 08:41:33,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:33,530 INFO L472 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-07-25 08:41:33,530 INFO L473 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-07-25 08:41:33,530 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-07-25 08:41:33,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-07-25 08:41:33,531 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:33,531 INFO L354 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2018-07-25 08:41:33,531 INFO L415 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:33,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1771859647, now seen corresponding path program 64 times [2018-07-25 08:41:33,532 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:33,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:33,796 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:33,796 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:33,797 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-07-25 08:41:33,797 INFO L451 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-07-25 08:41:33,798 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-07-25 08:41:33,799 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-07-25 08:41:33,799 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2018-07-25 08:41:33,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:33,849 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-07-25 08:41:33,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-07-25 08:41:33,849 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2018-07-25 08:41:33,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:33,850 INFO L225 Difference]: With dead ends: 71 [2018-07-25 08:41:33,850 INFO L226 Difference]: Without dead ends: 69 [2018-07-25 08:41:33,852 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-07-25 08:41:33,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-07-25 08:41:33,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-07-25 08:41:33,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-07-25 08:41:33,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-07-25 08:41:33,855 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2018-07-25 08:41:33,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:33,855 INFO L472 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-07-25 08:41:33,855 INFO L473 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-07-25 08:41:33,855 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-07-25 08:41:33,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-07-25 08:41:33,856 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:33,857 INFO L354 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2018-07-25 08:41:33,857 INFO L415 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:33,857 INFO L82 PathProgramCache]: Analyzing trace with hash 906923816, now seen corresponding path program 65 times [2018-07-25 08:41:33,857 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:33,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:34,182 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:34,183 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:34,183 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-07-25 08:41:34,183 INFO L451 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-07-25 08:41:34,184 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-07-25 08:41:34,185 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-07-25 08:41:34,186 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2018-07-25 08:41:34,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:34,245 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-07-25 08:41:34,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-07-25 08:41:34,246 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2018-07-25 08:41:34,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:34,247 INFO L225 Difference]: With dead ends: 72 [2018-07-25 08:41:34,247 INFO L226 Difference]: Without dead ends: 70 [2018-07-25 08:41:34,248 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-07-25 08:41:34,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-07-25 08:41:34,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-07-25 08:41:34,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-07-25 08:41:34,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-07-25 08:41:34,252 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2018-07-25 08:41:34,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:34,252 INFO L472 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-07-25 08:41:34,252 INFO L473 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-07-25 08:41:34,253 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-07-25 08:41:34,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-07-25 08:41:34,253 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:34,253 INFO L354 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2018-07-25 08:41:34,254 INFO L415 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:34,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1950134751, now seen corresponding path program 66 times [2018-07-25 08:41:34,254 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:34,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:34,567 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:34,567 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:34,568 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-07-25 08:41:34,568 INFO L451 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-07-25 08:41:34,569 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-07-25 08:41:34,569 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-07-25 08:41:34,569 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2018-07-25 08:41:34,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:34,610 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-07-25 08:41:34,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-07-25 08:41:34,610 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2018-07-25 08:41:34,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:34,611 INFO L225 Difference]: With dead ends: 73 [2018-07-25 08:41:34,611 INFO L226 Difference]: Without dead ends: 71 [2018-07-25 08:41:34,612 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-07-25 08:41:34,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-07-25 08:41:34,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-07-25 08:41:34,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-07-25 08:41:34,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-07-25 08:41:34,615 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2018-07-25 08:41:34,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:34,615 INFO L472 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-07-25 08:41:34,615 INFO L473 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-07-25 08:41:34,615 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-07-25 08:41:34,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-07-25 08:41:34,616 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:34,616 INFO L354 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2018-07-25 08:41:34,616 INFO L415 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:34,617 INFO L82 PathProgramCache]: Analyzing trace with hash -324637112, now seen corresponding path program 67 times [2018-07-25 08:41:34,617 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:34,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:34,853 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:34,853 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:34,854 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-07-25 08:41:34,854 INFO L451 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-07-25 08:41:34,855 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-07-25 08:41:34,855 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-07-25 08:41:34,856 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2018-07-25 08:41:34,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:34,897 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-07-25 08:41:34,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-07-25 08:41:34,897 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2018-07-25 08:41:34,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:34,898 INFO L225 Difference]: With dead ends: 74 [2018-07-25 08:41:34,898 INFO L226 Difference]: Without dead ends: 72 [2018-07-25 08:41:34,899 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-07-25 08:41:34,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-07-25 08:41:34,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-07-25 08:41:34,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-07-25 08:41:34,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-07-25 08:41:34,902 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2018-07-25 08:41:34,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:34,902 INFO L472 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-07-25 08:41:34,902 INFO L473 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-07-25 08:41:34,902 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-07-25 08:41:34,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-07-25 08:41:34,903 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:34,903 INFO L354 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2018-07-25 08:41:34,903 INFO L415 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:34,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1473817855, now seen corresponding path program 68 times [2018-07-25 08:41:34,904 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:34,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:35,135 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:35,135 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:35,135 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-07-25 08:41:35,136 INFO L451 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-07-25 08:41:35,137 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-07-25 08:41:35,137 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-07-25 08:41:35,137 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2018-07-25 08:41:35,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:35,198 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-07-25 08:41:35,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-07-25 08:41:35,199 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2018-07-25 08:41:35,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:35,200 INFO L225 Difference]: With dead ends: 75 [2018-07-25 08:41:35,200 INFO L226 Difference]: Without dead ends: 73 [2018-07-25 08:41:35,200 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-07-25 08:41:35,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-07-25 08:41:35,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-07-25 08:41:35,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-07-25 08:41:35,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-07-25 08:41:35,203 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2018-07-25 08:41:35,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:35,204 INFO L472 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-07-25 08:41:35,204 INFO L473 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-07-25 08:41:35,204 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-07-25 08:41:35,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-07-25 08:41:35,204 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:35,205 INFO L354 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2018-07-25 08:41:35,205 INFO L415 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:35,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1556284776, now seen corresponding path program 69 times [2018-07-25 08:41:35,205 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:35,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:35,436 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:35,436 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:35,436 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-07-25 08:41:35,436 INFO L451 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-07-25 08:41:35,437 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-07-25 08:41:35,438 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-07-25 08:41:35,438 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2018-07-25 08:41:35,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:35,499 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-07-25 08:41:35,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-07-25 08:41:35,499 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2018-07-25 08:41:35,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:35,500 INFO L225 Difference]: With dead ends: 76 [2018-07-25 08:41:35,500 INFO L226 Difference]: Without dead ends: 74 [2018-07-25 08:41:35,501 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-07-25 08:41:35,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-07-25 08:41:35,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-07-25 08:41:35,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-07-25 08:41:35,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-07-25 08:41:35,504 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2018-07-25 08:41:35,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:35,504 INFO L472 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-07-25 08:41:35,504 INFO L473 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-07-25 08:41:35,504 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-07-25 08:41:35,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-07-25 08:41:35,505 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:35,505 INFO L354 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2018-07-25 08:41:35,505 INFO L415 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:35,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1000185825, now seen corresponding path program 70 times [2018-07-25 08:41:35,506 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:35,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:35,736 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:41:35,737 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:35,737 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-07-25 08:41:35,737 INFO L451 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-07-25 08:41:35,738 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-07-25 08:41:35,739 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-07-25 08:41:35,739 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2018-07-25 08:41:35,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:35,799 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-07-25 08:41:35,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-07-25 08:41:35,799 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2018-07-25 08:41:35,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:35,800 INFO L225 Difference]: With dead ends: 77 [2018-07-25 08:41:35,800 INFO L226 Difference]: Without dead ends: 75 [2018-07-25 08:41:35,801 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-07-25 08:41:35,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-07-25 08:41:35,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-07-25 08:41:35,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-07-25 08:41:35,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-07-25 08:41:35,803 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2018-07-25 08:41:35,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:35,804 INFO L472 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-07-25 08:41:35,804 INFO L473 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-07-25 08:41:35,804 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-07-25 08:41:35,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-07-25 08:41:35,805 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:35,805 INFO L354 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2018-07-25 08:41:35,805 INFO L415 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:35,805 INFO L82 PathProgramCache]: Analyzing trace with hash 940987528, now seen corresponding path program 71 times [2018-07-25 08:41:35,805 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:35,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:36,042 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:41:36,042 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:36,043 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-07-25 08:41:36,043 INFO L451 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-07-25 08:41:36,044 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-07-25 08:41:36,044 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-07-25 08:41:36,045 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2018-07-25 08:41:36,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:36,110 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-07-25 08:41:36,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-07-25 08:41:36,110 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2018-07-25 08:41:36,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:36,111 INFO L225 Difference]: With dead ends: 78 [2018-07-25 08:41:36,111 INFO L226 Difference]: Without dead ends: 76 [2018-07-25 08:41:36,112 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-07-25 08:41:36,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-07-25 08:41:36,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-07-25 08:41:36,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-07-25 08:41:36,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-07-25 08:41:36,115 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2018-07-25 08:41:36,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:36,115 INFO L472 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-07-25 08:41:36,115 INFO L473 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-07-25 08:41:36,116 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-07-25 08:41:36,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-07-25 08:41:36,116 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:36,116 INFO L354 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2018-07-25 08:41:36,117 INFO L415 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:36,117 INFO L82 PathProgramCache]: Analyzing trace with hash -894159679, now seen corresponding path program 72 times [2018-07-25 08:41:36,117 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:36,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:36,347 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:41:36,347 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:36,348 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-07-25 08:41:36,348 INFO L451 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-07-25 08:41:36,349 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-07-25 08:41:36,349 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-07-25 08:41:36,349 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2018-07-25 08:41:36,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:36,415 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-07-25 08:41:36,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-07-25 08:41:36,415 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2018-07-25 08:41:36,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:36,416 INFO L225 Difference]: With dead ends: 79 [2018-07-25 08:41:36,416 INFO L226 Difference]: Without dead ends: 77 [2018-07-25 08:41:36,417 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-07-25 08:41:36,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-07-25 08:41:36,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-07-25 08:41:36,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-07-25 08:41:36,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-07-25 08:41:36,420 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2018-07-25 08:41:36,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:36,420 INFO L472 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-07-25 08:41:36,420 INFO L473 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-07-25 08:41:36,420 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-07-25 08:41:36,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-07-25 08:41:36,421 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:36,421 INFO L354 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2018-07-25 08:41:36,421 INFO L415 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:36,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1949148248, now seen corresponding path program 73 times [2018-07-25 08:41:36,421 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:36,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:36,658 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:41:36,658 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:36,658 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-07-25 08:41:36,658 INFO L451 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-07-25 08:41:36,659 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-07-25 08:41:36,660 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-07-25 08:41:36,660 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2018-07-25 08:41:36,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:36,729 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-07-25 08:41:36,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-07-25 08:41:36,730 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2018-07-25 08:41:36,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:36,730 INFO L225 Difference]: With dead ends: 80 [2018-07-25 08:41:36,730 INFO L226 Difference]: Without dead ends: 78 [2018-07-25 08:41:36,731 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-07-25 08:41:36,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-07-25 08:41:36,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-07-25 08:41:36,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-07-25 08:41:36,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-07-25 08:41:36,734 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2018-07-25 08:41:36,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:36,735 INFO L472 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-07-25 08:41:36,735 INFO L473 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-07-25 08:41:36,735 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-07-25 08:41:36,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-07-25 08:41:36,736 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:36,736 INFO L354 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2018-07-25 08:41:36,736 INFO L415 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:36,736 INFO L82 PathProgramCache]: Analyzing trace with hash -294055519, now seen corresponding path program 74 times [2018-07-25 08:41:36,736 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:36,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:36,987 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:41:36,987 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:36,987 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-07-25 08:41:36,988 INFO L451 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-07-25 08:41:36,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-07-25 08:41:36,989 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-07-25 08:41:36,989 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2018-07-25 08:41:37,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:37,054 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-07-25 08:41:37,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-07-25 08:41:37,054 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2018-07-25 08:41:37,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:37,055 INFO L225 Difference]: With dead ends: 81 [2018-07-25 08:41:37,055 INFO L226 Difference]: Without dead ends: 79 [2018-07-25 08:41:37,056 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-07-25 08:41:37,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-07-25 08:41:37,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-07-25 08:41:37,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-07-25 08:41:37,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-07-25 08:41:37,058 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2018-07-25 08:41:37,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:37,059 INFO L472 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-07-25 08:41:37,059 INFO L473 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-07-25 08:41:37,059 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-07-25 08:41:37,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-07-25 08:41:37,059 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:37,060 INFO L354 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2018-07-25 08:41:37,060 INFO L415 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:37,060 INFO L82 PathProgramCache]: Analyzing trace with hash -525788472, now seen corresponding path program 75 times [2018-07-25 08:41:37,060 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:37,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:37,302 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:41:37,302 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:37,302 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-07-25 08:41:37,303 INFO L451 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-07-25 08:41:37,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-07-25 08:41:37,304 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-07-25 08:41:37,304 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2018-07-25 08:41:37,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:37,374 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-07-25 08:41:37,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-07-25 08:41:37,374 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2018-07-25 08:41:37,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:37,375 INFO L225 Difference]: With dead ends: 82 [2018-07-25 08:41:37,375 INFO L226 Difference]: Without dead ends: 80 [2018-07-25 08:41:37,376 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-07-25 08:41:37,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-07-25 08:41:37,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-07-25 08:41:37,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-07-25 08:41:37,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-07-25 08:41:37,379 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2018-07-25 08:41:37,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:37,379 INFO L472 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-07-25 08:41:37,380 INFO L473 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-07-25 08:41:37,380 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-07-25 08:41:37,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-07-25 08:41:37,380 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:37,380 INFO L354 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2018-07-25 08:41:37,381 INFO L415 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:37,381 INFO L82 PathProgramCache]: Analyzing trace with hash 880424577, now seen corresponding path program 76 times [2018-07-25 08:41:37,381 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:37,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:37,632 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:41:37,632 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:37,632 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-07-25 08:41:37,633 INFO L451 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-07-25 08:41:37,634 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-07-25 08:41:37,635 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-07-25 08:41:37,635 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2018-07-25 08:41:37,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:37,695 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-07-25 08:41:37,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-07-25 08:41:37,696 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2018-07-25 08:41:37,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:37,697 INFO L225 Difference]: With dead ends: 83 [2018-07-25 08:41:37,697 INFO L226 Difference]: Without dead ends: 81 [2018-07-25 08:41:37,698 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-07-25 08:41:37,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-07-25 08:41:37,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-07-25 08:41:37,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-07-25 08:41:37,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-07-25 08:41:37,701 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2018-07-25 08:41:37,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:37,701 INFO L472 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-07-25 08:41:37,701 INFO L473 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-07-25 08:41:37,701 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-07-25 08:41:37,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-07-25 08:41:37,702 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:37,702 INFO L354 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2018-07-25 08:41:37,703 INFO L415 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:37,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1523356136, now seen corresponding path program 77 times [2018-07-25 08:41:37,703 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:37,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:37,951 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:41:37,951 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:37,952 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-07-25 08:41:37,952 INFO L451 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-07-25 08:41:37,953 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-07-25 08:41:37,953 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-07-25 08:41:37,954 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2018-07-25 08:41:37,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:37,992 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-07-25 08:41:37,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-07-25 08:41:37,993 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2018-07-25 08:41:37,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:37,993 INFO L225 Difference]: With dead ends: 84 [2018-07-25 08:41:37,993 INFO L226 Difference]: Without dead ends: 82 [2018-07-25 08:41:37,994 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-07-25 08:41:37,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-07-25 08:41:37,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-07-25 08:41:37,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-07-25 08:41:37,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-07-25 08:41:37,998 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2018-07-25 08:41:37,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:37,998 INFO L472 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-07-25 08:41:37,998 INFO L473 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-07-25 08:41:37,998 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-07-25 08:41:37,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-07-25 08:41:37,999 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:37,999 INFO L354 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2018-07-25 08:41:37,999 INFO L415 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:37,999 INFO L82 PathProgramCache]: Analyzing trace with hash -20602015, now seen corresponding path program 78 times [2018-07-25 08:41:38,000 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:38,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:38,251 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:41:38,251 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:38,252 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-07-25 08:41:38,252 INFO L451 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-07-25 08:41:38,253 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-07-25 08:41:38,253 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-07-25 08:41:38,254 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2018-07-25 08:41:38,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:38,314 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-07-25 08:41:38,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-07-25 08:41:38,314 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2018-07-25 08:41:38,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:38,315 INFO L225 Difference]: With dead ends: 85 [2018-07-25 08:41:38,315 INFO L226 Difference]: Without dead ends: 83 [2018-07-25 08:41:38,316 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-07-25 08:41:38,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-07-25 08:41:38,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-07-25 08:41:38,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-07-25 08:41:38,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-07-25 08:41:38,319 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2018-07-25 08:41:38,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:38,320 INFO L472 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-07-25 08:41:38,320 INFO L473 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-07-25 08:41:38,320 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-07-25 08:41:38,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-07-25 08:41:38,321 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:38,321 INFO L354 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2018-07-25 08:41:38,321 INFO L415 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:38,321 INFO L82 PathProgramCache]: Analyzing trace with hash -638664440, now seen corresponding path program 79 times [2018-07-25 08:41:38,321 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:38,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:38,570 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:41:38,571 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:38,571 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-07-25 08:41:38,571 INFO L451 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-07-25 08:41:38,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-07-25 08:41:38,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-07-25 08:41:38,573 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2018-07-25 08:41:38,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:38,654 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-07-25 08:41:38,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-07-25 08:41:38,654 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2018-07-25 08:41:38,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:38,655 INFO L225 Difference]: With dead ends: 86 [2018-07-25 08:41:38,655 INFO L226 Difference]: Without dead ends: 84 [2018-07-25 08:41:38,656 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-07-25 08:41:38,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-07-25 08:41:38,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-07-25 08:41:38,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-07-25 08:41:38,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-07-25 08:41:38,659 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2018-07-25 08:41:38,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:38,659 INFO L472 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-07-25 08:41:38,660 INFO L473 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-07-25 08:41:38,660 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-07-25 08:41:38,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-07-25 08:41:38,660 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:38,661 INFO L354 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2018-07-25 08:41:38,661 INFO L415 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:38,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1676236865, now seen corresponding path program 80 times [2018-07-25 08:41:38,661 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:38,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:38,913 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:41:38,914 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:38,914 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-07-25 08:41:38,914 INFO L451 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-07-25 08:41:38,915 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-07-25 08:41:38,916 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-07-25 08:41:38,916 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2018-07-25 08:41:38,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:38,977 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-07-25 08:41:38,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-07-25 08:41:38,978 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2018-07-25 08:41:38,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:38,979 INFO L225 Difference]: With dead ends: 87 [2018-07-25 08:41:38,979 INFO L226 Difference]: Without dead ends: 85 [2018-07-25 08:41:38,979 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-07-25 08:41:38,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-07-25 08:41:38,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-07-25 08:41:38,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-07-25 08:41:38,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-07-25 08:41:38,982 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2018-07-25 08:41:38,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:38,983 INFO L472 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-07-25 08:41:38,983 INFO L473 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-07-25 08:41:38,983 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-07-25 08:41:38,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-07-25 08:41:38,984 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:38,984 INFO L354 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2018-07-25 08:41:38,984 INFO L415 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:38,984 INFO L82 PathProgramCache]: Analyzing trace with hash 423733288, now seen corresponding path program 81 times [2018-07-25 08:41:38,984 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:38,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:39,308 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:41:39,308 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:39,308 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-07-25 08:41:39,309 INFO L451 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-07-25 08:41:39,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-07-25 08:41:39,310 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-07-25 08:41:39,311 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2018-07-25 08:41:39,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:39,369 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-07-25 08:41:39,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-07-25 08:41:39,369 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2018-07-25 08:41:39,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:39,370 INFO L225 Difference]: With dead ends: 88 [2018-07-25 08:41:39,370 INFO L226 Difference]: Without dead ends: 86 [2018-07-25 08:41:39,371 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-07-25 08:41:39,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-07-25 08:41:39,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-07-25 08:41:39,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-07-25 08:41:39,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-07-25 08:41:39,375 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2018-07-25 08:41:39,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:39,375 INFO L472 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-07-25 08:41:39,375 INFO L473 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-07-25 08:41:39,375 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-07-25 08:41:39,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-07-25 08:41:39,376 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:39,376 INFO L354 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2018-07-25 08:41:39,377 INFO L415 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:39,377 INFO L82 PathProgramCache]: Analyzing trace with hash 250828065, now seen corresponding path program 82 times [2018-07-25 08:41:39,377 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:39,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:39,649 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:41:39,649 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:39,649 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-07-25 08:41:39,649 INFO L451 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-07-25 08:41:39,650 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-07-25 08:41:39,650 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-07-25 08:41:39,650 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2018-07-25 08:41:39,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:39,735 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-07-25 08:41:39,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-07-25 08:41:39,735 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2018-07-25 08:41:39,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:39,736 INFO L225 Difference]: With dead ends: 89 [2018-07-25 08:41:39,736 INFO L226 Difference]: Without dead ends: 87 [2018-07-25 08:41:39,737 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-07-25 08:41:39,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-07-25 08:41:39,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-07-25 08:41:39,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-07-25 08:41:39,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-07-25 08:41:39,741 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2018-07-25 08:41:39,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:39,742 INFO L472 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-07-25 08:41:39,742 INFO L473 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-07-25 08:41:39,742 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-07-25 08:41:39,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-07-25 08:41:39,743 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:39,743 INFO L354 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2018-07-25 08:41:39,743 INFO L415 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:39,743 INFO L82 PathProgramCache]: Analyzing trace with hash -814266552, now seen corresponding path program 83 times [2018-07-25 08:41:39,743 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:39,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:39,953 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:41:39,953 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:39,953 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-07-25 08:41:39,954 INFO L451 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-07-25 08:41:39,954 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-07-25 08:41:39,955 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-07-25 08:41:39,955 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2018-07-25 08:41:40,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:40,005 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-07-25 08:41:40,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-07-25 08:41:40,005 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2018-07-25 08:41:40,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:40,006 INFO L225 Difference]: With dead ends: 90 [2018-07-25 08:41:40,006 INFO L226 Difference]: Without dead ends: 88 [2018-07-25 08:41:40,007 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-07-25 08:41:40,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-07-25 08:41:40,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-07-25 08:41:40,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-07-25 08:41:40,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-07-25 08:41:40,010 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2018-07-25 08:41:40,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:40,011 INFO L472 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-07-25 08:41:40,011 INFO L473 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-07-25 08:41:40,011 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-07-25 08:41:40,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-07-25 08:41:40,011 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:40,011 INFO L354 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2018-07-25 08:41:40,012 INFO L415 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:40,012 INFO L82 PathProgramCache]: Analyzing trace with hash 527538689, now seen corresponding path program 84 times [2018-07-25 08:41:40,012 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:40,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:40,283 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:41:40,283 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:40,283 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-07-25 08:41:40,284 INFO L451 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-07-25 08:41:40,285 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-07-25 08:41:40,285 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-07-25 08:41:40,285 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2018-07-25 08:41:40,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:40,384 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-07-25 08:41:40,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-07-25 08:41:40,384 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2018-07-25 08:41:40,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:40,385 INFO L225 Difference]: With dead ends: 91 [2018-07-25 08:41:40,385 INFO L226 Difference]: Without dead ends: 89 [2018-07-25 08:41:40,386 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-07-25 08:41:40,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-07-25 08:41:40,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-07-25 08:41:40,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-07-25 08:41:40,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-07-25 08:41:40,389 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2018-07-25 08:41:40,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:40,389 INFO L472 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-07-25 08:41:40,389 INFO L473 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-07-25 08:41:40,390 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-07-25 08:41:40,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-07-25 08:41:40,390 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:40,390 INFO L354 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2018-07-25 08:41:40,391 INFO L415 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:40,391 INFO L82 PathProgramCache]: Analyzing trace with hash -826171800, now seen corresponding path program 85 times [2018-07-25 08:41:40,391 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:40,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:40,636 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:41:40,636 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:40,637 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-07-25 08:41:40,637 INFO L451 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-07-25 08:41:40,638 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-07-25 08:41:40,638 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-07-25 08:41:40,638 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2018-07-25 08:41:40,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:40,691 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-07-25 08:41:40,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-07-25 08:41:40,692 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2018-07-25 08:41:40,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:40,692 INFO L225 Difference]: With dead ends: 92 [2018-07-25 08:41:40,693 INFO L226 Difference]: Without dead ends: 90 [2018-07-25 08:41:40,693 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-07-25 08:41:40,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-07-25 08:41:40,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-07-25 08:41:40,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-07-25 08:41:40,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-07-25 08:41:40,696 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2018-07-25 08:41:40,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:40,696 INFO L472 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-07-25 08:41:40,696 INFO L473 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-07-25 08:41:40,697 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-07-25 08:41:40,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-07-25 08:41:40,698 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:40,698 INFO L354 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2018-07-25 08:41:40,698 INFO L415 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:40,698 INFO L82 PathProgramCache]: Analyzing trace with hash 158476001, now seen corresponding path program 86 times [2018-07-25 08:41:40,698 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:40,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:40,979 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:41:40,980 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:40,980 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-07-25 08:41:40,980 INFO L451 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-07-25 08:41:40,981 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-07-25 08:41:40,981 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-07-25 08:41:40,982 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2018-07-25 08:41:41,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:41,088 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-07-25 08:41:41,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-07-25 08:41:41,088 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2018-07-25 08:41:41,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:41,089 INFO L225 Difference]: With dead ends: 93 [2018-07-25 08:41:41,089 INFO L226 Difference]: Without dead ends: 91 [2018-07-25 08:41:41,090 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-07-25 08:41:41,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-07-25 08:41:41,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-07-25 08:41:41,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-07-25 08:41:41,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-07-25 08:41:41,095 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2018-07-25 08:41:41,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:41,096 INFO L472 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-07-25 08:41:41,096 INFO L473 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-07-25 08:41:41,096 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-07-25 08:41:41,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-07-25 08:41:41,096 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:41,096 INFO L354 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2018-07-25 08:41:41,097 INFO L415 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:41,097 INFO L82 PathProgramCache]: Analyzing trace with hash 617786760, now seen corresponding path program 87 times [2018-07-25 08:41:41,097 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:41,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:41,352 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:41:41,353 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:41,353 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-07-25 08:41:41,353 INFO L451 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-07-25 08:41:41,354 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-07-25 08:41:41,354 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-07-25 08:41:41,354 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2018-07-25 08:41:41,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:41,396 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-07-25 08:41:41,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-07-25 08:41:41,396 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2018-07-25 08:41:41,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:41,397 INFO L225 Difference]: With dead ends: 94 [2018-07-25 08:41:41,397 INFO L226 Difference]: Without dead ends: 92 [2018-07-25 08:41:41,398 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-07-25 08:41:41,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-07-25 08:41:41,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-07-25 08:41:41,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-07-25 08:41:41,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-07-25 08:41:41,402 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2018-07-25 08:41:41,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:41,402 INFO L472 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-07-25 08:41:41,402 INFO L473 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-07-25 08:41:41,402 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-07-25 08:41:41,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-07-25 08:41:41,403 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:41,403 INFO L354 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2018-07-25 08:41:41,403 INFO L415 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:41,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1971518401, now seen corresponding path program 88 times [2018-07-25 08:41:41,404 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:41,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:41,688 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:41:41,689 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:41,689 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-07-25 08:41:41,689 INFO L451 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-07-25 08:41:41,690 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-07-25 08:41:41,691 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-07-25 08:41:41,691 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2018-07-25 08:41:41,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:41,793 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-07-25 08:41:41,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-07-25 08:41:41,793 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2018-07-25 08:41:41,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:41,794 INFO L225 Difference]: With dead ends: 95 [2018-07-25 08:41:41,794 INFO L226 Difference]: Without dead ends: 93 [2018-07-25 08:41:41,795 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-07-25 08:41:41,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-07-25 08:41:41,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-07-25 08:41:41,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-07-25 08:41:41,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-07-25 08:41:41,799 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2018-07-25 08:41:41,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:41,799 INFO L472 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-07-25 08:41:41,799 INFO L473 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-07-25 08:41:41,799 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-07-25 08:41:41,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-07-25 08:41:41,819 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:41,819 INFO L354 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2018-07-25 08:41:41,819 INFO L415 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:41,820 INFO L82 PathProgramCache]: Analyzing trace with hash 987526312, now seen corresponding path program 89 times [2018-07-25 08:41:41,820 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:41,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:42,068 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:41:42,068 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:42,068 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-07-25 08:41:42,069 INFO L451 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-07-25 08:41:42,070 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-07-25 08:41:42,070 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-07-25 08:41:42,070 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2018-07-25 08:41:42,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:42,135 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-07-25 08:41:42,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-07-25 08:41:42,135 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2018-07-25 08:41:42,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:42,136 INFO L225 Difference]: With dead ends: 96 [2018-07-25 08:41:42,136 INFO L226 Difference]: Without dead ends: 94 [2018-07-25 08:41:42,137 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-07-25 08:41:42,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-07-25 08:41:42,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-07-25 08:41:42,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-07-25 08:41:42,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-07-25 08:41:42,140 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2018-07-25 08:41:42,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:42,140 INFO L472 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-07-25 08:41:42,140 INFO L473 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-07-25 08:41:42,141 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-07-25 08:41:42,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-07-25 08:41:42,141 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:42,141 INFO L354 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2018-07-25 08:41:42,141 INFO L415 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:42,142 INFO L82 PathProgramCache]: Analyzing trace with hash 548542625, now seen corresponding path program 90 times [2018-07-25 08:41:42,142 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:42,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:42,383 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:41:42,383 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:42,383 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-07-25 08:41:42,384 INFO L451 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-07-25 08:41:42,384 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-07-25 08:41:42,385 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-07-25 08:41:42,385 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2018-07-25 08:41:42,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:42,425 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-07-25 08:41:42,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-07-25 08:41:42,425 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2018-07-25 08:41:42,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:42,426 INFO L225 Difference]: With dead ends: 97 [2018-07-25 08:41:42,426 INFO L226 Difference]: Without dead ends: 95 [2018-07-25 08:41:42,427 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-07-25 08:41:42,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-07-25 08:41:42,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-07-25 08:41:42,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-07-25 08:41:42,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-07-25 08:41:42,430 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2018-07-25 08:41:42,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:42,430 INFO L472 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-07-25 08:41:42,430 INFO L473 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-07-25 08:41:42,430 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-07-25 08:41:42,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-07-25 08:41:42,431 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:42,431 INFO L354 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2018-07-25 08:41:42,431 INFO L415 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:42,432 INFO L82 PathProgramCache]: Analyzing trace with hash -175049784, now seen corresponding path program 91 times [2018-07-25 08:41:42,432 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:42,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:42,789 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:41:42,789 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:42,789 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-07-25 08:41:42,790 INFO L451 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-07-25 08:41:42,791 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-07-25 08:41:42,791 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-07-25 08:41:42,792 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2018-07-25 08:41:42,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:42,935 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-07-25 08:41:42,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-07-25 08:41:42,936 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2018-07-25 08:41:42,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:42,937 INFO L225 Difference]: With dead ends: 98 [2018-07-25 08:41:42,937 INFO L226 Difference]: Without dead ends: 96 [2018-07-25 08:41:42,938 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-07-25 08:41:42,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-07-25 08:41:42,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-07-25 08:41:42,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-07-25 08:41:42,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-07-25 08:41:42,943 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2018-07-25 08:41:42,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:42,943 INFO L472 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-07-25 08:41:42,943 INFO L473 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-07-25 08:41:42,943 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-07-25 08:41:42,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-07-25 08:41:42,944 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:42,944 INFO L354 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2018-07-25 08:41:42,944 INFO L415 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:42,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1131577983, now seen corresponding path program 92 times [2018-07-25 08:41:42,945 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:42,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:43,323 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:41:43,323 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:43,323 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-07-25 08:41:43,324 INFO L451 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-07-25 08:41:43,325 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-07-25 08:41:43,325 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-07-25 08:41:43,326 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2018-07-25 08:41:43,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:43,477 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-07-25 08:41:43,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-07-25 08:41:43,477 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2018-07-25 08:41:43,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:43,478 INFO L225 Difference]: With dead ends: 99 [2018-07-25 08:41:43,478 INFO L226 Difference]: Without dead ends: 97 [2018-07-25 08:41:43,479 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-07-25 08:41:43,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-07-25 08:41:43,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-07-25 08:41:43,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-07-25 08:41:43,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-07-25 08:41:43,483 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2018-07-25 08:41:43,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:43,483 INFO L472 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-07-25 08:41:43,483 INFO L473 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-07-25 08:41:43,483 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-07-25 08:41:43,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-07-25 08:41:43,484 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:43,484 INFO L354 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2018-07-25 08:41:43,484 INFO L415 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:43,484 INFO L82 PathProgramCache]: Analyzing trace with hash -719181080, now seen corresponding path program 93 times [2018-07-25 08:41:43,485 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:43,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:43,849 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:41:43,850 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:43,850 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-07-25 08:41:43,850 INFO L451 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-07-25 08:41:43,852 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-07-25 08:41:43,852 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-07-25 08:41:43,852 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2018-07-25 08:41:43,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:43,951 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-07-25 08:41:43,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-07-25 08:41:43,951 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2018-07-25 08:41:43,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:43,952 INFO L225 Difference]: With dead ends: 100 [2018-07-25 08:41:43,952 INFO L226 Difference]: Without dead ends: 98 [2018-07-25 08:41:43,953 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-07-25 08:41:43,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-07-25 08:41:43,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-07-25 08:41:43,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-07-25 08:41:43,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-07-25 08:41:43,956 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2018-07-25 08:41:43,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:43,957 INFO L472 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-07-25 08:41:43,957 INFO L473 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-07-25 08:41:43,957 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-07-25 08:41:43,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-07-25 08:41:43,957 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:43,957 INFO L354 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2018-07-25 08:41:43,958 INFO L415 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:43,958 INFO L82 PathProgramCache]: Analyzing trace with hash -819778975, now seen corresponding path program 94 times [2018-07-25 08:41:43,958 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:43,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:44,325 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:44,325 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:44,325 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-07-25 08:41:44,326 INFO L451 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-07-25 08:41:44,329 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-07-25 08:41:44,330 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-07-25 08:41:44,330 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2018-07-25 08:41:44,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:44,404 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-07-25 08:41:44,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-07-25 08:41:44,405 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2018-07-25 08:41:44,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:44,406 INFO L225 Difference]: With dead ends: 101 [2018-07-25 08:41:44,406 INFO L226 Difference]: Without dead ends: 99 [2018-07-25 08:41:44,407 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-07-25 08:41:44,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-07-25 08:41:44,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-07-25 08:41:44,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-07-25 08:41:44,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-07-25 08:41:44,411 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2018-07-25 08:41:44,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:44,411 INFO L472 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-07-25 08:41:44,411 INFO L473 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-07-25 08:41:44,412 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-07-25 08:41:44,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-07-25 08:41:44,412 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:44,413 INFO L354 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2018-07-25 08:41:44,413 INFO L415 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:44,413 INFO L82 PathProgramCache]: Analyzing trace with hash 356653576, now seen corresponding path program 95 times [2018-07-25 08:41:44,413 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:44,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:44,846 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:44,846 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:44,846 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-07-25 08:41:44,847 INFO L451 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-07-25 08:41:44,848 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-07-25 08:41:44,848 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-07-25 08:41:44,849 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2018-07-25 08:41:44,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:44,904 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-07-25 08:41:44,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-07-25 08:41:44,904 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2018-07-25 08:41:44,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:44,905 INFO L225 Difference]: With dead ends: 102 [2018-07-25 08:41:44,906 INFO L226 Difference]: Without dead ends: 100 [2018-07-25 08:41:44,906 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-07-25 08:41:44,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-07-25 08:41:44,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-07-25 08:41:44,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-07-25 08:41:44,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-07-25 08:41:44,911 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2018-07-25 08:41:44,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:44,911 INFO L472 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-07-25 08:41:44,911 INFO L473 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-07-25 08:41:44,911 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-07-25 08:41:44,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-07-25 08:41:44,912 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:44,912 INFO L354 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2018-07-25 08:41:44,913 INFO L415 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:44,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1828643007, now seen corresponding path program 96 times [2018-07-25 08:41:44,913 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:44,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:45,186 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:45,186 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:45,187 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-07-25 08:41:45,187 INFO L451 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-07-25 08:41:45,188 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-07-25 08:41:45,188 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-07-25 08:41:45,188 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2018-07-25 08:41:45,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:45,248 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-07-25 08:41:45,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-07-25 08:41:45,249 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2018-07-25 08:41:45,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:45,249 INFO L225 Difference]: With dead ends: 103 [2018-07-25 08:41:45,249 INFO L226 Difference]: Without dead ends: 101 [2018-07-25 08:41:45,250 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-07-25 08:41:45,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-07-25 08:41:45,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-07-25 08:41:45,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-07-25 08:41:45,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-07-25 08:41:45,252 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2018-07-25 08:41:45,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:45,253 INFO L472 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-07-25 08:41:45,253 INFO L473 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-07-25 08:41:45,253 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-07-25 08:41:45,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-07-25 08:41:45,253 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:45,253 INFO L354 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2018-07-25 08:41:45,254 INFO L415 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:45,254 INFO L82 PathProgramCache]: Analyzing trace with hash -853360344, now seen corresponding path program 97 times [2018-07-25 08:41:45,254 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:45,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:45,631 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:45,631 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:45,631 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-07-25 08:41:45,632 INFO L451 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-07-25 08:41:45,633 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-07-25 08:41:45,634 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-07-25 08:41:45,634 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2018-07-25 08:41:45,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:45,744 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-07-25 08:41:45,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-07-25 08:41:45,744 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2018-07-25 08:41:45,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:45,745 INFO L225 Difference]: With dead ends: 104 [2018-07-25 08:41:45,745 INFO L226 Difference]: Without dead ends: 102 [2018-07-25 08:41:45,746 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-07-25 08:41:45,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-07-25 08:41:45,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-07-25 08:41:45,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-07-25 08:41:45,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-07-25 08:41:45,750 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2018-07-25 08:41:45,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:45,750 INFO L472 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-07-25 08:41:45,750 INFO L473 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-07-25 08:41:45,751 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-07-25 08:41:45,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-07-25 08:41:45,751 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:45,751 INFO L354 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2018-07-25 08:41:45,752 INFO L415 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:45,752 INFO L82 PathProgramCache]: Analyzing trace with hash -684368863, now seen corresponding path program 98 times [2018-07-25 08:41:45,752 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:45,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:46,120 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:46,120 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:46,120 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-07-25 08:41:46,121 INFO L451 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-07-25 08:41:46,122 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-07-25 08:41:46,122 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-07-25 08:41:46,122 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2018-07-25 08:41:46,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:46,191 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-07-25 08:41:46,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-07-25 08:41:46,192 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2018-07-25 08:41:46,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:46,192 INFO L225 Difference]: With dead ends: 105 [2018-07-25 08:41:46,192 INFO L226 Difference]: Without dead ends: 103 [2018-07-25 08:41:46,193 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-07-25 08:41:46,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-07-25 08:41:46,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-07-25 08:41:46,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-07-25 08:41:46,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-07-25 08:41:46,195 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2018-07-25 08:41:46,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:46,196 INFO L472 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-07-25 08:41:46,196 INFO L473 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-07-25 08:41:46,196 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-07-25 08:41:46,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-07-25 08:41:46,196 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:46,196 INFO L354 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2018-07-25 08:41:46,197 INFO L415 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:46,197 INFO L82 PathProgramCache]: Analyzing trace with hash 259399752, now seen corresponding path program 99 times [2018-07-25 08:41:46,197 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:46,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:46,490 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:46,490 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:46,490 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-07-25 08:41:46,490 INFO L451 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-07-25 08:41:46,491 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-07-25 08:41:46,492 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-07-25 08:41:46,492 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2018-07-25 08:41:46,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:46,559 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-07-25 08:41:46,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-07-25 08:41:46,559 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2018-07-25 08:41:46,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:46,560 INFO L225 Difference]: With dead ends: 106 [2018-07-25 08:41:46,560 INFO L226 Difference]: Without dead ends: 104 [2018-07-25 08:41:46,561 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-07-25 08:41:46,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-07-25 08:41:46,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-07-25 08:41:46,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-07-25 08:41:46,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-07-25 08:41:46,564 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2018-07-25 08:41:46,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:46,564 INFO L472 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-07-25 08:41:46,564 INFO L473 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-07-25 08:41:46,564 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-07-25 08:41:46,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-07-25 08:41:46,565 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:46,565 INFO L354 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2018-07-25 08:41:46,565 INFO L415 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:46,565 INFO L82 PathProgramCache]: Analyzing trace with hash -548544255, now seen corresponding path program 100 times [2018-07-25 08:41:46,566 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:46,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:46,877 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:46,878 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:46,878 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-07-25 08:41:46,878 INFO L451 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-07-25 08:41:46,879 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-07-25 08:41:46,879 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-07-25 08:41:46,880 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2018-07-25 08:41:46,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:46,945 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-07-25 08:41:46,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-07-25 08:41:46,945 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2018-07-25 08:41:46,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:46,946 INFO L225 Difference]: With dead ends: 107 [2018-07-25 08:41:46,946 INFO L226 Difference]: Without dead ends: 105 [2018-07-25 08:41:46,947 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-07-25 08:41:46,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-07-25 08:41:46,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-07-25 08:41:46,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-07-25 08:41:46,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-07-25 08:41:46,950 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2018-07-25 08:41:46,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:46,950 INFO L472 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-07-25 08:41:46,950 INFO L473 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-07-25 08:41:46,951 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-07-25 08:41:46,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-07-25 08:41:46,951 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:46,951 INFO L354 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2018-07-25 08:41:46,952 INFO L415 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:46,952 INFO L82 PathProgramCache]: Analyzing trace with hash 174995304, now seen corresponding path program 101 times [2018-07-25 08:41:46,952 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:46,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:47,219 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:47,219 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:47,219 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-07-25 08:41:47,220 INFO L451 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-07-25 08:41:47,221 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-07-25 08:41:47,222 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-07-25 08:41:47,222 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 104 states. [2018-07-25 08:41:47,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:47,304 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-07-25 08:41:47,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-07-25 08:41:47,304 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2018-07-25 08:41:47,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:47,305 INFO L225 Difference]: With dead ends: 108 [2018-07-25 08:41:47,305 INFO L226 Difference]: Without dead ends: 106 [2018-07-25 08:41:47,306 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-07-25 08:41:47,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-07-25 08:41:47,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-07-25 08:41:47,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-07-25 08:41:47,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-07-25 08:41:47,313 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2018-07-25 08:41:47,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:47,313 INFO L472 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-07-25 08:41:47,313 INFO L473 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-07-25 08:41:47,313 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-07-25 08:41:47,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-07-25 08:41:47,314 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:47,314 INFO L354 BasicCegarLoop]: trace histogram [102, 1, 1, 1] [2018-07-25 08:41:47,314 INFO L415 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:47,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1129885153, now seen corresponding path program 102 times [2018-07-25 08:41:47,315 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:47,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:47,602 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:47,602 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:47,602 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2018-07-25 08:41:47,603 INFO L451 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-07-25 08:41:47,603 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-07-25 08:41:47,604 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2018-07-25 08:41:47,604 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 105 states. [2018-07-25 08:41:47,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:47,689 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-07-25 08:41:47,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-07-25 08:41:47,689 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 105 [2018-07-25 08:41:47,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:47,690 INFO L225 Difference]: With dead ends: 109 [2018-07-25 08:41:47,690 INFO L226 Difference]: Without dead ends: 107 [2018-07-25 08:41:47,690 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2018-07-25 08:41:47,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-07-25 08:41:47,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-07-25 08:41:47,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-07-25 08:41:47,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-07-25 08:41:47,694 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2018-07-25 08:41:47,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:47,694 INFO L472 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-07-25 08:41:47,694 INFO L473 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-07-25 08:41:47,694 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-07-25 08:41:47,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-07-25 08:41:47,694 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:47,695 INFO L354 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2018-07-25 08:41:47,695 INFO L415 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:47,695 INFO L82 PathProgramCache]: Analyzing trace with hash 666699400, now seen corresponding path program 103 times [2018-07-25 08:41:47,695 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:47,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:48,016 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:48,016 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:48,016 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-07-25 08:41:48,017 INFO L451 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-07-25 08:41:48,018 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-07-25 08:41:48,018 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-07-25 08:41:48,018 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 106 states. [2018-07-25 08:41:48,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:48,121 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-07-25 08:41:48,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-07-25 08:41:48,122 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 106 [2018-07-25 08:41:48,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:48,123 INFO L225 Difference]: With dead ends: 110 [2018-07-25 08:41:48,123 INFO L226 Difference]: Without dead ends: 108 [2018-07-25 08:41:48,123 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-07-25 08:41:48,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-07-25 08:41:48,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-07-25 08:41:48,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-07-25 08:41:48,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-07-25 08:41:48,127 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2018-07-25 08:41:48,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:48,127 INFO L472 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-07-25 08:41:48,127 INFO L473 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-07-25 08:41:48,127 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-07-25 08:41:48,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-07-25 08:41:48,128 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:48,128 INFO L354 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2018-07-25 08:41:48,128 INFO L415 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:48,129 INFO L82 PathProgramCache]: Analyzing trace with hash -807157055, now seen corresponding path program 104 times [2018-07-25 08:41:48,129 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:48,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:48,374 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:48,374 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:48,375 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2018-07-25 08:41:48,375 INFO L451 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-07-25 08:41:48,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-07-25 08:41:48,376 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2018-07-25 08:41:48,376 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2018-07-25 08:41:48,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:48,461 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-07-25 08:41:48,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-07-25 08:41:48,461 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2018-07-25 08:41:48,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:48,462 INFO L225 Difference]: With dead ends: 111 [2018-07-25 08:41:48,462 INFO L226 Difference]: Without dead ends: 109 [2018-07-25 08:41:48,463 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2018-07-25 08:41:48,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-07-25 08:41:48,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-07-25 08:41:48,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-07-25 08:41:48,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-07-25 08:41:48,466 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2018-07-25 08:41:48,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:48,466 INFO L472 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-07-25 08:41:48,466 INFO L473 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-07-25 08:41:48,467 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-07-25 08:41:48,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-07-25 08:41:48,467 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:48,467 INFO L354 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2018-07-25 08:41:48,468 INFO L415 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:48,468 INFO L82 PathProgramCache]: Analyzing trace with hash 747933096, now seen corresponding path program 105 times [2018-07-25 08:41:48,468 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:48,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:48,732 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:48,732 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:48,733 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-07-25 08:41:48,733 INFO L451 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-07-25 08:41:48,734 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-07-25 08:41:48,735 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-07-25 08:41:48,735 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2018-07-25 08:41:48,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:48,803 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2018-07-25 08:41:48,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-07-25 08:41:48,804 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2018-07-25 08:41:48,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:48,805 INFO L225 Difference]: With dead ends: 112 [2018-07-25 08:41:48,805 INFO L226 Difference]: Without dead ends: 110 [2018-07-25 08:41:48,806 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-07-25 08:41:48,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-07-25 08:41:48,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-07-25 08:41:48,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-07-25 08:41:48,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-07-25 08:41:48,809 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2018-07-25 08:41:48,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:48,810 INFO L472 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-07-25 08:41:48,810 INFO L473 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-07-25 08:41:48,810 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-07-25 08:41:48,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-07-25 08:41:48,810 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:48,811 INFO L354 BasicCegarLoop]: trace histogram [106, 1, 1, 1] [2018-07-25 08:41:48,811 INFO L415 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:48,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1711087521, now seen corresponding path program 106 times [2018-07-25 08:41:48,811 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:48,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:49,092 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:49,092 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:49,093 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-07-25 08:41:49,093 INFO L451 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-07-25 08:41:49,094 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-07-25 08:41:49,094 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2018-07-25 08:41:49,094 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 109 states. [2018-07-25 08:41:49,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:49,184 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-07-25 08:41:49,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-07-25 08:41:49,184 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 109 [2018-07-25 08:41:49,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:49,184 INFO L225 Difference]: With dead ends: 113 [2018-07-25 08:41:49,185 INFO L226 Difference]: Without dead ends: 111 [2018-07-25 08:41:49,185 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2018-07-25 08:41:49,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-07-25 08:41:49,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-07-25 08:41:49,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-07-25 08:41:49,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-07-25 08:41:49,189 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2018-07-25 08:41:49,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:49,189 INFO L472 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-07-25 08:41:49,189 INFO L473 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-07-25 08:41:49,189 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-07-25 08:41:49,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-07-25 08:41:49,190 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:49,190 INFO L354 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2018-07-25 08:41:49,190 INFO L415 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:49,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1504103624, now seen corresponding path program 107 times [2018-07-25 08:41:49,191 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:49,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:49,502 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:49,502 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:49,502 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-07-25 08:41:49,502 INFO L451 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-07-25 08:41:49,504 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-07-25 08:41:49,505 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-07-25 08:41:49,505 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 110 states. [2018-07-25 08:41:49,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:49,630 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-07-25 08:41:49,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-07-25 08:41:49,631 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2018-07-25 08:41:49,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:49,632 INFO L225 Difference]: With dead ends: 114 [2018-07-25 08:41:49,632 INFO L226 Difference]: Without dead ends: 112 [2018-07-25 08:41:49,633 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-07-25 08:41:49,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-07-25 08:41:49,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-07-25 08:41:49,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-07-25 08:41:49,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-07-25 08:41:49,637 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2018-07-25 08:41:49,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:49,637 INFO L472 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-07-25 08:41:49,637 INFO L473 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-07-25 08:41:49,637 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-07-25 08:41:49,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-07-25 08:41:49,638 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:49,638 INFO L354 BasicCegarLoop]: trace histogram [108, 1, 1, 1] [2018-07-25 08:41:49,639 INFO L415 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:49,639 INFO L82 PathProgramCache]: Analyzing trace with hash -617429887, now seen corresponding path program 108 times [2018-07-25 08:41:49,639 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:49,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:49,980 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:49,980 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:49,980 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2018-07-25 08:41:49,980 INFO L451 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-07-25 08:41:49,981 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-07-25 08:41:49,982 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2018-07-25 08:41:49,982 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 111 states. [2018-07-25 08:41:50,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:50,059 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-07-25 08:41:50,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-07-25 08:41:50,060 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 111 [2018-07-25 08:41:50,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:50,060 INFO L225 Difference]: With dead ends: 115 [2018-07-25 08:41:50,060 INFO L226 Difference]: Without dead ends: 113 [2018-07-25 08:41:50,061 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2018-07-25 08:41:50,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-07-25 08:41:50,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-07-25 08:41:50,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-07-25 08:41:50,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-07-25 08:41:50,064 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2018-07-25 08:41:50,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:50,064 INFO L472 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-07-25 08:41:50,064 INFO L473 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-07-25 08:41:50,064 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-07-25 08:41:50,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-07-25 08:41:50,065 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:50,065 INFO L354 BasicCegarLoop]: trace histogram [109, 1, 1, 1] [2018-07-25 08:41:50,065 INFO L415 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:50,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1960459288, now seen corresponding path program 109 times [2018-07-25 08:41:50,065 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:50,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:50,347 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:50,347 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:50,347 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-07-25 08:41:50,347 INFO L451 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-07-25 08:41:50,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-07-25 08:41:50,349 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-07-25 08:41:50,349 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 112 states. [2018-07-25 08:41:50,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:50,518 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-07-25 08:41:50,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-07-25 08:41:50,519 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 112 [2018-07-25 08:41:50,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:50,519 INFO L225 Difference]: With dead ends: 116 [2018-07-25 08:41:50,520 INFO L226 Difference]: Without dead ends: 114 [2018-07-25 08:41:50,521 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-07-25 08:41:50,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-07-25 08:41:50,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-07-25 08:41:50,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-07-25 08:41:50,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2018-07-25 08:41:50,525 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2018-07-25 08:41:50,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:50,525 INFO L472 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2018-07-25 08:41:50,525 INFO L473 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-07-25 08:41:50,525 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-07-25 08:41:50,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-07-25 08:41:50,526 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:50,526 INFO L354 BasicCegarLoop]: trace histogram [110, 1, 1, 1] [2018-07-25 08:41:50,526 INFO L415 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:50,527 INFO L82 PathProgramCache]: Analyzing trace with hash -644697759, now seen corresponding path program 110 times [2018-07-25 08:41:50,527 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:50,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:50,844 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:50,845 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:50,845 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2018-07-25 08:41:50,845 INFO L451 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-07-25 08:41:50,846 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-07-25 08:41:50,847 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2018-07-25 08:41:50,847 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 113 states. [2018-07-25 08:41:50,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:50,935 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-07-25 08:41:50,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-07-25 08:41:50,935 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 113 [2018-07-25 08:41:50,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:50,936 INFO L225 Difference]: With dead ends: 117 [2018-07-25 08:41:50,936 INFO L226 Difference]: Without dead ends: 115 [2018-07-25 08:41:50,937 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2018-07-25 08:41:50,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-07-25 08:41:50,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-07-25 08:41:50,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-07-25 08:41:50,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-07-25 08:41:50,941 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 113 [2018-07-25 08:41:50,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:50,941 INFO L472 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-07-25 08:41:50,941 INFO L473 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-07-25 08:41:50,941 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-07-25 08:41:50,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-07-25 08:41:50,942 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:50,942 INFO L354 BasicCegarLoop]: trace histogram [111, 1, 1, 1] [2018-07-25 08:41:50,942 INFO L415 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:50,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1489203976, now seen corresponding path program 111 times [2018-07-25 08:41:50,943 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:50,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:51,279 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:51,280 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:51,280 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-07-25 08:41:51,280 INFO L451 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-07-25 08:41:51,281 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-07-25 08:41:51,282 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-07-25 08:41:51,282 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 114 states. [2018-07-25 08:41:51,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:51,465 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2018-07-25 08:41:51,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-07-25 08:41:51,465 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 114 [2018-07-25 08:41:51,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:51,466 INFO L225 Difference]: With dead ends: 118 [2018-07-25 08:41:51,466 INFO L226 Difference]: Without dead ends: 116 [2018-07-25 08:41:51,467 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-07-25 08:41:51,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-07-25 08:41:51,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-07-25 08:41:51,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-07-25 08:41:51,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-07-25 08:41:51,471 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 114 [2018-07-25 08:41:51,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:51,471 INFO L472 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-07-25 08:41:51,471 INFO L473 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-07-25 08:41:51,471 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-07-25 08:41:51,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-07-25 08:41:51,472 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:51,472 INFO L354 BasicCegarLoop]: trace histogram [112, 1, 1, 1] [2018-07-25 08:41:51,472 INFO L415 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:51,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1079318975, now seen corresponding path program 112 times [2018-07-25 08:41:51,473 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:51,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:51,777 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:51,777 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:51,777 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2018-07-25 08:41:51,778 INFO L451 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-07-25 08:41:51,779 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-07-25 08:41:51,780 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2018-07-25 08:41:51,780 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 115 states. [2018-07-25 08:41:51,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:51,934 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-07-25 08:41:51,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-07-25 08:41:51,934 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 115 [2018-07-25 08:41:51,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:51,935 INFO L225 Difference]: With dead ends: 119 [2018-07-25 08:41:51,935 INFO L226 Difference]: Without dead ends: 117 [2018-07-25 08:41:51,936 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2018-07-25 08:41:51,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-07-25 08:41:51,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-07-25 08:41:51,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-07-25 08:41:51,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-07-25 08:41:51,939 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 115 [2018-07-25 08:41:51,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:51,940 INFO L472 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-07-25 08:41:51,940 INFO L473 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-07-25 08:41:51,940 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-07-25 08:41:51,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-07-25 08:41:51,941 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:51,941 INFO L354 BasicCegarLoop]: trace histogram [113, 1, 1, 1] [2018-07-25 08:41:51,941 INFO L415 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:51,941 INFO L82 PathProgramCache]: Analyzing trace with hash 900848168, now seen corresponding path program 113 times [2018-07-25 08:41:51,941 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:51,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:52,325 INFO L134 CoverageAnalysis]: Checked inductivity of 6441 backedges. 0 proven. 6441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:52,325 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:52,325 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-07-25 08:41:52,325 INFO L451 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-07-25 08:41:52,326 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-07-25 08:41:52,326 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-07-25 08:41:52,326 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 116 states. [2018-07-25 08:41:52,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:52,438 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2018-07-25 08:41:52,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-07-25 08:41:52,439 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 116 [2018-07-25 08:41:52,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:52,439 INFO L225 Difference]: With dead ends: 120 [2018-07-25 08:41:52,439 INFO L226 Difference]: Without dead ends: 118 [2018-07-25 08:41:52,440 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-07-25 08:41:52,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-07-25 08:41:52,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-07-25 08:41:52,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-07-25 08:41:52,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2018-07-25 08:41:52,443 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 116 [2018-07-25 08:41:52,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:52,443 INFO L472 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2018-07-25 08:41:52,443 INFO L473 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-07-25 08:41:52,444 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2018-07-25 08:41:52,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-07-25 08:41:52,444 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:52,444 INFO L354 BasicCegarLoop]: trace histogram [114, 1, 1, 1] [2018-07-25 08:41:52,444 INFO L415 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:52,445 INFO L82 PathProgramCache]: Analyzing trace with hash -2138479839, now seen corresponding path program 114 times [2018-07-25 08:41:52,445 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:52,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:52,953 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:52,953 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:52,954 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2018-07-25 08:41:52,954 INFO L451 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-07-25 08:41:52,955 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-07-25 08:41:52,956 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2018-07-25 08:41:52,956 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 117 states. [2018-07-25 08:41:53,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:53,091 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-07-25 08:41:53,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-07-25 08:41:53,091 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 117 [2018-07-25 08:41:53,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:53,092 INFO L225 Difference]: With dead ends: 121 [2018-07-25 08:41:53,092 INFO L226 Difference]: Without dead ends: 119 [2018-07-25 08:41:53,093 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2018-07-25 08:41:53,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-07-25 08:41:53,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-07-25 08:41:53,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-07-25 08:41:53,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-07-25 08:41:53,096 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 117 [2018-07-25 08:41:53,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:53,097 INFO L472 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-07-25 08:41:53,097 INFO L473 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-07-25 08:41:53,097 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-07-25 08:41:53,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-07-25 08:41:53,097 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:53,098 INFO L354 BasicCegarLoop]: trace histogram [115, 1, 1, 1] [2018-07-25 08:41:53,098 INFO L415 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:53,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1868367544, now seen corresponding path program 115 times [2018-07-25 08:41:53,098 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:53,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:53,421 INFO L134 CoverageAnalysis]: Checked inductivity of 6670 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:53,421 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:53,422 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-07-25 08:41:53,422 INFO L451 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-07-25 08:41:53,423 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-07-25 08:41:53,423 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-07-25 08:41:53,423 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 118 states. [2018-07-25 08:41:53,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:53,607 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2018-07-25 08:41:53,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-07-25 08:41:53,608 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 118 [2018-07-25 08:41:53,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:53,609 INFO L225 Difference]: With dead ends: 122 [2018-07-25 08:41:53,609 INFO L226 Difference]: Without dead ends: 120 [2018-07-25 08:41:53,610 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-07-25 08:41:53,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-07-25 08:41:53,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-07-25 08:41:53,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-07-25 08:41:53,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2018-07-25 08:41:53,613 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 118 [2018-07-25 08:41:53,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:53,613 INFO L472 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2018-07-25 08:41:53,613 INFO L473 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-07-25 08:41:53,614 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2018-07-25 08:41:53,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-07-25 08:41:53,614 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:53,614 INFO L354 BasicCegarLoop]: trace histogram [116, 1, 1, 1] [2018-07-25 08:41:53,614 INFO L415 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:53,615 INFO L82 PathProgramCache]: Analyzing trace with hash -2084820991, now seen corresponding path program 116 times [2018-07-25 08:41:53,615 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:53,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:53,948 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:53,948 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:53,948 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2018-07-25 08:41:53,948 INFO L451 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-07-25 08:41:53,949 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-07-25 08:41:53,950 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2018-07-25 08:41:53,950 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 119 states. [2018-07-25 08:41:54,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:54,082 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-07-25 08:41:54,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-07-25 08:41:54,082 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 119 [2018-07-25 08:41:54,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:54,082 INFO L225 Difference]: With dead ends: 123 [2018-07-25 08:41:54,083 INFO L226 Difference]: Without dead ends: 121 [2018-07-25 08:41:54,083 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2018-07-25 08:41:54,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-07-25 08:41:54,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-07-25 08:41:54,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-07-25 08:41:54,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-07-25 08:41:54,085 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 119 [2018-07-25 08:41:54,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:54,086 INFO L472 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-07-25 08:41:54,086 INFO L473 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-07-25 08:41:54,086 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-07-25 08:41:54,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-07-25 08:41:54,086 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:54,086 INFO L354 BasicCegarLoop]: trace histogram [117, 1, 1, 1] [2018-07-25 08:41:54,086 INFO L415 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:54,086 INFO L82 PathProgramCache]: Analyzing trace with hash -204943256, now seen corresponding path program 117 times [2018-07-25 08:41:54,087 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:54,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:54,405 INFO L134 CoverageAnalysis]: Checked inductivity of 6903 backedges. 0 proven. 6903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:54,406 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:54,406 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-07-25 08:41:54,406 INFO L451 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-07-25 08:41:54,407 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-07-25 08:41:54,407 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-07-25 08:41:54,408 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 120 states. [2018-07-25 08:41:54,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:54,535 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2018-07-25 08:41:54,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-07-25 08:41:54,535 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 120 [2018-07-25 08:41:54,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:54,536 INFO L225 Difference]: With dead ends: 124 [2018-07-25 08:41:54,536 INFO L226 Difference]: Without dead ends: 122 [2018-07-25 08:41:54,537 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-07-25 08:41:54,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-07-25 08:41:54,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-07-25 08:41:54,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-07-25 08:41:54,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2018-07-25 08:41:54,540 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 120 [2018-07-25 08:41:54,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:54,540 INFO L472 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2018-07-25 08:41:54,540 INFO L473 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-07-25 08:41:54,540 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2018-07-25 08:41:54,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-07-25 08:41:54,541 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:54,541 INFO L354 BasicCegarLoop]: trace histogram [118, 1, 1, 1] [2018-07-25 08:41:54,541 INFO L415 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:54,541 INFO L82 PathProgramCache]: Analyzing trace with hash -2058275615, now seen corresponding path program 118 times [2018-07-25 08:41:54,541 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:54,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:54,886 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:54,886 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:54,886 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [120] total 120 [2018-07-25 08:41:54,886 INFO L451 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-07-25 08:41:54,887 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-07-25 08:41:54,888 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7260, Invalid=7260, Unknown=0, NotChecked=0, Total=14520 [2018-07-25 08:41:54,888 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 121 states. [2018-07-25 08:41:55,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:55,004 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-07-25 08:41:55,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-07-25 08:41:55,005 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 121 [2018-07-25 08:41:55,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:55,005 INFO L225 Difference]: With dead ends: 125 [2018-07-25 08:41:55,005 INFO L226 Difference]: Without dead ends: 123 [2018-07-25 08:41:55,006 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7260, Invalid=7260, Unknown=0, NotChecked=0, Total=14520 [2018-07-25 08:41:55,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-07-25 08:41:55,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-07-25 08:41:55,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-07-25 08:41:55,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-07-25 08:41:55,009 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 121 [2018-07-25 08:41:55,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:55,010 INFO L472 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-07-25 08:41:55,010 INFO L473 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-07-25 08:41:55,010 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-07-25 08:41:55,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-07-25 08:41:55,010 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:55,011 INFO L354 BasicCegarLoop]: trace histogram [119, 1, 1, 1] [2018-07-25 08:41:55,011 INFO L415 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:55,011 INFO L82 PathProgramCache]: Analyzing trace with hash 617963400, now seen corresponding path program 119 times [2018-07-25 08:41:55,011 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:55,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:55,481 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:55,481 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:55,481 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-07-25 08:41:55,481 INFO L451 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-07-25 08:41:55,482 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-07-25 08:41:55,482 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-07-25 08:41:55,482 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 122 states. [2018-07-25 08:41:55,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:55,540 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2018-07-25 08:41:55,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-07-25 08:41:55,540 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 122 [2018-07-25 08:41:55,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:55,541 INFO L225 Difference]: With dead ends: 126 [2018-07-25 08:41:55,541 INFO L226 Difference]: Without dead ends: 124 [2018-07-25 08:41:55,541 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-07-25 08:41:55,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-07-25 08:41:55,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-07-25 08:41:55,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-07-25 08:41:55,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2018-07-25 08:41:55,544 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 122 [2018-07-25 08:41:55,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:55,544 INFO L472 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2018-07-25 08:41:55,544 INFO L473 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-07-25 08:41:55,545 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2018-07-25 08:41:55,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-07-25 08:41:55,545 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:55,545 INFO L354 BasicCegarLoop]: trace histogram [120, 1, 1, 1] [2018-07-25 08:41:55,545 INFO L415 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:55,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1976994241, now seen corresponding path program 120 times [2018-07-25 08:41:55,546 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:55,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:55,902 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:55,902 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:55,903 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [122] total 122 [2018-07-25 08:41:55,903 INFO L451 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-07-25 08:41:55,904 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-07-25 08:41:55,904 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7503, Invalid=7503, Unknown=0, NotChecked=0, Total=15006 [2018-07-25 08:41:55,905 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 123 states. [2018-07-25 08:41:56,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:56,050 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-07-25 08:41:56,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-07-25 08:41:56,050 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 123 [2018-07-25 08:41:56,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:56,050 INFO L225 Difference]: With dead ends: 127 [2018-07-25 08:41:56,050 INFO L226 Difference]: Without dead ends: 125 [2018-07-25 08:41:56,051 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=7503, Invalid=7503, Unknown=0, NotChecked=0, Total=15006 [2018-07-25 08:41:56,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-07-25 08:41:56,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-07-25 08:41:56,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-07-25 08:41:56,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-07-25 08:41:56,054 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 123 [2018-07-25 08:41:56,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:56,055 INFO L472 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-07-25 08:41:56,055 INFO L473 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-07-25 08:41:56,055 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-07-25 08:41:56,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-07-25 08:41:56,055 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:56,055 INFO L354 BasicCegarLoop]: trace histogram [121, 1, 1, 1] [2018-07-25 08:41:56,056 INFO L415 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:56,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1157277352, now seen corresponding path program 121 times [2018-07-25 08:41:56,056 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:56,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:56,428 INFO L134 CoverageAnalysis]: Checked inductivity of 7381 backedges. 0 proven. 7381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:56,429 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:56,429 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-07-25 08:41:56,429 INFO L451 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-07-25 08:41:56,430 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-07-25 08:41:56,430 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-07-25 08:41:56,431 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 124 states. [2018-07-25 08:41:56,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:56,581 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2018-07-25 08:41:56,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-07-25 08:41:56,581 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 124 [2018-07-25 08:41:56,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:56,582 INFO L225 Difference]: With dead ends: 128 [2018-07-25 08:41:56,582 INFO L226 Difference]: Without dead ends: 126 [2018-07-25 08:41:56,583 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-07-25 08:41:56,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-07-25 08:41:56,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-07-25 08:41:56,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-07-25 08:41:56,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2018-07-25 08:41:56,586 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 124 [2018-07-25 08:41:56,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:56,586 INFO L472 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2018-07-25 08:41:56,586 INFO L473 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-07-25 08:41:56,586 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2018-07-25 08:41:56,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-07-25 08:41:56,587 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:56,587 INFO L354 BasicCegarLoop]: trace histogram [122, 1, 1, 1] [2018-07-25 08:41:56,587 INFO L415 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:56,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1515857569, now seen corresponding path program 122 times [2018-07-25 08:41:56,587 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:56,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:57,201 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:57,201 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:57,202 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [124] total 124 [2018-07-25 08:41:57,202 INFO L451 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-07-25 08:41:57,204 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-07-25 08:41:57,204 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7750, Invalid=7750, Unknown=0, NotChecked=0, Total=15500 [2018-07-25 08:41:57,205 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 125 states. [2018-07-25 08:41:57,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:57,565 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-07-25 08:41:57,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-07-25 08:41:57,565 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 125 [2018-07-25 08:41:57,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:57,566 INFO L225 Difference]: With dead ends: 129 [2018-07-25 08:41:57,566 INFO L226 Difference]: Without dead ends: 127 [2018-07-25 08:41:57,567 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=7750, Invalid=7750, Unknown=0, NotChecked=0, Total=15500 [2018-07-25 08:41:57,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-07-25 08:41:57,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-07-25 08:41:57,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-07-25 08:41:57,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-07-25 08:41:57,570 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 125 [2018-07-25 08:41:57,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:57,570 INFO L472 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-07-25 08:41:57,570 INFO L473 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-07-25 08:41:57,570 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-07-25 08:41:57,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-07-25 08:41:57,571 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:57,571 INFO L354 BasicCegarLoop]: trace histogram [123, 1, 1, 1] [2018-07-25 08:41:57,571 INFO L415 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:57,572 INFO L82 PathProgramCache]: Analyzing trace with hash -253057592, now seen corresponding path program 123 times [2018-07-25 08:41:57,572 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:57,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:58,016 INFO L134 CoverageAnalysis]: Checked inductivity of 7626 backedges. 0 proven. 7626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:58,017 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:58,017 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-07-25 08:41:58,017 INFO L451 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-07-25 08:41:58,018 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-07-25 08:41:58,019 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-07-25 08:41:58,019 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 126 states. [2018-07-25 08:41:58,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:58,144 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2018-07-25 08:41:58,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-07-25 08:41:58,144 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 126 [2018-07-25 08:41:58,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:58,144 INFO L225 Difference]: With dead ends: 130 [2018-07-25 08:41:58,145 INFO L226 Difference]: Without dead ends: 128 [2018-07-25 08:41:58,145 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-07-25 08:41:58,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-07-25 08:41:58,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-07-25 08:41:58,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-07-25 08:41:58,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2018-07-25 08:41:58,148 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 126 [2018-07-25 08:41:58,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:58,148 INFO L472 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2018-07-25 08:41:58,148 INFO L473 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-07-25 08:41:58,148 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2018-07-25 08:41:58,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-07-25 08:41:58,149 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:58,149 INFO L354 BasicCegarLoop]: trace histogram [124, 1, 1, 1] [2018-07-25 08:41:58,149 INFO L415 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:58,150 INFO L82 PathProgramCache]: Analyzing trace with hash 745147265, now seen corresponding path program 124 times [2018-07-25 08:41:58,150 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:58,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:58,535 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:58,536 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:58,536 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [126] total 126 [2018-07-25 08:41:58,536 INFO L451 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-07-25 08:41:58,537 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-07-25 08:41:58,537 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8001, Invalid=8001, Unknown=0, NotChecked=0, Total=16002 [2018-07-25 08:41:58,537 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 127 states. [2018-07-25 08:41:58,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:58,729 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-07-25 08:41:58,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-07-25 08:41:58,729 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 127 [2018-07-25 08:41:58,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:58,729 INFO L225 Difference]: With dead ends: 131 [2018-07-25 08:41:58,729 INFO L226 Difference]: Without dead ends: 129 [2018-07-25 08:41:58,730 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8001, Invalid=8001, Unknown=0, NotChecked=0, Total=16002 [2018-07-25 08:41:58,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-07-25 08:41:58,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-07-25 08:41:58,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-07-25 08:41:58,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-07-25 08:41:58,732 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 127 [2018-07-25 08:41:58,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:58,733 INFO L472 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-07-25 08:41:58,733 INFO L473 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-07-25 08:41:58,733 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-07-25 08:41:58,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-07-25 08:41:58,733 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:58,734 INFO L354 BasicCegarLoop]: trace histogram [125, 1, 1, 1] [2018-07-25 08:41:58,734 INFO L415 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:58,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1624726760, now seen corresponding path program 125 times [2018-07-25 08:41:58,734 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:58,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:59,073 INFO L134 CoverageAnalysis]: Checked inductivity of 7875 backedges. 0 proven. 7875 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:59,074 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:59,074 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-07-25 08:41:59,074 INFO L451 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-07-25 08:41:59,075 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-07-25 08:41:59,076 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-07-25 08:41:59,076 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 128 states. [2018-07-25 08:41:59,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:59,182 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2018-07-25 08:41:59,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-07-25 08:41:59,182 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 128 [2018-07-25 08:41:59,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:59,182 INFO L225 Difference]: With dead ends: 132 [2018-07-25 08:41:59,182 INFO L226 Difference]: Without dead ends: 130 [2018-07-25 08:41:59,183 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-07-25 08:41:59,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-07-25 08:41:59,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-07-25 08:41:59,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-07-25 08:41:59,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2018-07-25 08:41:59,186 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 128 [2018-07-25 08:41:59,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:59,187 INFO L472 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2018-07-25 08:41:59,187 INFO L473 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-07-25 08:41:59,187 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2018-07-25 08:41:59,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-07-25 08:41:59,187 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:59,188 INFO L354 BasicCegarLoop]: trace histogram [126, 1, 1, 1] [2018-07-25 08:41:59,188 INFO L415 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:59,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1173079967, now seen corresponding path program 126 times [2018-07-25 08:41:59,188 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:59,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:59,557 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:59,557 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:59,557 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [128] total 128 [2018-07-25 08:41:59,558 INFO L451 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-07-25 08:41:59,559 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-07-25 08:41:59,559 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8256, Invalid=8256, Unknown=0, NotChecked=0, Total=16512 [2018-07-25 08:41:59,560 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 129 states. [2018-07-25 08:41:59,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:59,738 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-07-25 08:41:59,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-07-25 08:41:59,738 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 129 [2018-07-25 08:41:59,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:59,739 INFO L225 Difference]: With dead ends: 133 [2018-07-25 08:41:59,739 INFO L226 Difference]: Without dead ends: 131 [2018-07-25 08:41:59,740 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8256, Invalid=8256, Unknown=0, NotChecked=0, Total=16512 [2018-07-25 08:41:59,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-07-25 08:41:59,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-07-25 08:41:59,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-07-25 08:41:59,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-07-25 08:41:59,743 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 129 [2018-07-25 08:41:59,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:59,743 INFO L472 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-07-25 08:41:59,743 INFO L473 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-07-25 08:41:59,743 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-07-25 08:41:59,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-07-25 08:41:59,744 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:59,744 INFO L354 BasicCegarLoop]: trace histogram [127, 1, 1, 1] [2018-07-25 08:41:59,745 INFO L415 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:59,745 INFO L82 PathProgramCache]: Analyzing trace with hash -2005742584, now seen corresponding path program 127 times [2018-07-25 08:41:59,745 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:59,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:00,133 INFO L134 CoverageAnalysis]: Checked inductivity of 8128 backedges. 0 proven. 8128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:00,133 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:00,133 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-07-25 08:42:00,134 INFO L451 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-07-25 08:42:00,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-07-25 08:42:00,136 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-07-25 08:42:00,137 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 130 states. [2018-07-25 08:42:00,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:00,210 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2018-07-25 08:42:00,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-07-25 08:42:00,210 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 130 [2018-07-25 08:42:00,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:00,211 INFO L225 Difference]: With dead ends: 134 [2018-07-25 08:42:00,211 INFO L226 Difference]: Without dead ends: 132 [2018-07-25 08:42:00,212 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-07-25 08:42:00,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-07-25 08:42:00,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-07-25 08:42:00,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-07-25 08:42:00,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2018-07-25 08:42:00,216 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 130 [2018-07-25 08:42:00,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:00,216 INFO L472 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2018-07-25 08:42:00,216 INFO L473 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-07-25 08:42:00,216 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2018-07-25 08:42:00,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-07-25 08:42:00,217 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:00,217 INFO L354 BasicCegarLoop]: trace histogram [128, 1, 1, 1] [2018-07-25 08:42:00,217 INFO L415 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:00,217 INFO L82 PathProgramCache]: Analyzing trace with hash -2048479935, now seen corresponding path program 128 times [2018-07-25 08:42:00,217 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:00,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:00,596 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:00,596 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:00,596 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [130] total 130 [2018-07-25 08:42:00,597 INFO L451 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-07-25 08:42:00,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-07-25 08:42:00,599 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8515, Invalid=8515, Unknown=0, NotChecked=0, Total=17030 [2018-07-25 08:42:00,599 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 131 states. [2018-07-25 08:42:00,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:00,767 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-07-25 08:42:00,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-07-25 08:42:00,767 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 131 [2018-07-25 08:42:00,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:00,768 INFO L225 Difference]: With dead ends: 135 [2018-07-25 08:42:00,768 INFO L226 Difference]: Without dead ends: 133 [2018-07-25 08:42:00,769 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8515, Invalid=8515, Unknown=0, NotChecked=0, Total=17030 [2018-07-25 08:42:00,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-07-25 08:42:00,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-07-25 08:42:00,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-07-25 08:42:00,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-07-25 08:42:00,772 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 131 [2018-07-25 08:42:00,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:00,772 INFO L472 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-07-25 08:42:00,772 INFO L473 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-07-25 08:42:00,772 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-07-25 08:42:00,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-07-25 08:42:00,773 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:00,773 INFO L354 BasicCegarLoop]: trace histogram [129, 1, 1, 1] [2018-07-25 08:42:00,773 INFO L415 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:00,773 INFO L82 PathProgramCache]: Analyzing trace with hash 921629480, now seen corresponding path program 129 times [2018-07-25 08:42:00,773 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:00,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:01,277 INFO L134 CoverageAnalysis]: Checked inductivity of 8385 backedges. 0 proven. 8385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:01,277 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:01,277 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-07-25 08:42:01,278 INFO L451 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-07-25 08:42:01,279 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-07-25 08:42:01,280 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-07-25 08:42:01,280 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 132 states. [2018-07-25 08:42:01,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:01,454 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2018-07-25 08:42:01,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-07-25 08:42:01,455 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 132 [2018-07-25 08:42:01,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:01,455 INFO L225 Difference]: With dead ends: 136 [2018-07-25 08:42:01,455 INFO L226 Difference]: Without dead ends: 134 [2018-07-25 08:42:01,456 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-07-25 08:42:01,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-07-25 08:42:01,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-07-25 08:42:01,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-07-25 08:42:01,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2018-07-25 08:42:01,459 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 132 [2018-07-25 08:42:01,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:01,459 INFO L472 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2018-07-25 08:42:01,459 INFO L473 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-07-25 08:42:01,459 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2018-07-25 08:42:01,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-07-25 08:42:01,460 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:01,460 INFO L354 BasicCegarLoop]: trace histogram [130, 1, 1, 1] [2018-07-25 08:42:01,460 INFO L415 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:01,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1494259167, now seen corresponding path program 130 times [2018-07-25 08:42:01,461 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:01,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:01,907 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:01,907 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:01,907 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [132] total 132 [2018-07-25 08:42:01,908 INFO L451 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-07-25 08:42:01,909 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-07-25 08:42:01,909 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8778, Invalid=8778, Unknown=0, NotChecked=0, Total=17556 [2018-07-25 08:42:01,909 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 133 states. [2018-07-25 08:42:02,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:02,072 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-07-25 08:42:02,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-07-25 08:42:02,073 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 133 [2018-07-25 08:42:02,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:02,073 INFO L225 Difference]: With dead ends: 137 [2018-07-25 08:42:02,073 INFO L226 Difference]: Without dead ends: 135 [2018-07-25 08:42:02,074 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8778, Invalid=8778, Unknown=0, NotChecked=0, Total=17556 [2018-07-25 08:42:02,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-07-25 08:42:02,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-07-25 08:42:02,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-07-25 08:42:02,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-07-25 08:42:02,076 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 133 [2018-07-25 08:42:02,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:02,077 INFO L472 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-07-25 08:42:02,077 INFO L473 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-07-25 08:42:02,077 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-07-25 08:42:02,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-07-25 08:42:02,077 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:02,077 INFO L354 BasicCegarLoop]: trace histogram [131, 1, 1, 1] [2018-07-25 08:42:02,077 INFO L415 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:02,078 INFO L82 PathProgramCache]: Analyzing trace with hash 922604104, now seen corresponding path program 131 times [2018-07-25 08:42:02,078 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:02,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:02,480 INFO L134 CoverageAnalysis]: Checked inductivity of 8646 backedges. 0 proven. 8646 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:02,481 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:02,481 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-07-25 08:42:02,481 INFO L451 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-07-25 08:42:02,483 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-07-25 08:42:02,483 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-07-25 08:42:02,483 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 134 states. [2018-07-25 08:42:02,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:02,683 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2018-07-25 08:42:02,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-07-25 08:42:02,683 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 134 [2018-07-25 08:42:02,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:02,684 INFO L225 Difference]: With dead ends: 138 [2018-07-25 08:42:02,684 INFO L226 Difference]: Without dead ends: 136 [2018-07-25 08:42:02,685 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-07-25 08:42:02,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-07-25 08:42:02,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-07-25 08:42:02,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-07-25 08:42:02,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2018-07-25 08:42:02,688 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 134 [2018-07-25 08:42:02,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:02,688 INFO L472 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2018-07-25 08:42:02,688 INFO L473 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-07-25 08:42:02,688 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2018-07-25 08:42:02,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-07-25 08:42:02,689 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:02,689 INFO L354 BasicCegarLoop]: trace histogram [132, 1, 1, 1] [2018-07-25 08:42:02,689 INFO L415 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:02,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1464045823, now seen corresponding path program 132 times [2018-07-25 08:42:02,690 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:02,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:03,100 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:03,100 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:03,100 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [134] total 134 [2018-07-25 08:42:03,101 INFO L451 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-07-25 08:42:03,102 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-07-25 08:42:03,102 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9045, Invalid=9045, Unknown=0, NotChecked=0, Total=18090 [2018-07-25 08:42:03,103 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 135 states. [2018-07-25 08:42:03,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:03,240 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-07-25 08:42:03,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-07-25 08:42:03,240 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 135 [2018-07-25 08:42:03,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:03,241 INFO L225 Difference]: With dead ends: 139 [2018-07-25 08:42:03,241 INFO L226 Difference]: Without dead ends: 137 [2018-07-25 08:42:03,242 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9045, Invalid=9045, Unknown=0, NotChecked=0, Total=18090 [2018-07-25 08:42:03,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-07-25 08:42:03,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-07-25 08:42:03,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-07-25 08:42:03,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-07-25 08:42:03,245 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 135 [2018-07-25 08:42:03,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:03,245 INFO L472 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-07-25 08:42:03,245 INFO L473 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-07-25 08:42:03,245 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-07-25 08:42:03,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-07-25 08:42:03,246 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:03,246 INFO L354 BasicCegarLoop]: trace histogram [133, 1, 1, 1] [2018-07-25 08:42:03,246 INFO L415 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:03,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1859217768, now seen corresponding path program 133 times [2018-07-25 08:42:03,247 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:03,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:03,681 INFO L134 CoverageAnalysis]: Checked inductivity of 8911 backedges. 0 proven. 8911 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:03,682 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:03,682 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-07-25 08:42:03,682 INFO L451 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-07-25 08:42:03,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-07-25 08:42:03,685 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-07-25 08:42:03,685 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 136 states. [2018-07-25 08:42:03,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:03,879 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2018-07-25 08:42:03,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-07-25 08:42:03,880 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 136 [2018-07-25 08:42:03,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:03,880 INFO L225 Difference]: With dead ends: 140 [2018-07-25 08:42:03,880 INFO L226 Difference]: Without dead ends: 138 [2018-07-25 08:42:03,882 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-07-25 08:42:03,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-07-25 08:42:03,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-07-25 08:42:03,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-07-25 08:42:03,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2018-07-25 08:42:03,885 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 136 [2018-07-25 08:42:03,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:03,885 INFO L472 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2018-07-25 08:42:03,885 INFO L473 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-07-25 08:42:03,885 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2018-07-25 08:42:03,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-07-25 08:42:03,886 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:03,886 INFO L354 BasicCegarLoop]: trace histogram [134, 1, 1, 1] [2018-07-25 08:42:03,886 INFO L415 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:03,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1801173985, now seen corresponding path program 134 times [2018-07-25 08:42:03,887 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:03,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:04,324 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:04,324 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:04,324 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [136] total 136 [2018-07-25 08:42:04,324 INFO L451 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-07-25 08:42:04,326 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-07-25 08:42:04,327 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9316, Invalid=9316, Unknown=0, NotChecked=0, Total=18632 [2018-07-25 08:42:04,327 INFO L87 Difference]: Start difference. First operand 138 states and 138 transitions. Second operand 137 states. [2018-07-25 08:42:04,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:04,531 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-07-25 08:42:04,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-07-25 08:42:04,531 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 137 [2018-07-25 08:42:04,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:04,532 INFO L225 Difference]: With dead ends: 141 [2018-07-25 08:42:04,532 INFO L226 Difference]: Without dead ends: 139 [2018-07-25 08:42:04,533 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9316, Invalid=9316, Unknown=0, NotChecked=0, Total=18632 [2018-07-25 08:42:04,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-07-25 08:42:04,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-07-25 08:42:04,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-07-25 08:42:04,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2018-07-25 08:42:04,535 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 137 [2018-07-25 08:42:04,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:04,535 INFO L472 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2018-07-25 08:42:04,535 INFO L473 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-07-25 08:42:04,535 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2018-07-25 08:42:04,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-07-25 08:42:04,536 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:04,536 INFO L354 BasicCegarLoop]: trace histogram [135, 1, 1, 1] [2018-07-25 08:42:04,536 INFO L415 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:04,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1816712, now seen corresponding path program 135 times [2018-07-25 08:42:04,536 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:04,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:04,976 INFO L134 CoverageAnalysis]: Checked inductivity of 9180 backedges. 0 proven. 9180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:04,977 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:04,977 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-07-25 08:42:04,977 INFO L451 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-07-25 08:42:04,978 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-07-25 08:42:04,979 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-07-25 08:42:04,979 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 138 states. [2018-07-25 08:42:05,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:05,198 INFO L93 Difference]: Finished difference Result 142 states and 142 transitions. [2018-07-25 08:42:05,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-07-25 08:42:05,198 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 138 [2018-07-25 08:42:05,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:05,198 INFO L225 Difference]: With dead ends: 142 [2018-07-25 08:42:05,198 INFO L226 Difference]: Without dead ends: 140 [2018-07-25 08:42:05,199 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-07-25 08:42:05,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-07-25 08:42:05,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-07-25 08:42:05,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-07-25 08:42:05,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2018-07-25 08:42:05,201 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 138 [2018-07-25 08:42:05,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:05,201 INFO L472 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2018-07-25 08:42:05,201 INFO L473 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-07-25 08:42:05,201 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2018-07-25 08:42:05,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-07-25 08:42:05,202 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:05,202 INFO L354 BasicCegarLoop]: trace histogram [136, 1, 1, 1] [2018-07-25 08:42:05,202 INFO L415 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:05,202 INFO L82 PathProgramCache]: Analyzing trace with hash 56316097, now seen corresponding path program 136 times [2018-07-25 08:42:05,202 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:05,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:05,605 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:05,605 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:05,605 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [138] total 138 [2018-07-25 08:42:05,606 INFO L451 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-07-25 08:42:05,607 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-07-25 08:42:05,608 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9591, Invalid=9591, Unknown=0, NotChecked=0, Total=19182 [2018-07-25 08:42:05,608 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 139 states. [2018-07-25 08:42:05,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:05,715 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-07-25 08:42:05,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-07-25 08:42:05,715 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 139 [2018-07-25 08:42:05,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:05,715 INFO L225 Difference]: With dead ends: 143 [2018-07-25 08:42:05,716 INFO L226 Difference]: Without dead ends: 141 [2018-07-25 08:42:05,717 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9591, Invalid=9591, Unknown=0, NotChecked=0, Total=19182 [2018-07-25 08:42:05,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-07-25 08:42:05,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-07-25 08:42:05,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-07-25 08:42:05,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-07-25 08:42:05,720 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 139 [2018-07-25 08:42:05,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:05,720 INFO L472 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-07-25 08:42:05,721 INFO L473 AbstractCegarLoop]: Interpolant automaton has 139 states. [2018-07-25 08:42:05,721 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-07-25 08:42:05,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-07-25 08:42:05,721 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:05,722 INFO L354 BasicCegarLoop]: trace histogram [137, 1, 1, 1] [2018-07-25 08:42:05,722 INFO L415 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:05,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1745797032, now seen corresponding path program 137 times [2018-07-25 08:42:05,722 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:05,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:06,222 INFO L134 CoverageAnalysis]: Checked inductivity of 9453 backedges. 0 proven. 9453 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:06,222 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:06,222 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-07-25 08:42:06,222 INFO L451 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-07-25 08:42:06,224 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-07-25 08:42:06,225 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-07-25 08:42:06,225 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 140 states. [2018-07-25 08:42:06,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:06,469 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2018-07-25 08:42:06,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2018-07-25 08:42:06,469 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 140 [2018-07-25 08:42:06,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:06,470 INFO L225 Difference]: With dead ends: 144 [2018-07-25 08:42:06,470 INFO L226 Difference]: Without dead ends: 142 [2018-07-25 08:42:06,471 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-07-25 08:42:06,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-07-25 08:42:06,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-07-25 08:42:06,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-07-25 08:42:06,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2018-07-25 08:42:06,473 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 140 [2018-07-25 08:42:06,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:06,473 INFO L472 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2018-07-25 08:42:06,473 INFO L473 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-07-25 08:42:06,473 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2018-07-25 08:42:06,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-07-25 08:42:06,474 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:06,474 INFO L354 BasicCegarLoop]: trace histogram [138, 1, 1, 1] [2018-07-25 08:42:06,474 INFO L415 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:06,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1714868831, now seen corresponding path program 138 times [2018-07-25 08:42:06,474 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:06,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:06,914 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:06,915 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:06,915 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [140] total 140 [2018-07-25 08:42:06,915 INFO L451 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-07-25 08:42:06,916 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-07-25 08:42:06,917 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9870, Invalid=9870, Unknown=0, NotChecked=0, Total=19740 [2018-07-25 08:42:06,917 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 141 states. [2018-07-25 08:42:07,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:07,149 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-07-25 08:42:07,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-07-25 08:42:07,149 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 141 [2018-07-25 08:42:07,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:07,150 INFO L225 Difference]: With dead ends: 145 [2018-07-25 08:42:07,150 INFO L226 Difference]: Without dead ends: 143 [2018-07-25 08:42:07,151 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9870, Invalid=9870, Unknown=0, NotChecked=0, Total=19740 [2018-07-25 08:42:07,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-07-25 08:42:07,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-07-25 08:42:07,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-07-25 08:42:07,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-07-25 08:42:07,153 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 141 [2018-07-25 08:42:07,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:07,154 INFO L472 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-07-25 08:42:07,154 INFO L473 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-07-25 08:42:07,154 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-07-25 08:42:07,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-07-25 08:42:07,154 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:07,155 INFO L354 BasicCegarLoop]: trace histogram [139, 1, 1, 1] [2018-07-25 08:42:07,155 INFO L415 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:07,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1621328184, now seen corresponding path program 139 times [2018-07-25 08:42:07,155 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:07,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:07,626 INFO L134 CoverageAnalysis]: Checked inductivity of 9730 backedges. 0 proven. 9730 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:07,627 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:07,627 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2018-07-25 08:42:07,627 INFO L451 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-07-25 08:42:07,629 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-07-25 08:42:07,629 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-07-25 08:42:07,630 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 142 states. [2018-07-25 08:42:07,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:07,925 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2018-07-25 08:42:07,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2018-07-25 08:42:07,926 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 142 [2018-07-25 08:42:07,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:07,926 INFO L225 Difference]: With dead ends: 146 [2018-07-25 08:42:07,926 INFO L226 Difference]: Without dead ends: 144 [2018-07-25 08:42:07,927 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-07-25 08:42:07,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-07-25 08:42:07,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-07-25 08:42:07,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-07-25 08:42:07,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 144 transitions. [2018-07-25 08:42:07,931 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 144 transitions. Word has length 142 [2018-07-25 08:42:07,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:07,932 INFO L472 AbstractCegarLoop]: Abstraction has 144 states and 144 transitions. [2018-07-25 08:42:07,932 INFO L473 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-07-25 08:42:07,932 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 144 transitions. [2018-07-25 08:42:07,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-07-25 08:42:07,933 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:07,933 INFO L354 BasicCegarLoop]: trace histogram [140, 1, 1, 1] [2018-07-25 08:42:07,933 INFO L415 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:07,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1278431873, now seen corresponding path program 140 times [2018-07-25 08:42:07,933 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:07,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:08,478 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:08,478 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:08,478 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [142] total 142 [2018-07-25 08:42:08,478 INFO L451 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-07-25 08:42:08,479 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-07-25 08:42:08,480 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10153, Invalid=10153, Unknown=0, NotChecked=0, Total=20306 [2018-07-25 08:42:08,480 INFO L87 Difference]: Start difference. First operand 144 states and 144 transitions. Second operand 143 states. [2018-07-25 08:42:08,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:08,654 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-07-25 08:42:08,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-07-25 08:42:08,654 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 143 [2018-07-25 08:42:08,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:08,655 INFO L225 Difference]: With dead ends: 147 [2018-07-25 08:42:08,655 INFO L226 Difference]: Without dead ends: 145 [2018-07-25 08:42:08,655 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10153, Invalid=10153, Unknown=0, NotChecked=0, Total=20306 [2018-07-25 08:42:08,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-07-25 08:42:08,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-07-25 08:42:08,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-07-25 08:42:08,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-07-25 08:42:08,657 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 143 [2018-07-25 08:42:08,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:08,657 INFO L472 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-07-25 08:42:08,657 INFO L473 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-07-25 08:42:08,658 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-07-25 08:42:08,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-07-25 08:42:08,658 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:08,658 INFO L354 BasicCegarLoop]: trace histogram [141, 1, 1, 1] [2018-07-25 08:42:08,658 INFO L415 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:08,659 INFO L82 PathProgramCache]: Analyzing trace with hash 976680424, now seen corresponding path program 141 times [2018-07-25 08:42:08,659 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:08,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:09,122 INFO L134 CoverageAnalysis]: Checked inductivity of 10011 backedges. 0 proven. 10011 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:09,123 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:09,123 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2018-07-25 08:42:09,123 INFO L451 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-07-25 08:42:09,125 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-07-25 08:42:09,126 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-07-25 08:42:09,126 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 144 states. [2018-07-25 08:42:09,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:09,234 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2018-07-25 08:42:09,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-07-25 08:42:09,234 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 144 [2018-07-25 08:42:09,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:09,235 INFO L225 Difference]: With dead ends: 148 [2018-07-25 08:42:09,235 INFO L226 Difference]: Without dead ends: 146 [2018-07-25 08:42:09,236 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-07-25 08:42:09,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-07-25 08:42:09,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-07-25 08:42:09,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-07-25 08:42:09,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2018-07-25 08:42:09,239 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 144 [2018-07-25 08:42:09,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:09,239 INFO L472 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2018-07-25 08:42:09,240 INFO L473 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-07-25 08:42:09,240 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2018-07-25 08:42:09,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-07-25 08:42:09,240 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:09,240 INFO L354 BasicCegarLoop]: trace histogram [142, 1, 1, 1] [2018-07-25 08:42:09,241 INFO L415 AbstractCegarLoop]: === Iteration 143 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:09,241 INFO L82 PathProgramCache]: Analyzing trace with hash 212320097, now seen corresponding path program 142 times [2018-07-25 08:42:09,241 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:09,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:09,906 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:09,906 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:09,907 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [144] total 144 [2018-07-25 08:42:09,907 INFO L451 AbstractCegarLoop]: Interpolant automaton has 145 states [2018-07-25 08:42:09,909 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2018-07-25 08:42:09,910 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10440, Invalid=10440, Unknown=0, NotChecked=0, Total=20880 [2018-07-25 08:42:09,911 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 145 states. [2018-07-25 08:42:10,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:10,205 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-07-25 08:42:10,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2018-07-25 08:42:10,206 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 145 [2018-07-25 08:42:10,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:10,206 INFO L225 Difference]: With dead ends: 149 [2018-07-25 08:42:10,206 INFO L226 Difference]: Without dead ends: 147 [2018-07-25 08:42:10,207 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=10440, Invalid=10440, Unknown=0, NotChecked=0, Total=20880 [2018-07-25 08:42:10,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-07-25 08:42:10,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-07-25 08:42:10,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-07-25 08:42:10,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-07-25 08:42:10,209 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 145 [2018-07-25 08:42:10,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:10,209 INFO L472 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-07-25 08:42:10,209 INFO L473 AbstractCegarLoop]: Interpolant automaton has 145 states. [2018-07-25 08:42:10,209 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-07-25 08:42:10,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-07-25 08:42:10,210 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:10,210 INFO L354 BasicCegarLoop]: trace histogram [143, 1, 1, 1] [2018-07-25 08:42:10,210 INFO L415 AbstractCegarLoop]: === Iteration 144 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:10,210 INFO L82 PathProgramCache]: Analyzing trace with hash -2008013560, now seen corresponding path program 143 times [2018-07-25 08:42:10,210 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:10,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:10,664 INFO L134 CoverageAnalysis]: Checked inductivity of 10296 backedges. 0 proven. 10296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:10,665 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:10,665 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2018-07-25 08:42:10,665 INFO L451 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-07-25 08:42:10,666 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-07-25 08:42:10,667 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-07-25 08:42:10,667 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 146 states. [2018-07-25 08:42:10,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:10,984 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2018-07-25 08:42:10,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-07-25 08:42:10,984 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 146 [2018-07-25 08:42:10,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:10,984 INFO L225 Difference]: With dead ends: 150 [2018-07-25 08:42:10,984 INFO L226 Difference]: Without dead ends: 148 [2018-07-25 08:42:10,985 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-07-25 08:42:10,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-07-25 08:42:10,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-07-25 08:42:10,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-07-25 08:42:10,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2018-07-25 08:42:10,987 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 146 [2018-07-25 08:42:10,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:10,987 INFO L472 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2018-07-25 08:42:10,987 INFO L473 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-07-25 08:42:10,988 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2018-07-25 08:42:10,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-07-25 08:42:10,988 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:10,988 INFO L354 BasicCegarLoop]: trace histogram [144, 1, 1, 1] [2018-07-25 08:42:10,988 INFO L415 AbstractCegarLoop]: === Iteration 145 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:10,988 INFO L82 PathProgramCache]: Analyzing trace with hash -2118880191, now seen corresponding path program 144 times [2018-07-25 08:42:10,988 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:10,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:11,473 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:11,473 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:11,473 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [146] total 146 [2018-07-25 08:42:11,474 INFO L451 AbstractCegarLoop]: Interpolant automaton has 147 states [2018-07-25 08:42:11,475 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2018-07-25 08:42:11,476 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10731, Invalid=10731, Unknown=0, NotChecked=0, Total=21462 [2018-07-25 08:42:11,476 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 147 states. [2018-07-25 08:42:11,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:11,744 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-07-25 08:42:11,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-07-25 08:42:11,744 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 147 [2018-07-25 08:42:11,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:11,745 INFO L225 Difference]: With dead ends: 151 [2018-07-25 08:42:11,745 INFO L226 Difference]: Without dead ends: 149 [2018-07-25 08:42:11,746 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10731, Invalid=10731, Unknown=0, NotChecked=0, Total=21462 [2018-07-25 08:42:11,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-07-25 08:42:11,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-07-25 08:42:11,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-07-25 08:42:11,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-07-25 08:42:11,748 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 147 [2018-07-25 08:42:11,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:11,749 INFO L472 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-07-25 08:42:11,749 INFO L473 AbstractCegarLoop]: Interpolant automaton has 147 states. [2018-07-25 08:42:11,749 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-07-25 08:42:11,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-07-25 08:42:11,749 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:11,749 INFO L354 BasicCegarLoop]: trace histogram [145, 1, 1, 1] [2018-07-25 08:42:11,749 INFO L415 AbstractCegarLoop]: === Iteration 146 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:11,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1260778456, now seen corresponding path program 145 times [2018-07-25 08:42:11,750 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:11,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:12,245 INFO L134 CoverageAnalysis]: Checked inductivity of 10585 backedges. 0 proven. 10585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:12,245 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:12,245 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147] total 147 [2018-07-25 08:42:12,245 INFO L451 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-07-25 08:42:12,247 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-07-25 08:42:12,247 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-07-25 08:42:12,247 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 148 states. [2018-07-25 08:42:12,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:12,519 INFO L93 Difference]: Finished difference Result 152 states and 152 transitions. [2018-07-25 08:42:12,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2018-07-25 08:42:12,520 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 148 [2018-07-25 08:42:12,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:12,520 INFO L225 Difference]: With dead ends: 152 [2018-07-25 08:42:12,520 INFO L226 Difference]: Without dead ends: 150 [2018-07-25 08:42:12,521 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-07-25 08:42:12,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-07-25 08:42:12,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-07-25 08:42:12,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-07-25 08:42:12,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2018-07-25 08:42:12,523 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 148 [2018-07-25 08:42:12,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:12,524 INFO L472 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2018-07-25 08:42:12,524 INFO L473 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-07-25 08:42:12,524 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2018-07-25 08:42:12,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-07-25 08:42:12,524 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:12,525 INFO L354 BasicCegarLoop]: trace histogram [146, 1, 1, 1] [2018-07-25 08:42:12,525 INFO L415 AbstractCegarLoop]: === Iteration 147 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:12,525 INFO L82 PathProgramCache]: Analyzing trace with hash -429428447, now seen corresponding path program 146 times [2018-07-25 08:42:12,525 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:12,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:13,063 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:13,063 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:13,063 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [148] total 148 [2018-07-25 08:42:13,064 INFO L451 AbstractCegarLoop]: Interpolant automaton has 149 states [2018-07-25 08:42:13,065 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2018-07-25 08:42:13,066 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11026, Invalid=11026, Unknown=0, NotChecked=0, Total=22052 [2018-07-25 08:42:13,066 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 149 states. [2018-07-25 08:42:13,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:13,363 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-07-25 08:42:13,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2018-07-25 08:42:13,364 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 149 [2018-07-25 08:42:13,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:13,364 INFO L225 Difference]: With dead ends: 153 [2018-07-25 08:42:13,364 INFO L226 Difference]: Without dead ends: 151 [2018-07-25 08:42:13,365 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11026, Invalid=11026, Unknown=0, NotChecked=0, Total=22052 [2018-07-25 08:42:13,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-07-25 08:42:13,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-07-25 08:42:13,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-07-25 08:42:13,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-07-25 08:42:13,368 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 149 [2018-07-25 08:42:13,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:13,368 INFO L472 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-07-25 08:42:13,369 INFO L473 AbstractCegarLoop]: Interpolant automaton has 149 states. [2018-07-25 08:42:13,369 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-07-25 08:42:13,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-07-25 08:42:13,369 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:13,369 INFO L354 BasicCegarLoop]: trace histogram [147, 1, 1, 1] [2018-07-25 08:42:13,370 INFO L415 AbstractCegarLoop]: === Iteration 148 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:13,370 INFO L82 PathProgramCache]: Analyzing trace with hash -427381944, now seen corresponding path program 147 times [2018-07-25 08:42:13,370 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:13,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:13,887 INFO L134 CoverageAnalysis]: Checked inductivity of 10878 backedges. 0 proven. 10878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:13,887 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:13,887 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149] total 149 [2018-07-25 08:42:13,888 INFO L451 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-07-25 08:42:13,889 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-07-25 08:42:13,890 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-07-25 08:42:13,890 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 150 states. [2018-07-25 08:42:14,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:14,220 INFO L93 Difference]: Finished difference Result 154 states and 154 transitions. [2018-07-25 08:42:14,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-07-25 08:42:14,220 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 150 [2018-07-25 08:42:14,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:14,221 INFO L225 Difference]: With dead ends: 154 [2018-07-25 08:42:14,221 INFO L226 Difference]: Without dead ends: 152 [2018-07-25 08:42:14,222 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-07-25 08:42:14,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-07-25 08:42:14,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-07-25 08:42:14,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-07-25 08:42:14,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2018-07-25 08:42:14,224 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 150 [2018-07-25 08:42:14,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:14,224 INFO L472 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2018-07-25 08:42:14,224 INFO L473 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-07-25 08:42:14,224 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2018-07-25 08:42:14,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-07-25 08:42:14,225 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:14,225 INFO L354 BasicCegarLoop]: trace histogram [148, 1, 1, 1] [2018-07-25 08:42:14,225 INFO L415 AbstractCegarLoop]: === Iteration 149 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:14,226 INFO L82 PathProgramCache]: Analyzing trace with hash -363940351, now seen corresponding path program 148 times [2018-07-25 08:42:14,226 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:14,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:14,753 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:14,754 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:14,754 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [150] total 150 [2018-07-25 08:42:14,754 INFO L451 AbstractCegarLoop]: Interpolant automaton has 151 states [2018-07-25 08:42:14,756 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 151 interpolants. [2018-07-25 08:42:14,756 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11325, Invalid=11325, Unknown=0, NotChecked=0, Total=22650 [2018-07-25 08:42:14,757 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 151 states. [2018-07-25 08:42:15,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:15,105 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-07-25 08:42:15,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2018-07-25 08:42:15,105 INFO L78 Accepts]: Start accepts. Automaton has 151 states. Word has length 151 [2018-07-25 08:42:15,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:15,105 INFO L225 Difference]: With dead ends: 155 [2018-07-25 08:42:15,105 INFO L226 Difference]: Without dead ends: 153 [2018-07-25 08:42:15,106 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11325, Invalid=11325, Unknown=0, NotChecked=0, Total=22650 [2018-07-25 08:42:15,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-07-25 08:42:15,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-07-25 08:42:15,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-07-25 08:42:15,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-07-25 08:42:15,109 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 151 [2018-07-25 08:42:15,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:15,109 INFO L472 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-07-25 08:42:15,109 INFO L473 AbstractCegarLoop]: Interpolant automaton has 151 states. [2018-07-25 08:42:15,110 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-07-25 08:42:15,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-07-25 08:42:15,110 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:15,110 INFO L354 BasicCegarLoop]: trace histogram [149, 1, 1, 1] [2018-07-25 08:42:15,110 INFO L415 AbstractCegarLoop]: === Iteration 150 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:15,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1602749032, now seen corresponding path program 149 times [2018-07-25 08:42:15,111 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:15,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:15,670 INFO L134 CoverageAnalysis]: Checked inductivity of 11175 backedges. 0 proven. 11175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:15,670 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:15,670 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [151] total 151 [2018-07-25 08:42:15,671 INFO L451 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-07-25 08:42:15,672 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-07-25 08:42:15,673 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-07-25 08:42:15,673 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 152 states. [2018-07-25 08:42:16,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:16,055 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2018-07-25 08:42:16,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-07-25 08:42:16,055 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 152 [2018-07-25 08:42:16,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:16,056 INFO L225 Difference]: With dead ends: 156 [2018-07-25 08:42:16,056 INFO L226 Difference]: Without dead ends: 154 [2018-07-25 08:42:16,057 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-07-25 08:42:16,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-07-25 08:42:16,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-07-25 08:42:16,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-07-25 08:42:16,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 154 transitions. [2018-07-25 08:42:16,060 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 154 transitions. Word has length 152 [2018-07-25 08:42:16,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:16,061 INFO L472 AbstractCegarLoop]: Abstraction has 154 states and 154 transitions. [2018-07-25 08:42:16,061 INFO L473 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-07-25 08:42:16,061 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 154 transitions. [2018-07-25 08:42:16,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-07-25 08:42:16,061 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:16,062 INFO L354 BasicCegarLoop]: trace histogram [150, 1, 1, 1] [2018-07-25 08:42:16,062 INFO L415 AbstractCegarLoop]: === Iteration 151 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:16,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1854389535, now seen corresponding path program 150 times [2018-07-25 08:42:16,062 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:16,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:16,624 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:16,624 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:16,624 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [152] total 152 [2018-07-25 08:42:16,624 INFO L451 AbstractCegarLoop]: Interpolant automaton has 153 states [2018-07-25 08:42:16,626 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2018-07-25 08:42:16,627 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11628, Invalid=11628, Unknown=0, NotChecked=0, Total=23256 [2018-07-25 08:42:16,627 INFO L87 Difference]: Start difference. First operand 154 states and 154 transitions. Second operand 153 states. [2018-07-25 08:42:16,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:16,983 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2018-07-25 08:42:16,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-07-25 08:42:16,984 INFO L78 Accepts]: Start accepts. Automaton has 153 states. Word has length 153 [2018-07-25 08:42:16,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:16,984 INFO L225 Difference]: With dead ends: 157 [2018-07-25 08:42:16,984 INFO L226 Difference]: Without dead ends: 155 [2018-07-25 08:42:16,985 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11628, Invalid=11628, Unknown=0, NotChecked=0, Total=23256 [2018-07-25 08:42:16,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-07-25 08:42:16,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-07-25 08:42:16,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-07-25 08:42:16,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-07-25 08:42:16,987 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 153 [2018-07-25 08:42:16,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:16,987 INFO L472 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-07-25 08:42:16,987 INFO L473 AbstractCegarLoop]: Interpolant automaton has 153 states. [2018-07-25 08:42:16,987 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-07-25 08:42:16,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-07-25 08:42:16,988 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:16,988 INFO L354 BasicCegarLoop]: trace histogram [151, 1, 1, 1] [2018-07-25 08:42:16,988 INFO L415 AbstractCegarLoop]: === Iteration 152 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:16,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1651502712, now seen corresponding path program 151 times [2018-07-25 08:42:16,988 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:16,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:17,485 INFO L134 CoverageAnalysis]: Checked inductivity of 11476 backedges. 0 proven. 11476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:17,485 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:17,486 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [153] total 153 [2018-07-25 08:42:17,486 INFO L451 AbstractCegarLoop]: Interpolant automaton has 154 states [2018-07-25 08:42:17,487 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2018-07-25 08:42:17,488 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-07-25 08:42:17,488 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 154 states. [2018-07-25 08:42:17,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:17,849 INFO L93 Difference]: Finished difference Result 158 states and 158 transitions. [2018-07-25 08:42:17,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2018-07-25 08:42:17,849 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 154 [2018-07-25 08:42:17,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:17,850 INFO L225 Difference]: With dead ends: 158 [2018-07-25 08:42:17,850 INFO L226 Difference]: Without dead ends: 156 [2018-07-25 08:42:17,851 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-07-25 08:42:17,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-07-25 08:42:17,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-07-25 08:42:17,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-07-25 08:42:17,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2018-07-25 08:42:17,853 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 154 [2018-07-25 08:42:17,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:17,853 INFO L472 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2018-07-25 08:42:17,853 INFO L473 AbstractCegarLoop]: Interpolant automaton has 154 states. [2018-07-25 08:42:17,853 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2018-07-25 08:42:17,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-07-25 08:42:17,853 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:17,853 INFO L354 BasicCegarLoop]: trace histogram [152, 1, 1, 1] [2018-07-25 08:42:17,853 INFO L415 AbstractCegarLoop]: === Iteration 153 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:17,854 INFO L82 PathProgramCache]: Analyzing trace with hash 343021505, now seen corresponding path program 152 times [2018-07-25 08:42:17,854 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:17,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:18,363 INFO L134 CoverageAnalysis]: Checked inductivity of 11628 backedges. 0 proven. 11628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:18,363 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:18,363 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [154] total 154 [2018-07-25 08:42:18,364 INFO L451 AbstractCegarLoop]: Interpolant automaton has 155 states [2018-07-25 08:42:18,366 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2018-07-25 08:42:18,367 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11935, Invalid=11935, Unknown=0, NotChecked=0, Total=23870 [2018-07-25 08:42:18,367 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 155 states. [2018-07-25 08:42:18,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:18,712 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-07-25 08:42:18,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2018-07-25 08:42:18,713 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 155 [2018-07-25 08:42:18,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:18,713 INFO L225 Difference]: With dead ends: 159 [2018-07-25 08:42:18,713 INFO L226 Difference]: Without dead ends: 157 [2018-07-25 08:42:18,714 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11935, Invalid=11935, Unknown=0, NotChecked=0, Total=23870 [2018-07-25 08:42:18,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-07-25 08:42:18,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-07-25 08:42:18,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-07-25 08:42:18,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-07-25 08:42:18,717 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 155 [2018-07-25 08:42:18,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:18,717 INFO L472 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-07-25 08:42:18,717 INFO L473 AbstractCegarLoop]: Interpolant automaton has 155 states. [2018-07-25 08:42:18,717 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-07-25 08:42:18,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-07-25 08:42:18,718 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:18,718 INFO L354 BasicCegarLoop]: trace histogram [153, 1, 1, 1] [2018-07-25 08:42:18,718 INFO L415 AbstractCegarLoop]: === Iteration 154 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:18,718 INFO L82 PathProgramCache]: Analyzing trace with hash 2043730088, now seen corresponding path program 153 times [2018-07-25 08:42:18,719 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:18,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:19,262 INFO L134 CoverageAnalysis]: Checked inductivity of 11781 backedges. 0 proven. 11781 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:19,262 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:19,262 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [155] total 155 [2018-07-25 08:42:19,263 INFO L451 AbstractCegarLoop]: Interpolant automaton has 156 states [2018-07-25 08:42:19,264 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2018-07-25 08:42:19,265 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-07-25 08:42:19,265 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 156 states. [2018-07-25 08:42:19,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:19,612 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2018-07-25 08:42:19,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-07-25 08:42:19,612 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 156 [2018-07-25 08:42:19,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:19,612 INFO L225 Difference]: With dead ends: 160 [2018-07-25 08:42:19,613 INFO L226 Difference]: Without dead ends: 158 [2018-07-25 08:42:19,614 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-07-25 08:42:19,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-07-25 08:42:19,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-07-25 08:42:19,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-07-25 08:42:19,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2018-07-25 08:42:19,617 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 156 [2018-07-25 08:42:19,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:19,617 INFO L472 AbstractCegarLoop]: Abstraction has 158 states and 158 transitions. [2018-07-25 08:42:19,617 INFO L473 AbstractCegarLoop]: Interpolant automaton has 156 states. [2018-07-25 08:42:19,617 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2018-07-25 08:42:19,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-07-25 08:42:19,617 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:19,617 INFO L354 BasicCegarLoop]: trace histogram [154, 1, 1, 1] [2018-07-25 08:42:19,617 INFO L415 AbstractCegarLoop]: === Iteration 155 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:19,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1068878687, now seen corresponding path program 154 times [2018-07-25 08:42:19,618 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:19,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:20,234 INFO L134 CoverageAnalysis]: Checked inductivity of 11935 backedges. 0 proven. 11935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:20,234 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:20,235 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [156] total 156 [2018-07-25 08:42:20,235 INFO L451 AbstractCegarLoop]: Interpolant automaton has 157 states [2018-07-25 08:42:20,236 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 157 interpolants. [2018-07-25 08:42:20,236 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12246, Invalid=12246, Unknown=0, NotChecked=0, Total=24492 [2018-07-25 08:42:20,236 INFO L87 Difference]: Start difference. First operand 158 states and 158 transitions. Second operand 157 states. [2018-07-25 08:42:20,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:20,586 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-07-25 08:42:20,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2018-07-25 08:42:20,587 INFO L78 Accepts]: Start accepts. Automaton has 157 states. Word has length 157 [2018-07-25 08:42:20,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:20,587 INFO L225 Difference]: With dead ends: 161 [2018-07-25 08:42:20,587 INFO L226 Difference]: Without dead ends: 159 [2018-07-25 08:42:20,588 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=12246, Invalid=12246, Unknown=0, NotChecked=0, Total=24492 [2018-07-25 08:42:20,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-07-25 08:42:20,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-07-25 08:42:20,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-07-25 08:42:20,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2018-07-25 08:42:20,590 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 157 [2018-07-25 08:42:20,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:20,591 INFO L472 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2018-07-25 08:42:20,591 INFO L473 AbstractCegarLoop]: Interpolant automaton has 157 states. [2018-07-25 08:42:20,591 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2018-07-25 08:42:20,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-07-25 08:42:20,591 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:20,591 INFO L354 BasicCegarLoop]: trace histogram [155, 1, 1, 1] [2018-07-25 08:42:20,591 INFO L415 AbstractCegarLoop]: === Iteration 156 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:20,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1224497096, now seen corresponding path program 155 times [2018-07-25 08:42:20,592 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:20,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:21,149 INFO L134 CoverageAnalysis]: Checked inductivity of 12090 backedges. 0 proven. 12090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:21,150 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:21,150 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [157] total 157 [2018-07-25 08:42:21,150 INFO L451 AbstractCegarLoop]: Interpolant automaton has 158 states [2018-07-25 08:42:21,152 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2018-07-25 08:42:21,153 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-07-25 08:42:21,153 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 158 states. [2018-07-25 08:42:21,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:21,389 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2018-07-25 08:42:21,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2018-07-25 08:42:21,389 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 158 [2018-07-25 08:42:21,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:21,390 INFO L225 Difference]: With dead ends: 162 [2018-07-25 08:42:21,390 INFO L226 Difference]: Without dead ends: 160 [2018-07-25 08:42:21,391 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-07-25 08:42:21,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-07-25 08:42:21,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-07-25 08:42:21,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-07-25 08:42:21,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 160 transitions. [2018-07-25 08:42:21,393 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 160 transitions. Word has length 158 [2018-07-25 08:42:21,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:21,393 INFO L472 AbstractCegarLoop]: Abstraction has 160 states and 160 transitions. [2018-07-25 08:42:21,393 INFO L473 AbstractCegarLoop]: Interpolant automaton has 158 states. [2018-07-25 08:42:21,393 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 160 transitions. [2018-07-25 08:42:21,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-07-25 08:42:21,394 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:21,394 INFO L354 BasicCegarLoop]: trace histogram [156, 1, 1, 1] [2018-07-25 08:42:21,394 INFO L415 AbstractCegarLoop]: === Iteration 157 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:21,394 INFO L82 PathProgramCache]: Analyzing trace with hash -695297663, now seen corresponding path program 156 times [2018-07-25 08:42:21,394 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:21,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:21,927 INFO L134 CoverageAnalysis]: Checked inductivity of 12246 backedges. 0 proven. 12246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:21,927 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:21,927 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [158] total 158 [2018-07-25 08:42:21,928 INFO L451 AbstractCegarLoop]: Interpolant automaton has 159 states [2018-07-25 08:42:21,929 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 159 interpolants. [2018-07-25 08:42:21,930 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12561, Invalid=12561, Unknown=0, NotChecked=0, Total=25122 [2018-07-25 08:42:21,930 INFO L87 Difference]: Start difference. First operand 160 states and 160 transitions. Second operand 159 states. [2018-07-25 08:42:22,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:22,058 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-07-25 08:42:22,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2018-07-25 08:42:22,058 INFO L78 Accepts]: Start accepts. Automaton has 159 states. Word has length 159 [2018-07-25 08:42:22,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:22,059 INFO L225 Difference]: With dead ends: 163 [2018-07-25 08:42:22,059 INFO L226 Difference]: Without dead ends: 161 [2018-07-25 08:42:22,060 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=12561, Invalid=12561, Unknown=0, NotChecked=0, Total=25122 [2018-07-25 08:42:22,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-07-25 08:42:22,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-07-25 08:42:22,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-07-25 08:42:22,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-07-25 08:42:22,062 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 159 [2018-07-25 08:42:22,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:22,062 INFO L472 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-07-25 08:42:22,062 INFO L473 AbstractCegarLoop]: Interpolant automaton has 159 states. [2018-07-25 08:42:22,062 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-07-25 08:42:22,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-07-25 08:42:22,062 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:22,063 INFO L354 BasicCegarLoop]: trace histogram [157, 1, 1, 1] [2018-07-25 08:42:22,063 INFO L415 AbstractCegarLoop]: === Iteration 158 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:22,063 INFO L82 PathProgramCache]: Analyzing trace with hash -79393048, now seen corresponding path program 157 times [2018-07-25 08:42:22,063 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:22,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:22,600 INFO L134 CoverageAnalysis]: Checked inductivity of 12403 backedges. 0 proven. 12403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:22,600 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:22,600 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [159] total 159 [2018-07-25 08:42:22,600 INFO L451 AbstractCegarLoop]: Interpolant automaton has 160 states [2018-07-25 08:42:22,602 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2018-07-25 08:42:22,603 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-07-25 08:42:22,603 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 160 states. [2018-07-25 08:42:22,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:22,817 INFO L93 Difference]: Finished difference Result 164 states and 164 transitions. [2018-07-25 08:42:22,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2018-07-25 08:42:22,817 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 160 [2018-07-25 08:42:22,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:22,818 INFO L225 Difference]: With dead ends: 164 [2018-07-25 08:42:22,818 INFO L226 Difference]: Without dead ends: 162 [2018-07-25 08:42:22,819 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-07-25 08:42:22,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-07-25 08:42:22,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-07-25 08:42:22,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-07-25 08:42:22,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2018-07-25 08:42:22,821 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 160 [2018-07-25 08:42:22,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:22,821 INFO L472 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2018-07-25 08:42:22,821 INFO L473 AbstractCegarLoop]: Interpolant automaton has 160 states. [2018-07-25 08:42:22,821 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2018-07-25 08:42:22,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-07-25 08:42:22,821 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:22,821 INFO L354 BasicCegarLoop]: trace histogram [158, 1, 1, 1] [2018-07-25 08:42:22,822 INFO L415 AbstractCegarLoop]: === Iteration 159 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:22,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1833780833, now seen corresponding path program 158 times [2018-07-25 08:42:22,822 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:22,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:23,389 INFO L134 CoverageAnalysis]: Checked inductivity of 12561 backedges. 0 proven. 12561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:23,389 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:23,390 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [160] total 160 [2018-07-25 08:42:23,390 INFO L451 AbstractCegarLoop]: Interpolant automaton has 161 states [2018-07-25 08:42:23,391 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 161 interpolants. [2018-07-25 08:42:23,392 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12880, Invalid=12880, Unknown=0, NotChecked=0, Total=25760 [2018-07-25 08:42:23,392 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 161 states. [2018-07-25 08:42:23,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:23,804 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-07-25 08:42:23,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2018-07-25 08:42:23,805 INFO L78 Accepts]: Start accepts. Automaton has 161 states. Word has length 161 [2018-07-25 08:42:23,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:23,805 INFO L225 Difference]: With dead ends: 165 [2018-07-25 08:42:23,805 INFO L226 Difference]: Without dead ends: 163 [2018-07-25 08:42:23,806 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=12880, Invalid=12880, Unknown=0, NotChecked=0, Total=25760 [2018-07-25 08:42:23,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-07-25 08:42:23,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-07-25 08:42:23,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-07-25 08:42:23,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-07-25 08:42:23,809 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 161 [2018-07-25 08:42:23,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:23,810 INFO L472 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-07-25 08:42:23,810 INFO L473 AbstractCegarLoop]: Interpolant automaton has 161 states. [2018-07-25 08:42:23,810 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-07-25 08:42:23,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-07-25 08:42:23,810 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:23,810 INFO L354 BasicCegarLoop]: trace histogram [159, 1, 1, 1] [2018-07-25 08:42:23,811 INFO L415 AbstractCegarLoop]: === Iteration 160 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:23,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1012629000, now seen corresponding path program 159 times [2018-07-25 08:42:23,811 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:23,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:24,498 INFO L134 CoverageAnalysis]: Checked inductivity of 12720 backedges. 0 proven. 12720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:24,498 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:24,498 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [161] total 161 [2018-07-25 08:42:24,498 INFO L451 AbstractCegarLoop]: Interpolant automaton has 162 states [2018-07-25 08:42:24,500 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2018-07-25 08:42:24,500 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-07-25 08:42:24,500 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 162 states. [2018-07-25 08:42:24,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:24,916 INFO L93 Difference]: Finished difference Result 166 states and 166 transitions. [2018-07-25 08:42:24,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2018-07-25 08:42:24,916 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 162 [2018-07-25 08:42:24,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:24,916 INFO L225 Difference]: With dead ends: 166 [2018-07-25 08:42:24,916 INFO L226 Difference]: Without dead ends: 164 [2018-07-25 08:42:24,917 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-07-25 08:42:24,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-07-25 08:42:24,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2018-07-25 08:42:24,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-07-25 08:42:24,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2018-07-25 08:42:24,920 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 162 [2018-07-25 08:42:24,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:24,920 INFO L472 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2018-07-25 08:42:24,921 INFO L473 AbstractCegarLoop]: Interpolant automaton has 162 states. [2018-07-25 08:42:24,921 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2018-07-25 08:42:24,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-07-25 08:42:24,921 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:24,921 INFO L354 BasicCegarLoop]: trace histogram [160, 1, 1, 1] [2018-07-25 08:42:24,922 INFO L415 AbstractCegarLoop]: === Iteration 161 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:24,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1326725953, now seen corresponding path program 160 times [2018-07-25 08:42:24,922 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:24,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:25,568 INFO L134 CoverageAnalysis]: Checked inductivity of 12880 backedges. 0 proven. 12880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:25,569 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:25,569 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [162] total 162 [2018-07-25 08:42:25,569 INFO L451 AbstractCegarLoop]: Interpolant automaton has 163 states [2018-07-25 08:42:25,571 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 163 interpolants. [2018-07-25 08:42:25,572 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13203, Invalid=13203, Unknown=0, NotChecked=0, Total=26406 [2018-07-25 08:42:25,572 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand 163 states. [2018-07-25 08:42:25,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:25,981 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-07-25 08:42:25,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2018-07-25 08:42:25,982 INFO L78 Accepts]: Start accepts. Automaton has 163 states. Word has length 163 [2018-07-25 08:42:25,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:25,982 INFO L225 Difference]: With dead ends: 167 [2018-07-25 08:42:25,982 INFO L226 Difference]: Without dead ends: 165 [2018-07-25 08:42:25,983 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13203, Invalid=13203, Unknown=0, NotChecked=0, Total=26406 [2018-07-25 08:42:25,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-07-25 08:42:25,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-07-25 08:42:25,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-07-25 08:42:25,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-07-25 08:42:25,985 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 163 [2018-07-25 08:42:25,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:25,986 INFO L472 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-07-25 08:42:25,986 INFO L473 AbstractCegarLoop]: Interpolant automaton has 163 states. [2018-07-25 08:42:25,986 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-07-25 08:42:25,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-07-25 08:42:25,987 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:25,987 INFO L354 BasicCegarLoop]: trace histogram [161, 1, 1, 1] [2018-07-25 08:42:25,987 INFO L415 AbstractCegarLoop]: === Iteration 162 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:25,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1821170392, now seen corresponding path program 161 times [2018-07-25 08:42:25,987 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:26,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:26,614 INFO L134 CoverageAnalysis]: Checked inductivity of 13041 backedges. 0 proven. 13041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:26,614 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:26,614 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [163] total 163 [2018-07-25 08:42:26,615 INFO L451 AbstractCegarLoop]: Interpolant automaton has 164 states [2018-07-25 08:42:26,617 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2018-07-25 08:42:26,618 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-07-25 08:42:26,618 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 164 states. [2018-07-25 08:42:26,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:26,771 INFO L93 Difference]: Finished difference Result 168 states and 168 transitions. [2018-07-25 08:42:26,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2018-07-25 08:42:26,772 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 164 [2018-07-25 08:42:26,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:26,772 INFO L225 Difference]: With dead ends: 168 [2018-07-25 08:42:26,772 INFO L226 Difference]: Without dead ends: 166 [2018-07-25 08:42:26,774 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-07-25 08:42:26,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-07-25 08:42:26,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-07-25 08:42:26,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-07-25 08:42:26,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2018-07-25 08:42:26,777 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 164 [2018-07-25 08:42:26,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:26,777 INFO L472 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2018-07-25 08:42:26,777 INFO L473 AbstractCegarLoop]: Interpolant automaton has 164 states. [2018-07-25 08:42:26,778 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2018-07-25 08:42:26,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-07-25 08:42:26,778 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:26,778 INFO L354 BasicCegarLoop]: trace histogram [162, 1, 1, 1] [2018-07-25 08:42:26,778 INFO L415 AbstractCegarLoop]: === Iteration 163 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:26,779 INFO L82 PathProgramCache]: Analyzing trace with hash -621709279, now seen corresponding path program 162 times [2018-07-25 08:42:26,779 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:26,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:27,404 INFO L134 CoverageAnalysis]: Checked inductivity of 13203 backedges. 0 proven. 13203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:27,404 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:27,404 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [164] total 164 [2018-07-25 08:42:27,405 INFO L451 AbstractCegarLoop]: Interpolant automaton has 165 states [2018-07-25 08:42:27,406 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 165 interpolants. [2018-07-25 08:42:27,407 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13530, Invalid=13530, Unknown=0, NotChecked=0, Total=27060 [2018-07-25 08:42:27,407 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 165 states. [2018-07-25 08:42:27,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:27,715 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2018-07-25 08:42:27,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2018-07-25 08:42:27,715 INFO L78 Accepts]: Start accepts. Automaton has 165 states. Word has length 165 [2018-07-25 08:42:27,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:27,715 INFO L225 Difference]: With dead ends: 169 [2018-07-25 08:42:27,715 INFO L226 Difference]: Without dead ends: 167 [2018-07-25 08:42:27,717 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13530, Invalid=13530, Unknown=0, NotChecked=0, Total=27060 [2018-07-25 08:42:27,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-07-25 08:42:27,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-07-25 08:42:27,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-07-25 08:42:27,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2018-07-25 08:42:27,719 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 165 [2018-07-25 08:42:27,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:27,719 INFO L472 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2018-07-25 08:42:27,719 INFO L473 AbstractCegarLoop]: Interpolant automaton has 165 states. [2018-07-25 08:42:27,719 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2018-07-25 08:42:27,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-07-25 08:42:27,720 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:27,720 INFO L354 BasicCegarLoop]: trace histogram [163, 1, 1, 1] [2018-07-25 08:42:27,720 INFO L415 AbstractCegarLoop]: === Iteration 164 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:27,720 INFO L82 PathProgramCache]: Analyzing trace with hash -2093120440, now seen corresponding path program 163 times [2018-07-25 08:42:27,720 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:27,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:28,354 INFO L134 CoverageAnalysis]: Checked inductivity of 13366 backedges. 0 proven. 13366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:28,354 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:28,354 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [165] total 165 [2018-07-25 08:42:28,354 INFO L451 AbstractCegarLoop]: Interpolant automaton has 166 states [2018-07-25 08:42:28,356 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2018-07-25 08:42:28,357 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-07-25 08:42:28,357 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 166 states. [2018-07-25 08:42:28,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:28,856 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2018-07-25 08:42:28,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2018-07-25 08:42:28,856 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 166 [2018-07-25 08:42:28,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:28,856 INFO L225 Difference]: With dead ends: 170 [2018-07-25 08:42:28,856 INFO L226 Difference]: Without dead ends: 168 [2018-07-25 08:42:28,858 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-07-25 08:42:28,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-07-25 08:42:28,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-07-25 08:42:28,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-07-25 08:42:28,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 168 transitions. [2018-07-25 08:42:28,896 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 168 transitions. Word has length 166 [2018-07-25 08:42:28,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:28,896 INFO L472 AbstractCegarLoop]: Abstraction has 168 states and 168 transitions. [2018-07-25 08:42:28,896 INFO L473 AbstractCegarLoop]: Interpolant automaton has 166 states. [2018-07-25 08:42:28,896 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 168 transitions. [2018-07-25 08:42:28,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-07-25 08:42:28,897 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:28,897 INFO L354 BasicCegarLoop]: trace histogram [164, 1, 1, 1] [2018-07-25 08:42:28,897 INFO L415 AbstractCegarLoop]: === Iteration 165 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:28,897 INFO L82 PathProgramCache]: Analyzing trace with hash -462226175, now seen corresponding path program 164 times [2018-07-25 08:42:28,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:28,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:29,471 INFO L134 CoverageAnalysis]: Checked inductivity of 13530 backedges. 0 proven. 13530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:29,471 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:29,471 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [166] total 166 [2018-07-25 08:42:29,471 INFO L451 AbstractCegarLoop]: Interpolant automaton has 167 states [2018-07-25 08:42:29,474 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 167 interpolants. [2018-07-25 08:42:29,475 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13861, Invalid=13861, Unknown=0, NotChecked=0, Total=27722 [2018-07-25 08:42:29,475 INFO L87 Difference]: Start difference. First operand 168 states and 168 transitions. Second operand 167 states. [2018-07-25 08:42:29,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:29,853 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-07-25 08:42:29,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2018-07-25 08:42:29,853 INFO L78 Accepts]: Start accepts. Automaton has 167 states. Word has length 167 [2018-07-25 08:42:29,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:29,854 INFO L225 Difference]: With dead ends: 171 [2018-07-25 08:42:29,854 INFO L226 Difference]: Without dead ends: 169 [2018-07-25 08:42:29,856 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13861, Invalid=13861, Unknown=0, NotChecked=0, Total=27722 [2018-07-25 08:42:29,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-07-25 08:42:29,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-07-25 08:42:29,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-07-25 08:42:29,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2018-07-25 08:42:29,859 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 167 [2018-07-25 08:42:29,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:29,859 INFO L472 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2018-07-25 08:42:29,859 INFO L473 AbstractCegarLoop]: Interpolant automaton has 167 states. [2018-07-25 08:42:29,859 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2018-07-25 08:42:29,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-07-25 08:42:29,860 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:29,860 INFO L354 BasicCegarLoop]: trace histogram [165, 1, 1, 1] [2018-07-25 08:42:29,860 INFO L415 AbstractCegarLoop]: === Iteration 166 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:29,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1444111512, now seen corresponding path program 165 times [2018-07-25 08:42:29,861 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:29,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:30,558 INFO L134 CoverageAnalysis]: Checked inductivity of 13695 backedges. 0 proven. 13695 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:30,559 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:30,559 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [167] total 167 [2018-07-25 08:42:30,559 INFO L451 AbstractCegarLoop]: Interpolant automaton has 168 states [2018-07-25 08:42:30,561 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2018-07-25 08:42:30,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-07-25 08:42:30,562 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 168 states. [2018-07-25 08:42:30,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:30,748 INFO L93 Difference]: Finished difference Result 172 states and 172 transitions. [2018-07-25 08:42:30,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2018-07-25 08:42:30,748 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 168 [2018-07-25 08:42:30,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:30,749 INFO L225 Difference]: With dead ends: 172 [2018-07-25 08:42:30,749 INFO L226 Difference]: Without dead ends: 170 [2018-07-25 08:42:30,750 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-07-25 08:42:30,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-07-25 08:42:30,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2018-07-25 08:42:30,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-07-25 08:42:30,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 170 transitions. [2018-07-25 08:42:30,752 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 170 transitions. Word has length 168 [2018-07-25 08:42:30,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:30,752 INFO L472 AbstractCegarLoop]: Abstraction has 170 states and 170 transitions. [2018-07-25 08:42:30,752 INFO L473 AbstractCegarLoop]: Interpolant automaton has 168 states. [2018-07-25 08:42:30,753 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 170 transitions. [2018-07-25 08:42:30,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-07-25 08:42:30,753 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:30,753 INFO L354 BasicCegarLoop]: trace histogram [166, 1, 1, 1] [2018-07-25 08:42:30,753 INFO L415 AbstractCegarLoop]: === Iteration 167 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:30,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1817785887, now seen corresponding path program 166 times [2018-07-25 08:42:30,754 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:30,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:31,461 INFO L134 CoverageAnalysis]: Checked inductivity of 13861 backedges. 0 proven. 13861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:31,462 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:31,462 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [168] total 168 [2018-07-25 08:42:31,462 INFO L451 AbstractCegarLoop]: Interpolant automaton has 169 states [2018-07-25 08:42:31,464 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 169 interpolants. [2018-07-25 08:42:31,465 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14196, Invalid=14196, Unknown=0, NotChecked=0, Total=28392 [2018-07-25 08:42:31,465 INFO L87 Difference]: Start difference. First operand 170 states and 170 transitions. Second operand 169 states. [2018-07-25 08:42:31,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:31,990 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2018-07-25 08:42:31,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2018-07-25 08:42:31,990 INFO L78 Accepts]: Start accepts. Automaton has 169 states. Word has length 169 [2018-07-25 08:42:31,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:31,991 INFO L225 Difference]: With dead ends: 173 [2018-07-25 08:42:31,991 INFO L226 Difference]: Without dead ends: 171 [2018-07-25 08:42:31,992 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=14196, Invalid=14196, Unknown=0, NotChecked=0, Total=28392 [2018-07-25 08:42:31,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-07-25 08:42:31,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-07-25 08:42:31,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-07-25 08:42:31,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-07-25 08:42:31,994 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 169 [2018-07-25 08:42:31,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:31,994 INFO L472 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-07-25 08:42:31,994 INFO L473 AbstractCegarLoop]: Interpolant automaton has 169 states. [2018-07-25 08:42:31,994 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-07-25 08:42:31,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-07-25 08:42:31,995 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:31,995 INFO L354 BasicCegarLoop]: trace histogram [167, 1, 1, 1] [2018-07-25 08:42:31,995 INFO L415 AbstractCegarLoop]: === Iteration 168 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:31,995 INFO L82 PathProgramCache]: Analyzing trace with hash -516789624, now seen corresponding path program 167 times [2018-07-25 08:42:31,995 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:32,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:32,676 INFO L134 CoverageAnalysis]: Checked inductivity of 14028 backedges. 0 proven. 14028 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:32,676 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:32,676 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [169] total 169 [2018-07-25 08:42:32,676 INFO L451 AbstractCegarLoop]: Interpolant automaton has 170 states [2018-07-25 08:42:32,678 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2018-07-25 08:42:32,679 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-07-25 08:42:32,679 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 170 states. [2018-07-25 08:42:33,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:33,094 INFO L93 Difference]: Finished difference Result 174 states and 174 transitions. [2018-07-25 08:42:33,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2018-07-25 08:42:33,094 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 170 [2018-07-25 08:42:33,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:33,095 INFO L225 Difference]: With dead ends: 174 [2018-07-25 08:42:33,095 INFO L226 Difference]: Without dead ends: 172 [2018-07-25 08:42:33,096 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-07-25 08:42:33,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-07-25 08:42:33,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2018-07-25 08:42:33,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-07-25 08:42:33,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2018-07-25 08:42:33,098 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 170 [2018-07-25 08:42:33,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:33,098 INFO L472 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2018-07-25 08:42:33,098 INFO L473 AbstractCegarLoop]: Interpolant automaton has 170 states. [2018-07-25 08:42:33,098 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2018-07-25 08:42:33,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-07-25 08:42:33,099 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:33,099 INFO L354 BasicCegarLoop]: trace histogram [168, 1, 1, 1] [2018-07-25 08:42:33,099 INFO L415 AbstractCegarLoop]: === Iteration 169 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:33,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1159388865, now seen corresponding path program 168 times [2018-07-25 08:42:33,099 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:33,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:33,750 INFO L134 CoverageAnalysis]: Checked inductivity of 14196 backedges. 0 proven. 14196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:33,750 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:33,750 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [170] total 170 [2018-07-25 08:42:33,750 INFO L451 AbstractCegarLoop]: Interpolant automaton has 171 states [2018-07-25 08:42:33,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 171 interpolants. [2018-07-25 08:42:33,752 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14535, Invalid=14535, Unknown=0, NotChecked=0, Total=29070 [2018-07-25 08:42:33,752 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 171 states. [2018-07-25 08:42:33,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:33,998 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-07-25 08:42:33,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2018-07-25 08:42:33,998 INFO L78 Accepts]: Start accepts. Automaton has 171 states. Word has length 171 [2018-07-25 08:42:33,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:33,999 INFO L225 Difference]: With dead ends: 175 [2018-07-25 08:42:33,999 INFO L226 Difference]: Without dead ends: 173 [2018-07-25 08:42:34,000 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=14535, Invalid=14535, Unknown=0, NotChecked=0, Total=29070 [2018-07-25 08:42:34,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-07-25 08:42:34,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-07-25 08:42:34,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-07-25 08:42:34,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-07-25 08:42:34,002 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 171 [2018-07-25 08:42:34,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:34,002 INFO L472 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-07-25 08:42:34,002 INFO L473 AbstractCegarLoop]: Interpolant automaton has 171 states. [2018-07-25 08:42:34,002 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-07-25 08:42:34,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-07-25 08:42:34,003 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:34,003 INFO L354 BasicCegarLoop]: trace histogram [169, 1, 1, 1] [2018-07-25 08:42:34,003 INFO L415 AbstractCegarLoop]: === Iteration 170 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:34,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1581314472, now seen corresponding path program 169 times [2018-07-25 08:42:34,003 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:34,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:34,632 INFO L134 CoverageAnalysis]: Checked inductivity of 14365 backedges. 0 proven. 14365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:34,632 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:34,632 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [171] total 171 [2018-07-25 08:42:34,632 INFO L451 AbstractCegarLoop]: Interpolant automaton has 172 states [2018-07-25 08:42:34,634 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2018-07-25 08:42:34,635 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-07-25 08:42:34,635 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 172 states. [2018-07-25 08:42:35,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:35,198 INFO L93 Difference]: Finished difference Result 176 states and 176 transitions. [2018-07-25 08:42:35,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2018-07-25 08:42:35,198 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 172 [2018-07-25 08:42:35,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:35,198 INFO L225 Difference]: With dead ends: 176 [2018-07-25 08:42:35,198 INFO L226 Difference]: Without dead ends: 174 [2018-07-25 08:42:35,199 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-07-25 08:42:35,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-07-25 08:42:35,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2018-07-25 08:42:35,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-07-25 08:42:35,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 174 transitions. [2018-07-25 08:42:35,201 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 174 transitions. Word has length 172 [2018-07-25 08:42:35,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:35,202 INFO L472 AbstractCegarLoop]: Abstraction has 174 states and 174 transitions. [2018-07-25 08:42:35,202 INFO L473 AbstractCegarLoop]: Interpolant automaton has 172 states. [2018-07-25 08:42:35,202 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 174 transitions. [2018-07-25 08:42:35,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-07-25 08:42:35,202 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:35,202 INFO L354 BasicCegarLoop]: trace histogram [170, 1, 1, 1] [2018-07-25 08:42:35,202 INFO L415 AbstractCegarLoop]: === Iteration 171 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:35,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1776106401, now seen corresponding path program 170 times [2018-07-25 08:42:35,203 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:35,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:35,829 INFO L134 CoverageAnalysis]: Checked inductivity of 14535 backedges. 0 proven. 14535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:35,829 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:35,829 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [172] total 172 [2018-07-25 08:42:35,829 INFO L451 AbstractCegarLoop]: Interpolant automaton has 173 states [2018-07-25 08:42:35,832 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 173 interpolants. [2018-07-25 08:42:35,834 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14878, Invalid=14878, Unknown=0, NotChecked=0, Total=29756 [2018-07-25 08:42:35,834 INFO L87 Difference]: Start difference. First operand 174 states and 174 transitions. Second operand 173 states. [2018-07-25 08:42:36,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:36,044 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2018-07-25 08:42:36,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2018-07-25 08:42:36,045 INFO L78 Accepts]: Start accepts. Automaton has 173 states. Word has length 173 [2018-07-25 08:42:36,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:36,045 INFO L225 Difference]: With dead ends: 177 [2018-07-25 08:42:36,045 INFO L226 Difference]: Without dead ends: 175 [2018-07-25 08:42:36,047 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=14878, Invalid=14878, Unknown=0, NotChecked=0, Total=29756 [2018-07-25 08:42:36,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-07-25 08:42:36,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-07-25 08:42:36,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-07-25 08:42:36,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2018-07-25 08:42:36,051 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 173 [2018-07-25 08:42:36,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:36,051 INFO L472 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2018-07-25 08:42:36,051 INFO L473 AbstractCegarLoop]: Interpolant automaton has 173 states. [2018-07-25 08:42:36,051 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2018-07-25 08:42:36,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-07-25 08:42:36,052 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:36,052 INFO L354 BasicCegarLoop]: trace histogram [171, 1, 1, 1] [2018-07-25 08:42:36,052 INFO L415 AbstractCegarLoop]: === Iteration 172 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:36,052 INFO L82 PathProgramCache]: Analyzing trace with hash -775278392, now seen corresponding path program 171 times [2018-07-25 08:42:36,052 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:36,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:36,722 INFO L134 CoverageAnalysis]: Checked inductivity of 14706 backedges. 0 proven. 14706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:36,722 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:36,722 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [173] total 173 [2018-07-25 08:42:36,723 INFO L451 AbstractCegarLoop]: Interpolant automaton has 174 states [2018-07-25 08:42:36,725 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2018-07-25 08:42:36,726 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-07-25 08:42:36,726 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 174 states. [2018-07-25 08:42:37,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:37,309 INFO L93 Difference]: Finished difference Result 178 states and 178 transitions. [2018-07-25 08:42:37,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2018-07-25 08:42:37,309 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 174 [2018-07-25 08:42:37,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:37,310 INFO L225 Difference]: With dead ends: 178 [2018-07-25 08:42:37,310 INFO L226 Difference]: Without dead ends: 176 [2018-07-25 08:42:37,312 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-07-25 08:42:37,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-07-25 08:42:37,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2018-07-25 08:42:37,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-07-25 08:42:37,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2018-07-25 08:42:37,314 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 174 [2018-07-25 08:42:37,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:37,315 INFO L472 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2018-07-25 08:42:37,315 INFO L473 AbstractCegarLoop]: Interpolant automaton has 174 states. [2018-07-25 08:42:37,315 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2018-07-25 08:42:37,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-07-25 08:42:37,315 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:37,315 INFO L354 BasicCegarLoop]: trace histogram [172, 1, 1, 1] [2018-07-25 08:42:37,315 INFO L415 AbstractCegarLoop]: === Iteration 173 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:37,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1736171649, now seen corresponding path program 172 times [2018-07-25 08:42:37,316 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:37,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:37,995 INFO L134 CoverageAnalysis]: Checked inductivity of 14878 backedges. 0 proven. 14878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:37,996 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:37,996 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [174] total 174 [2018-07-25 08:42:37,996 INFO L451 AbstractCegarLoop]: Interpolant automaton has 175 states [2018-07-25 08:42:37,997 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 175 interpolants. [2018-07-25 08:42:37,998 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15225, Invalid=15225, Unknown=0, NotChecked=0, Total=30450 [2018-07-25 08:42:37,998 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 175 states. [2018-07-25 08:42:38,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:38,358 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-07-25 08:42:38,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2018-07-25 08:42:38,358 INFO L78 Accepts]: Start accepts. Automaton has 175 states. Word has length 175 [2018-07-25 08:42:38,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:38,358 INFO L225 Difference]: With dead ends: 179 [2018-07-25 08:42:38,358 INFO L226 Difference]: Without dead ends: 177 [2018-07-25 08:42:38,360 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15225, Invalid=15225, Unknown=0, NotChecked=0, Total=30450 [2018-07-25 08:42:38,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-07-25 08:42:38,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-07-25 08:42:38,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-07-25 08:42:38,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-07-25 08:42:38,363 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 175 [2018-07-25 08:42:38,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:38,363 INFO L472 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-07-25 08:42:38,363 INFO L473 AbstractCegarLoop]: Interpolant automaton has 175 states. [2018-07-25 08:42:38,363 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-07-25 08:42:38,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-07-25 08:42:38,364 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:38,364 INFO L354 BasicCegarLoop]: trace histogram [173, 1, 1, 1] [2018-07-25 08:42:38,364 INFO L415 AbstractCegarLoop]: === Iteration 174 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:38,364 INFO L82 PathProgramCache]: Analyzing trace with hash -2013255704, now seen corresponding path program 173 times [2018-07-25 08:42:38,364 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:38,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:39,064 INFO L134 CoverageAnalysis]: Checked inductivity of 15051 backedges. 0 proven. 15051 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:39,065 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:39,065 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [175] total 175 [2018-07-25 08:42:39,065 INFO L451 AbstractCegarLoop]: Interpolant automaton has 176 states [2018-07-25 08:42:39,067 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2018-07-25 08:42:39,068 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-07-25 08:42:39,068 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 176 states. [2018-07-25 08:42:39,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:39,674 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2018-07-25 08:42:39,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2018-07-25 08:42:39,674 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 176 [2018-07-25 08:42:39,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:39,675 INFO L225 Difference]: With dead ends: 180 [2018-07-25 08:42:39,675 INFO L226 Difference]: Without dead ends: 178 [2018-07-25 08:42:39,677 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-07-25 08:42:39,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-07-25 08:42:39,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2018-07-25 08:42:39,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-07-25 08:42:39,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2018-07-25 08:42:39,679 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 176 [2018-07-25 08:42:39,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:39,680 INFO L472 AbstractCegarLoop]: Abstraction has 178 states and 178 transitions. [2018-07-25 08:42:39,680 INFO L473 AbstractCegarLoop]: Interpolant automaton has 176 states. [2018-07-25 08:42:39,680 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2018-07-25 08:42:39,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-07-25 08:42:39,680 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:39,680 INFO L354 BasicCegarLoop]: trace histogram [174, 1, 1, 1] [2018-07-25 08:42:39,681 INFO L415 AbstractCegarLoop]: === Iteration 175 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:39,681 INFO L82 PathProgramCache]: Analyzing trace with hash 2013580641, now seen corresponding path program 174 times [2018-07-25 08:42:39,681 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:39,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:40,465 INFO L134 CoverageAnalysis]: Checked inductivity of 15225 backedges. 0 proven. 15225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:40,466 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:40,466 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [176] total 176 [2018-07-25 08:42:40,466 INFO L451 AbstractCegarLoop]: Interpolant automaton has 177 states [2018-07-25 08:42:40,468 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 177 interpolants. [2018-07-25 08:42:40,469 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15576, Invalid=15576, Unknown=0, NotChecked=0, Total=31152 [2018-07-25 08:42:40,470 INFO L87 Difference]: Start difference. First operand 178 states and 178 transitions. Second operand 177 states. [2018-07-25 08:42:41,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:41,075 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2018-07-25 08:42:41,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2018-07-25 08:42:41,075 INFO L78 Accepts]: Start accepts. Automaton has 177 states. Word has length 177 [2018-07-25 08:42:41,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:41,075 INFO L225 Difference]: With dead ends: 181 [2018-07-25 08:42:41,075 INFO L226 Difference]: Without dead ends: 179 [2018-07-25 08:42:41,077 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=15576, Invalid=15576, Unknown=0, NotChecked=0, Total=31152 [2018-07-25 08:42:41,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-07-25 08:42:41,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-07-25 08:42:41,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-07-25 08:42:41,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2018-07-25 08:42:41,080 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 177 [2018-07-25 08:42:41,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:41,080 INFO L472 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2018-07-25 08:42:41,080 INFO L473 AbstractCegarLoop]: Interpolant automaton has 177 states. [2018-07-25 08:42:41,080 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2018-07-25 08:42:41,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-07-25 08:42:41,080 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:41,080 INFO L354 BasicCegarLoop]: trace histogram [175, 1, 1, 1] [2018-07-25 08:42:41,081 INFO L415 AbstractCegarLoop]: === Iteration 176 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:41,081 INFO L82 PathProgramCache]: Analyzing trace with hash -2003511544, now seen corresponding path program 175 times [2018-07-25 08:42:41,081 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:41,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:41,865 INFO L134 CoverageAnalysis]: Checked inductivity of 15400 backedges. 0 proven. 15400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:41,865 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:41,865 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [177] total 177 [2018-07-25 08:42:41,866 INFO L451 AbstractCegarLoop]: Interpolant automaton has 178 states [2018-07-25 08:42:41,868 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2018-07-25 08:42:41,870 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-07-25 08:42:41,870 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 178 states. [2018-07-25 08:42:42,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:42,509 INFO L93 Difference]: Finished difference Result 182 states and 182 transitions. [2018-07-25 08:42:42,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2018-07-25 08:42:42,509 INFO L78 Accepts]: Start accepts. Automaton has 178 states. Word has length 178 [2018-07-25 08:42:42,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:42,510 INFO L225 Difference]: With dead ends: 182 [2018-07-25 08:42:42,510 INFO L226 Difference]: Without dead ends: 180 [2018-07-25 08:42:42,511 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-07-25 08:42:42,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-07-25 08:42:42,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2018-07-25 08:42:42,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-07-25 08:42:42,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 180 transitions. [2018-07-25 08:42:42,514 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 180 transitions. Word has length 178 [2018-07-25 08:42:42,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:42,514 INFO L472 AbstractCegarLoop]: Abstraction has 180 states and 180 transitions. [2018-07-25 08:42:42,514 INFO L473 AbstractCegarLoop]: Interpolant automaton has 178 states. [2018-07-25 08:42:42,514 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 180 transitions. [2018-07-25 08:42:42,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-07-25 08:42:42,515 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:42,515 INFO L354 BasicCegarLoop]: trace histogram [176, 1, 1, 1] [2018-07-25 08:42:42,515 INFO L415 AbstractCegarLoop]: === Iteration 177 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:42,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1979317695, now seen corresponding path program 176 times [2018-07-25 08:42:42,515 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:42,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:43,317 INFO L134 CoverageAnalysis]: Checked inductivity of 15576 backedges. 0 proven. 15576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:43,318 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:43,318 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [178] total 178 [2018-07-25 08:42:43,318 INFO L451 AbstractCegarLoop]: Interpolant automaton has 179 states [2018-07-25 08:42:43,320 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 179 interpolants. [2018-07-25 08:42:43,321 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15931, Invalid=15931, Unknown=0, NotChecked=0, Total=31862 [2018-07-25 08:42:43,321 INFO L87 Difference]: Start difference. First operand 180 states and 180 transitions. Second operand 179 states. [2018-07-25 08:42:43,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:43,852 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-07-25 08:42:43,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2018-07-25 08:42:43,852 INFO L78 Accepts]: Start accepts. Automaton has 179 states. Word has length 179 [2018-07-25 08:42:43,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:43,853 INFO L225 Difference]: With dead ends: 183 [2018-07-25 08:42:43,853 INFO L226 Difference]: Without dead ends: 181 [2018-07-25 08:42:43,854 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=15931, Invalid=15931, Unknown=0, NotChecked=0, Total=31862 [2018-07-25 08:42:43,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-07-25 08:42:43,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-07-25 08:42:43,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-07-25 08:42:43,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-07-25 08:42:43,856 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 179 [2018-07-25 08:42:43,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:43,857 INFO L472 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-07-25 08:42:43,857 INFO L473 AbstractCegarLoop]: Interpolant automaton has 179 states. [2018-07-25 08:42:43,857 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-07-25 08:42:43,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-07-25 08:42:43,857 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:43,857 INFO L354 BasicCegarLoop]: trace histogram [177, 1, 1, 1] [2018-07-25 08:42:43,858 INFO L415 AbstractCegarLoop]: === Iteration 178 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:43,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1229308376, now seen corresponding path program 177 times [2018-07-25 08:42:43,858 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:43,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:44,633 INFO L134 CoverageAnalysis]: Checked inductivity of 15753 backedges. 0 proven. 15753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:44,633 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:44,633 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [179] total 179 [2018-07-25 08:42:44,634 INFO L451 AbstractCegarLoop]: Interpolant automaton has 180 states [2018-07-25 08:42:44,636 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 180 interpolants. [2018-07-25 08:42:44,637 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-07-25 08:42:44,637 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 180 states. [2018-07-25 08:42:45,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:45,393 INFO L93 Difference]: Finished difference Result 184 states and 184 transitions. [2018-07-25 08:42:45,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2018-07-25 08:42:45,393 INFO L78 Accepts]: Start accepts. Automaton has 180 states. Word has length 180 [2018-07-25 08:42:45,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:45,394 INFO L225 Difference]: With dead ends: 184 [2018-07-25 08:42:45,394 INFO L226 Difference]: Without dead ends: 182 [2018-07-25 08:42:45,395 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-07-25 08:42:45,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-07-25 08:42:45,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-07-25 08:42:45,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-07-25 08:42:45,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2018-07-25 08:42:45,397 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 180 [2018-07-25 08:42:45,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:45,398 INFO L472 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2018-07-25 08:42:45,398 INFO L473 AbstractCegarLoop]: Interpolant automaton has 180 states. [2018-07-25 08:42:45,398 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2018-07-25 08:42:45,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-07-25 08:42:45,398 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:45,398 INFO L354 BasicCegarLoop]: trace histogram [178, 1, 1, 1] [2018-07-25 08:42:45,399 INFO L415 AbstractCegarLoop]: === Iteration 179 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:45,399 INFO L82 PathProgramCache]: Analyzing trace with hash 546144033, now seen corresponding path program 178 times [2018-07-25 08:42:45,399 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:45,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:46,134 INFO L134 CoverageAnalysis]: Checked inductivity of 15931 backedges. 0 proven. 15931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:46,134 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:46,135 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [180] total 180 [2018-07-25 08:42:46,135 INFO L451 AbstractCegarLoop]: Interpolant automaton has 181 states [2018-07-25 08:42:46,137 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 181 interpolants. [2018-07-25 08:42:46,138 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16290, Invalid=16290, Unknown=0, NotChecked=0, Total=32580 [2018-07-25 08:42:46,138 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 181 states. [2018-07-25 08:42:46,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:46,409 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2018-07-25 08:42:46,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2018-07-25 08:42:46,409 INFO L78 Accepts]: Start accepts. Automaton has 181 states. Word has length 181 [2018-07-25 08:42:46,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:46,409 INFO L225 Difference]: With dead ends: 185 [2018-07-25 08:42:46,410 INFO L226 Difference]: Without dead ends: 183 [2018-07-25 08:42:46,411 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=16290, Invalid=16290, Unknown=0, NotChecked=0, Total=32580 [2018-07-25 08:42:46,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-07-25 08:42:46,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-07-25 08:42:46,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-07-25 08:42:46,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-07-25 08:42:46,413 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 181 [2018-07-25 08:42:46,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:46,413 INFO L472 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-07-25 08:42:46,413 INFO L473 AbstractCegarLoop]: Interpolant automaton has 181 states. [2018-07-25 08:42:46,414 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-07-25 08:42:46,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-07-25 08:42:46,414 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:46,414 INFO L354 BasicCegarLoop]: trace histogram [179, 1, 1, 1] [2018-07-25 08:42:46,414 INFO L415 AbstractCegarLoop]: === Iteration 180 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:46,415 INFO L82 PathProgramCache]: Analyzing trace with hash -249406136, now seen corresponding path program 179 times [2018-07-25 08:42:46,415 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:46,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:47,207 INFO L134 CoverageAnalysis]: Checked inductivity of 16110 backedges. 0 proven. 16110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:47,208 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:47,208 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [181] total 181 [2018-07-25 08:42:47,208 INFO L451 AbstractCegarLoop]: Interpolant automaton has 182 states [2018-07-25 08:42:47,210 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 182 interpolants. [2018-07-25 08:42:47,212 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-07-25 08:42:47,212 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 182 states. [2018-07-25 08:42:48,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:48,139 INFO L93 Difference]: Finished difference Result 186 states and 186 transitions. [2018-07-25 08:42:48,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2018-07-25 08:42:48,140 INFO L78 Accepts]: Start accepts. Automaton has 182 states. Word has length 182 [2018-07-25 08:42:48,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:48,140 INFO L225 Difference]: With dead ends: 186 [2018-07-25 08:42:48,140 INFO L226 Difference]: Without dead ends: 184 [2018-07-25 08:42:48,142 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-07-25 08:42:48,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-07-25 08:42:48,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2018-07-25 08:42:48,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-07-25 08:42:48,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 184 transitions. [2018-07-25 08:42:48,144 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 184 transitions. Word has length 182 [2018-07-25 08:42:48,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:48,144 INFO L472 AbstractCegarLoop]: Abstraction has 184 states and 184 transitions. [2018-07-25 08:42:48,144 INFO L473 AbstractCegarLoop]: Interpolant automaton has 182 states. [2018-07-25 08:42:48,144 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 184 transitions. [2018-07-25 08:42:48,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-07-25 08:42:48,144 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:48,145 INFO L354 BasicCegarLoop]: trace histogram [180, 1, 1, 1] [2018-07-25 08:42:48,145 INFO L415 AbstractCegarLoop]: === Iteration 181 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:48,145 INFO L82 PathProgramCache]: Analyzing trace with hash 858342401, now seen corresponding path program 180 times [2018-07-25 08:42:48,145 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:48,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:48,866 INFO L134 CoverageAnalysis]: Checked inductivity of 16290 backedges. 0 proven. 16290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:48,866 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:48,866 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [182] total 182 [2018-07-25 08:42:48,867 INFO L451 AbstractCegarLoop]: Interpolant automaton has 183 states [2018-07-25 08:42:48,869 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 183 interpolants. [2018-07-25 08:42:48,869 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16653, Invalid=16653, Unknown=0, NotChecked=0, Total=33306 [2018-07-25 08:42:48,870 INFO L87 Difference]: Start difference. First operand 184 states and 184 transitions. Second operand 183 states. [2018-07-25 08:42:49,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:49,116 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2018-07-25 08:42:49,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2018-07-25 08:42:49,116 INFO L78 Accepts]: Start accepts. Automaton has 183 states. Word has length 183 [2018-07-25 08:42:49,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:49,117 INFO L225 Difference]: With dead ends: 187 [2018-07-25 08:42:49,117 INFO L226 Difference]: Without dead ends: 185 [2018-07-25 08:42:49,119 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=16653, Invalid=16653, Unknown=0, NotChecked=0, Total=33306 [2018-07-25 08:42:49,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-07-25 08:42:49,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-07-25 08:42:49,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-07-25 08:42:49,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-07-25 08:42:49,122 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 183 [2018-07-25 08:42:49,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:49,122 INFO L472 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-07-25 08:42:49,123 INFO L473 AbstractCegarLoop]: Interpolant automaton has 183 states. [2018-07-25 08:42:49,123 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-07-25 08:42:49,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-07-25 08:42:49,123 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:49,123 INFO L354 BasicCegarLoop]: trace histogram [181, 1, 1, 1] [2018-07-25 08:42:49,124 INFO L415 AbstractCegarLoop]: === Iteration 182 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:49,124 INFO L82 PathProgramCache]: Analyzing trace with hash 838808680, now seen corresponding path program 181 times [2018-07-25 08:42:49,124 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:49,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:49,877 INFO L134 CoverageAnalysis]: Checked inductivity of 16471 backedges. 0 proven. 16471 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:49,877 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:49,877 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [183] total 183 [2018-07-25 08:42:49,877 INFO L451 AbstractCegarLoop]: Interpolant automaton has 184 states [2018-07-25 08:42:49,880 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 184 interpolants. [2018-07-25 08:42:49,881 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-07-25 08:42:49,881 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 184 states. [2018-07-25 08:42:50,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:50,487 INFO L93 Difference]: Finished difference Result 188 states and 188 transitions. [2018-07-25 08:42:50,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2018-07-25 08:42:50,487 INFO L78 Accepts]: Start accepts. Automaton has 184 states. Word has length 184 [2018-07-25 08:42:50,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:50,488 INFO L225 Difference]: With dead ends: 188 [2018-07-25 08:42:50,488 INFO L226 Difference]: Without dead ends: 186 [2018-07-25 08:42:50,489 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-07-25 08:42:50,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-07-25 08:42:50,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2018-07-25 08:42:50,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-07-25 08:42:50,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2018-07-25 08:42:50,491 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 184 [2018-07-25 08:42:50,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:50,491 INFO L472 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2018-07-25 08:42:50,491 INFO L473 AbstractCegarLoop]: Interpolant automaton has 184 states. [2018-07-25 08:42:50,492 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2018-07-25 08:42:50,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-07-25 08:42:50,492 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:50,492 INFO L354 BasicCegarLoop]: trace histogram [182, 1, 1, 1] [2018-07-25 08:42:50,492 INFO L415 AbstractCegarLoop]: === Iteration 183 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:50,492 INFO L82 PathProgramCache]: Analyzing trace with hash 233263329, now seen corresponding path program 182 times [2018-07-25 08:42:50,492 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:50,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:51,224 INFO L134 CoverageAnalysis]: Checked inductivity of 16653 backedges. 0 proven. 16653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:51,225 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:51,225 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [184] total 184 [2018-07-25 08:42:51,225 INFO L451 AbstractCegarLoop]: Interpolant automaton has 185 states [2018-07-25 08:42:51,228 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 185 interpolants. [2018-07-25 08:42:51,230 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17020, Invalid=17020, Unknown=0, NotChecked=0, Total=34040 [2018-07-25 08:42:51,230 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 185 states. [2018-07-25 08:42:51,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:51,944 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2018-07-25 08:42:51,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2018-07-25 08:42:51,945 INFO L78 Accepts]: Start accepts. Automaton has 185 states. Word has length 185 [2018-07-25 08:42:51,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:51,945 INFO L225 Difference]: With dead ends: 189 [2018-07-25 08:42:51,945 INFO L226 Difference]: Without dead ends: 187 [2018-07-25 08:42:51,948 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=17020, Invalid=17020, Unknown=0, NotChecked=0, Total=34040 [2018-07-25 08:42:51,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-07-25 08:42:51,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-07-25 08:42:51,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-07-25 08:42:51,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2018-07-25 08:42:51,950 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 185 [2018-07-25 08:42:51,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:51,951 INFO L472 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2018-07-25 08:42:51,951 INFO L473 AbstractCegarLoop]: Interpolant automaton has 185 states. [2018-07-25 08:42:51,951 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2018-07-25 08:42:51,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-07-25 08:42:51,951 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:51,951 INFO L354 BasicCegarLoop]: trace histogram [183, 1, 1, 1] [2018-07-25 08:42:51,951 INFO L415 AbstractCegarLoop]: === Iteration 184 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:51,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1358773368, now seen corresponding path program 183 times [2018-07-25 08:42:51,952 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:51,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:52,736 INFO L134 CoverageAnalysis]: Checked inductivity of 16836 backedges. 0 proven. 16836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:52,736 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:52,736 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [185] total 185 [2018-07-25 08:42:52,736 INFO L451 AbstractCegarLoop]: Interpolant automaton has 186 states [2018-07-25 08:42:52,737 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 186 interpolants. [2018-07-25 08:42:52,738 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-07-25 08:42:52,738 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 186 states. [2018-07-25 08:42:52,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:52,938 INFO L93 Difference]: Finished difference Result 190 states and 190 transitions. [2018-07-25 08:42:52,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2018-07-25 08:42:52,939 INFO L78 Accepts]: Start accepts. Automaton has 186 states. Word has length 186 [2018-07-25 08:42:52,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:52,939 INFO L225 Difference]: With dead ends: 190 [2018-07-25 08:42:52,939 INFO L226 Difference]: Without dead ends: 188 [2018-07-25 08:42:52,940 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-07-25 08:42:52,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-07-25 08:42:52,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2018-07-25 08:42:52,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-07-25 08:42:52,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 188 transitions. [2018-07-25 08:42:52,942 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 188 transitions. Word has length 186 [2018-07-25 08:42:52,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:52,942 INFO L472 AbstractCegarLoop]: Abstraction has 188 states and 188 transitions. [2018-07-25 08:42:52,942 INFO L473 AbstractCegarLoop]: Interpolant automaton has 186 states. [2018-07-25 08:42:52,942 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 188 transitions. [2018-07-25 08:42:52,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-07-25 08:42:52,943 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:52,943 INFO L354 BasicCegarLoop]: trace histogram [184, 1, 1, 1] [2018-07-25 08:42:52,943 INFO L415 AbstractCegarLoop]: === Iteration 185 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:52,943 INFO L82 PathProgramCache]: Analyzing trace with hash 827696577, now seen corresponding path program 184 times [2018-07-25 08:42:52,943 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:52,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:53,688 INFO L134 CoverageAnalysis]: Checked inductivity of 17020 backedges. 0 proven. 17020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:53,688 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:53,688 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [186] total 186 [2018-07-25 08:42:53,689 INFO L451 AbstractCegarLoop]: Interpolant automaton has 187 states [2018-07-25 08:42:53,691 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 187 interpolants. [2018-07-25 08:42:53,692 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17391, Invalid=17391, Unknown=0, NotChecked=0, Total=34782 [2018-07-25 08:42:53,692 INFO L87 Difference]: Start difference. First operand 188 states and 188 transitions. Second operand 187 states. [2018-07-25 08:42:54,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:54,383 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-07-25 08:42:54,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2018-07-25 08:42:54,384 INFO L78 Accepts]: Start accepts. Automaton has 187 states. Word has length 187 [2018-07-25 08:42:54,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:54,384 INFO L225 Difference]: With dead ends: 191 [2018-07-25 08:42:54,384 INFO L226 Difference]: Without dead ends: 189 [2018-07-25 08:42:54,386 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=17391, Invalid=17391, Unknown=0, NotChecked=0, Total=34782 [2018-07-25 08:42:54,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-07-25 08:42:54,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-07-25 08:42:54,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-07-25 08:42:54,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2018-07-25 08:42:54,388 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 187 [2018-07-25 08:42:54,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:54,388 INFO L472 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2018-07-25 08:42:54,388 INFO L473 AbstractCegarLoop]: Interpolant automaton has 187 states. [2018-07-25 08:42:54,388 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2018-07-25 08:42:54,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-07-25 08:42:54,389 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:54,389 INFO L354 BasicCegarLoop]: trace histogram [185, 1, 1, 1] [2018-07-25 08:42:54,389 INFO L415 AbstractCegarLoop]: === Iteration 186 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:54,389 INFO L82 PathProgramCache]: Analyzing trace with hash -111211864, now seen corresponding path program 185 times [2018-07-25 08:42:54,389 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:54,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:55,137 INFO L134 CoverageAnalysis]: Checked inductivity of 17205 backedges. 0 proven. 17205 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:55,137 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:55,137 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [187] total 187 [2018-07-25 08:42:55,137 INFO L451 AbstractCegarLoop]: Interpolant automaton has 188 states [2018-07-25 08:42:55,140 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 188 interpolants. [2018-07-25 08:42:55,140 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-07-25 08:42:55,141 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 188 states. [2018-07-25 08:42:55,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:55,952 INFO L93 Difference]: Finished difference Result 192 states and 192 transitions. [2018-07-25 08:42:55,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 188 states. [2018-07-25 08:42:55,953 INFO L78 Accepts]: Start accepts. Automaton has 188 states. Word has length 188 [2018-07-25 08:42:55,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:55,953 INFO L225 Difference]: With dead ends: 192 [2018-07-25 08:42:55,953 INFO L226 Difference]: Without dead ends: 190 [2018-07-25 08:42:55,955 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-07-25 08:42:55,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-07-25 08:42:55,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2018-07-25 08:42:55,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-07-25 08:42:55,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 190 transitions. [2018-07-25 08:42:55,957 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 190 transitions. Word has length 188 [2018-07-25 08:42:55,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:55,958 INFO L472 AbstractCegarLoop]: Abstraction has 190 states and 190 transitions. [2018-07-25 08:42:55,958 INFO L473 AbstractCegarLoop]: Interpolant automaton has 188 states. [2018-07-25 08:42:55,958 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 190 transitions. [2018-07-25 08:42:55,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-07-25 08:42:55,958 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:55,958 INFO L354 BasicCegarLoop]: trace histogram [186, 1, 1, 1] [2018-07-25 08:42:55,958 INFO L415 AbstractCegarLoop]: === Iteration 187 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:55,959 INFO L82 PathProgramCache]: Analyzing trace with hash 847397537, now seen corresponding path program 186 times [2018-07-25 08:42:55,959 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:55,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:56,728 INFO L134 CoverageAnalysis]: Checked inductivity of 17391 backedges. 0 proven. 17391 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:56,728 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:56,728 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [188] total 188 [2018-07-25 08:42:56,728 INFO L451 AbstractCegarLoop]: Interpolant automaton has 189 states [2018-07-25 08:42:56,731 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 189 interpolants. [2018-07-25 08:42:56,732 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17766, Invalid=17766, Unknown=0, NotChecked=0, Total=35532 [2018-07-25 08:42:56,732 INFO L87 Difference]: Start difference. First operand 190 states and 190 transitions. Second operand 189 states. [2018-07-25 08:42:57,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:57,048 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2018-07-25 08:42:57,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2018-07-25 08:42:57,049 INFO L78 Accepts]: Start accepts. Automaton has 189 states. Word has length 189 [2018-07-25 08:42:57,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:57,049 INFO L225 Difference]: With dead ends: 193 [2018-07-25 08:42:57,049 INFO L226 Difference]: Without dead ends: 191 [2018-07-25 08:42:57,051 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=17766, Invalid=17766, Unknown=0, NotChecked=0, Total=35532 [2018-07-25 08:42:57,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-07-25 08:42:57,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-07-25 08:42:57,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-07-25 08:42:57,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-07-25 08:42:57,053 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 189 [2018-07-25 08:42:57,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:57,053 INFO L472 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2018-07-25 08:42:57,053 INFO L473 AbstractCegarLoop]: Interpolant automaton has 189 states. [2018-07-25 08:42:57,053 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-07-25 08:42:57,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-07-25 08:42:57,054 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:57,054 INFO L354 BasicCegarLoop]: trace histogram [187, 1, 1, 1] [2018-07-25 08:42:57,054 INFO L415 AbstractCegarLoop]: === Iteration 188 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:57,054 INFO L82 PathProgramCache]: Analyzing trace with hash 499517896, now seen corresponding path program 187 times [2018-07-25 08:42:57,054 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:57,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:57,847 INFO L134 CoverageAnalysis]: Checked inductivity of 17578 backedges. 0 proven. 17578 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:57,848 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:57,848 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [189] total 189 [2018-07-25 08:42:57,848 INFO L451 AbstractCegarLoop]: Interpolant automaton has 190 states [2018-07-25 08:42:57,850 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 190 interpolants. [2018-07-25 08:42:57,851 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-07-25 08:42:57,851 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 190 states. [2018-07-25 08:42:58,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:58,212 INFO L93 Difference]: Finished difference Result 194 states and 194 transitions. [2018-07-25 08:42:58,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2018-07-25 08:42:58,213 INFO L78 Accepts]: Start accepts. Automaton has 190 states. Word has length 190 [2018-07-25 08:42:58,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:58,213 INFO L225 Difference]: With dead ends: 194 [2018-07-25 08:42:58,213 INFO L226 Difference]: Without dead ends: 192 [2018-07-25 08:42:58,214 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-07-25 08:42:58,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-07-25 08:42:58,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2018-07-25 08:42:58,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-07-25 08:42:58,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 192 transitions. [2018-07-25 08:42:58,217 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 192 transitions. Word has length 190 [2018-07-25 08:42:58,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:58,217 INFO L472 AbstractCegarLoop]: Abstraction has 192 states and 192 transitions. [2018-07-25 08:42:58,217 INFO L473 AbstractCegarLoop]: Interpolant automaton has 190 states. [2018-07-25 08:42:58,217 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 192 transitions. [2018-07-25 08:42:58,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-07-25 08:42:58,217 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:58,217 INFO L354 BasicCegarLoop]: trace histogram [188, 1, 1, 1] [2018-07-25 08:42:58,218 INFO L415 AbstractCegarLoop]: === Iteration 189 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:58,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1694816383, now seen corresponding path program 188 times [2018-07-25 08:42:58,218 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:58,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:58,982 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:58,982 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:58,982 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [190] total 190 [2018-07-25 08:42:58,982 INFO L451 AbstractCegarLoop]: Interpolant automaton has 191 states [2018-07-25 08:42:58,985 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 191 interpolants. [2018-07-25 08:42:58,986 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18145, Invalid=18145, Unknown=0, NotChecked=0, Total=36290 [2018-07-25 08:42:58,986 INFO L87 Difference]: Start difference. First operand 192 states and 192 transitions. Second operand 191 states. [2018-07-25 08:42:59,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:59,776 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-07-25 08:42:59,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 191 states. [2018-07-25 08:42:59,776 INFO L78 Accepts]: Start accepts. Automaton has 191 states. Word has length 191 [2018-07-25 08:42:59,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:59,776 INFO L225 Difference]: With dead ends: 195 [2018-07-25 08:42:59,777 INFO L226 Difference]: Without dead ends: 193 [2018-07-25 08:42:59,779 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=18145, Invalid=18145, Unknown=0, NotChecked=0, Total=36290 [2018-07-25 08:42:59,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-07-25 08:42:59,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-07-25 08:42:59,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-07-25 08:42:59,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-07-25 08:42:59,782 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 191 [2018-07-25 08:42:59,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:59,782 INFO L472 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-07-25 08:42:59,782 INFO L473 AbstractCegarLoop]: Interpolant automaton has 191 states. [2018-07-25 08:42:59,783 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-07-25 08:42:59,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-07-25 08:42:59,783 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:59,783 INFO L354 BasicCegarLoop]: trace histogram [189, 1, 1, 1] [2018-07-25 08:42:59,784 INFO L415 AbstractCegarLoop]: === Iteration 190 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:59,784 INFO L82 PathProgramCache]: Analyzing trace with hash -999702296, now seen corresponding path program 189 times [2018-07-25 08:42:59,784 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:59,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:43:00,656 INFO L134 CoverageAnalysis]: Checked inductivity of 17955 backedges. 0 proven. 17955 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:43:00,656 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:43:00,656 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [191] total 191 [2018-07-25 08:43:00,656 INFO L451 AbstractCegarLoop]: Interpolant automaton has 192 states [2018-07-25 08:43:00,659 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2018-07-25 08:43:00,660 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-07-25 08:43:00,660 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 192 states. [2018-07-25 08:43:01,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:43:01,493 INFO L93 Difference]: Finished difference Result 196 states and 196 transitions. [2018-07-25 08:43:01,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2018-07-25 08:43:01,493 INFO L78 Accepts]: Start accepts. Automaton has 192 states. Word has length 192 [2018-07-25 08:43:01,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:43:01,494 INFO L225 Difference]: With dead ends: 196 [2018-07-25 08:43:01,494 INFO L226 Difference]: Without dead ends: 194 [2018-07-25 08:43:01,495 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-07-25 08:43:01,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-07-25 08:43:01,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2018-07-25 08:43:01,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-07-25 08:43:01,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 194 transitions. [2018-07-25 08:43:01,499 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 194 transitions. Word has length 192 [2018-07-25 08:43:01,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:43:01,499 INFO L472 AbstractCegarLoop]: Abstraction has 194 states and 194 transitions. [2018-07-25 08:43:01,499 INFO L473 AbstractCegarLoop]: Interpolant automaton has 192 states. [2018-07-25 08:43:01,499 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 194 transitions. [2018-07-25 08:43:01,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-07-25 08:43:01,500 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:43:01,500 INFO L354 BasicCegarLoop]: trace histogram [190, 1, 1, 1] [2018-07-25 08:43:01,500 INFO L415 AbstractCegarLoop]: === Iteration 191 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:43:01,501 INFO L82 PathProgramCache]: Analyzing trace with hash -926002079, now seen corresponding path program 190 times [2018-07-25 08:43:01,501 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:43:01,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:43:02,326 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:43:02,326 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:43:02,326 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [192] total 192 [2018-07-25 08:43:02,326 INFO L451 AbstractCegarLoop]: Interpolant automaton has 193 states [2018-07-25 08:43:02,328 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 193 interpolants. [2018-07-25 08:43:02,329 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18528, Invalid=18528, Unknown=0, NotChecked=0, Total=37056 [2018-07-25 08:43:02,329 INFO L87 Difference]: Start difference. First operand 194 states and 194 transitions. Second operand 193 states. [2018-07-25 08:43:02,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:43:02,772 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2018-07-25 08:43:02,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 193 states. [2018-07-25 08:43:02,772 INFO L78 Accepts]: Start accepts. Automaton has 193 states. Word has length 193 [2018-07-25 08:43:02,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:43:02,773 INFO L225 Difference]: With dead ends: 197 [2018-07-25 08:43:02,773 INFO L226 Difference]: Without dead ends: 195 [2018-07-25 08:43:02,774 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=18528, Invalid=18528, Unknown=0, NotChecked=0, Total=37056 [2018-07-25 08:43:02,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-07-25 08:43:02,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2018-07-25 08:43:02,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-07-25 08:43:02,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2018-07-25 08:43:02,777 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 193 [2018-07-25 08:43:02,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:43:02,778 INFO L472 AbstractCegarLoop]: Abstraction has 195 states and 195 transitions. [2018-07-25 08:43:02,778 INFO L473 AbstractCegarLoop]: Interpolant automaton has 193 states. [2018-07-25 08:43:02,778 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2018-07-25 08:43:02,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-07-25 08:43:02,779 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:43:02,779 INFO L354 BasicCegarLoop]: trace histogram [191, 1, 1, 1] [2018-07-25 08:43:02,779 INFO L415 AbstractCegarLoop]: === Iteration 192 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:43:02,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1358704648, now seen corresponding path program 191 times [2018-07-25 08:43:02,779 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:43:02,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:43:03,697 INFO L134 CoverageAnalysis]: Checked inductivity of 18336 backedges. 0 proven. 18336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:43:03,698 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:43:03,698 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [193] total 193 [2018-07-25 08:43:03,698 INFO L451 AbstractCegarLoop]: Interpolant automaton has 194 states [2018-07-25 08:43:03,701 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 194 interpolants. [2018-07-25 08:43:03,703 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-07-25 08:43:03,703 INFO L87 Difference]: Start difference. First operand 195 states and 195 transitions. Second operand 194 states. [2018-07-25 08:43:03,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:43:03,952 INFO L93 Difference]: Finished difference Result 198 states and 198 transitions. [2018-07-25 08:43:03,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 194 states. [2018-07-25 08:43:03,952 INFO L78 Accepts]: Start accepts. Automaton has 194 states. Word has length 194 [2018-07-25 08:43:03,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:43:03,953 INFO L225 Difference]: With dead ends: 198 [2018-07-25 08:43:03,953 INFO L226 Difference]: Without dead ends: 196 [2018-07-25 08:43:03,955 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-07-25 08:43:03,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-07-25 08:43:03,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2018-07-25 08:43:03,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-07-25 08:43:03,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2018-07-25 08:43:03,959 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 194 [2018-07-25 08:43:03,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:43:03,959 INFO L472 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2018-07-25 08:43:03,959 INFO L473 AbstractCegarLoop]: Interpolant automaton has 194 states. [2018-07-25 08:43:03,959 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2018-07-25 08:43:03,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-07-25 08:43:03,960 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:43:03,960 INFO L354 BasicCegarLoop]: trace histogram [192, 1, 1, 1] [2018-07-25 08:43:03,960 INFO L415 AbstractCegarLoop]: === Iteration 193 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:43:03,961 INFO L82 PathProgramCache]: Analyzing trace with hash -829830847, now seen corresponding path program 192 times [2018-07-25 08:43:03,961 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:43:03,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:43:04,774 INFO L134 CoverageAnalysis]: Checked inductivity of 18528 backedges. 0 proven. 18528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:43:04,774 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:43:04,774 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [194] total 194 [2018-07-25 08:43:04,775 INFO L451 AbstractCegarLoop]: Interpolant automaton has 195 states [2018-07-25 08:43:04,777 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 195 interpolants. [2018-07-25 08:43:04,778 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18915, Invalid=18915, Unknown=0, NotChecked=0, Total=37830 [2018-07-25 08:43:04,778 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 195 states. [2018-07-25 08:43:05,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:43:05,188 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2018-07-25 08:43:05,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2018-07-25 08:43:05,189 INFO L78 Accepts]: Start accepts. Automaton has 195 states. Word has length 195 [2018-07-25 08:43:05,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:43:05,189 INFO L225 Difference]: With dead ends: 199 [2018-07-25 08:43:05,189 INFO L226 Difference]: Without dead ends: 197 [2018-07-25 08:43:05,191 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=18915, Invalid=18915, Unknown=0, NotChecked=0, Total=37830 [2018-07-25 08:43:05,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-07-25 08:43:05,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-07-25 08:43:05,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-07-25 08:43:05,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2018-07-25 08:43:05,193 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 195 [2018-07-25 08:43:05,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:43:05,193 INFO L472 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2018-07-25 08:43:05,193 INFO L473 AbstractCegarLoop]: Interpolant automaton has 195 states. [2018-07-25 08:43:05,193 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2018-07-25 08:43:05,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-07-25 08:43:05,194 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:43:05,194 INFO L354 BasicCegarLoop]: trace histogram [193, 1, 1, 1] [2018-07-25 08:43:05,194 INFO L415 AbstractCegarLoop]: === Iteration 194 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:43:05,194 INFO L82 PathProgramCache]: Analyzing trace with hash 45045544, now seen corresponding path program 193 times [2018-07-25 08:43:05,194 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:43:05,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:43:06,039 INFO L134 CoverageAnalysis]: Checked inductivity of 18721 backedges. 0 proven. 18721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:43:06,040 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:43:06,040 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [195] total 195 [2018-07-25 08:43:06,040 INFO L451 AbstractCegarLoop]: Interpolant automaton has 196 states [2018-07-25 08:43:06,043 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 196 interpolants. [2018-07-25 08:43:06,044 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-07-25 08:43:06,044 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 196 states. [2018-07-25 08:43:06,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:43:06,761 INFO L93 Difference]: Finished difference Result 200 states and 200 transitions. [2018-07-25 08:43:06,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 196 states. [2018-07-25 08:43:06,762 INFO L78 Accepts]: Start accepts. Automaton has 196 states. Word has length 196 [2018-07-25 08:43:06,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:43:06,762 INFO L225 Difference]: With dead ends: 200 [2018-07-25 08:43:06,762 INFO L226 Difference]: Without dead ends: 198 [2018-07-25 08:43:06,763 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-07-25 08:43:06,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-07-25 08:43:06,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2018-07-25 08:43:06,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-07-25 08:43:06,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 198 transitions. [2018-07-25 08:43:06,766 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 198 transitions. Word has length 196 [2018-07-25 08:43:06,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:43:06,766 INFO L472 AbstractCegarLoop]: Abstraction has 198 states and 198 transitions. [2018-07-25 08:43:06,767 INFO L473 AbstractCegarLoop]: Interpolant automaton has 196 states. [2018-07-25 08:43:06,767 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 198 transitions. [2018-07-25 08:43:06,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-07-25 08:43:06,767 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:43:06,768 INFO L354 BasicCegarLoop]: trace histogram [194, 1, 1, 1] [2018-07-25 08:43:06,768 INFO L415 AbstractCegarLoop]: === Iteration 195 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:43:06,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1396409889, now seen corresponding path program 194 times [2018-07-25 08:43:06,768 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:43:06,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:43:07,687 INFO L134 CoverageAnalysis]: Checked inductivity of 18915 backedges. 0 proven. 18915 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:43:07,687 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:43:07,687 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [196] total 196 [2018-07-25 08:43:07,688 INFO L451 AbstractCegarLoop]: Interpolant automaton has 197 states [2018-07-25 08:43:07,690 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 197 interpolants. [2018-07-25 08:43:07,692 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19306, Invalid=19306, Unknown=0, NotChecked=0, Total=38612 [2018-07-25 08:43:07,692 INFO L87 Difference]: Start difference. First operand 198 states and 198 transitions. Second operand 197 states. [2018-07-25 08:43:08,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:43:08,642 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2018-07-25 08:43:08,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 197 states. [2018-07-25 08:43:08,643 INFO L78 Accepts]: Start accepts. Automaton has 197 states. Word has length 197 [2018-07-25 08:43:08,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:43:08,643 INFO L225 Difference]: With dead ends: 201 [2018-07-25 08:43:08,643 INFO L226 Difference]: Without dead ends: 199 [2018-07-25 08:43:08,645 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=19306, Invalid=19306, Unknown=0, NotChecked=0, Total=38612 [2018-07-25 08:43:08,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-07-25 08:43:08,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-07-25 08:43:08,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-07-25 08:43:08,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2018-07-25 08:43:08,647 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 197 [2018-07-25 08:43:08,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:43:08,647 INFO L472 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2018-07-25 08:43:08,647 INFO L473 AbstractCegarLoop]: Interpolant automaton has 197 states. [2018-07-25 08:43:08,647 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2018-07-25 08:43:08,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-07-25 08:43:08,648 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:43:08,648 INFO L354 BasicCegarLoop]: trace histogram [195, 1, 1, 1] [2018-07-25 08:43:08,648 INFO L415 AbstractCegarLoop]: === Iteration 196 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:43:08,648 INFO L82 PathProgramCache]: Analyzing trace with hash 339031624, now seen corresponding path program 195 times [2018-07-25 08:43:08,648 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:43:08,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:43:09,493 INFO L134 CoverageAnalysis]: Checked inductivity of 19110 backedges. 0 proven. 19110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:43:09,494 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:43:09,494 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [197] total 197 [2018-07-25 08:43:09,494 INFO L451 AbstractCegarLoop]: Interpolant automaton has 198 states [2018-07-25 08:43:09,497 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 198 interpolants. [2018-07-25 08:43:09,499 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-07-25 08:43:09,499 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand 198 states. [2018-07-25 08:43:10,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:43:10,504 INFO L93 Difference]: Finished difference Result 202 states and 202 transitions. [2018-07-25 08:43:10,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2018-07-25 08:43:10,504 INFO L78 Accepts]: Start accepts. Automaton has 198 states. Word has length 198 [2018-07-25 08:43:10,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:43:10,504 INFO L225 Difference]: With dead ends: 202 [2018-07-25 08:43:10,505 INFO L226 Difference]: Without dead ends: 200 [2018-07-25 08:43:10,507 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-07-25 08:43:10,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-07-25 08:43:10,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2018-07-25 08:43:10,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-07-25 08:43:10,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 200 transitions. [2018-07-25 08:43:10,509 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 200 transitions. Word has length 198 [2018-07-25 08:43:10,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:43:10,509 INFO L472 AbstractCegarLoop]: Abstraction has 200 states and 200 transitions. [2018-07-25 08:43:10,509 INFO L473 AbstractCegarLoop]: Interpolant automaton has 198 states. [2018-07-25 08:43:10,509 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 200 transitions. [2018-07-25 08:43:10,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-07-25 08:43:10,510 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:43:10,510 INFO L354 BasicCegarLoop]: trace histogram [196, 1, 1, 1] [2018-07-25 08:43:10,510 INFO L415 AbstractCegarLoop]: === Iteration 197 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:43:10,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1920043777, now seen corresponding path program 196 times [2018-07-25 08:43:10,510 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:43:10,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:43:11,523 INFO L134 CoverageAnalysis]: Checked inductivity of 19306 backedges. 0 proven. 19306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:43:11,523 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:43:11,523 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [198] total 198 [2018-07-25 08:43:11,524 INFO L451 AbstractCegarLoop]: Interpolant automaton has 199 states [2018-07-25 08:43:11,527 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 199 interpolants. [2018-07-25 08:43:11,529 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19701, Invalid=19701, Unknown=0, NotChecked=0, Total=39402 [2018-07-25 08:43:11,529 INFO L87 Difference]: Start difference. First operand 200 states and 200 transitions. Second operand 199 states. [2018-07-25 08:43:12,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:43:12,819 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2018-07-25 08:43:12,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 199 states. [2018-07-25 08:43:12,820 INFO L78 Accepts]: Start accepts. Automaton has 199 states. Word has length 199 [2018-07-25 08:43:12,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:43:12,820 INFO L225 Difference]: With dead ends: 203 [2018-07-25 08:43:12,820 INFO L226 Difference]: Without dead ends: 201 [2018-07-25 08:43:12,821 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=19701, Invalid=19701, Unknown=0, NotChecked=0, Total=39402 [2018-07-25 08:43:12,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-07-25 08:43:12,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2018-07-25 08:43:12,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-07-25 08:43:12,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-07-25 08:43:12,823 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 199 [2018-07-25 08:43:12,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:43:12,824 INFO L472 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-07-25 08:43:12,824 INFO L473 AbstractCegarLoop]: Interpolant automaton has 199 states. [2018-07-25 08:43:12,824 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-07-25 08:43:12,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-07-25 08:43:12,824 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:43:12,824 INFO L354 BasicCegarLoop]: trace histogram [197, 1, 1, 1] [2018-07-25 08:43:12,824 INFO L415 AbstractCegarLoop]: === Iteration 198 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:43:12,825 INFO L82 PathProgramCache]: Analyzing trace with hash -608187032, now seen corresponding path program 197 times [2018-07-25 08:43:12,825 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:43:12,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:43:13,758 INFO L134 CoverageAnalysis]: Checked inductivity of 19503 backedges. 0 proven. 19503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:43:13,759 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:43:13,759 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [199] total 199 [2018-07-25 08:43:13,759 INFO L451 AbstractCegarLoop]: Interpolant automaton has 200 states [2018-07-25 08:43:13,762 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 200 interpolants. [2018-07-25 08:43:13,763 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-07-25 08:43:13,763 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 200 states. [2018-07-25 08:43:14,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:43:14,593 INFO L93 Difference]: Finished difference Result 204 states and 204 transitions. [2018-07-25 08:43:14,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2018-07-25 08:43:14,593 INFO L78 Accepts]: Start accepts. Automaton has 200 states. Word has length 200 [2018-07-25 08:43:14,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:43:14,593 INFO L225 Difference]: With dead ends: 204 [2018-07-25 08:43:14,593 INFO L226 Difference]: Without dead ends: 202 [2018-07-25 08:43:14,595 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-07-25 08:43:14,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-07-25 08:43:14,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2018-07-25 08:43:14,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-07-25 08:43:14,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 202 transitions. [2018-07-25 08:43:14,597 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 202 transitions. Word has length 200 [2018-07-25 08:43:14,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:43:14,597 INFO L472 AbstractCegarLoop]: Abstraction has 202 states and 202 transitions. [2018-07-25 08:43:14,598 INFO L473 AbstractCegarLoop]: Interpolant automaton has 200 states. [2018-07-25 08:43:14,598 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 202 transitions. [2018-07-25 08:43:14,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-07-25 08:43:14,598 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:43:14,598 INFO L354 BasicCegarLoop]: trace histogram [198, 1, 1, 1] [2018-07-25 08:43:14,598 INFO L415 AbstractCegarLoop]: === Iteration 199 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:43:14,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1673930783, now seen corresponding path program 198 times [2018-07-25 08:43:14,599 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:43:14,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:43:15,469 INFO L134 CoverageAnalysis]: Checked inductivity of 19701 backedges. 0 proven. 19701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:43:15,469 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:43:15,469 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [200] total 200 [2018-07-25 08:43:15,469 INFO L451 AbstractCegarLoop]: Interpolant automaton has 201 states [2018-07-25 08:43:15,472 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 201 interpolants. [2018-07-25 08:43:15,473 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20100, Invalid=20100, Unknown=0, NotChecked=0, Total=40200 [2018-07-25 08:43:15,473 INFO L87 Difference]: Start difference. First operand 202 states and 202 transitions. Second operand 201 states. [2018-07-25 08:43:16,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:43:16,217 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2018-07-25 08:43:16,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2018-07-25 08:43:16,217 INFO L78 Accepts]: Start accepts. Automaton has 201 states. Word has length 201 [2018-07-25 08:43:16,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:43:16,218 INFO L225 Difference]: With dead ends: 205 [2018-07-25 08:43:16,218 INFO L226 Difference]: Without dead ends: 203 [2018-07-25 08:43:16,220 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=20100, Invalid=20100, Unknown=0, NotChecked=0, Total=40200 [2018-07-25 08:43:16,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-07-25 08:43:16,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-07-25 08:43:16,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-07-25 08:43:16,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2018-07-25 08:43:16,222 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 201 [2018-07-25 08:43:16,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:43:16,222 INFO L472 AbstractCegarLoop]: Abstraction has 203 states and 203 transitions. [2018-07-25 08:43:16,222 INFO L473 AbstractCegarLoop]: Interpolant automaton has 201 states. [2018-07-25 08:43:16,222 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2018-07-25 08:43:16,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-07-25 08:43:16,223 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:43:16,223 INFO L354 BasicCegarLoop]: trace histogram [199, 1, 1, 1] [2018-07-25 08:43:16,223 INFO L415 AbstractCegarLoop]: === Iteration 200 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:43:16,223 INFO L82 PathProgramCache]: Analyzing trace with hash -352248696, now seen corresponding path program 199 times [2018-07-25 08:43:16,223 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:43:16,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:43:17,122 INFO L134 CoverageAnalysis]: Checked inductivity of 19900 backedges. 0 proven. 19900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:43:17,122 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:43:17,123 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [201] total 201 [2018-07-25 08:43:17,123 INFO L451 AbstractCegarLoop]: Interpolant automaton has 202 states [2018-07-25 08:43:17,125 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 202 interpolants. [2018-07-25 08:43:17,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-07-25 08:43:17,127 INFO L87 Difference]: Start difference. First operand 203 states and 203 transitions. Second operand 202 states. [2018-07-25 08:43:17,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:43:17,839 INFO L93 Difference]: Finished difference Result 206 states and 206 transitions. [2018-07-25 08:43:17,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2018-07-25 08:43:17,839 INFO L78 Accepts]: Start accepts. Automaton has 202 states. Word has length 202 [2018-07-25 08:43:17,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:43:17,840 INFO L225 Difference]: With dead ends: 206 [2018-07-25 08:43:17,840 INFO L226 Difference]: Without dead ends: 204 [2018-07-25 08:43:17,842 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-07-25 08:43:17,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-07-25 08:43:17,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2018-07-25 08:43:17,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-07-25 08:43:17,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 204 transitions. [2018-07-25 08:43:17,844 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 204 transitions. Word has length 202 [2018-07-25 08:43:17,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:43:17,845 INFO L472 AbstractCegarLoop]: Abstraction has 204 states and 204 transitions. [2018-07-25 08:43:17,845 INFO L473 AbstractCegarLoop]: Interpolant automaton has 202 states. [2018-07-25 08:43:17,845 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 204 transitions. [2018-07-25 08:43:17,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-07-25 08:43:17,845 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:43:17,845 INFO L354 BasicCegarLoop]: trace histogram [200, 1, 1, 1] [2018-07-25 08:43:17,845 INFO L415 AbstractCegarLoop]: === Iteration 201 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:43:17,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1965190337, now seen corresponding path program 200 times [2018-07-25 08:43:17,846 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:43:17,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:43:18,764 INFO L134 CoverageAnalysis]: Checked inductivity of 20100 backedges. 0 proven. 20100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:43:18,764 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:43:18,764 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [202] total 202 [2018-07-25 08:43:18,765 INFO L451 AbstractCegarLoop]: Interpolant automaton has 203 states [2018-07-25 08:43:18,767 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 203 interpolants. [2018-07-25 08:43:18,769 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20503, Invalid=20503, Unknown=0, NotChecked=0, Total=41006 [2018-07-25 08:43:18,769 INFO L87 Difference]: Start difference. First operand 204 states and 204 transitions. Second operand 203 states. [2018-07-25 08:43:19,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:43:19,460 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2018-07-25 08:43:19,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 203 states. [2018-07-25 08:43:19,460 INFO L78 Accepts]: Start accepts. Automaton has 203 states. Word has length 203 [2018-07-25 08:43:19,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:43:19,461 INFO L225 Difference]: With dead ends: 207 [2018-07-25 08:43:19,461 INFO L226 Difference]: Without dead ends: 205 [2018-07-25 08:43:19,463 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=20503, Invalid=20503, Unknown=0, NotChecked=0, Total=41006 [2018-07-25 08:43:19,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-07-25 08:43:19,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-07-25 08:43:19,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-07-25 08:43:19,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2018-07-25 08:43:19,465 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 203 [2018-07-25 08:43:19,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:43:19,465 INFO L472 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2018-07-25 08:43:19,465 INFO L473 AbstractCegarLoop]: Interpolant automaton has 203 states. [2018-07-25 08:43:19,465 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2018-07-25 08:43:19,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-07-25 08:43:19,466 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:43:19,466 INFO L354 BasicCegarLoop]: trace histogram [201, 1, 1, 1] [2018-07-25 08:43:19,466 INFO L415 AbstractCegarLoop]: === Iteration 202 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:43:19,466 INFO L82 PathProgramCache]: Analyzing trace with hash 791356328, now seen corresponding path program 201 times [2018-07-25 08:43:19,466 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:43:19,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:43:20,368 INFO L134 CoverageAnalysis]: Checked inductivity of 20301 backedges. 0 proven. 20301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:43:20,369 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:43:20,369 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [203] total 203 [2018-07-25 08:43:20,369 INFO L451 AbstractCegarLoop]: Interpolant automaton has 204 states [2018-07-25 08:43:20,372 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 204 interpolants. [2018-07-25 08:43:20,373 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-07-25 08:43:20,373 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 204 states. [2018-07-25 08:43:21,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:43:21,102 INFO L93 Difference]: Finished difference Result 208 states and 208 transitions. [2018-07-25 08:43:21,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 204 states. [2018-07-25 08:43:21,102 INFO L78 Accepts]: Start accepts. Automaton has 204 states. Word has length 204 [2018-07-25 08:43:21,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:43:21,102 INFO L225 Difference]: With dead ends: 208 [2018-07-25 08:43:21,103 INFO L226 Difference]: Without dead ends: 206 [2018-07-25 08:43:21,104 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-07-25 08:43:21,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-07-25 08:43:21,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2018-07-25 08:43:21,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-07-25 08:43:21,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2018-07-25 08:43:21,107 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 204 [2018-07-25 08:43:21,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:43:21,107 INFO L472 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2018-07-25 08:43:21,107 INFO L473 AbstractCegarLoop]: Interpolant automaton has 204 states. [2018-07-25 08:43:21,107 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2018-07-25 08:43:21,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-07-25 08:43:21,107 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:43:21,107 INFO L354 BasicCegarLoop]: trace histogram [202, 1, 1, 1] [2018-07-25 08:43:21,108 INFO L415 AbstractCegarLoop]: === Iteration 203 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:43:21,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1237759583, now seen corresponding path program 202 times [2018-07-25 08:43:21,108 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:43:21,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:43:22,038 INFO L134 CoverageAnalysis]: Checked inductivity of 20503 backedges. 0 proven. 20503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:43:22,039 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:43:22,039 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [204] total 204 [2018-07-25 08:43:22,039 INFO L451 AbstractCegarLoop]: Interpolant automaton has 205 states [2018-07-25 08:43:22,042 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 205 interpolants. [2018-07-25 08:43:22,043 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20910, Invalid=20910, Unknown=0, NotChecked=0, Total=41820 [2018-07-25 08:43:22,043 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand 205 states. [2018-07-25 08:43:22,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:43:22,885 INFO L93 Difference]: Finished difference Result 209 states and 209 transitions. [2018-07-25 08:43:22,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 205 states. [2018-07-25 08:43:22,885 INFO L78 Accepts]: Start accepts. Automaton has 205 states. Word has length 205 [2018-07-25 08:43:22,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:43:22,886 INFO L225 Difference]: With dead ends: 209 [2018-07-25 08:43:22,886 INFO L226 Difference]: Without dead ends: 207 [2018-07-25 08:43:22,888 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=20910, Invalid=20910, Unknown=0, NotChecked=0, Total=41820 [2018-07-25 08:43:22,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-07-25 08:43:22,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2018-07-25 08:43:22,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-07-25 08:43:22,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2018-07-25 08:43:22,890 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 205 [2018-07-25 08:43:22,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:43:22,890 INFO L472 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2018-07-25 08:43:22,890 INFO L473 AbstractCegarLoop]: Interpolant automaton has 205 states. [2018-07-25 08:43:22,890 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2018-07-25 08:43:22,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-07-25 08:43:22,891 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:43:22,891 INFO L354 BasicCegarLoop]: trace histogram [203, 1, 1, 1] [2018-07-25 08:43:22,891 INFO L415 AbstractCegarLoop]: === Iteration 204 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:43:22,891 INFO L82 PathProgramCache]: Analyzing trace with hash 284156616, now seen corresponding path program 203 times [2018-07-25 08:43:22,891 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:43:22,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:43:23,830 INFO L134 CoverageAnalysis]: Checked inductivity of 20706 backedges. 0 proven. 20706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:43:23,830 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:43:23,830 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [205] total 205 [2018-07-25 08:43:23,830 INFO L451 AbstractCegarLoop]: Interpolant automaton has 206 states [2018-07-25 08:43:23,833 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 206 interpolants. [2018-07-25 08:43:23,835 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-07-25 08:43:23,835 INFO L87 Difference]: Start difference. First operand 207 states and 207 transitions. Second operand 206 states. [2018-07-25 08:43:24,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:43:24,804 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2018-07-25 08:43:24,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 206 states. [2018-07-25 08:43:24,805 INFO L78 Accepts]: Start accepts. Automaton has 206 states. Word has length 206 [2018-07-25 08:43:24,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:43:24,805 INFO L225 Difference]: With dead ends: 210 [2018-07-25 08:43:24,805 INFO L226 Difference]: Without dead ends: 208 [2018-07-25 08:43:24,807 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-07-25 08:43:24,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-07-25 08:43:24,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2018-07-25 08:43:24,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-07-25 08:43:24,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 208 transitions. [2018-07-25 08:43:24,810 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 208 transitions. Word has length 206 [2018-07-25 08:43:24,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:43:24,811 INFO L472 AbstractCegarLoop]: Abstraction has 208 states and 208 transitions. [2018-07-25 08:43:24,811 INFO L473 AbstractCegarLoop]: Interpolant automaton has 206 states. [2018-07-25 08:43:24,811 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 208 transitions. [2018-07-25 08:43:24,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-07-25 08:43:24,812 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:43:24,812 INFO L354 BasicCegarLoop]: trace histogram [204, 1, 1, 1] [2018-07-25 08:43:24,812 INFO L415 AbstractCegarLoop]: === Iteration 205 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:43:24,812 INFO L82 PathProgramCache]: Analyzing trace with hash 218918529, now seen corresponding path program 204 times [2018-07-25 08:43:24,812 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:43:24,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:43:25,749 INFO L134 CoverageAnalysis]: Checked inductivity of 20910 backedges. 0 proven. 20910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:43:25,749 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:43:25,749 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [206] total 206 [2018-07-25 08:43:25,750 INFO L451 AbstractCegarLoop]: Interpolant automaton has 207 states [2018-07-25 08:43:25,753 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 207 interpolants. [2018-07-25 08:43:25,754 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21321, Invalid=21321, Unknown=0, NotChecked=0, Total=42642 [2018-07-25 08:43:25,754 INFO L87 Difference]: Start difference. First operand 208 states and 208 transitions. Second operand 207 states. [2018-07-25 08:43:26,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:43:26,918 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2018-07-25 08:43:26,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 207 states. [2018-07-25 08:43:26,919 INFO L78 Accepts]: Start accepts. Automaton has 207 states. Word has length 207 [2018-07-25 08:43:26,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:43:26,919 INFO L225 Difference]: With dead ends: 211 [2018-07-25 08:43:26,919 INFO L226 Difference]: Without dead ends: 209 [2018-07-25 08:43:26,921 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=21321, Invalid=21321, Unknown=0, NotChecked=0, Total=42642 [2018-07-25 08:43:26,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-07-25 08:43:26,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2018-07-25 08:43:26,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-07-25 08:43:26,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2018-07-25 08:43:26,924 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 207 [2018-07-25 08:43:26,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:43:26,925 INFO L472 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2018-07-25 08:43:26,925 INFO L473 AbstractCegarLoop]: Interpolant automaton has 207 states. [2018-07-25 08:43:26,925 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2018-07-25 08:43:26,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-07-25 08:43:26,925 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:43:26,925 INFO L354 BasicCegarLoop]: trace histogram [205, 1, 1, 1] [2018-07-25 08:43:26,926 INFO L415 AbstractCegarLoop]: === Iteration 206 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:43:26,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1803462168, now seen corresponding path program 205 times [2018-07-25 08:43:26,926 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:43:26,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:43:27,943 INFO L134 CoverageAnalysis]: Checked inductivity of 21115 backedges. 0 proven. 21115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:43:27,944 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:43:27,944 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [207] total 207 [2018-07-25 08:43:27,944 INFO L451 AbstractCegarLoop]: Interpolant automaton has 208 states [2018-07-25 08:43:27,945 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 208 interpolants. [2018-07-25 08:43:27,946 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-07-25 08:43:27,946 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 208 states. [2018-07-25 08:43:29,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:43:29,048 INFO L93 Difference]: Finished difference Result 212 states and 212 transitions. [2018-07-25 08:43:29,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 208 states. [2018-07-25 08:43:29,048 INFO L78 Accepts]: Start accepts. Automaton has 208 states. Word has length 208 [2018-07-25 08:43:29,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:43:29,049 INFO L225 Difference]: With dead ends: 212 [2018-07-25 08:43:29,049 INFO L226 Difference]: Without dead ends: 210 [2018-07-25 08:43:29,050 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-07-25 08:43:29,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-07-25 08:43:29,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2018-07-25 08:43:29,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-07-25 08:43:29,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 210 transitions. [2018-07-25 08:43:29,052 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 210 transitions. Word has length 208 [2018-07-25 08:43:29,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:43:29,052 INFO L472 AbstractCegarLoop]: Abstraction has 210 states and 210 transitions. [2018-07-25 08:43:29,052 INFO L473 AbstractCegarLoop]: Interpolant automaton has 208 states. [2018-07-25 08:43:29,052 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 210 transitions. [2018-07-25 08:43:29,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-07-25 08:43:29,053 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:43:29,053 INFO L354 BasicCegarLoop]: trace histogram [206, 1, 1, 1] [2018-07-25 08:43:29,053 INFO L415 AbstractCegarLoop]: === Iteration 207 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:43:29,053 INFO L82 PathProgramCache]: Analyzing trace with hash -72754335, now seen corresponding path program 206 times [2018-07-25 08:43:29,053 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:43:29,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:43:29,986 INFO L134 CoverageAnalysis]: Checked inductivity of 21321 backedges. 0 proven. 21321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:43:29,986 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:43:29,987 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [208] total 208 [2018-07-25 08:43:29,987 INFO L451 AbstractCegarLoop]: Interpolant automaton has 209 states [2018-07-25 08:43:29,990 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 209 interpolants. [2018-07-25 08:43:29,991 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21736, Invalid=21736, Unknown=0, NotChecked=0, Total=43472 [2018-07-25 08:43:29,991 INFO L87 Difference]: Start difference. First operand 210 states and 210 transitions. Second operand 209 states. [2018-07-25 08:43:31,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:43:31,119 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2018-07-25 08:43:31,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 209 states. [2018-07-25 08:43:31,120 INFO L78 Accepts]: Start accepts. Automaton has 209 states. Word has length 209 [2018-07-25 08:43:31,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:43:31,120 INFO L225 Difference]: With dead ends: 213 [2018-07-25 08:43:31,120 INFO L226 Difference]: Without dead ends: 211 [2018-07-25 08:43:31,123 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=21736, Invalid=21736, Unknown=0, NotChecked=0, Total=43472 [2018-07-25 08:43:31,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-07-25 08:43:31,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-07-25 08:43:31,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-07-25 08:43:31,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2018-07-25 08:43:31,126 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 209 [2018-07-25 08:43:31,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:43:31,126 INFO L472 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2018-07-25 08:43:31,126 INFO L473 AbstractCegarLoop]: Interpolant automaton has 209 states. [2018-07-25 08:43:31,126 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2018-07-25 08:43:31,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-07-25 08:43:31,127 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:43:31,127 INFO L354 BasicCegarLoop]: trace histogram [207, 1, 1, 1] [2018-07-25 08:43:31,127 INFO L415 AbstractCegarLoop]: === Iteration 208 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:43:31,127 INFO L82 PathProgramCache]: Analyzing trace with hash 2039580936, now seen corresponding path program 207 times [2018-07-25 08:43:31,127 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:43:31,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:43:32,087 INFO L134 CoverageAnalysis]: Checked inductivity of 21528 backedges. 0 proven. 21528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:43:32,087 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:43:32,087 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [209] total 209 [2018-07-25 08:43:32,088 INFO L451 AbstractCegarLoop]: Interpolant automaton has 210 states [2018-07-25 08:43:32,091 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 210 interpolants. [2018-07-25 08:43:32,092 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-07-25 08:43:32,092 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 210 states. [2018-07-25 08:43:33,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:43:33,039 INFO L93 Difference]: Finished difference Result 214 states and 214 transitions. [2018-07-25 08:43:33,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 210 states. [2018-07-25 08:43:33,039 INFO L78 Accepts]: Start accepts. Automaton has 210 states. Word has length 210 [2018-07-25 08:43:33,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:43:33,040 INFO L225 Difference]: With dead ends: 214 [2018-07-25 08:43:33,040 INFO L226 Difference]: Without dead ends: 212 [2018-07-25 08:43:33,042 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-07-25 08:43:33,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-07-25 08:43:33,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2018-07-25 08:43:33,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-07-25 08:43:33,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 212 transitions. [2018-07-25 08:43:33,046 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 212 transitions. Word has length 210 [2018-07-25 08:43:33,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:43:33,046 INFO L472 AbstractCegarLoop]: Abstraction has 212 states and 212 transitions. [2018-07-25 08:43:33,046 INFO L473 AbstractCegarLoop]: Interpolant automaton has 210 states. [2018-07-25 08:43:33,046 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 212 transitions. [2018-07-25 08:43:33,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-07-25 08:43:33,047 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:43:33,047 INFO L354 BasicCegarLoop]: trace histogram [208, 1, 1, 1] [2018-07-25 08:43:33,048 INFO L415 AbstractCegarLoop]: === Iteration 209 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:43:33,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1197502399, now seen corresponding path program 208 times [2018-07-25 08:43:33,048 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:43:33,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:43:34,281 INFO L134 CoverageAnalysis]: Checked inductivity of 21736 backedges. 0 proven. 21736 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:43:34,281 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:43:34,281 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [210] total 210 [2018-07-25 08:43:34,281 INFO L451 AbstractCegarLoop]: Interpolant automaton has 211 states [2018-07-25 08:43:34,283 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 211 interpolants. [2018-07-25 08:43:34,284 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22155, Invalid=22155, Unknown=0, NotChecked=0, Total=44310 [2018-07-25 08:43:34,285 INFO L87 Difference]: Start difference. First operand 212 states and 212 transitions. Second operand 211 states. [2018-07-25 08:43:34,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:43:34,910 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2018-07-25 08:43:34,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 211 states. [2018-07-25 08:43:34,910 INFO L78 Accepts]: Start accepts. Automaton has 211 states. Word has length 211 [2018-07-25 08:43:34,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:43:34,910 INFO L225 Difference]: With dead ends: 215 [2018-07-25 08:43:34,910 INFO L226 Difference]: Without dead ends: 213 [2018-07-25 08:43:34,912 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=22155, Invalid=22155, Unknown=0, NotChecked=0, Total=44310 [2018-07-25 08:43:34,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-07-25 08:43:34,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2018-07-25 08:43:34,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-07-25 08:43:34,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2018-07-25 08:43:34,914 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 211 [2018-07-25 08:43:34,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:43:34,914 INFO L472 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2018-07-25 08:43:34,914 INFO L473 AbstractCegarLoop]: Interpolant automaton has 211 states. [2018-07-25 08:43:34,914 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2018-07-25 08:43:34,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-07-25 08:43:34,915 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:43:34,915 INFO L354 BasicCegarLoop]: trace histogram [209, 1, 1, 1] [2018-07-25 08:43:34,915 INFO L415 AbstractCegarLoop]: === Iteration 210 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:43:34,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1532129320, now seen corresponding path program 209 times [2018-07-25 08:43:34,915 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:43:34,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:43:35,869 INFO L134 CoverageAnalysis]: Checked inductivity of 21945 backedges. 0 proven. 21945 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:43:35,869 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:43:35,869 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [211] total 211 [2018-07-25 08:43:35,869 INFO L451 AbstractCegarLoop]: Interpolant automaton has 212 states [2018-07-25 08:43:35,872 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 212 interpolants. [2018-07-25 08:43:35,874 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-07-25 08:43:35,874 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 212 states. [2018-07-25 08:43:36,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:43:36,482 INFO L93 Difference]: Finished difference Result 216 states and 216 transitions. [2018-07-25 08:43:36,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 212 states. [2018-07-25 08:43:36,482 INFO L78 Accepts]: Start accepts. Automaton has 212 states. Word has length 212 [2018-07-25 08:43:36,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:43:36,483 INFO L225 Difference]: With dead ends: 216 [2018-07-25 08:43:36,483 INFO L226 Difference]: Without dead ends: 214 [2018-07-25 08:43:36,485 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-07-25 08:43:36,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-07-25 08:43:36,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2018-07-25 08:43:36,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-07-25 08:43:36,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 214 transitions. [2018-07-25 08:43:36,487 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 214 transitions. Word has length 212 [2018-07-25 08:43:36,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:43:36,488 INFO L472 AbstractCegarLoop]: Abstraction has 214 states and 214 transitions. [2018-07-25 08:43:36,488 INFO L473 AbstractCegarLoop]: Interpolant automaton has 212 states. [2018-07-25 08:43:36,488 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 214 transitions. [2018-07-25 08:43:36,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-07-25 08:43:36,488 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:43:36,488 INFO L354 BasicCegarLoop]: trace histogram [210, 1, 1, 1] [2018-07-25 08:43:36,488 INFO L415 AbstractCegarLoop]: === Iteration 211 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:43:36,488 INFO L82 PathProgramCache]: Analyzing trace with hash 251366689, now seen corresponding path program 210 times [2018-07-25 08:43:36,489 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:43:36,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:43:37,472 INFO L134 CoverageAnalysis]: Checked inductivity of 22155 backedges. 0 proven. 22155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:43:37,472 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:43:37,472 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [212] total 212 [2018-07-25 08:43:37,473 INFO L451 AbstractCegarLoop]: Interpolant automaton has 213 states [2018-07-25 08:43:37,475 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 213 interpolants. [2018-07-25 08:43:37,477 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22578, Invalid=22578, Unknown=0, NotChecked=0, Total=45156 [2018-07-25 08:43:37,477 INFO L87 Difference]: Start difference. First operand 214 states and 214 transitions. Second operand 213 states. [2018-07-25 08:43:38,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:43:38,382 INFO L93 Difference]: Finished difference Result 217 states and 217 transitions. [2018-07-25 08:43:38,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 213 states. [2018-07-25 08:43:38,383 INFO L78 Accepts]: Start accepts. Automaton has 213 states. Word has length 213 [2018-07-25 08:43:38,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:43:38,383 INFO L225 Difference]: With dead ends: 217 [2018-07-25 08:43:38,383 INFO L226 Difference]: Without dead ends: 215 [2018-07-25 08:43:38,385 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=22578, Invalid=22578, Unknown=0, NotChecked=0, Total=45156 [2018-07-25 08:43:38,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-07-25 08:43:38,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2018-07-25 08:43:38,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-07-25 08:43:38,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 215 transitions. [2018-07-25 08:43:38,387 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 215 transitions. Word has length 213 [2018-07-25 08:43:38,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:43:38,388 INFO L472 AbstractCegarLoop]: Abstraction has 215 states and 215 transitions. [2018-07-25 08:43:38,388 INFO L473 AbstractCegarLoop]: Interpolant automaton has 213 states. [2018-07-25 08:43:38,388 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 215 transitions. [2018-07-25 08:43:38,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-07-25 08:43:38,388 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:43:38,388 INFO L354 BasicCegarLoop]: trace histogram [211, 1, 1, 1] [2018-07-25 08:43:38,388 INFO L415 AbstractCegarLoop]: === Iteration 212 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:43:38,389 INFO L82 PathProgramCache]: Analyzing trace with hash -797569208, now seen corresponding path program 211 times [2018-07-25 08:43:38,389 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:43:38,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:43:39,373 INFO L134 CoverageAnalysis]: Checked inductivity of 22366 backedges. 0 proven. 22366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:43:39,373 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:43:39,373 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [213] total 213 [2018-07-25 08:43:39,374 INFO L451 AbstractCegarLoop]: Interpolant automaton has 214 states [2018-07-25 08:43:39,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 214 interpolants. [2018-07-25 08:43:39,378 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-07-25 08:43:39,378 INFO L87 Difference]: Start difference. First operand 215 states and 215 transitions. Second operand 214 states. [2018-07-25 08:43:40,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:43:40,673 INFO L93 Difference]: Finished difference Result 218 states and 218 transitions. [2018-07-25 08:43:40,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 214 states. [2018-07-25 08:43:40,673 INFO L78 Accepts]: Start accepts. Automaton has 214 states. Word has length 214 [2018-07-25 08:43:40,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:43:40,674 INFO L225 Difference]: With dead ends: 218 [2018-07-25 08:43:40,674 INFO L226 Difference]: Without dead ends: 216 [2018-07-25 08:43:40,676 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-07-25 08:43:40,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-07-25 08:43:40,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2018-07-25 08:43:40,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-07-25 08:43:40,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 216 transitions. [2018-07-25 08:43:40,678 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 216 transitions. Word has length 214 [2018-07-25 08:43:40,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:43:40,679 INFO L472 AbstractCegarLoop]: Abstraction has 216 states and 216 transitions. [2018-07-25 08:43:40,679 INFO L473 AbstractCegarLoop]: Interpolant automaton has 214 states. [2018-07-25 08:43:40,679 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 216 transitions. [2018-07-25 08:43:40,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-07-25 08:43:40,679 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:43:40,679 INFO L354 BasicCegarLoop]: trace histogram [212, 1, 1, 1] [2018-07-25 08:43:40,679 INFO L415 AbstractCegarLoop]: === Iteration 213 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:43:40,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1045156353, now seen corresponding path program 212 times [2018-07-25 08:43:40,680 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:43:40,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:43:41,658 INFO L134 CoverageAnalysis]: Checked inductivity of 22578 backedges. 0 proven. 22578 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:43:41,658 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:43:41,658 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [214] total 214 [2018-07-25 08:43:41,658 INFO L451 AbstractCegarLoop]: Interpolant automaton has 215 states [2018-07-25 08:43:41,662 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 215 interpolants. [2018-07-25 08:43:41,664 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23005, Invalid=23005, Unknown=0, NotChecked=0, Total=46010 [2018-07-25 08:43:41,664 INFO L87 Difference]: Start difference. First operand 216 states and 216 transitions. Second operand 215 states. [2018-07-25 08:43:42,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:43:42,599 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2018-07-25 08:43:42,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 215 states. [2018-07-25 08:43:42,599 INFO L78 Accepts]: Start accepts. Automaton has 215 states. Word has length 215 [2018-07-25 08:43:42,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:43:42,600 INFO L225 Difference]: With dead ends: 219 [2018-07-25 08:43:42,600 INFO L226 Difference]: Without dead ends: 217 [2018-07-25 08:43:42,602 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=23005, Invalid=23005, Unknown=0, NotChecked=0, Total=46010 [2018-07-25 08:43:42,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-07-25 08:43:42,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2018-07-25 08:43:42,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-07-25 08:43:42,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2018-07-25 08:43:42,604 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 215 [2018-07-25 08:43:42,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:43:42,604 INFO L472 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2018-07-25 08:43:42,604 INFO L473 AbstractCegarLoop]: Interpolant automaton has 215 states. [2018-07-25 08:43:42,604 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2018-07-25 08:43:42,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-07-25 08:43:42,605 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:43:42,605 INFO L354 BasicCegarLoop]: trace histogram [213, 1, 1, 1] [2018-07-25 08:43:42,605 INFO L415 AbstractCegarLoop]: === Iteration 214 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:43:42,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1959893400, now seen corresponding path program 213 times [2018-07-25 08:43:42,605 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:43:42,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:43:43,667 INFO L134 CoverageAnalysis]: Checked inductivity of 22791 backedges. 0 proven. 22791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:43:43,667 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:43:43,667 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [215] total 215 [2018-07-25 08:43:43,668 INFO L451 AbstractCegarLoop]: Interpolant automaton has 216 states [2018-07-25 08:43:43,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 216 interpolants. [2018-07-25 08:43:43,672 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2018-07-25 08:43:43,673 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 216 states. [2018-07-25 08:43:44,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:43:44,077 INFO L93 Difference]: Finished difference Result 220 states and 220 transitions. [2018-07-25 08:43:44,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 216 states. [2018-07-25 08:43:44,077 INFO L78 Accepts]: Start accepts. Automaton has 216 states. Word has length 216 [2018-07-25 08:43:44,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:43:44,078 INFO L225 Difference]: With dead ends: 220 [2018-07-25 08:43:44,078 INFO L226 Difference]: Without dead ends: 218 [2018-07-25 08:43:44,079 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2018-07-25 08:43:44,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-07-25 08:43:44,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2018-07-25 08:43:44,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-07-25 08:43:44,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 218 transitions. [2018-07-25 08:43:44,081 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 218 transitions. Word has length 216 [2018-07-25 08:43:44,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:43:44,081 INFO L472 AbstractCegarLoop]: Abstraction has 218 states and 218 transitions. [2018-07-25 08:43:44,081 INFO L473 AbstractCegarLoop]: Interpolant automaton has 216 states. [2018-07-25 08:43:44,081 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 218 transitions. [2018-07-25 08:43:44,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-07-25 08:43:44,082 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:43:44,082 INFO L354 BasicCegarLoop]: trace histogram [214, 1, 1, 1] [2018-07-25 08:43:44,082 INFO L415 AbstractCegarLoop]: === Iteration 215 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:43:44,082 INFO L82 PathProgramCache]: Analyzing trace with hash -627155231, now seen corresponding path program 214 times [2018-07-25 08:43:44,082 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:43:44,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:43:45,075 INFO L134 CoverageAnalysis]: Checked inductivity of 23005 backedges. 0 proven. 23005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:43:45,076 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:43:45,076 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [216] total 216 [2018-07-25 08:43:45,076 INFO L451 AbstractCegarLoop]: Interpolant automaton has 217 states [2018-07-25 08:43:45,079 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 217 interpolants. [2018-07-25 08:43:45,080 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23436, Invalid=23436, Unknown=0, NotChecked=0, Total=46872 [2018-07-25 08:43:45,081 INFO L87 Difference]: Start difference. First operand 218 states and 218 transitions. Second operand 217 states. [2018-07-25 08:43:45,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:43:45,825 INFO L93 Difference]: Finished difference Result 221 states and 221 transitions. [2018-07-25 08:43:45,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 217 states. [2018-07-25 08:43:45,825 INFO L78 Accepts]: Start accepts. Automaton has 217 states. Word has length 217 [2018-07-25 08:43:45,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:43:45,825 INFO L225 Difference]: With dead ends: 221 [2018-07-25 08:43:45,825 INFO L226 Difference]: Without dead ends: 219 [2018-07-25 08:43:45,827 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=23436, Invalid=23436, Unknown=0, NotChecked=0, Total=46872 [2018-07-25 08:43:45,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-07-25 08:43:45,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-07-25 08:43:45,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-07-25 08:43:45,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 219 transitions. [2018-07-25 08:43:45,830 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 219 transitions. Word has length 217 [2018-07-25 08:43:45,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:43:45,830 INFO L472 AbstractCegarLoop]: Abstraction has 219 states and 219 transitions. [2018-07-25 08:43:45,830 INFO L473 AbstractCegarLoop]: Interpolant automaton has 217 states. [2018-07-25 08:43:45,830 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 219 transitions. [2018-07-25 08:43:45,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-07-25 08:43:45,831 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:43:45,831 INFO L354 BasicCegarLoop]: trace histogram [215, 1, 1, 1] [2018-07-25 08:43:45,831 INFO L415 AbstractCegarLoop]: === Iteration 216 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:43:45,831 INFO L82 PathProgramCache]: Analyzing trace with hash 2033022344, now seen corresponding path program 215 times [2018-07-25 08:43:45,831 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:43:45,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:43:46,878 INFO L134 CoverageAnalysis]: Checked inductivity of 23220 backedges. 0 proven. 23220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:43:46,879 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:43:46,879 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [217] total 217 [2018-07-25 08:43:46,879 INFO L451 AbstractCegarLoop]: Interpolant automaton has 218 states [2018-07-25 08:43:46,882 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 218 interpolants. [2018-07-25 08:43:46,884 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2018-07-25 08:43:46,884 INFO L87 Difference]: Start difference. First operand 219 states and 219 transitions. Second operand 218 states. [2018-07-25 08:43:48,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:43:48,317 INFO L93 Difference]: Finished difference Result 222 states and 222 transitions. [2018-07-25 08:43:48,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 218 states. [2018-07-25 08:43:48,317 INFO L78 Accepts]: Start accepts. Automaton has 218 states. Word has length 218 [2018-07-25 08:43:48,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:43:48,318 INFO L225 Difference]: With dead ends: 222 [2018-07-25 08:43:48,318 INFO L226 Difference]: Without dead ends: 220 [2018-07-25 08:43:48,320 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2018-07-25 08:43:48,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-07-25 08:43:48,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2018-07-25 08:43:48,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-07-25 08:43:48,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 220 transitions. [2018-07-25 08:43:48,322 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 220 transitions. Word has length 218 [2018-07-25 08:43:48,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:43:48,322 INFO L472 AbstractCegarLoop]: Abstraction has 220 states and 220 transitions. [2018-07-25 08:43:48,322 INFO L473 AbstractCegarLoop]: Interpolant automaton has 218 states. [2018-07-25 08:43:48,323 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 220 transitions. [2018-07-25 08:43:48,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-07-25 08:43:48,323 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:43:48,323 INFO L354 BasicCegarLoop]: trace histogram [216, 1, 1, 1] [2018-07-25 08:43:48,323 INFO L415 AbstractCegarLoop]: === Iteration 217 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:43:48,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1400818751, now seen corresponding path program 216 times [2018-07-25 08:43:48,324 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:43:48,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:43:49,376 INFO L134 CoverageAnalysis]: Checked inductivity of 23436 backedges. 0 proven. 23436 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:43:49,376 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:43:49,376 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [218] total 218 [2018-07-25 08:43:49,376 INFO L451 AbstractCegarLoop]: Interpolant automaton has 219 states [2018-07-25 08:43:49,379 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 219 interpolants. [2018-07-25 08:43:49,380 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23871, Invalid=23871, Unknown=0, NotChecked=0, Total=47742 [2018-07-25 08:43:49,380 INFO L87 Difference]: Start difference. First operand 220 states and 220 transitions. Second operand 219 states. [2018-07-25 08:43:50,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:43:50,360 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2018-07-25 08:43:50,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2018-07-25 08:43:50,360 INFO L78 Accepts]: Start accepts. Automaton has 219 states. Word has length 219 [2018-07-25 08:43:50,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:43:50,361 INFO L225 Difference]: With dead ends: 223 [2018-07-25 08:43:50,361 INFO L226 Difference]: Without dead ends: 221 [2018-07-25 08:43:50,362 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=23871, Invalid=23871, Unknown=0, NotChecked=0, Total=47742 [2018-07-25 08:43:50,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-07-25 08:43:50,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2018-07-25 08:43:50,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-07-25 08:43:50,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2018-07-25 08:43:50,364 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 219 [2018-07-25 08:43:50,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:43:50,365 INFO L472 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2018-07-25 08:43:50,365 INFO L473 AbstractCegarLoop]: Interpolant automaton has 219 states. [2018-07-25 08:43:50,365 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2018-07-25 08:43:50,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-07-25 08:43:50,365 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:43:50,365 INFO L354 BasicCegarLoop]: trace histogram [217, 1, 1, 1] [2018-07-25 08:43:50,365 INFO L415 AbstractCegarLoop]: === Iteration 218 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:43:50,366 INFO L82 PathProgramCache]: Analyzing trace with hash -475710296, now seen corresponding path program 217 times [2018-07-25 08:43:50,366 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:43:50,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:43:51,424 INFO L134 CoverageAnalysis]: Checked inductivity of 23653 backedges. 0 proven. 23653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:43:51,424 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:43:51,424 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [219] total 219 [2018-07-25 08:43:51,425 INFO L451 AbstractCegarLoop]: Interpolant automaton has 220 states [2018-07-25 08:43:51,428 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 220 interpolants. [2018-07-25 08:43:51,430 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2018-07-25 08:43:51,430 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 220 states. [2018-07-25 08:43:52,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:43:52,258 INFO L93 Difference]: Finished difference Result 224 states and 224 transitions. [2018-07-25 08:43:52,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 220 states. [2018-07-25 08:43:52,258 INFO L78 Accepts]: Start accepts. Automaton has 220 states. Word has length 220 [2018-07-25 08:43:52,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:43:52,259 INFO L225 Difference]: With dead ends: 224 [2018-07-25 08:43:52,259 INFO L226 Difference]: Without dead ends: 222 [2018-07-25 08:43:52,261 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2018-07-25 08:43:52,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-07-25 08:43:52,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2018-07-25 08:43:52,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-07-25 08:43:52,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 222 transitions. [2018-07-25 08:43:52,263 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 222 transitions. Word has length 220 [2018-07-25 08:43:52,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:43:52,263 INFO L472 AbstractCegarLoop]: Abstraction has 222 states and 222 transitions. [2018-07-25 08:43:52,263 INFO L473 AbstractCegarLoop]: Interpolant automaton has 220 states. [2018-07-25 08:43:52,263 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 222 transitions. [2018-07-25 08:43:52,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-07-25 08:43:52,264 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:43:52,264 INFO L354 BasicCegarLoop]: trace histogram [218, 1, 1, 1] [2018-07-25 08:43:52,264 INFO L415 AbstractCegarLoop]: === Iteration 219 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:43:52,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1862119263, now seen corresponding path program 218 times [2018-07-25 08:43:52,264 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:43:52,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:43:53,349 INFO L134 CoverageAnalysis]: Checked inductivity of 23871 backedges. 0 proven. 23871 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:43:53,349 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:43:53,349 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [220] total 220 [2018-07-25 08:43:53,349 INFO L451 AbstractCegarLoop]: Interpolant automaton has 221 states [2018-07-25 08:43:53,353 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 221 interpolants. [2018-07-25 08:43:53,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24310, Invalid=24310, Unknown=0, NotChecked=0, Total=48620 [2018-07-25 08:43:53,355 INFO L87 Difference]: Start difference. First operand 222 states and 222 transitions. Second operand 221 states. [2018-07-25 08:43:55,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:43:55,343 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2018-07-25 08:43:55,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 221 states. [2018-07-25 08:43:55,343 INFO L78 Accepts]: Start accepts. Automaton has 221 states. Word has length 221 [2018-07-25 08:43:55,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:43:55,344 INFO L225 Difference]: With dead ends: 225 [2018-07-25 08:43:55,344 INFO L226 Difference]: Without dead ends: 223 [2018-07-25 08:43:55,346 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=24310, Invalid=24310, Unknown=0, NotChecked=0, Total=48620 [2018-07-25 08:43:55,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-07-25 08:43:55,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-07-25 08:43:55,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-07-25 08:43:55,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 223 transitions. [2018-07-25 08:43:55,349 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 223 transitions. Word has length 221 [2018-07-25 08:43:55,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:43:55,349 INFO L472 AbstractCegarLoop]: Abstraction has 223 states and 223 transitions. [2018-07-25 08:43:55,349 INFO L473 AbstractCegarLoop]: Interpolant automaton has 221 states. [2018-07-25 08:43:55,349 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 223 transitions. [2018-07-25 08:43:55,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-07-25 08:43:55,350 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:43:55,350 INFO L354 BasicCegarLoop]: trace histogram [219, 1, 1, 1] [2018-07-25 08:43:55,350 INFO L415 AbstractCegarLoop]: === Iteration 220 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:43:55,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1891124280, now seen corresponding path program 219 times [2018-07-25 08:43:55,350 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:43:55,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:43:56,631 INFO L134 CoverageAnalysis]: Checked inductivity of 24090 backedges. 0 proven. 24090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:43:56,631 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:43:56,631 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [221] total 221 [2018-07-25 08:43:56,631 INFO L451 AbstractCegarLoop]: Interpolant automaton has 222 states [2018-07-25 08:43:56,635 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 222 interpolants. [2018-07-25 08:43:56,637 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2018-07-25 08:43:56,637 INFO L87 Difference]: Start difference. First operand 223 states and 223 transitions. Second operand 222 states. [2018-07-25 08:43:57,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:43:57,332 INFO L93 Difference]: Finished difference Result 226 states and 226 transitions. [2018-07-25 08:43:57,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 222 states. [2018-07-25 08:43:57,332 INFO L78 Accepts]: Start accepts. Automaton has 222 states. Word has length 222 [2018-07-25 08:43:57,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:43:57,333 INFO L225 Difference]: With dead ends: 226 [2018-07-25 08:43:57,333 INFO L226 Difference]: Without dead ends: 224 [2018-07-25 08:43:57,335 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2018-07-25 08:43:57,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-07-25 08:43:57,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2018-07-25 08:43:57,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-07-25 08:43:57,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 224 transitions. [2018-07-25 08:43:57,339 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 224 transitions. Word has length 222 [2018-07-25 08:43:57,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:43:57,340 INFO L472 AbstractCegarLoop]: Abstraction has 224 states and 224 transitions. [2018-07-25 08:43:57,340 INFO L473 AbstractCegarLoop]: Interpolant automaton has 222 states. [2018-07-25 08:43:57,340 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 224 transitions. [2018-07-25 08:43:57,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-07-25 08:43:57,341 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:43:57,341 INFO L354 BasicCegarLoop]: trace histogram [220, 1, 1, 1] [2018-07-25 08:43:57,341 INFO L415 AbstractCegarLoop]: === Iteration 221 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:43:57,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1504687489, now seen corresponding path program 220 times [2018-07-25 08:43:57,341 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:43:57,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:43:58,697 INFO L134 CoverageAnalysis]: Checked inductivity of 24310 backedges. 0 proven. 24310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:43:58,697 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:43:58,697 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [222] total 222 [2018-07-25 08:43:58,697 INFO L451 AbstractCegarLoop]: Interpolant automaton has 223 states [2018-07-25 08:43:58,701 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 223 interpolants. [2018-07-25 08:43:58,703 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24753, Invalid=24753, Unknown=0, NotChecked=0, Total=49506 [2018-07-25 08:43:58,703 INFO L87 Difference]: Start difference. First operand 224 states and 224 transitions. Second operand 223 states. [2018-07-25 08:43:59,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:43:59,756 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2018-07-25 08:43:59,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 223 states. [2018-07-25 08:43:59,756 INFO L78 Accepts]: Start accepts. Automaton has 223 states. Word has length 223 [2018-07-25 08:43:59,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:43:59,756 INFO L225 Difference]: With dead ends: 227 [2018-07-25 08:43:59,757 INFO L226 Difference]: Without dead ends: 225 [2018-07-25 08:43:59,759 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=24753, Invalid=24753, Unknown=0, NotChecked=0, Total=49506 [2018-07-25 08:43:59,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-07-25 08:43:59,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2018-07-25 08:43:59,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-07-25 08:43:59,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2018-07-25 08:43:59,761 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 223 [2018-07-25 08:43:59,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:43:59,761 INFO L472 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2018-07-25 08:43:59,761 INFO L473 AbstractCegarLoop]: Interpolant automaton has 223 states. [2018-07-25 08:43:59,762 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2018-07-25 08:43:59,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-07-25 08:43:59,762 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:43:59,762 INFO L354 BasicCegarLoop]: trace histogram [221, 1, 1, 1] [2018-07-25 08:43:59,762 INFO L415 AbstractCegarLoop]: === Iteration 222 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:43:59,762 INFO L82 PathProgramCache]: Analyzing trace with hash -599330072, now seen corresponding path program 221 times [2018-07-25 08:43:59,762 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:43:59,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:44:00,858 INFO L134 CoverageAnalysis]: Checked inductivity of 24531 backedges. 0 proven. 24531 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:44:00,858 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:44:00,858 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [223] total 223 [2018-07-25 08:44:00,859 INFO L451 AbstractCegarLoop]: Interpolant automaton has 224 states [2018-07-25 08:44:00,861 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 224 interpolants. [2018-07-25 08:44:00,862 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24976, Invalid=24976, Unknown=0, NotChecked=0, Total=49952 [2018-07-25 08:44:00,862 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 224 states. [2018-07-25 08:44:02,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:44:02,321 INFO L93 Difference]: Finished difference Result 228 states and 228 transitions. [2018-07-25 08:44:02,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 224 states. [2018-07-25 08:44:02,321 INFO L78 Accepts]: Start accepts. Automaton has 224 states. Word has length 224 [2018-07-25 08:44:02,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:44:02,322 INFO L225 Difference]: With dead ends: 228 [2018-07-25 08:44:02,322 INFO L226 Difference]: Without dead ends: 226 [2018-07-25 08:44:02,323 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=24976, Invalid=24976, Unknown=0, NotChecked=0, Total=49952 [2018-07-25 08:44:02,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-07-25 08:44:02,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2018-07-25 08:44:02,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-07-25 08:44:02,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 226 transitions. [2018-07-25 08:44:02,326 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 226 transitions. Word has length 224 [2018-07-25 08:44:02,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:44:02,326 INFO L472 AbstractCegarLoop]: Abstraction has 226 states and 226 transitions. [2018-07-25 08:44:02,326 INFO L473 AbstractCegarLoop]: Interpolant automaton has 224 states. [2018-07-25 08:44:02,326 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 226 transitions. [2018-07-25 08:44:02,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-07-25 08:44:02,326 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:44:02,327 INFO L354 BasicCegarLoop]: trace histogram [222, 1, 1, 1] [2018-07-25 08:44:02,327 INFO L415 AbstractCegarLoop]: === Iteration 223 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:44:02,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1399365023, now seen corresponding path program 222 times [2018-07-25 08:44:02,327 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:44:02,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:44:03,424 INFO L134 CoverageAnalysis]: Checked inductivity of 24753 backedges. 0 proven. 24753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:44:03,425 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:44:03,425 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [224] total 224 [2018-07-25 08:44:03,425 INFO L451 AbstractCegarLoop]: Interpolant automaton has 225 states [2018-07-25 08:44:03,428 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 225 interpolants. [2018-07-25 08:44:03,430 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25200, Invalid=25200, Unknown=0, NotChecked=0, Total=50400 [2018-07-25 08:44:03,430 INFO L87 Difference]: Start difference. First operand 226 states and 226 transitions. Second operand 225 states. [2018-07-25 08:44:04,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:44:04,332 INFO L93 Difference]: Finished difference Result 229 states and 229 transitions. [2018-07-25 08:44:04,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 225 states. [2018-07-25 08:44:04,332 INFO L78 Accepts]: Start accepts. Automaton has 225 states. Word has length 225 [2018-07-25 08:44:04,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:44:04,333 INFO L225 Difference]: With dead ends: 229 [2018-07-25 08:44:04,333 INFO L226 Difference]: Without dead ends: 227 [2018-07-25 08:44:04,335 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=25200, Invalid=25200, Unknown=0, NotChecked=0, Total=50400 [2018-07-25 08:44:04,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-07-25 08:44:04,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2018-07-25 08:44:04,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-07-25 08:44:04,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2018-07-25 08:44:04,338 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 225 [2018-07-25 08:44:04,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:44:04,338 INFO L472 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2018-07-25 08:44:04,338 INFO L473 AbstractCegarLoop]: Interpolant automaton has 225 states. [2018-07-25 08:44:04,338 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2018-07-25 08:44:04,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-07-25 08:44:04,339 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:44:04,339 INFO L354 BasicCegarLoop]: trace histogram [223, 1, 1, 1] [2018-07-25 08:44:04,339 INFO L415 AbstractCegarLoop]: === Iteration 224 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:44:04,339 INFO L82 PathProgramCache]: Analyzing trace with hash -430644728, now seen corresponding path program 223 times [2018-07-25 08:44:04,339 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:44:04,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:44:05,488 INFO L134 CoverageAnalysis]: Checked inductivity of 24976 backedges. 0 proven. 24976 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:44:05,489 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:44:05,489 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [225] total 225 [2018-07-25 08:44:05,489 INFO L451 AbstractCegarLoop]: Interpolant automaton has 226 states [2018-07-25 08:44:05,491 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 226 interpolants. [2018-07-25 08:44:05,492 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25425, Invalid=25425, Unknown=0, NotChecked=0, Total=50850 [2018-07-25 08:44:05,492 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 226 states. [2018-07-25 08:44:07,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:44:07,019 INFO L93 Difference]: Finished difference Result 230 states and 230 transitions. [2018-07-25 08:44:07,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 226 states. [2018-07-25 08:44:07,020 INFO L78 Accepts]: Start accepts. Automaton has 226 states. Word has length 226 [2018-07-25 08:44:07,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:44:07,020 INFO L225 Difference]: With dead ends: 230 [2018-07-25 08:44:07,020 INFO L226 Difference]: Without dead ends: 228 [2018-07-25 08:44:07,021 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=25425, Invalid=25425, Unknown=0, NotChecked=0, Total=50850 [2018-07-25 08:44:07,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-07-25 08:44:07,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2018-07-25 08:44:07,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-07-25 08:44:07,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 228 transitions. [2018-07-25 08:44:07,024 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 228 transitions. Word has length 226 [2018-07-25 08:44:07,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:44:07,024 INFO L472 AbstractCegarLoop]: Abstraction has 228 states and 228 transitions. [2018-07-25 08:44:07,024 INFO L473 AbstractCegarLoop]: Interpolant automaton has 226 states. [2018-07-25 08:44:07,024 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 228 transitions. [2018-07-25 08:44:07,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-07-25 08:44:07,025 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:44:07,025 INFO L354 BasicCegarLoop]: trace histogram [224, 1, 1, 1] [2018-07-25 08:44:07,025 INFO L415 AbstractCegarLoop]: === Iteration 225 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:44:07,025 INFO L82 PathProgramCache]: Analyzing trace with hash -465086655, now seen corresponding path program 224 times [2018-07-25 08:44:07,025 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:44:07,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:44:08,145 INFO L134 CoverageAnalysis]: Checked inductivity of 25200 backedges. 0 proven. 25200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:44:08,146 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:44:08,146 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [226] total 226 [2018-07-25 08:44:08,146 INFO L451 AbstractCegarLoop]: Interpolant automaton has 227 states [2018-07-25 08:44:08,150 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 227 interpolants. [2018-07-25 08:44:08,152 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25651, Invalid=25651, Unknown=0, NotChecked=0, Total=51302 [2018-07-25 08:44:08,152 INFO L87 Difference]: Start difference. First operand 228 states and 228 transitions. Second operand 227 states. [2018-07-25 08:44:08,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:44:08,584 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2018-07-25 08:44:08,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 227 states. [2018-07-25 08:44:08,584 INFO L78 Accepts]: Start accepts. Automaton has 227 states. Word has length 227 [2018-07-25 08:44:08,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:44:08,585 INFO L225 Difference]: With dead ends: 231 [2018-07-25 08:44:08,585 INFO L226 Difference]: Without dead ends: 229 [2018-07-25 08:44:08,587 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=25651, Invalid=25651, Unknown=0, NotChecked=0, Total=51302 [2018-07-25 08:44:08,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-07-25 08:44:08,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2018-07-25 08:44:08,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-07-25 08:44:08,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2018-07-25 08:44:08,590 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 227 [2018-07-25 08:44:08,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:44:08,590 INFO L472 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2018-07-25 08:44:08,590 INFO L473 AbstractCegarLoop]: Interpolant automaton has 227 states. [2018-07-25 08:44:08,590 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2018-07-25 08:44:08,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-07-25 08:44:08,590 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:44:08,591 INFO L354 BasicCegarLoop]: trace histogram [225, 1, 1, 1] [2018-07-25 08:44:08,591 INFO L415 AbstractCegarLoop]: === Iteration 226 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:44:08,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1532786392, now seen corresponding path program 225 times [2018-07-25 08:44:08,591 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:44:08,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:44:09,802 INFO L134 CoverageAnalysis]: Checked inductivity of 25425 backedges. 0 proven. 25425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:44:09,803 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:44:09,803 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [227] total 227 [2018-07-25 08:44:09,803 INFO L451 AbstractCegarLoop]: Interpolant automaton has 228 states [2018-07-25 08:44:09,805 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 228 interpolants. [2018-07-25 08:44:09,806 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25878, Invalid=25878, Unknown=0, NotChecked=0, Total=51756 [2018-07-25 08:44:09,806 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 228 states. [2018-07-25 08:44:11,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:44:11,305 INFO L93 Difference]: Finished difference Result 232 states and 232 transitions. [2018-07-25 08:44:11,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 228 states. [2018-07-25 08:44:11,305 INFO L78 Accepts]: Start accepts. Automaton has 228 states. Word has length 228 [2018-07-25 08:44:11,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:44:11,305 INFO L225 Difference]: With dead ends: 232 [2018-07-25 08:44:11,305 INFO L226 Difference]: Without dead ends: 230 [2018-07-25 08:44:11,306 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=25878, Invalid=25878, Unknown=0, NotChecked=0, Total=51756 [2018-07-25 08:44:11,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-07-25 08:44:11,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2018-07-25 08:44:11,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-07-25 08:44:11,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 230 transitions. [2018-07-25 08:44:11,309 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 230 transitions. Word has length 228 [2018-07-25 08:44:11,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:44:11,309 INFO L472 AbstractCegarLoop]: Abstraction has 230 states and 230 transitions. [2018-07-25 08:44:11,309 INFO L473 AbstractCegarLoop]: Interpolant automaton has 228 states. [2018-07-25 08:44:11,309 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 230 transitions. [2018-07-25 08:44:11,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-07-25 08:44:11,310 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:44:11,310 INFO L354 BasicCegarLoop]: trace histogram [226, 1, 1, 1] [2018-07-25 08:44:11,310 INFO L415 AbstractCegarLoop]: === Iteration 227 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:44:11,310 INFO L82 PathProgramCache]: Analyzing trace with hash -271739871, now seen corresponding path program 226 times [2018-07-25 08:44:11,310 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:44:11,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:44:12,449 INFO L134 CoverageAnalysis]: Checked inductivity of 25651 backedges. 0 proven. 25651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:44:12,449 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:44:12,450 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [228] total 228 [2018-07-25 08:44:12,450 INFO L451 AbstractCegarLoop]: Interpolant automaton has 229 states [2018-07-25 08:44:12,453 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 229 interpolants. [2018-07-25 08:44:12,455 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26106, Invalid=26106, Unknown=0, NotChecked=0, Total=52212 [2018-07-25 08:44:12,455 INFO L87 Difference]: Start difference. First operand 230 states and 230 transitions. Second operand 229 states. [2018-07-25 08:44:13,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:44:13,493 INFO L93 Difference]: Finished difference Result 233 states and 233 transitions. [2018-07-25 08:44:13,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 229 states. [2018-07-25 08:44:13,493 INFO L78 Accepts]: Start accepts. Automaton has 229 states. Word has length 229 [2018-07-25 08:44:13,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:44:13,494 INFO L225 Difference]: With dead ends: 233 [2018-07-25 08:44:13,494 INFO L226 Difference]: Without dead ends: 231 [2018-07-25 08:44:13,496 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=26106, Invalid=26106, Unknown=0, NotChecked=0, Total=52212 [2018-07-25 08:44:13,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-07-25 08:44:13,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2018-07-25 08:44:13,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-07-25 08:44:13,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2018-07-25 08:44:13,499 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 229 [2018-07-25 08:44:13,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:44:13,499 INFO L472 AbstractCegarLoop]: Abstraction has 231 states and 231 transitions. [2018-07-25 08:44:13,499 INFO L473 AbstractCegarLoop]: Interpolant automaton has 229 states. [2018-07-25 08:44:13,499 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 231 transitions. [2018-07-25 08:44:13,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-07-25 08:44:13,500 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:44:13,500 INFO L354 BasicCegarLoop]: trace histogram [227, 1, 1, 1] [2018-07-25 08:44:13,500 INFO L415 AbstractCegarLoop]: === Iteration 228 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:44:13,500 INFO L82 PathProgramCache]: Analyzing trace with hash 165996616, now seen corresponding path program 227 times [2018-07-25 08:44:13,500 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:44:13,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:44:14,677 INFO L134 CoverageAnalysis]: Checked inductivity of 25878 backedges. 0 proven. 25878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:44:14,678 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:44:14,678 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [229] total 229 [2018-07-25 08:44:14,678 INFO L451 AbstractCegarLoop]: Interpolant automaton has 230 states [2018-07-25 08:44:14,682 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 230 interpolants. [2018-07-25 08:44:14,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26335, Invalid=26335, Unknown=0, NotChecked=0, Total=52670 [2018-07-25 08:44:14,684 INFO L87 Difference]: Start difference. First operand 231 states and 231 transitions. Second operand 230 states. [2018-07-25 08:44:16,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:44:16,242 INFO L93 Difference]: Finished difference Result 234 states and 234 transitions. [2018-07-25 08:44:16,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 230 states. [2018-07-25 08:44:16,242 INFO L78 Accepts]: Start accepts. Automaton has 230 states. Word has length 230 [2018-07-25 08:44:16,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:44:16,242 INFO L225 Difference]: With dead ends: 234 [2018-07-25 08:44:16,242 INFO L226 Difference]: Without dead ends: 232 [2018-07-25 08:44:16,244 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=26335, Invalid=26335, Unknown=0, NotChecked=0, Total=52670 [2018-07-25 08:44:16,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-07-25 08:44:16,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2018-07-25 08:44:16,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-07-25 08:44:16,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 232 transitions. [2018-07-25 08:44:16,246 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 232 transitions. Word has length 230 [2018-07-25 08:44:16,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:44:16,247 INFO L472 AbstractCegarLoop]: Abstraction has 232 states and 232 transitions. [2018-07-25 08:44:16,247 INFO L473 AbstractCegarLoop]: Interpolant automaton has 230 states. [2018-07-25 08:44:16,247 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 232 transitions. [2018-07-25 08:44:16,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-07-25 08:44:16,247 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:44:16,247 INFO L354 BasicCegarLoop]: trace histogram [228, 1, 1, 1] [2018-07-25 08:44:16,248 INFO L415 AbstractCegarLoop]: === Iteration 229 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:44:16,248 INFO L82 PathProgramCache]: Analyzing trace with hash 850925825, now seen corresponding path program 228 times [2018-07-25 08:44:16,248 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:44:16,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:44:17,427 INFO L134 CoverageAnalysis]: Checked inductivity of 26106 backedges. 0 proven. 26106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:44:17,427 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:44:17,427 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [230] total 230 [2018-07-25 08:44:17,427 INFO L451 AbstractCegarLoop]: Interpolant automaton has 231 states [2018-07-25 08:44:17,431 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 231 interpolants. [2018-07-25 08:44:17,433 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26565, Invalid=26565, Unknown=0, NotChecked=0, Total=53130 [2018-07-25 08:44:17,433 INFO L87 Difference]: Start difference. First operand 232 states and 232 transitions. Second operand 231 states. [2018-07-25 08:44:17,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:44:17,892 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2018-07-25 08:44:17,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 231 states. [2018-07-25 08:44:17,892 INFO L78 Accepts]: Start accepts. Automaton has 231 states. Word has length 231 [2018-07-25 08:44:17,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:44:17,892 INFO L225 Difference]: With dead ends: 235 [2018-07-25 08:44:17,893 INFO L226 Difference]: Without dead ends: 233 [2018-07-25 08:44:17,896 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=26565, Invalid=26565, Unknown=0, NotChecked=0, Total=53130 [2018-07-25 08:44:17,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-07-25 08:44:17,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2018-07-25 08:44:17,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-07-25 08:44:17,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2018-07-25 08:44:17,898 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 231 [2018-07-25 08:44:17,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:44:17,899 INFO L472 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2018-07-25 08:44:17,899 INFO L473 AbstractCegarLoop]: Interpolant automaton has 231 states. [2018-07-25 08:44:17,899 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2018-07-25 08:44:17,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-07-25 08:44:17,899 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:44:17,899 INFO L354 BasicCegarLoop]: trace histogram [229, 1, 1, 1] [2018-07-25 08:44:17,900 INFO L415 AbstractCegarLoop]: === Iteration 230 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:44:17,900 INFO L82 PathProgramCache]: Analyzing trace with hash 608894824, now seen corresponding path program 229 times [2018-07-25 08:44:17,900 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:44:17,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:44:19,091 INFO L134 CoverageAnalysis]: Checked inductivity of 26335 backedges. 0 proven. 26335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:44:19,091 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:44:19,091 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [231] total 231 [2018-07-25 08:44:19,091 INFO L451 AbstractCegarLoop]: Interpolant automaton has 232 states [2018-07-25 08:44:19,095 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 232 interpolants. [2018-07-25 08:44:19,097 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26796, Invalid=26796, Unknown=0, NotChecked=0, Total=53592 [2018-07-25 08:44:19,097 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 232 states. [2018-07-25 08:44:20,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:44:20,741 INFO L93 Difference]: Finished difference Result 236 states and 236 transitions. [2018-07-25 08:44:20,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 232 states. [2018-07-25 08:44:20,741 INFO L78 Accepts]: Start accepts. Automaton has 232 states. Word has length 232 [2018-07-25 08:44:20,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:44:20,741 INFO L225 Difference]: With dead ends: 236 [2018-07-25 08:44:20,741 INFO L226 Difference]: Without dead ends: 234 [2018-07-25 08:44:20,744 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=26796, Invalid=26796, Unknown=0, NotChecked=0, Total=53592 [2018-07-25 08:44:20,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-07-25 08:44:20,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2018-07-25 08:44:20,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-07-25 08:44:20,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 234 transitions. [2018-07-25 08:44:20,746 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 234 transitions. Word has length 232 [2018-07-25 08:44:20,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:44:20,747 INFO L472 AbstractCegarLoop]: Abstraction has 234 states and 234 transitions. [2018-07-25 08:44:20,747 INFO L473 AbstractCegarLoop]: Interpolant automaton has 232 states. [2018-07-25 08:44:20,747 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 234 transitions. [2018-07-25 08:44:20,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-07-25 08:44:20,747 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:44:20,747 INFO L354 BasicCegarLoop]: trace histogram [230, 1, 1, 1] [2018-07-25 08:44:20,748 INFO L415 AbstractCegarLoop]: === Iteration 231 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:44:20,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1695868385, now seen corresponding path program 230 times [2018-07-25 08:44:20,748 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:44:20,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:44:21,939 INFO L134 CoverageAnalysis]: Checked inductivity of 26565 backedges. 0 proven. 26565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:44:21,940 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:44:21,940 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [232] total 232 [2018-07-25 08:44:21,940 INFO L451 AbstractCegarLoop]: Interpolant automaton has 233 states [2018-07-25 08:44:21,944 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 233 interpolants. [2018-07-25 08:44:21,945 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27028, Invalid=27028, Unknown=0, NotChecked=0, Total=54056 [2018-07-25 08:44:21,945 INFO L87 Difference]: Start difference. First operand 234 states and 234 transitions. Second operand 233 states. [2018-07-25 08:44:23,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:44:23,071 INFO L93 Difference]: Finished difference Result 237 states and 237 transitions. [2018-07-25 08:44:23,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 233 states. [2018-07-25 08:44:23,071 INFO L78 Accepts]: Start accepts. Automaton has 233 states. Word has length 233 [2018-07-25 08:44:23,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:44:23,071 INFO L225 Difference]: With dead ends: 237 [2018-07-25 08:44:23,071 INFO L226 Difference]: Without dead ends: 235 [2018-07-25 08:44:23,073 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 231 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=27028, Invalid=27028, Unknown=0, NotChecked=0, Total=54056 [2018-07-25 08:44:23,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-07-25 08:44:23,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2018-07-25 08:44:23,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-07-25 08:44:23,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 235 transitions. [2018-07-25 08:44:23,076 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 235 transitions. Word has length 233 [2018-07-25 08:44:23,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:44:23,076 INFO L472 AbstractCegarLoop]: Abstraction has 235 states and 235 transitions. [2018-07-25 08:44:23,076 INFO L473 AbstractCegarLoop]: Interpolant automaton has 233 states. [2018-07-25 08:44:23,076 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 235 transitions. [2018-07-25 08:44:23,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-07-25 08:44:23,077 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:44:23,077 INFO L354 BasicCegarLoop]: trace histogram [231, 1, 1, 1] [2018-07-25 08:44:23,077 INFO L415 AbstractCegarLoop]: === Iteration 232 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:44:23,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1032310408, now seen corresponding path program 231 times [2018-07-25 08:44:23,077 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:44:23,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:44:24,264 INFO L134 CoverageAnalysis]: Checked inductivity of 26796 backedges. 0 proven. 26796 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:44:24,264 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:44:24,264 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [233] total 233 [2018-07-25 08:44:24,264 INFO L451 AbstractCegarLoop]: Interpolant automaton has 234 states [2018-07-25 08:44:24,268 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 234 interpolants. [2018-07-25 08:44:24,269 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27261, Invalid=27261, Unknown=0, NotChecked=0, Total=54522 [2018-07-25 08:44:24,270 INFO L87 Difference]: Start difference. First operand 235 states and 235 transitions. Second operand 234 states. [2018-07-25 08:44:25,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:44:25,153 INFO L93 Difference]: Finished difference Result 238 states and 238 transitions. [2018-07-25 08:44:25,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 234 states. [2018-07-25 08:44:25,153 INFO L78 Accepts]: Start accepts. Automaton has 234 states. Word has length 234 [2018-07-25 08:44:25,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:44:25,154 INFO L225 Difference]: With dead ends: 238 [2018-07-25 08:44:25,154 INFO L226 Difference]: Without dead ends: 236 [2018-07-25 08:44:25,157 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=27261, Invalid=27261, Unknown=0, NotChecked=0, Total=54522 [2018-07-25 08:44:25,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-07-25 08:44:25,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2018-07-25 08:44:25,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-07-25 08:44:25,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 236 transitions. [2018-07-25 08:44:25,160 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 236 transitions. Word has length 234 [2018-07-25 08:44:25,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:44:25,160 INFO L472 AbstractCegarLoop]: Abstraction has 236 states and 236 transitions. [2018-07-25 08:44:25,160 INFO L473 AbstractCegarLoop]: Interpolant automaton has 234 states. [2018-07-25 08:44:25,160 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 236 transitions. [2018-07-25 08:44:25,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-07-25 08:44:25,161 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:44:25,161 INFO L354 BasicCegarLoop]: trace histogram [232, 1, 1, 1] [2018-07-25 08:44:25,161 INFO L415 AbstractCegarLoop]: === Iteration 233 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:44:25,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1936849601, now seen corresponding path program 232 times [2018-07-25 08:44:25,161 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:44:25,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:44:26,360 INFO L134 CoverageAnalysis]: Checked inductivity of 27028 backedges. 0 proven. 27028 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:44:26,361 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:44:26,361 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [234] total 234 [2018-07-25 08:44:26,361 INFO L451 AbstractCegarLoop]: Interpolant automaton has 235 states [2018-07-25 08:44:26,364 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 235 interpolants. [2018-07-25 08:44:26,366 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27495, Invalid=27495, Unknown=0, NotChecked=0, Total=54990 [2018-07-25 08:44:26,366 INFO L87 Difference]: Start difference. First operand 236 states and 236 transitions. Second operand 235 states. [2018-07-25 08:44:27,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:44:27,814 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2018-07-25 08:44:27,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 235 states. [2018-07-25 08:44:27,815 INFO L78 Accepts]: Start accepts. Automaton has 235 states. Word has length 235 [2018-07-25 08:44:27,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:44:27,815 INFO L225 Difference]: With dead ends: 239 [2018-07-25 08:44:27,815 INFO L226 Difference]: Without dead ends: 237 [2018-07-25 08:44:27,817 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=27495, Invalid=27495, Unknown=0, NotChecked=0, Total=54990 [2018-07-25 08:44:27,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-07-25 08:44:27,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2018-07-25 08:44:27,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-07-25 08:44:27,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2018-07-25 08:44:27,820 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 235 [2018-07-25 08:44:27,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:44:27,820 INFO L472 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2018-07-25 08:44:27,820 INFO L473 AbstractCegarLoop]: Interpolant automaton has 235 states. [2018-07-25 08:44:27,820 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2018-07-25 08:44:27,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-07-25 08:44:27,820 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:44:27,821 INFO L354 BasicCegarLoop]: trace histogram [233, 1, 1, 1] [2018-07-25 08:44:27,821 INFO L415 AbstractCegarLoop]: === Iteration 234 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:44:27,821 INFO L82 PathProgramCache]: Analyzing trace with hash -87206488, now seen corresponding path program 233 times [2018-07-25 08:44:27,821 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:44:27,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:44:29,071 INFO L134 CoverageAnalysis]: Checked inductivity of 27261 backedges. 0 proven. 27261 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:44:29,071 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:44:29,071 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [235] total 235 [2018-07-25 08:44:29,072 INFO L451 AbstractCegarLoop]: Interpolant automaton has 236 states [2018-07-25 08:44:29,076 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 236 interpolants. [2018-07-25 08:44:29,078 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27730, Invalid=27730, Unknown=0, NotChecked=0, Total=55460 [2018-07-25 08:44:29,079 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 236 states. [2018-07-25 08:44:30,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:44:30,307 INFO L93 Difference]: Finished difference Result 240 states and 240 transitions. [2018-07-25 08:44:30,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 236 states. [2018-07-25 08:44:30,307 INFO L78 Accepts]: Start accepts. Automaton has 236 states. Word has length 236 [2018-07-25 08:44:30,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:44:30,307 INFO L225 Difference]: With dead ends: 240 [2018-07-25 08:44:30,308 INFO L226 Difference]: Without dead ends: 238 [2018-07-25 08:44:30,310 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=27730, Invalid=27730, Unknown=0, NotChecked=0, Total=55460 [2018-07-25 08:44:30,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-07-25 08:44:30,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2018-07-25 08:44:30,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-07-25 08:44:30,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 238 transitions. [2018-07-25 08:44:30,312 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 238 transitions. Word has length 236 [2018-07-25 08:44:30,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:44:30,313 INFO L472 AbstractCegarLoop]: Abstraction has 238 states and 238 transitions. [2018-07-25 08:44:30,313 INFO L473 AbstractCegarLoop]: Interpolant automaton has 236 states. [2018-07-25 08:44:30,313 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 238 transitions. [2018-07-25 08:44:30,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-07-25 08:44:30,313 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:44:30,313 INFO L354 BasicCegarLoop]: trace histogram [234, 1, 1, 1] [2018-07-25 08:44:30,314 INFO L415 AbstractCegarLoop]: === Iteration 235 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:44:30,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1591564193, now seen corresponding path program 234 times [2018-07-25 08:44:30,314 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:44:30,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:44:31,542 INFO L134 CoverageAnalysis]: Checked inductivity of 27495 backedges. 0 proven. 27495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:44:31,543 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:44:31,543 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [236] total 236 [2018-07-25 08:44:31,543 INFO L451 AbstractCegarLoop]: Interpolant automaton has 237 states [2018-07-25 08:44:31,547 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 237 interpolants. [2018-07-25 08:44:31,549 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27966, Invalid=27966, Unknown=0, NotChecked=0, Total=55932 [2018-07-25 08:44:31,549 INFO L87 Difference]: Start difference. First operand 238 states and 238 transitions. Second operand 237 states. [2018-07-25 08:44:32,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:44:32,938 INFO L93 Difference]: Finished difference Result 241 states and 241 transitions. [2018-07-25 08:44:32,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 237 states. [2018-07-25 08:44:32,938 INFO L78 Accepts]: Start accepts. Automaton has 237 states. Word has length 237 [2018-07-25 08:44:32,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:44:32,939 INFO L225 Difference]: With dead ends: 241 [2018-07-25 08:44:32,939 INFO L226 Difference]: Without dead ends: 239 [2018-07-25 08:44:32,941 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=27966, Invalid=27966, Unknown=0, NotChecked=0, Total=55932 [2018-07-25 08:44:32,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-07-25 08:44:32,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2018-07-25 08:44:32,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-07-25 08:44:32,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 239 transitions. [2018-07-25 08:44:32,944 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 239 transitions. Word has length 237 [2018-07-25 08:44:32,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:44:32,944 INFO L472 AbstractCegarLoop]: Abstraction has 239 states and 239 transitions. [2018-07-25 08:44:32,944 INFO L473 AbstractCegarLoop]: Interpolant automaton has 237 states. [2018-07-25 08:44:32,944 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 239 transitions. [2018-07-25 08:44:32,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-07-25 08:44:32,945 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:44:32,945 INFO L354 BasicCegarLoop]: trace histogram [235, 1, 1, 1] [2018-07-25 08:44:32,945 INFO L415 AbstractCegarLoop]: === Iteration 236 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:44:32,945 INFO L82 PathProgramCache]: Analyzing trace with hash 2093847752, now seen corresponding path program 235 times [2018-07-25 08:44:32,945 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:44:32,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:44:34,211 INFO L134 CoverageAnalysis]: Checked inductivity of 27730 backedges. 0 proven. 27730 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:44:34,211 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:44:34,211 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [237] total 237 [2018-07-25 08:44:34,211 INFO L451 AbstractCegarLoop]: Interpolant automaton has 238 states [2018-07-25 08:44:34,215 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 238 interpolants. [2018-07-25 08:44:34,217 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28203, Invalid=28203, Unknown=0, NotChecked=0, Total=56406 [2018-07-25 08:44:34,217 INFO L87 Difference]: Start difference. First operand 239 states and 239 transitions. Second operand 238 states. [2018-07-25 08:44:35,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:44:35,802 INFO L93 Difference]: Finished difference Result 242 states and 242 transitions. [2018-07-25 08:44:35,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 238 states. [2018-07-25 08:44:35,802 INFO L78 Accepts]: Start accepts. Automaton has 238 states. Word has length 238 [2018-07-25 08:44:35,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:44:35,802 INFO L225 Difference]: With dead ends: 242 [2018-07-25 08:44:35,802 INFO L226 Difference]: Without dead ends: 240 [2018-07-25 08:44:35,805 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=28203, Invalid=28203, Unknown=0, NotChecked=0, Total=56406 [2018-07-25 08:44:35,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-07-25 08:44:35,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2018-07-25 08:44:35,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-07-25 08:44:35,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 240 transitions. [2018-07-25 08:44:35,807 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 240 transitions. Word has length 238 [2018-07-25 08:44:35,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:44:35,808 INFO L472 AbstractCegarLoop]: Abstraction has 240 states and 240 transitions. [2018-07-25 08:44:35,808 INFO L473 AbstractCegarLoop]: Interpolant automaton has 238 states. [2018-07-25 08:44:35,808 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 240 transitions. [2018-07-25 08:44:35,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-07-25 08:44:35,808 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:44:35,808 INFO L354 BasicCegarLoop]: trace histogram [236, 1, 1, 1] [2018-07-25 08:44:35,808 INFO L415 AbstractCegarLoop]: === Iteration 237 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:44:35,809 INFO L82 PathProgramCache]: Analyzing trace with hash 484768897, now seen corresponding path program 236 times [2018-07-25 08:44:35,809 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:44:35,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:44:37,069 INFO L134 CoverageAnalysis]: Checked inductivity of 27966 backedges. 0 proven. 27966 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:44:37,069 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:44:37,069 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [238] total 238 [2018-07-25 08:44:37,070 INFO L451 AbstractCegarLoop]: Interpolant automaton has 239 states [2018-07-25 08:44:37,074 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 239 interpolants. [2018-07-25 08:44:37,077 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28441, Invalid=28441, Unknown=0, NotChecked=0, Total=56882 [2018-07-25 08:44:37,077 INFO L87 Difference]: Start difference. First operand 240 states and 240 transitions. Second operand 239 states. [2018-07-25 08:44:38,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:44:38,326 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2018-07-25 08:44:38,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 239 states. [2018-07-25 08:44:38,326 INFO L78 Accepts]: Start accepts. Automaton has 239 states. Word has length 239 [2018-07-25 08:44:38,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:44:38,327 INFO L225 Difference]: With dead ends: 243 [2018-07-25 08:44:38,327 INFO L226 Difference]: Without dead ends: 241 [2018-07-25 08:44:38,330 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=28441, Invalid=28441, Unknown=0, NotChecked=0, Total=56882 [2018-07-25 08:44:38,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-07-25 08:44:38,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2018-07-25 08:44:38,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-07-25 08:44:38,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2018-07-25 08:44:38,332 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 239 [2018-07-25 08:44:38,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:44:38,332 INFO L472 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2018-07-25 08:44:38,333 INFO L473 AbstractCegarLoop]: Interpolant automaton has 239 states. [2018-07-25 08:44:38,333 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2018-07-25 08:44:38,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-07-25 08:44:38,333 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:44:38,333 INFO L354 BasicCegarLoop]: trace histogram [237, 1, 1, 1] [2018-07-25 08:44:38,333 INFO L415 AbstractCegarLoop]: === Iteration 238 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:44:38,334 INFO L82 PathProgramCache]: Analyzing trace with hash 2142931944, now seen corresponding path program 237 times [2018-07-25 08:44:38,334 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:44:38,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:44:39,679 INFO L134 CoverageAnalysis]: Checked inductivity of 28203 backedges. 0 proven. 28203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:44:39,679 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:44:39,679 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [239] total 239 [2018-07-25 08:44:39,679 INFO L451 AbstractCegarLoop]: Interpolant automaton has 240 states [2018-07-25 08:44:39,681 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 240 interpolants. [2018-07-25 08:44:39,682 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28680, Invalid=28680, Unknown=0, NotChecked=0, Total=57360 [2018-07-25 08:44:39,682 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 240 states. [2018-07-25 08:44:40,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:44:40,598 INFO L93 Difference]: Finished difference Result 244 states and 244 transitions. [2018-07-25 08:44:40,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 240 states. [2018-07-25 08:44:40,599 INFO L78 Accepts]: Start accepts. Automaton has 240 states. Word has length 240 [2018-07-25 08:44:40,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:44:40,599 INFO L225 Difference]: With dead ends: 244 [2018-07-25 08:44:40,599 INFO L226 Difference]: Without dead ends: 242 [2018-07-25 08:44:40,600 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=28680, Invalid=28680, Unknown=0, NotChecked=0, Total=57360 [2018-07-25 08:44:40,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-07-25 08:44:40,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2018-07-25 08:44:40,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-07-25 08:44:40,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 242 transitions. [2018-07-25 08:44:40,603 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 242 transitions. Word has length 240 [2018-07-25 08:44:40,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:44:40,603 INFO L472 AbstractCegarLoop]: Abstraction has 242 states and 242 transitions. [2018-07-25 08:44:40,603 INFO L473 AbstractCegarLoop]: Interpolant automaton has 240 states. [2018-07-25 08:44:40,603 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 242 transitions. [2018-07-25 08:44:40,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-07-25 08:44:40,604 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:44:40,604 INFO L354 BasicCegarLoop]: trace histogram [238, 1, 1, 1] [2018-07-25 08:44:40,604 INFO L415 AbstractCegarLoop]: === Iteration 239 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:44:40,604 INFO L82 PathProgramCache]: Analyzing trace with hash 2006378849, now seen corresponding path program 238 times [2018-07-25 08:44:40,604 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:44:40,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:44:41,973 INFO L134 CoverageAnalysis]: Checked inductivity of 28441 backedges. 0 proven. 28441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:44:41,974 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:44:41,974 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [240] total 240 [2018-07-25 08:44:41,974 INFO L451 AbstractCegarLoop]: Interpolant automaton has 241 states [2018-07-25 08:44:41,978 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 241 interpolants. [2018-07-25 08:44:41,980 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28920, Invalid=28920, Unknown=0, NotChecked=0, Total=57840 [2018-07-25 08:44:41,980 INFO L87 Difference]: Start difference. First operand 242 states and 242 transitions. Second operand 241 states. [2018-07-25 08:44:43,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:44:43,999 INFO L93 Difference]: Finished difference Result 245 states and 245 transitions. [2018-07-25 08:44:43,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 241 states. [2018-07-25 08:44:43,999 INFO L78 Accepts]: Start accepts. Automaton has 241 states. Word has length 241 [2018-07-25 08:44:43,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:44:44,000 INFO L225 Difference]: With dead ends: 245 [2018-07-25 08:44:44,000 INFO L226 Difference]: Without dead ends: 243 [2018-07-25 08:44:44,002 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=28920, Invalid=28920, Unknown=0, NotChecked=0, Total=57840 [2018-07-25 08:44:44,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-07-25 08:44:44,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2018-07-25 08:44:44,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-07-25 08:44:44,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 243 transitions. [2018-07-25 08:44:44,005 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 243 transitions. Word has length 241 [2018-07-25 08:44:44,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:44:44,005 INFO L472 AbstractCegarLoop]: Abstraction has 243 states and 243 transitions. [2018-07-25 08:44:44,005 INFO L473 AbstractCegarLoop]: Interpolant automaton has 241 states. [2018-07-25 08:44:44,005 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 243 transitions. [2018-07-25 08:44:44,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-07-25 08:44:44,006 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:44:44,006 INFO L354 BasicCegarLoop]: trace histogram [239, 1, 1, 1] [2018-07-25 08:44:44,006 INFO L415 AbstractCegarLoop]: === Iteration 240 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:44:44,006 INFO L82 PathProgramCache]: Analyzing trace with hash 2068200200, now seen corresponding path program 239 times [2018-07-25 08:44:44,006 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:44:44,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:44:45,364 INFO L134 CoverageAnalysis]: Checked inductivity of 28680 backedges. 0 proven. 28680 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:44:45,365 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:44:45,365 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [241] total 241 [2018-07-25 08:44:45,365 INFO L451 AbstractCegarLoop]: Interpolant automaton has 242 states [2018-07-25 08:44:45,367 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 242 interpolants. [2018-07-25 08:44:45,368 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29161, Invalid=29161, Unknown=0, NotChecked=0, Total=58322 [2018-07-25 08:44:45,368 INFO L87 Difference]: Start difference. First operand 243 states and 243 transitions. Second operand 242 states. [2018-07-25 08:44:46,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:44:46,797 INFO L93 Difference]: Finished difference Result 246 states and 246 transitions. [2018-07-25 08:44:46,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 242 states. [2018-07-25 08:44:46,797 INFO L78 Accepts]: Start accepts. Automaton has 242 states. Word has length 242 [2018-07-25 08:44:46,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:44:46,798 INFO L225 Difference]: With dead ends: 246 [2018-07-25 08:44:46,798 INFO L226 Difference]: Without dead ends: 244 [2018-07-25 08:44:46,799 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=29161, Invalid=29161, Unknown=0, NotChecked=0, Total=58322 [2018-07-25 08:44:46,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-07-25 08:44:46,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2018-07-25 08:44:46,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-07-25 08:44:46,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 244 transitions. [2018-07-25 08:44:46,802 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 244 transitions. Word has length 242 [2018-07-25 08:44:46,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:44:46,802 INFO L472 AbstractCegarLoop]: Abstraction has 244 states and 244 transitions. [2018-07-25 08:44:46,802 INFO L473 AbstractCegarLoop]: Interpolant automaton has 242 states. [2018-07-25 08:44:46,802 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 244 transitions. [2018-07-25 08:44:46,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-07-25 08:44:46,803 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:44:46,803 INFO L354 BasicCegarLoop]: trace histogram [240, 1, 1, 1] [2018-07-25 08:44:46,803 INFO L415 AbstractCegarLoop]: === Iteration 241 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:44:46,803 INFO L82 PathProgramCache]: Analyzing trace with hash -310305215, now seen corresponding path program 240 times [2018-07-25 08:44:46,803 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:44:46,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:44:48,116 INFO L134 CoverageAnalysis]: Checked inductivity of 28920 backedges. 0 proven. 28920 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:44:48,116 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:44:48,116 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [242] total 242 [2018-07-25 08:44:48,116 INFO L451 AbstractCegarLoop]: Interpolant automaton has 243 states [2018-07-25 08:44:48,120 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 243 interpolants. [2018-07-25 08:44:48,122 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29403, Invalid=29403, Unknown=0, NotChecked=0, Total=58806 [2018-07-25 08:44:48,122 INFO L87 Difference]: Start difference. First operand 244 states and 244 transitions. Second operand 243 states. [2018-07-25 08:44:48,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:44:48,680 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2018-07-25 08:44:48,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 243 states. [2018-07-25 08:44:48,680 INFO L78 Accepts]: Start accepts. Automaton has 243 states. Word has length 243 [2018-07-25 08:44:48,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:44:48,681 INFO L225 Difference]: With dead ends: 247 [2018-07-25 08:44:48,681 INFO L226 Difference]: Without dead ends: 245 [2018-07-25 08:44:48,683 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=29403, Invalid=29403, Unknown=0, NotChecked=0, Total=58806 [2018-07-25 08:44:48,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-07-25 08:44:48,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2018-07-25 08:44:48,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-07-25 08:44:48,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2018-07-25 08:44:48,686 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 243 [2018-07-25 08:44:48,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:44:48,686 INFO L472 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2018-07-25 08:44:48,686 INFO L473 AbstractCegarLoop]: Interpolant automaton has 243 states. [2018-07-25 08:44:48,686 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2018-07-25 08:44:48,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-07-25 08:44:48,687 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:44:48,687 INFO L354 BasicCegarLoop]: trace histogram [241, 1, 1, 1] [2018-07-25 08:44:48,687 INFO L415 AbstractCegarLoop]: === Iteration 242 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:44:48,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1029529048, now seen corresponding path program 241 times [2018-07-25 08:44:48,687 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:44:48,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:44:50,075 INFO L134 CoverageAnalysis]: Checked inductivity of 29161 backedges. 0 proven. 29161 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:44:50,075 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:44:50,075 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [243] total 243 [2018-07-25 08:44:50,076 INFO L451 AbstractCegarLoop]: Interpolant automaton has 244 states [2018-07-25 08:44:50,078 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 244 interpolants. [2018-07-25 08:44:50,079 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29646, Invalid=29646, Unknown=0, NotChecked=0, Total=59292 [2018-07-25 08:44:50,080 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 244 states. [2018-07-25 08:44:51,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:44:51,753 INFO L93 Difference]: Finished difference Result 248 states and 248 transitions. [2018-07-25 08:44:51,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 244 states. [2018-07-25 08:44:51,753 INFO L78 Accepts]: Start accepts. Automaton has 244 states. Word has length 244 [2018-07-25 08:44:51,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:44:51,753 INFO L225 Difference]: With dead ends: 248 [2018-07-25 08:44:51,753 INFO L226 Difference]: Without dead ends: 246 [2018-07-25 08:44:51,755 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 242 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=29646, Invalid=29646, Unknown=0, NotChecked=0, Total=59292 [2018-07-25 08:44:51,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-07-25 08:44:51,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2018-07-25 08:44:51,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-07-25 08:44:51,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 246 transitions. [2018-07-25 08:44:51,758 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 246 transitions. Word has length 244 [2018-07-25 08:44:51,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:44:51,759 INFO L472 AbstractCegarLoop]: Abstraction has 246 states and 246 transitions. [2018-07-25 08:44:51,759 INFO L473 AbstractCegarLoop]: Interpolant automaton has 244 states. [2018-07-25 08:44:51,759 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 246 transitions. [2018-07-25 08:44:51,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-07-25 08:44:51,759 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:44:51,759 INFO L354 BasicCegarLoop]: trace histogram [242, 1, 1, 1] [2018-07-25 08:44:51,760 INFO L415 AbstractCegarLoop]: === Iteration 243 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:44:51,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1850631391, now seen corresponding path program 242 times [2018-07-25 08:44:51,760 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:44:51,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:44:53,152 INFO L134 CoverageAnalysis]: Checked inductivity of 29403 backedges. 0 proven. 29403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:44:53,152 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:44:53,152 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [244] total 244 [2018-07-25 08:44:53,153 INFO L451 AbstractCegarLoop]: Interpolant automaton has 245 states [2018-07-25 08:44:53,157 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 245 interpolants. [2018-07-25 08:44:53,159 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29890, Invalid=29890, Unknown=0, NotChecked=0, Total=59780 [2018-07-25 08:44:53,159 INFO L87 Difference]: Start difference. First operand 246 states and 246 transitions. Second operand 245 states. [2018-07-25 08:44:54,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:44:54,980 INFO L93 Difference]: Finished difference Result 249 states and 249 transitions. [2018-07-25 08:44:54,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 245 states. [2018-07-25 08:44:54,981 INFO L78 Accepts]: Start accepts. Automaton has 245 states. Word has length 245 [2018-07-25 08:44:54,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:44:54,981 INFO L225 Difference]: With dead ends: 249 [2018-07-25 08:44:54,981 INFO L226 Difference]: Without dead ends: 247 [2018-07-25 08:44:54,985 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 243 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=29890, Invalid=29890, Unknown=0, NotChecked=0, Total=59780 [2018-07-25 08:44:54,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-07-25 08:44:54,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2018-07-25 08:44:54,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-07-25 08:44:54,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 247 transitions. [2018-07-25 08:44:54,989 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 247 transitions. Word has length 245 [2018-07-25 08:44:54,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:44:54,989 INFO L472 AbstractCegarLoop]: Abstraction has 247 states and 247 transitions. [2018-07-25 08:44:54,989 INFO L473 AbstractCegarLoop]: Interpolant automaton has 245 states. [2018-07-25 08:44:54,989 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 247 transitions. [2018-07-25 08:44:54,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-07-25 08:44:54,990 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:44:54,990 INFO L354 BasicCegarLoop]: trace histogram [243, 1, 1, 1] [2018-07-25 08:44:54,990 INFO L415 AbstractCegarLoop]: === Iteration 244 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:44:54,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1535000248, now seen corresponding path program 243 times [2018-07-25 08:44:54,991 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:44:55,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:44:56,393 INFO L134 CoverageAnalysis]: Checked inductivity of 29646 backedges. 0 proven. 29646 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:44:56,393 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:44:56,393 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [245] total 245 [2018-07-25 08:44:56,394 INFO L451 AbstractCegarLoop]: Interpolant automaton has 246 states [2018-07-25 08:44:56,397 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 246 interpolants. [2018-07-25 08:44:56,398 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30135, Invalid=30135, Unknown=0, NotChecked=0, Total=60270 [2018-07-25 08:44:56,398 INFO L87 Difference]: Start difference. First operand 247 states and 247 transitions. Second operand 246 states. [2018-07-25 08:44:58,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:44:58,433 INFO L93 Difference]: Finished difference Result 250 states and 250 transitions. [2018-07-25 08:44:58,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 246 states. [2018-07-25 08:44:58,433 INFO L78 Accepts]: Start accepts. Automaton has 246 states. Word has length 246 [2018-07-25 08:44:58,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:44:58,434 INFO L225 Difference]: With dead ends: 250 [2018-07-25 08:44:58,434 INFO L226 Difference]: Without dead ends: 248 [2018-07-25 08:44:58,436 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=30135, Invalid=30135, Unknown=0, NotChecked=0, Total=60270 [2018-07-25 08:44:58,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-07-25 08:44:58,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2018-07-25 08:44:58,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-07-25 08:44:58,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 248 transitions. [2018-07-25 08:44:58,438 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 248 transitions. Word has length 246 [2018-07-25 08:44:58,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:44:58,438 INFO L472 AbstractCegarLoop]: Abstraction has 248 states and 248 transitions. [2018-07-25 08:44:58,438 INFO L473 AbstractCegarLoop]: Interpolant automaton has 246 states. [2018-07-25 08:44:58,438 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 248 transitions. [2018-07-25 08:44:58,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-07-25 08:44:58,439 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:44:58,439 INFO L354 BasicCegarLoop]: trace histogram [244, 1, 1, 1] [2018-07-25 08:44:58,439 INFO L415 AbstractCegarLoop]: === Iteration 245 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:44:58,439 INFO L82 PathProgramCache]: Analyzing trace with hash -340369407, now seen corresponding path program 244 times [2018-07-25 08:44:58,440 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:44:58,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:44:59,840 INFO L134 CoverageAnalysis]: Checked inductivity of 29890 backedges. 0 proven. 29890 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:44:59,840 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:44:59,841 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [246] total 246 [2018-07-25 08:44:59,841 INFO L451 AbstractCegarLoop]: Interpolant automaton has 247 states [2018-07-25 08:44:59,846 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 247 interpolants. [2018-07-25 08:44:59,849 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30381, Invalid=30381, Unknown=0, NotChecked=0, Total=60762 [2018-07-25 08:44:59,849 INFO L87 Difference]: Start difference. First operand 248 states and 248 transitions. Second operand 247 states. [2018-07-25 08:45:01,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:01,932 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2018-07-25 08:45:01,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 247 states. [2018-07-25 08:45:01,932 INFO L78 Accepts]: Start accepts. Automaton has 247 states. Word has length 247 [2018-07-25 08:45:01,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:01,932 INFO L225 Difference]: With dead ends: 251 [2018-07-25 08:45:01,932 INFO L226 Difference]: Without dead ends: 249 [2018-07-25 08:45:01,935 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=30381, Invalid=30381, Unknown=0, NotChecked=0, Total=60762 [2018-07-25 08:45:01,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-07-25 08:45:01,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2018-07-25 08:45:01,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-07-25 08:45:01,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2018-07-25 08:45:01,938 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 247 [2018-07-25 08:45:01,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:01,938 INFO L472 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2018-07-25 08:45:01,938 INFO L473 AbstractCegarLoop]: Interpolant automaton has 247 states. [2018-07-25 08:45:01,938 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2018-07-25 08:45:01,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-07-25 08:45:01,939 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:01,939 INFO L354 BasicCegarLoop]: trace histogram [245, 1, 1, 1] [2018-07-25 08:45:01,939 INFO L415 AbstractCegarLoop]: === Iteration 246 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:01,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1961519000, now seen corresponding path program 245 times [2018-07-25 08:45:01,939 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:01,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:03,340 INFO L134 CoverageAnalysis]: Checked inductivity of 30135 backedges. 0 proven. 30135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:03,340 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:03,340 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [247] total 247 [2018-07-25 08:45:03,341 INFO L451 AbstractCegarLoop]: Interpolant automaton has 248 states [2018-07-25 08:45:03,344 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 248 interpolants. [2018-07-25 08:45:03,345 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30628, Invalid=30628, Unknown=0, NotChecked=0, Total=61256 [2018-07-25 08:45:03,345 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 248 states. [2018-07-25 08:45:04,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:04,373 INFO L93 Difference]: Finished difference Result 252 states and 252 transitions. [2018-07-25 08:45:04,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 248 states. [2018-07-25 08:45:04,373 INFO L78 Accepts]: Start accepts. Automaton has 248 states. Word has length 248 [2018-07-25 08:45:04,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:04,374 INFO L225 Difference]: With dead ends: 252 [2018-07-25 08:45:04,374 INFO L226 Difference]: Without dead ends: 250 [2018-07-25 08:45:04,376 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=30628, Invalid=30628, Unknown=0, NotChecked=0, Total=61256 [2018-07-25 08:45:04,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-07-25 08:45:04,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2018-07-25 08:45:04,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-07-25 08:45:04,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 250 transitions. [2018-07-25 08:45:04,379 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 250 transitions. Word has length 248 [2018-07-25 08:45:04,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:04,379 INFO L472 AbstractCegarLoop]: Abstraction has 250 states and 250 transitions. [2018-07-25 08:45:04,379 INFO L473 AbstractCegarLoop]: Interpolant automaton has 248 states. [2018-07-25 08:45:04,379 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 250 transitions. [2018-07-25 08:45:04,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-07-25 08:45:04,380 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:04,380 INFO L354 BasicCegarLoop]: trace histogram [246, 1, 1, 1] [2018-07-25 08:45:04,380 INFO L415 AbstractCegarLoop]: === Iteration 247 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:04,380 INFO L82 PathProgramCache]: Analyzing trace with hash -677548831, now seen corresponding path program 246 times [2018-07-25 08:45:04,380 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:04,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:05,809 INFO L134 CoverageAnalysis]: Checked inductivity of 30381 backedges. 0 proven. 30381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:05,810 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:05,810 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [248] total 248 [2018-07-25 08:45:05,810 INFO L451 AbstractCegarLoop]: Interpolant automaton has 249 states [2018-07-25 08:45:05,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 249 interpolants. [2018-07-25 08:45:05,816 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30876, Invalid=30876, Unknown=0, NotChecked=0, Total=61752 [2018-07-25 08:45:05,817 INFO L87 Difference]: Start difference. First operand 250 states and 250 transitions. Second operand 249 states. [2018-07-25 08:45:07,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:07,316 INFO L93 Difference]: Finished difference Result 253 states and 253 transitions. [2018-07-25 08:45:07,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 249 states. [2018-07-25 08:45:07,316 INFO L78 Accepts]: Start accepts. Automaton has 249 states. Word has length 249 [2018-07-25 08:45:07,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:07,317 INFO L225 Difference]: With dead ends: 253 [2018-07-25 08:45:07,317 INFO L226 Difference]: Without dead ends: 251 [2018-07-25 08:45:07,320 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 247 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=30876, Invalid=30876, Unknown=0, NotChecked=0, Total=61752 [2018-07-25 08:45:07,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-07-25 08:45:07,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2018-07-25 08:45:07,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-07-25 08:45:07,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2018-07-25 08:45:07,323 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 249 [2018-07-25 08:45:07,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:07,323 INFO L472 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2018-07-25 08:45:07,323 INFO L473 AbstractCegarLoop]: Interpolant automaton has 249 states. [2018-07-25 08:45:07,323 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2018-07-25 08:45:07,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-07-25 08:45:07,324 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:07,324 INFO L354 BasicCegarLoop]: trace histogram [247, 1, 1, 1] [2018-07-25 08:45:07,324 INFO L415 AbstractCegarLoop]: === Iteration 248 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:07,324 INFO L82 PathProgramCache]: Analyzing trace with hash 470820744, now seen corresponding path program 247 times [2018-07-25 08:45:07,324 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:07,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:08,749 INFO L134 CoverageAnalysis]: Checked inductivity of 30628 backedges. 0 proven. 30628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:08,749 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:08,749 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [249] total 249 [2018-07-25 08:45:08,750 INFO L451 AbstractCegarLoop]: Interpolant automaton has 250 states [2018-07-25 08:45:08,753 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 250 interpolants. [2018-07-25 08:45:08,755 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31125, Invalid=31125, Unknown=0, NotChecked=0, Total=62250 [2018-07-25 08:45:08,755 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 250 states. [2018-07-25 08:45:09,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:09,345 INFO L93 Difference]: Finished difference Result 254 states and 254 transitions. [2018-07-25 08:45:09,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 250 states. [2018-07-25 08:45:09,345 INFO L78 Accepts]: Start accepts. Automaton has 250 states. Word has length 250 [2018-07-25 08:45:09,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:09,345 INFO L225 Difference]: With dead ends: 254 [2018-07-25 08:45:09,346 INFO L226 Difference]: Without dead ends: 252 [2018-07-25 08:45:09,348 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=31125, Invalid=31125, Unknown=0, NotChecked=0, Total=62250 [2018-07-25 08:45:09,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-07-25 08:45:09,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2018-07-25 08:45:09,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-07-25 08:45:09,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 252 transitions. [2018-07-25 08:45:09,350 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 252 transitions. Word has length 250 [2018-07-25 08:45:09,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:09,351 INFO L472 AbstractCegarLoop]: Abstraction has 252 states and 252 transitions. [2018-07-25 08:45:09,351 INFO L473 AbstractCegarLoop]: Interpolant automaton has 250 states. [2018-07-25 08:45:09,351 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 252 transitions. [2018-07-25 08:45:09,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-07-25 08:45:09,351 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:09,351 INFO L354 BasicCegarLoop]: trace histogram [248, 1, 1, 1] [2018-07-25 08:45:09,352 INFO L415 AbstractCegarLoop]: === Iteration 249 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:09,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1710539201, now seen corresponding path program 248 times [2018-07-25 08:45:09,352 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:09,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:10,798 INFO L134 CoverageAnalysis]: Checked inductivity of 30876 backedges. 0 proven. 30876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:10,798 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:10,799 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [250] total 250 [2018-07-25 08:45:10,799 INFO L451 AbstractCegarLoop]: Interpolant automaton has 251 states [2018-07-25 08:45:10,803 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 251 interpolants. [2018-07-25 08:45:10,805 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31375, Invalid=31375, Unknown=0, NotChecked=0, Total=62750 [2018-07-25 08:45:10,805 INFO L87 Difference]: Start difference. First operand 252 states and 252 transitions. Second operand 251 states. [2018-07-25 08:45:12,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:12,482 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2018-07-25 08:45:12,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 251 states. [2018-07-25 08:45:12,482 INFO L78 Accepts]: Start accepts. Automaton has 251 states. Word has length 251 [2018-07-25 08:45:12,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:12,483 INFO L225 Difference]: With dead ends: 255 [2018-07-25 08:45:12,483 INFO L226 Difference]: Without dead ends: 253 [2018-07-25 08:45:12,485 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=31375, Invalid=31375, Unknown=0, NotChecked=0, Total=62750 [2018-07-25 08:45:12,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-07-25 08:45:12,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2018-07-25 08:45:12,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-07-25 08:45:12,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2018-07-25 08:45:12,488 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 251 [2018-07-25 08:45:12,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:12,488 INFO L472 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2018-07-25 08:45:12,488 INFO L473 AbstractCegarLoop]: Interpolant automaton has 251 states. [2018-07-25 08:45:12,488 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2018-07-25 08:45:12,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-07-25 08:45:12,489 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:12,489 INFO L354 BasicCegarLoop]: trace histogram [249, 1, 1, 1] [2018-07-25 08:45:12,489 INFO L415 AbstractCegarLoop]: === Iteration 250 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:12,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1487105704, now seen corresponding path program 249 times [2018-07-25 08:45:12,490 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:12,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:13,935 INFO L134 CoverageAnalysis]: Checked inductivity of 31125 backedges. 0 proven. 31125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:13,936 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:13,936 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [251] total 251 [2018-07-25 08:45:13,936 INFO L451 AbstractCegarLoop]: Interpolant automaton has 252 states [2018-07-25 08:45:13,939 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 252 interpolants. [2018-07-25 08:45:13,941 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31626, Invalid=31626, Unknown=0, NotChecked=0, Total=63252 [2018-07-25 08:45:13,941 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 252 states. [2018-07-25 08:45:14,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:14,707 INFO L93 Difference]: Finished difference Result 256 states and 256 transitions. [2018-07-25 08:45:14,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 252 states. [2018-07-25 08:45:14,707 INFO L78 Accepts]: Start accepts. Automaton has 252 states. Word has length 252 [2018-07-25 08:45:14,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:14,708 INFO L225 Difference]: With dead ends: 256 [2018-07-25 08:45:14,708 INFO L226 Difference]: Without dead ends: 254 [2018-07-25 08:45:14,710 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=31626, Invalid=31626, Unknown=0, NotChecked=0, Total=63252 [2018-07-25 08:45:14,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-07-25 08:45:14,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2018-07-25 08:45:14,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-07-25 08:45:14,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 254 transitions. [2018-07-25 08:45:14,714 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 254 transitions. Word has length 252 [2018-07-25 08:45:14,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:14,714 INFO L472 AbstractCegarLoop]: Abstraction has 254 states and 254 transitions. [2018-07-25 08:45:14,714 INFO L473 AbstractCegarLoop]: Interpolant automaton has 252 states. [2018-07-25 08:45:14,714 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 254 transitions. [2018-07-25 08:45:14,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-07-25 08:45:14,715 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:14,715 INFO L354 BasicCegarLoop]: trace histogram [250, 1, 1, 1] [2018-07-25 08:45:14,715 INFO L415 AbstractCegarLoop]: === Iteration 251 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:14,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1144365407, now seen corresponding path program 250 times [2018-07-25 08:45:14,715 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:14,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:16,443 INFO L134 CoverageAnalysis]: Checked inductivity of 31375 backedges. 0 proven. 31375 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:16,443 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:16,443 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [252] total 252 [2018-07-25 08:45:16,444 INFO L451 AbstractCegarLoop]: Interpolant automaton has 253 states [2018-07-25 08:45:16,448 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 253 interpolants. [2018-07-25 08:45:16,451 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31878, Invalid=31878, Unknown=0, NotChecked=0, Total=63756 [2018-07-25 08:45:16,451 INFO L87 Difference]: Start difference. First operand 254 states and 254 transitions. Second operand 253 states. [2018-07-25 08:45:19,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:19,064 INFO L93 Difference]: Finished difference Result 257 states and 257 transitions. [2018-07-25 08:45:19,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 253 states. [2018-07-25 08:45:19,064 INFO L78 Accepts]: Start accepts. Automaton has 253 states. Word has length 253 [2018-07-25 08:45:19,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:19,064 INFO L225 Difference]: With dead ends: 257 [2018-07-25 08:45:19,064 INFO L226 Difference]: Without dead ends: 255 [2018-07-25 08:45:19,068 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 251 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=31878, Invalid=31878, Unknown=0, NotChecked=0, Total=63756 [2018-07-25 08:45:19,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-07-25 08:45:19,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2018-07-25 08:45:19,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-07-25 08:45:19,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 255 transitions. [2018-07-25 08:45:19,071 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 255 transitions. Word has length 253 [2018-07-25 08:45:19,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:19,071 INFO L472 AbstractCegarLoop]: Abstraction has 255 states and 255 transitions. [2018-07-25 08:45:19,071 INFO L473 AbstractCegarLoop]: Interpolant automaton has 253 states. [2018-07-25 08:45:19,071 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 255 transitions. [2018-07-25 08:45:19,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-07-25 08:45:19,072 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:19,072 INFO L354 BasicCegarLoop]: trace histogram [251, 1, 1, 1] [2018-07-25 08:45:19,072 INFO L415 AbstractCegarLoop]: === Iteration 252 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:19,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1115591224, now seen corresponding path program 251 times [2018-07-25 08:45:19,072 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:19,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:20,778 INFO L134 CoverageAnalysis]: Checked inductivity of 31626 backedges. 0 proven. 31626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:20,778 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:20,779 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [253] total 253 [2018-07-25 08:45:20,779 INFO L451 AbstractCegarLoop]: Interpolant automaton has 254 states [2018-07-25 08:45:20,783 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 254 interpolants. [2018-07-25 08:45:20,786 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32131, Invalid=32131, Unknown=0, NotChecked=0, Total=64262 [2018-07-25 08:45:20,786 INFO L87 Difference]: Start difference. First operand 255 states and 255 transitions. Second operand 254 states. [2018-07-25 08:45:21,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:21,812 INFO L93 Difference]: Finished difference Result 258 states and 258 transitions. [2018-07-25 08:45:21,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 254 states. [2018-07-25 08:45:21,813 INFO L78 Accepts]: Start accepts. Automaton has 254 states. Word has length 254 [2018-07-25 08:45:21,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:21,813 INFO L225 Difference]: With dead ends: 258 [2018-07-25 08:45:21,813 INFO L226 Difference]: Without dead ends: 256 [2018-07-25 08:45:21,817 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=32131, Invalid=32131, Unknown=0, NotChecked=0, Total=64262 [2018-07-25 08:45:21,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-07-25 08:45:21,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2018-07-25 08:45:21,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-07-25 08:45:21,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 256 transitions. [2018-07-25 08:45:21,820 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 256 transitions. Word has length 254 [2018-07-25 08:45:21,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:21,821 INFO L472 AbstractCegarLoop]: Abstraction has 256 states and 256 transitions. [2018-07-25 08:45:21,821 INFO L473 AbstractCegarLoop]: Interpolant automaton has 254 states. [2018-07-25 08:45:21,821 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 256 transitions. [2018-07-25 08:45:21,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-07-25 08:45:21,821 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:21,821 INFO L354 BasicCegarLoop]: trace histogram [252, 1, 1, 1] [2018-07-25 08:45:21,822 INFO L415 AbstractCegarLoop]: === Iteration 253 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:21,822 INFO L82 PathProgramCache]: Analyzing trace with hash -223591551, now seen corresponding path program 252 times [2018-07-25 08:45:21,822 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:21,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:23,574 INFO L134 CoverageAnalysis]: Checked inductivity of 31878 backedges. 0 proven. 31878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:23,574 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:23,574 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [254] total 254 [2018-07-25 08:45:23,575 INFO L451 AbstractCegarLoop]: Interpolant automaton has 255 states [2018-07-25 08:45:23,580 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 255 interpolants. [2018-07-25 08:45:23,582 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32385, Invalid=32385, Unknown=0, NotChecked=0, Total=64770 [2018-07-25 08:45:23,583 INFO L87 Difference]: Start difference. First operand 256 states and 256 transitions. Second operand 255 states. [2018-07-25 08:45:26,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:26,246 INFO L93 Difference]: Finished difference Result 259 states and 259 transitions. [2018-07-25 08:45:26,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 255 states. [2018-07-25 08:45:26,246 INFO L78 Accepts]: Start accepts. Automaton has 255 states. Word has length 255 [2018-07-25 08:45:26,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:26,247 INFO L225 Difference]: With dead ends: 259 [2018-07-25 08:45:26,247 INFO L226 Difference]: Without dead ends: 257 [2018-07-25 08:45:26,250 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=32385, Invalid=32385, Unknown=0, NotChecked=0, Total=64770 [2018-07-25 08:45:26,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-07-25 08:45:26,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2018-07-25 08:45:26,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-07-25 08:45:26,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2018-07-25 08:45:26,253 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 255 [2018-07-25 08:45:26,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:26,253 INFO L472 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2018-07-25 08:45:26,253 INFO L473 AbstractCegarLoop]: Interpolant automaton has 255 states. [2018-07-25 08:45:26,253 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2018-07-25 08:45:26,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-07-25 08:45:26,254 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:26,254 INFO L354 BasicCegarLoop]: trace histogram [253, 1, 1, 1] [2018-07-25 08:45:26,254 INFO L415 AbstractCegarLoop]: === Iteration 254 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:26,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1658594536, now seen corresponding path program 253 times [2018-07-25 08:45:26,254 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:26,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:27,797 INFO L134 CoverageAnalysis]: Checked inductivity of 32131 backedges. 0 proven. 32131 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:27,797 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:27,797 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [255] total 255 [2018-07-25 08:45:27,797 INFO L451 AbstractCegarLoop]: Interpolant automaton has 256 states [2018-07-25 08:45:27,801 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 256 interpolants. [2018-07-25 08:45:27,804 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32640, Invalid=32640, Unknown=0, NotChecked=0, Total=65280 [2018-07-25 08:45:27,804 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 256 states. [2018-07-25 08:45:28,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:28,656 INFO L93 Difference]: Finished difference Result 260 states and 260 transitions. [2018-07-25 08:45:28,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 256 states. [2018-07-25 08:45:28,656 INFO L78 Accepts]: Start accepts. Automaton has 256 states. Word has length 256 [2018-07-25 08:45:28,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:28,656 INFO L225 Difference]: With dead ends: 260 [2018-07-25 08:45:28,657 INFO L226 Difference]: Without dead ends: 258 [2018-07-25 08:45:28,659 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=32640, Invalid=32640, Unknown=0, NotChecked=0, Total=65280 [2018-07-25 08:45:28,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-07-25 08:45:28,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2018-07-25 08:45:28,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-07-25 08:45:28,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 258 transitions. [2018-07-25 08:45:28,662 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 258 transitions. Word has length 256 [2018-07-25 08:45:28,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:28,663 INFO L472 AbstractCegarLoop]: Abstraction has 258 states and 258 transitions. [2018-07-25 08:45:28,663 INFO L473 AbstractCegarLoop]: Interpolant automaton has 256 states. [2018-07-25 08:45:28,663 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 258 transitions. [2018-07-25 08:45:28,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-07-25 08:45:28,663 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:28,663 INFO L354 BasicCegarLoop]: trace histogram [254, 1, 1, 1] [2018-07-25 08:45:28,664 INFO L415 AbstractCegarLoop]: === Iteration 255 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:28,664 INFO L82 PathProgramCache]: Analyzing trace with hash -123178911, now seen corresponding path program 254 times [2018-07-25 08:45:28,664 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:28,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:30,306 INFO L134 CoverageAnalysis]: Checked inductivity of 32385 backedges. 0 proven. 32385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:30,306 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:30,307 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [256] total 256 [2018-07-25 08:45:30,307 INFO L451 AbstractCegarLoop]: Interpolant automaton has 257 states [2018-07-25 08:45:30,309 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 257 interpolants. [2018-07-25 08:45:30,310 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32896, Invalid=32896, Unknown=0, NotChecked=0, Total=65792 [2018-07-25 08:45:30,311 INFO L87 Difference]: Start difference. First operand 258 states and 258 transitions. Second operand 257 states. [2018-07-25 08:45:32,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:32,651 INFO L93 Difference]: Finished difference Result 261 states and 261 transitions. [2018-07-25 08:45:32,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 257 states. [2018-07-25 08:45:32,651 INFO L78 Accepts]: Start accepts. Automaton has 257 states. Word has length 257 [2018-07-25 08:45:32,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:32,652 INFO L225 Difference]: With dead ends: 261 [2018-07-25 08:45:32,652 INFO L226 Difference]: Without dead ends: 259 [2018-07-25 08:45:32,653 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=32896, Invalid=32896, Unknown=0, NotChecked=0, Total=65792 [2018-07-25 08:45:32,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-07-25 08:45:32,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2018-07-25 08:45:32,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-07-25 08:45:32,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 259 transitions. [2018-07-25 08:45:32,656 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 259 transitions. Word has length 257 [2018-07-25 08:45:32,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:32,656 INFO L472 AbstractCegarLoop]: Abstraction has 259 states and 259 transitions. [2018-07-25 08:45:32,656 INFO L473 AbstractCegarLoop]: Interpolant automaton has 257 states. [2018-07-25 08:45:32,656 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 259 transitions. [2018-07-25 08:45:32,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-07-25 08:45:32,657 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:32,657 INFO L354 BasicCegarLoop]: trace histogram [255, 1, 1, 1] [2018-07-25 08:45:32,657 INFO L415 AbstractCegarLoop]: === Iteration 256 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:32,658 INFO L82 PathProgramCache]: Analyzing trace with hash 476419080, now seen corresponding path program 255 times [2018-07-25 08:45:32,658 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:32,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:34,403 INFO L134 CoverageAnalysis]: Checked inductivity of 32640 backedges. 0 proven. 32640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:34,404 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:34,404 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [257] total 257 [2018-07-25 08:45:34,404 INFO L451 AbstractCegarLoop]: Interpolant automaton has 258 states [2018-07-25 08:45:34,410 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 258 interpolants. [2018-07-25 08:45:34,412 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33153, Invalid=33153, Unknown=0, NotChecked=0, Total=66306 [2018-07-25 08:45:34,413 INFO L87 Difference]: Start difference. First operand 259 states and 259 transitions. Second operand 258 states. [2018-07-25 08:45:35,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:35,124 INFO L93 Difference]: Finished difference Result 262 states and 262 transitions. [2018-07-25 08:45:35,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 258 states. [2018-07-25 08:45:35,124 INFO L78 Accepts]: Start accepts. Automaton has 258 states. Word has length 258 [2018-07-25 08:45:35,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:35,125 INFO L225 Difference]: With dead ends: 262 [2018-07-25 08:45:35,125 INFO L226 Difference]: Without dead ends: 260 [2018-07-25 08:45:35,129 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 256 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=33153, Invalid=33153, Unknown=0, NotChecked=0, Total=66306 [2018-07-25 08:45:35,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-07-25 08:45:35,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2018-07-25 08:45:35,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-07-25 08:45:35,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 260 transitions. [2018-07-25 08:45:35,133 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 260 transitions. Word has length 258 [2018-07-25 08:45:35,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:35,133 INFO L472 AbstractCegarLoop]: Abstraction has 260 states and 260 transitions. [2018-07-25 08:45:35,133 INFO L473 AbstractCegarLoop]: Interpolant automaton has 258 states. [2018-07-25 08:45:35,134 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 260 transitions. [2018-07-25 08:45:35,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-07-25 08:45:35,134 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:35,135 INFO L354 BasicCegarLoop]: trace histogram [256, 1, 1, 1] [2018-07-25 08:45:35,135 INFO L415 AbstractCegarLoop]: === Iteration 257 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:35,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1884087617, now seen corresponding path program 256 times [2018-07-25 08:45:35,135 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:35,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:36,769 INFO L134 CoverageAnalysis]: Checked inductivity of 32896 backedges. 0 proven. 32896 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:36,770 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:36,770 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [258] total 258 [2018-07-25 08:45:36,770 INFO L451 AbstractCegarLoop]: Interpolant automaton has 259 states [2018-07-25 08:45:36,774 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 259 interpolants. [2018-07-25 08:45:36,775 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33411, Invalid=33411, Unknown=0, NotChecked=0, Total=66822 [2018-07-25 08:45:36,775 INFO L87 Difference]: Start difference. First operand 260 states and 260 transitions. Second operand 259 states. [2018-07-25 08:45:38,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:38,684 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions. [2018-07-25 08:45:38,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 259 states. [2018-07-25 08:45:38,684 INFO L78 Accepts]: Start accepts. Automaton has 259 states. Word has length 259 [2018-07-25 08:45:38,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:38,684 INFO L225 Difference]: With dead ends: 263 [2018-07-25 08:45:38,685 INFO L226 Difference]: Without dead ends: 261 [2018-07-25 08:45:38,686 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=33411, Invalid=33411, Unknown=0, NotChecked=0, Total=66822 [2018-07-25 08:45:38,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-07-25 08:45:38,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2018-07-25 08:45:38,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-07-25 08:45:38,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2018-07-25 08:45:38,689 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 259 [2018-07-25 08:45:38,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:38,690 INFO L472 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2018-07-25 08:45:38,690 INFO L473 AbstractCegarLoop]: Interpolant automaton has 259 states. [2018-07-25 08:45:38,690 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2018-07-25 08:45:38,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-07-25 08:45:38,691 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:38,691 INFO L354 BasicCegarLoop]: trace histogram [257, 1, 1, 1] [2018-07-25 08:45:38,691 INFO L415 AbstractCegarLoop]: === Iteration 258 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:38,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1722827992, now seen corresponding path program 257 times [2018-07-25 08:45:38,691 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:38,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:40,214 INFO L134 CoverageAnalysis]: Checked inductivity of 33153 backedges. 0 proven. 33153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:40,214 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:40,215 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [259] total 259 [2018-07-25 08:45:40,215 INFO L451 AbstractCegarLoop]: Interpolant automaton has 260 states [2018-07-25 08:45:40,219 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 260 interpolants. [2018-07-25 08:45:40,222 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33670, Invalid=33670, Unknown=0, NotChecked=0, Total=67340 [2018-07-25 08:45:40,222 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 260 states. Received shutdown request... [2018-07-25 08:45:40,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 203 states. [2018-07-25 08:45:40,751 WARN L541 AbstractCegarLoop]: Verification canceled [2018-07-25 08:45:40,756 WARN L202 ceAbstractionStarter]: Timeout [2018-07-25 08:45:40,757 INFO L202 PluginConnector]: Adding new model overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.07 08:45:40 BoogieIcfgContainer [2018-07-25 08:45:40,757 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-25 08:45:40,758 INFO L168 Benchmark]: Toolchain (without parser) took 259741.49 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -7.7 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-07-25 08:45:40,759 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 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:45:40,759 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.07 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:45:40,759 INFO L168 Benchmark]: Boogie Preprocessor took 19.64 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:45:40,759 INFO L168 Benchmark]: RCFGBuilder took 205.03 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:45:40,760 INFO L168 Benchmark]: TraceAbstraction took 259470.13 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -18.2 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-07-25 08:45:40,761 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.21 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 42.07 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 19.64 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 205.03 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 259470.13 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -18.2 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 31]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 31). Cancelled while BasicCegarLoop was constructing difference of abstraction (261states) and interpolant automaton (currently 203 states, 260 states before enhancement), while ReachableStatesComputation was computing reachable states (201 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. TIMEOUT Result, 259.4s OverallTime, 258 OverallIterations, 257 TraceHistogramMax, 109.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 772 SDtfs, 0 SDslu, 17007 SDs, 0 SdLazy, 50617 SolverSat, 495 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 33669 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 33411 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 131.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=261occurred in iteration=257, 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.8s AutomataMinimizationTime, 257 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 3.2s SatisfiabilityAnalysisTime, 140.3s InterpolantComputationTime, 33927 NumberOfCodeBlocks, 33927 NumberOfCodeBlocksAsserted, 258 NumberOfCheckSat, 33669 ConstructedInterpolants, 0 QuantifiedInterpolants, 17407389 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 258 InterpolantComputations, 1 PerfectInterpolantSequences, 0/2862209 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/overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-07-25_08-45-40-769.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-25_08-45-40-769.csv Completed graceful shutdown