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/20170304-DifficultPathPrograms/array2.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-e6fd87c [2018-07-25 13:21:05,583 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-25 13:21:05,586 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-25 13:21:05,599 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-25 13:21:05,599 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-25 13:21:05,600 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-25 13:21:05,602 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-25 13:21:05,603 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-25 13:21:05,605 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-25 13:21:05,606 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-25 13:21:05,607 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-25 13:21:05,607 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-25 13:21:05,608 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-25 13:21:05,609 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-25 13:21:05,610 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-25 13:21:05,611 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-25 13:21:05,612 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-25 13:21:05,614 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-25 13:21:05,619 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-25 13:21:05,620 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-25 13:21:05,621 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-25 13:21:05,623 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-25 13:21:05,626 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-25 13:21:05,626 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-25 13:21:05,626 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-25 13:21:05,627 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-25 13:21:05,630 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-25 13:21:05,631 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-25 13:21:05,634 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-25 13:21:05,637 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-25 13:21:05,637 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-25 13:21:05,638 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-25 13:21:05,638 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-25 13:21:05,638 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-25 13:21:05,640 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-25 13:21:05,641 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-25 13:21:05,642 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-07-25 13:21:05,658 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-25 13:21:05,658 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-25 13:21:05,662 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-25 13:21:05,663 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-25 13:21:05,663 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-25 13:21:05,663 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-25 13:21:05,664 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-25 13:21:05,664 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-25 13:21:05,733 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-25 13:21:05,746 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-25 13:21:05,753 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-25 13:21:05,754 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-25 13:21:05,755 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-25 13:21:05,756 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array2.i_3.bpl [2018-07-25 13:21:05,756 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array2.i_3.bpl' [2018-07-25 13:21:05,817 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-25 13:21:05,818 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-07-25 13:21:05,819 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-25 13:21:05,819 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-25 13:21:05,819 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-25 13:21:05,838 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:21:05" (1/1) ... [2018-07-25 13:21:05,853 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:21:05" (1/1) ... [2018-07-25 13:21:05,861 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-25 13:21:05,862 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-25 13:21:05,862 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-25 13:21:05,862 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-25 13:21:05,873 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:21:05" (1/1) ... [2018-07-25 13:21:05,874 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:21:05" (1/1) ... [2018-07-25 13:21:05,874 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:21:05" (1/1) ... [2018-07-25 13:21:05,875 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:21:05" (1/1) ... [2018-07-25 13:21:05,879 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:21:05" (1/1) ... [2018-07-25 13:21:05,881 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:21:05" (1/1) ... [2018-07-25 13:21:05,882 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:21:05" (1/1) ... [2018-07-25 13:21:05,883 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-25 13:21:05,884 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-25 13:21:05,884 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-25 13:21:05,884 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-25 13:21:05,885 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:21:05" (1/1) ... [2018-07-25 13:21:05,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-25 13:21:05,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-25 13:21:06,115 INFO L273 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-25 13:21:06,116 INFO L202 PluginConnector]: Adding new model array2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:21:06 BoogieIcfgContainer [2018-07-25 13:21:06,116 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-25 13:21:06,117 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-25 13:21:06,118 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-25 13:21:06,122 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-25 13:21:06,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:21:05" (1/2) ... [2018-07-25 13:21:06,124 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24b4f49d and model type array2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.07 01:21:06, skipping insertion in model container [2018-07-25 13:21:06,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:21:06" (2/2) ... [2018-07-25 13:21:06,127 INFO L112 eAbstractionObserver]: Analyzing ICFG array2.i_3.bpl [2018-07-25 13:21:06,137 INFO L133 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-25 13:21:06,146 INFO L145 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-25 13:21:06,199 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-25 13:21:06,200 INFO L374 AbstractCegarLoop]: Interprodecural is true [2018-07-25 13:21:06,201 INFO L375 AbstractCegarLoop]: Hoare is true [2018-07-25 13:21:06,201 INFO L376 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-25 13:21:06,201 INFO L377 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-25 13:21:06,201 INFO L378 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-25 13:21:06,202 INFO L379 AbstractCegarLoop]: Difference is false [2018-07-25 13:21:06,202 INFO L380 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-25 13:21:06,202 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-25 13:21:06,220 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-07-25 13:21:06,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-25 13:21:06,229 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:06,230 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-25 13:21:06,231 INFO L415 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:06,237 INFO L82 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2018-07-25 13:21:06,243 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:06,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:06,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:06,311 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:21:06,312 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-25 13:21:06,317 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 13:21:06,332 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 13:21:06,333 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:21:06,336 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-07-25 13:21:06,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:06,362 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2018-07-25 13:21:06,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 13:21:06,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-07-25 13:21:06,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:06,375 INFO L225 Difference]: With dead ends: 10 [2018-07-25 13:21:06,375 INFO L226 Difference]: Without dead ends: 7 [2018-07-25 13:21:06,379 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 13:21:06,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-07-25 13:21:06,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-07-25 13:21:06,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-07-25 13:21:06,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-07-25 13:21:06,418 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-07-25 13:21:06,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:06,418 INFO L472 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-07-25 13:21:06,418 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 13:21:06,418 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-07-25 13:21:06,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:21:06,419 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:06,419 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-07-25 13:21:06,420 INFO L415 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:06,420 INFO L82 PathProgramCache]: Analyzing trace with hash 889591169, now seen corresponding path program 1 times [2018-07-25 13:21:06,420 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:06,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:06,444 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:06,444 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:06,445 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-25 13:21:06,447 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 13:21:06,448 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 13:21:06,448 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-25 13:21:06,449 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 4 states. [2018-07-25 13:21:06,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:06,471 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-07-25 13:21:06,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 13:21:06,473 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-07-25 13:21:06,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:06,473 INFO L225 Difference]: With dead ends: 11 [2018-07-25 13:21:06,474 INFO L226 Difference]: Without dead ends: 9 [2018-07-25 13:21:06,477 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 13:21:06,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-07-25 13:21:06,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-07-25 13:21:06,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-25 13:21:06,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-07-25 13:21:06,483 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-07-25 13:21:06,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:06,483 INFO L472 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-07-25 13:21:06,483 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 13:21:06,483 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-07-25 13:21:06,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 13:21:06,484 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:06,484 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-07-25 13:21:06,485 INFO L415 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:06,486 INFO L82 PathProgramCache]: Analyzing trace with hash 198673595, now seen corresponding path program 2 times [2018-07-25 13:21:06,486 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:06,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:06,521 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 13:21:06,522 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:06,522 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-25 13:21:06,522 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 13:21:06,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 13:21:06,523 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:21:06,523 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 5 states. [2018-07-25 13:21:06,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:06,540 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-07-25 13:21:06,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-25 13:21:06,541 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-07-25 13:21:06,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:06,542 INFO L225 Difference]: With dead ends: 13 [2018-07-25 13:21:06,542 INFO L226 Difference]: Without dead ends: 11 [2018-07-25 13:21:06,543 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 13:21:06,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-25 13:21:06,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-07-25 13:21:06,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-25 13:21:06,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-07-25 13:21:06,546 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-07-25 13:21:06,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:06,547 INFO L472 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-07-25 13:21:06,547 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 13:21:06,547 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-07-25 13:21:06,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 13:21:06,548 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:06,548 INFO L354 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-07-25 13:21:06,548 INFO L415 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:06,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1946815861, now seen corresponding path program 3 times [2018-07-25 13:21:06,549 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:06,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:06,586 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:06,587 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:06,587 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-25 13:21:06,587 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 13:21:06,588 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 13:21:06,588 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-07-25 13:21:06,589 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 6 states. [2018-07-25 13:21:06,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:06,610 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-07-25 13:21:06,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-25 13:21:06,610 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-07-25 13:21:06,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:06,611 INFO L225 Difference]: With dead ends: 15 [2018-07-25 13:21:06,611 INFO L226 Difference]: Without dead ends: 13 [2018-07-25 13:21:06,612 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 13:21:06,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-07-25 13:21:06,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-07-25 13:21:06,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-25 13:21:06,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-07-25 13:21:06,616 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-07-25 13:21:06,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:06,617 INFO L472 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-07-25 13:21:06,617 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 13:21:06,617 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-07-25 13:21:06,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 13:21:06,618 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:06,618 INFO L354 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-07-25 13:21:06,619 INFO L415 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:06,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1715646545, now seen corresponding path program 4 times [2018-07-25 13:21:06,619 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:06,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:06,696 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:06,699 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:06,700 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 13:21:06,700 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:21:06,701 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:21:06,701 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:21:06,701 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 7 states. [2018-07-25 13:21:06,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:06,746 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-07-25 13:21:06,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-25 13:21:06,746 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-07-25 13:21:06,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:06,747 INFO L225 Difference]: With dead ends: 17 [2018-07-25 13:21:06,747 INFO L226 Difference]: Without dead ends: 15 [2018-07-25 13:21:06,748 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 13:21:06,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-07-25 13:21:06,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-07-25 13:21:06,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-25 13:21:06,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-07-25 13:21:06,756 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-07-25 13:21:06,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:06,757 INFO L472 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-07-25 13:21:06,757 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:21:06,757 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-07-25 13:21:06,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-25 13:21:06,758 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:06,759 INFO L354 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2018-07-25 13:21:06,759 INFO L415 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:06,760 INFO L82 PathProgramCache]: Analyzing trace with hash 531164009, now seen corresponding path program 5 times [2018-07-25 13:21:06,760 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:06,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:06,824 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:06,824 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:06,825 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:21:06,825 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:21:06,825 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:21:06,826 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:21:06,826 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2018-07-25 13:21:06,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:06,853 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-07-25 13:21:06,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-25 13:21:06,853 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-07-25 13:21:06,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:06,854 INFO L225 Difference]: With dead ends: 19 [2018-07-25 13:21:06,854 INFO L226 Difference]: Without dead ends: 17 [2018-07-25 13:21:06,855 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 13:21:06,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-07-25 13:21:06,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-07-25 13:21:06,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-07-25 13:21:06,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-07-25 13:21:06,860 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-07-25 13:21:06,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:06,860 INFO L472 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-07-25 13:21:06,861 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:21:06,861 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-07-25 13:21:06,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 13:21:06,861 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:06,862 INFO L354 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2018-07-25 13:21:06,862 INFO L415 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:06,862 INFO L82 PathProgramCache]: Analyzing trace with hash -652443485, now seen corresponding path program 6 times [2018-07-25 13:21:06,862 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:06,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:06,923 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:06,923 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:06,924 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 13:21:06,924 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:21:06,924 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:21:06,925 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:21:06,925 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 9 states. [2018-07-25 13:21:06,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:06,959 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-07-25 13:21:06,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-25 13:21:06,960 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-07-25 13:21:06,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:06,960 INFO L225 Difference]: With dead ends: 21 [2018-07-25 13:21:06,961 INFO L226 Difference]: Without dead ends: 19 [2018-07-25 13:21:06,961 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 13:21:06,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-07-25 13:21:06,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-07-25 13:21:06,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-07-25 13:21:06,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-07-25 13:21:06,972 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-07-25 13:21:06,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:06,972 INFO L472 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-07-25 13:21:06,972 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:21:06,972 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-07-25 13:21:06,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 13:21:06,973 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:06,975 INFO L354 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2018-07-25 13:21:06,975 INFO L415 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:06,975 INFO L82 PathProgramCache]: Analyzing trace with hash 67088221, now seen corresponding path program 7 times [2018-07-25 13:21:06,975 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:06,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:07,074 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:07,074 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:07,074 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 13:21:07,075 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 13:21:07,075 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 13:21:07,075 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:21:07,076 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 10 states. [2018-07-25 13:21:07,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:07,113 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-07-25 13:21:07,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 13:21:07,120 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-07-25 13:21:07,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:07,121 INFO L225 Difference]: With dead ends: 23 [2018-07-25 13:21:07,121 INFO L226 Difference]: Without dead ends: 21 [2018-07-25 13:21:07,124 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 13:21:07,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-07-25 13:21:07,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-07-25 13:21:07,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-07-25 13:21:07,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-07-25 13:21:07,132 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2018-07-25 13:21:07,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:07,133 INFO L472 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-07-25 13:21:07,133 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 13:21:07,133 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-07-25 13:21:07,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 13:21:07,137 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:07,137 INFO L354 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1] [2018-07-25 13:21:07,137 INFO L415 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:07,138 INFO L82 PathProgramCache]: Analyzing trace with hash 47323031, now seen corresponding path program 8 times [2018-07-25 13:21:07,138 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:07,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:07,218 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:07,219 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:07,219 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:21:07,221 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:21:07,222 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:21:07,222 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:21:07,229 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 11 states. [2018-07-25 13:21:07,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:07,281 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-07-25 13:21:07,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 13:21:07,282 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-07-25 13:21:07,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:07,283 INFO L225 Difference]: With dead ends: 25 [2018-07-25 13:21:07,283 INFO L226 Difference]: Without dead ends: 23 [2018-07-25 13:21:07,286 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 13:21:07,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-07-25 13:21:07,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-07-25 13:21:07,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-07-25 13:21:07,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-07-25 13:21:07,297 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2018-07-25 13:21:07,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:07,298 INFO L472 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-07-25 13:21:07,298 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:21:07,298 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-07-25 13:21:07,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-25 13:21:07,301 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:07,302 INFO L354 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1] [2018-07-25 13:21:07,302 INFO L415 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:07,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1767155375, now seen corresponding path program 9 times [2018-07-25 13:21:07,302 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:07,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:07,369 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:07,369 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:07,369 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:21:07,370 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:21:07,370 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:21:07,370 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:21:07,371 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 12 states. [2018-07-25 13:21:07,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:07,398 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-07-25 13:21:07,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 13:21:07,398 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-07-25 13:21:07,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:07,399 INFO L225 Difference]: With dead ends: 27 [2018-07-25 13:21:07,399 INFO L226 Difference]: Without dead ends: 25 [2018-07-25 13:21:07,400 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 13:21:07,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-07-25 13:21:07,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-07-25 13:21:07,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-07-25 13:21:07,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-07-25 13:21:07,408 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2018-07-25 13:21:07,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:07,409 INFO L472 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-07-25 13:21:07,409 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:21:07,409 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-07-25 13:21:07,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-07-25 13:21:07,410 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:07,410 INFO L354 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1] [2018-07-25 13:21:07,410 INFO L415 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:07,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1724181365, now seen corresponding path program 10 times [2018-07-25 13:21:07,411 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:07,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:07,459 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:07,459 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:07,460 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 13:21:07,460 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 13:21:07,460 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 13:21:07,461 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:21:07,461 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 13 states. [2018-07-25 13:21:07,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:07,496 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-07-25 13:21:07,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 13:21:07,496 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-07-25 13:21:07,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:07,497 INFO L225 Difference]: With dead ends: 29 [2018-07-25 13:21:07,501 INFO L226 Difference]: Without dead ends: 27 [2018-07-25 13:21:07,501 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 13:21:07,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-07-25 13:21:07,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-07-25 13:21:07,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-07-25 13:21:07,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-07-25 13:21:07,517 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2018-07-25 13:21:07,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:07,518 INFO L472 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-07-25 13:21:07,518 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 13:21:07,519 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-07-25 13:21:07,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-07-25 13:21:07,520 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:07,520 INFO L354 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1] [2018-07-25 13:21:07,520 INFO L415 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:07,521 INFO L82 PathProgramCache]: Analyzing trace with hash 919136581, now seen corresponding path program 11 times [2018-07-25 13:21:07,521 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:07,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:07,592 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:07,592 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:07,593 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 13:21:07,593 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 13:21:07,593 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 13:21:07,594 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:21:07,596 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 14 states. [2018-07-25 13:21:07,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:07,626 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-07-25 13:21:07,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 13:21:07,627 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-07-25 13:21:07,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:07,632 INFO L225 Difference]: With dead ends: 31 [2018-07-25 13:21:07,632 INFO L226 Difference]: Without dead ends: 29 [2018-07-25 13:21:07,634 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 13:21:07,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-07-25 13:21:07,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-07-25 13:21:07,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-07-25 13:21:07,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-07-25 13:21:07,643 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2018-07-25 13:21:07,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:07,644 INFO L472 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-07-25 13:21:07,644 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 13:21:07,644 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-07-25 13:21:07,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-07-25 13:21:07,645 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:07,645 INFO L354 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1] [2018-07-25 13:21:07,646 INFO L415 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:07,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1472956545, now seen corresponding path program 12 times [2018-07-25 13:21:07,647 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:07,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:07,715 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:07,716 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:07,716 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-25 13:21:07,719 INFO L451 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-25 13:21:07,719 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-25 13:21:07,720 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:21:07,720 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 15 states. [2018-07-25 13:21:07,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:07,756 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-07-25 13:21:07,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 13:21:07,756 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-07-25 13:21:07,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:07,757 INFO L225 Difference]: With dead ends: 33 [2018-07-25 13:21:07,757 INFO L226 Difference]: Without dead ends: 31 [2018-07-25 13:21:07,758 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 13:21:07,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-07-25 13:21:07,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-07-25 13:21:07,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-07-25 13:21:07,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-07-25 13:21:07,775 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2018-07-25 13:21:07,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:07,776 INFO L472 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-07-25 13:21:07,776 INFO L473 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-25 13:21:07,776 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-07-25 13:21:07,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-07-25 13:21:07,777 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:07,777 INFO L354 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1] [2018-07-25 13:21:07,778 INFO L415 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:07,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1828020025, now seen corresponding path program 13 times [2018-07-25 13:21:07,781 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:07,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:07,861 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:07,862 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:07,862 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-25 13:21:07,863 INFO L451 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-25 13:21:07,863 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-25 13:21:07,863 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:21:07,864 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 16 states. [2018-07-25 13:21:07,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:07,896 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-07-25 13:21:07,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-25 13:21:07,896 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-07-25 13:21:07,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:07,897 INFO L225 Difference]: With dead ends: 35 [2018-07-25 13:21:07,897 INFO L226 Difference]: Without dead ends: 33 [2018-07-25 13:21:07,898 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 13:21:07,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-07-25 13:21:07,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-07-25 13:21:07,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-07-25 13:21:07,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-07-25 13:21:07,909 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2018-07-25 13:21:07,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:07,910 INFO L472 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-07-25 13:21:07,910 INFO L473 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-25 13:21:07,910 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-07-25 13:21:07,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-07-25 13:21:07,911 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:07,911 INFO L354 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1] [2018-07-25 13:21:07,912 INFO L415 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:07,912 INFO L82 PathProgramCache]: Analyzing trace with hash 85672051, now seen corresponding path program 14 times [2018-07-25 13:21:07,912 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:07,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:07,992 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 13:21:07,992 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:07,992 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-07-25 13:21:07,993 INFO L451 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-25 13:21:07,994 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-25 13:21:07,995 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-07-25 13:21:07,995 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 17 states. [2018-07-25 13:21:08,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:08,021 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-07-25 13:21:08,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 13:21:08,021 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2018-07-25 13:21:08,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:08,022 INFO L225 Difference]: With dead ends: 37 [2018-07-25 13:21:08,022 INFO L226 Difference]: Without dead ends: 35 [2018-07-25 13:21:08,023 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 13:21:08,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-07-25 13:21:08,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-07-25 13:21:08,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-07-25 13:21:08,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-07-25 13:21:08,030 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2018-07-25 13:21:08,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:08,030 INFO L472 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-07-25 13:21:08,031 INFO L473 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-25 13:21:08,031 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-07-25 13:21:08,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-07-25 13:21:08,037 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:08,037 INFO L354 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1] [2018-07-25 13:21:08,037 INFO L415 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:08,039 INFO L82 PathProgramCache]: Analyzing trace with hash 726514477, now seen corresponding path program 15 times [2018-07-25 13:21:08,039 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:08,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:08,121 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:08,122 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:08,122 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-07-25 13:21:08,123 INFO L451 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-25 13:21:08,123 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-25 13:21:08,123 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-07-25 13:21:08,124 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 18 states. [2018-07-25 13:21:08,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:08,142 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-07-25 13:21:08,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-25 13:21:08,143 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2018-07-25 13:21:08,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:08,144 INFO L225 Difference]: With dead ends: 39 [2018-07-25 13:21:08,144 INFO L226 Difference]: Without dead ends: 37 [2018-07-25 13:21:08,145 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 13:21:08,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-07-25 13:21:08,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-07-25 13:21:08,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-07-25 13:21:08,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-07-25 13:21:08,150 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2018-07-25 13:21:08,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:08,150 INFO L472 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-07-25 13:21:08,150 INFO L473 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-25 13:21:08,151 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-07-25 13:21:08,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-07-25 13:21:08,151 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:08,151 INFO L354 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1] [2018-07-25 13:21:08,152 INFO L415 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:08,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1899204761, now seen corresponding path program 16 times [2018-07-25 13:21:08,152 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:08,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:08,218 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:08,219 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:08,219 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-07-25 13:21:08,220 INFO L451 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-07-25 13:21:08,220 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-07-25 13:21:08,220 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-07-25 13:21:08,221 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 19 states. [2018-07-25 13:21:08,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:08,237 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-07-25 13:21:08,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-25 13:21:08,238 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2018-07-25 13:21:08,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:08,239 INFO L225 Difference]: With dead ends: 41 [2018-07-25 13:21:08,239 INFO L226 Difference]: Without dead ends: 39 [2018-07-25 13:21:08,240 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 13:21:08,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-07-25 13:21:08,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-07-25 13:21:08,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-07-25 13:21:08,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-07-25 13:21:08,245 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2018-07-25 13:21:08,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:08,246 INFO L472 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-07-25 13:21:08,246 INFO L473 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-07-25 13:21:08,246 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-07-25 13:21:08,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-07-25 13:21:08,247 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:08,247 INFO L354 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1] [2018-07-25 13:21:08,248 INFO L415 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:08,248 INFO L82 PathProgramCache]: Analyzing trace with hash 225377569, now seen corresponding path program 17 times [2018-07-25 13:21:08,248 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:08,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:08,320 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:08,321 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:08,321 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-07-25 13:21:08,321 INFO L451 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-07-25 13:21:08,322 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-07-25 13:21:08,322 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-07-25 13:21:08,323 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 20 states. [2018-07-25 13:21:08,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:08,344 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-07-25 13:21:08,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-25 13:21:08,344 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2018-07-25 13:21:08,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:08,345 INFO L225 Difference]: With dead ends: 43 [2018-07-25 13:21:08,345 INFO L226 Difference]: Without dead ends: 41 [2018-07-25 13:21:08,346 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 13:21:08,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-07-25 13:21:08,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-07-25 13:21:08,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-07-25 13:21:08,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-07-25 13:21:08,351 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2018-07-25 13:21:08,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:08,351 INFO L472 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-07-25 13:21:08,351 INFO L473 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-07-25 13:21:08,351 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-07-25 13:21:08,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-07-25 13:21:08,352 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:08,352 INFO L354 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1] [2018-07-25 13:21:08,353 INFO L415 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:08,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1839531099, now seen corresponding path program 18 times [2018-07-25 13:21:08,353 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:08,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:08,443 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:08,444 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:08,444 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-07-25 13:21:08,444 INFO L451 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-07-25 13:21:08,445 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-07-25 13:21:08,445 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-07-25 13:21:08,447 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 21 states. [2018-07-25 13:21:08,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:08,478 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-07-25 13:21:08,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-25 13:21:08,479 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2018-07-25 13:21:08,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:08,479 INFO L225 Difference]: With dead ends: 45 [2018-07-25 13:21:08,480 INFO L226 Difference]: Without dead ends: 43 [2018-07-25 13:21:08,480 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 13:21:08,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-07-25 13:21:08,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-07-25 13:21:08,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-07-25 13:21:08,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-07-25 13:21:08,488 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2018-07-25 13:21:08,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:08,488 INFO L472 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-07-25 13:21:08,488 INFO L473 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-07-25 13:21:08,489 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-07-25 13:21:08,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-07-25 13:21:08,490 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:08,491 INFO L354 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1] [2018-07-25 13:21:08,491 INFO L415 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:08,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1737087723, now seen corresponding path program 19 times [2018-07-25 13:21:08,491 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:08,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:08,574 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:08,574 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:08,574 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-07-25 13:21:08,575 INFO L451 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-07-25 13:21:08,575 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-07-25 13:21:08,575 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-07-25 13:21:08,576 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 22 states. [2018-07-25 13:21:08,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:08,600 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-07-25 13:21:08,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-25 13:21:08,600 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2018-07-25 13:21:08,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:08,601 INFO L225 Difference]: With dead ends: 47 [2018-07-25 13:21:08,604 INFO L226 Difference]: Without dead ends: 45 [2018-07-25 13:21:08,604 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 13:21:08,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-07-25 13:21:08,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-07-25 13:21:08,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-07-25 13:21:08,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-07-25 13:21:08,618 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2018-07-25 13:21:08,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:08,620 INFO L472 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-07-25 13:21:08,620 INFO L473 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-07-25 13:21:08,620 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-07-25 13:21:08,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-07-25 13:21:08,621 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:08,621 INFO L354 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1] [2018-07-25 13:21:08,622 INFO L415 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:08,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1401028431, now seen corresponding path program 20 times [2018-07-25 13:21:08,622 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:08,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:08,716 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:08,716 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:08,716 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-07-25 13:21:08,717 INFO L451 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-07-25 13:21:08,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-07-25 13:21:08,717 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-07-25 13:21:08,718 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 23 states. [2018-07-25 13:21:08,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:08,740 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-07-25 13:21:08,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-25 13:21:08,740 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2018-07-25 13:21:08,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:08,741 INFO L225 Difference]: With dead ends: 49 [2018-07-25 13:21:08,741 INFO L226 Difference]: Without dead ends: 47 [2018-07-25 13:21:08,741 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 13:21:08,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-07-25 13:21:08,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-07-25 13:21:08,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-07-25 13:21:08,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-07-25 13:21:08,747 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2018-07-25 13:21:08,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:08,747 INFO L472 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-07-25 13:21:08,748 INFO L473 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-07-25 13:21:08,748 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-07-25 13:21:08,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-07-25 13:21:08,748 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:08,749 INFO L354 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1] [2018-07-25 13:21:08,749 INFO L415 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:08,749 INFO L82 PathProgramCache]: Analyzing trace with hash 2063610633, now seen corresponding path program 21 times [2018-07-25 13:21:08,749 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:08,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:08,855 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:08,856 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:08,856 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-07-25 13:21:08,857 INFO L451 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-07-25 13:21:08,857 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-07-25 13:21:08,858 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-07-25 13:21:08,859 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 24 states. [2018-07-25 13:21:08,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:08,884 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-07-25 13:21:08,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 13:21:08,885 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2018-07-25 13:21:08,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:08,886 INFO L225 Difference]: With dead ends: 51 [2018-07-25 13:21:08,886 INFO L226 Difference]: Without dead ends: 49 [2018-07-25 13:21:08,890 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 13:21:08,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-07-25 13:21:08,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-07-25 13:21:08,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-07-25 13:21:08,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-07-25 13:21:08,895 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2018-07-25 13:21:08,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:08,895 INFO L472 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-07-25 13:21:08,896 INFO L473 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-07-25 13:21:08,896 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-07-25 13:21:08,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-07-25 13:21:08,896 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:08,896 INFO L354 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1] [2018-07-25 13:21:08,897 INFO L415 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:08,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1145020349, now seen corresponding path program 22 times [2018-07-25 13:21:08,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:08,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:09,025 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:09,025 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:09,026 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-07-25 13:21:09,026 INFO L451 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-07-25 13:21:09,027 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-07-25 13:21:09,027 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-07-25 13:21:09,028 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 25 states. [2018-07-25 13:21:09,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:09,052 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-07-25 13:21:09,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-25 13:21:09,053 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2018-07-25 13:21:09,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:09,053 INFO L225 Difference]: With dead ends: 53 [2018-07-25 13:21:09,054 INFO L226 Difference]: Without dead ends: 51 [2018-07-25 13:21:09,055 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 13:21:09,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-07-25 13:21:09,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-07-25 13:21:09,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-07-25 13:21:09,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-07-25 13:21:09,067 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2018-07-25 13:21:09,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:09,068 INFO L472 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-07-25 13:21:09,068 INFO L473 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-07-25 13:21:09,068 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-07-25 13:21:09,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-07-25 13:21:09,072 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:09,072 INFO L354 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1] [2018-07-25 13:21:09,072 INFO L415 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:09,072 INFO L82 PathProgramCache]: Analyzing trace with hash -852875523, now seen corresponding path program 23 times [2018-07-25 13:21:09,073 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:09,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:09,187 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:09,187 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:09,188 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-07-25 13:21:09,188 INFO L451 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-07-25 13:21:09,188 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-07-25 13:21:09,189 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-07-25 13:21:09,189 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 26 states. [2018-07-25 13:21:09,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:09,217 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-07-25 13:21:09,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-25 13:21:09,218 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2018-07-25 13:21:09,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:09,218 INFO L225 Difference]: With dead ends: 55 [2018-07-25 13:21:09,219 INFO L226 Difference]: Without dead ends: 53 [2018-07-25 13:21:09,220 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 13:21:09,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-07-25 13:21:09,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-07-25 13:21:09,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-07-25 13:21:09,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-07-25 13:21:09,225 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2018-07-25 13:21:09,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:09,225 INFO L472 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-07-25 13:21:09,226 INFO L473 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-07-25 13:21:09,226 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-07-25 13:21:09,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-07-25 13:21:09,227 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:09,227 INFO L354 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1] [2018-07-25 13:21:09,227 INFO L415 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:09,228 INFO L82 PathProgramCache]: Analyzing trace with hash 725428023, now seen corresponding path program 24 times [2018-07-25 13:21:09,228 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:09,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:09,357 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:09,357 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:09,358 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-07-25 13:21:09,358 INFO L451 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-07-25 13:21:09,358 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-07-25 13:21:09,359 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-07-25 13:21:09,359 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 27 states. [2018-07-25 13:21:09,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:09,389 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-07-25 13:21:09,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-25 13:21:09,389 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2018-07-25 13:21:09,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:09,390 INFO L225 Difference]: With dead ends: 57 [2018-07-25 13:21:09,390 INFO L226 Difference]: Without dead ends: 55 [2018-07-25 13:21:09,393 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 13:21:09,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-07-25 13:21:09,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-07-25 13:21:09,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-07-25 13:21:09,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-07-25 13:21:09,404 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2018-07-25 13:21:09,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:09,404 INFO L472 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-07-25 13:21:09,404 INFO L473 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-07-25 13:21:09,409 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-07-25 13:21:09,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-07-25 13:21:09,410 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:09,410 INFO L354 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1] [2018-07-25 13:21:09,410 INFO L415 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:09,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1351680241, now seen corresponding path program 25 times [2018-07-25 13:21:09,411 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:09,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:09,539 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:09,540 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:09,540 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-07-25 13:21:09,540 INFO L451 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-07-25 13:21:09,541 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-07-25 13:21:09,541 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-07-25 13:21:09,542 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 28 states. [2018-07-25 13:21:09,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:09,579 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-07-25 13:21:09,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-25 13:21:09,579 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2018-07-25 13:21:09,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:09,580 INFO L225 Difference]: With dead ends: 59 [2018-07-25 13:21:09,580 INFO L226 Difference]: Without dead ends: 57 [2018-07-25 13:21:09,581 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 13:21:09,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-07-25 13:21:09,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-07-25 13:21:09,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-07-25 13:21:09,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-07-25 13:21:09,585 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2018-07-25 13:21:09,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:09,586 INFO L472 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-07-25 13:21:09,586 INFO L473 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-07-25 13:21:09,586 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-07-25 13:21:09,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-07-25 13:21:09,587 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:09,587 INFO L354 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1] [2018-07-25 13:21:09,587 INFO L415 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:09,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1884640299, now seen corresponding path program 26 times [2018-07-25 13:21:09,587 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:09,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:09,722 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:09,722 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:09,723 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-07-25 13:21:09,723 INFO L451 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-07-25 13:21:09,723 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-07-25 13:21:09,724 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-07-25 13:21:09,725 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 29 states. [2018-07-25 13:21:09,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:09,765 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-07-25 13:21:09,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-25 13:21:09,765 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2018-07-25 13:21:09,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:09,766 INFO L225 Difference]: With dead ends: 61 [2018-07-25 13:21:09,766 INFO L226 Difference]: Without dead ends: 59 [2018-07-25 13:21:09,767 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 13:21:09,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-07-25 13:21:09,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-07-25 13:21:09,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-07-25 13:21:09,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-07-25 13:21:09,773 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2018-07-25 13:21:09,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:09,774 INFO L472 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-07-25 13:21:09,774 INFO L473 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-07-25 13:21:09,774 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-07-25 13:21:09,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-07-25 13:21:09,774 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:09,775 INFO L354 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1] [2018-07-25 13:21:09,775 INFO L415 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:09,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1336819483, now seen corresponding path program 27 times [2018-07-25 13:21:09,775 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:09,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:09,916 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:09,916 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:09,917 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-07-25 13:21:09,917 INFO L451 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-07-25 13:21:09,917 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-07-25 13:21:09,918 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-07-25 13:21:09,918 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 30 states. [2018-07-25 13:21:09,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:09,950 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-07-25 13:21:09,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-25 13:21:09,950 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2018-07-25 13:21:09,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:09,951 INFO L225 Difference]: With dead ends: 63 [2018-07-25 13:21:09,951 INFO L226 Difference]: Without dead ends: 61 [2018-07-25 13:21:09,952 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 13:21:09,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-07-25 13:21:09,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-07-25 13:21:09,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-07-25 13:21:09,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-07-25 13:21:09,956 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2018-07-25 13:21:09,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:09,957 INFO L472 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-07-25 13:21:09,957 INFO L473 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-07-25 13:21:09,957 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-07-25 13:21:09,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-07-25 13:21:09,958 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:09,958 INFO L354 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1] [2018-07-25 13:21:09,958 INFO L415 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:09,959 INFO L82 PathProgramCache]: Analyzing trace with hash -488249569, now seen corresponding path program 28 times [2018-07-25 13:21:09,959 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:09,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:10,097 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:10,098 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:10,098 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-07-25 13:21:10,098 INFO L451 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-07-25 13:21:10,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-07-25 13:21:10,099 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-07-25 13:21:10,100 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 31 states. [2018-07-25 13:21:10,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:10,124 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-07-25 13:21:10,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-25 13:21:10,125 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2018-07-25 13:21:10,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:10,125 INFO L225 Difference]: With dead ends: 65 [2018-07-25 13:21:10,126 INFO L226 Difference]: Without dead ends: 63 [2018-07-25 13:21:10,127 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 13:21:10,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-07-25 13:21:10,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-07-25 13:21:10,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-07-25 13:21:10,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-07-25 13:21:10,134 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2018-07-25 13:21:10,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:10,134 INFO L472 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-07-25 13:21:10,134 INFO L473 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-07-25 13:21:10,134 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-07-25 13:21:10,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-07-25 13:21:10,135 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:10,135 INFO L354 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1] [2018-07-25 13:21:10,135 INFO L415 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:10,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1056348455, now seen corresponding path program 29 times [2018-07-25 13:21:10,136 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:10,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:10,314 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:10,314 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:10,314 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-07-25 13:21:10,315 INFO L451 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-07-25 13:21:10,315 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-07-25 13:21:10,319 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-07-25 13:21:10,319 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 32 states. [2018-07-25 13:21:10,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:10,362 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-07-25 13:21:10,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-07-25 13:21:10,362 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2018-07-25 13:21:10,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:10,363 INFO L225 Difference]: With dead ends: 67 [2018-07-25 13:21:10,363 INFO L226 Difference]: Without dead ends: 65 [2018-07-25 13:21:10,364 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 13:21:10,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-07-25 13:21:10,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-07-25 13:21:10,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-07-25 13:21:10,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-07-25 13:21:10,367 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2018-07-25 13:21:10,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:10,368 INFO L472 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-07-25 13:21:10,368 INFO L473 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-07-25 13:21:10,368 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-07-25 13:21:10,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-07-25 13:21:10,369 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:10,369 INFO L354 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1] [2018-07-25 13:21:10,369 INFO L415 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:10,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1538531309, now seen corresponding path program 30 times [2018-07-25 13:21:10,369 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:10,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:10,502 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:10,502 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:10,502 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-07-25 13:21:10,503 INFO L451 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-07-25 13:21:10,503 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-07-25 13:21:10,503 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 13:21:10,504 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 33 states. [2018-07-25 13:21:10,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:10,525 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-07-25 13:21:10,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-25 13:21:10,526 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2018-07-25 13:21:10,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:10,527 INFO L225 Difference]: With dead ends: 69 [2018-07-25 13:21:10,527 INFO L226 Difference]: Without dead ends: 67 [2018-07-25 13:21:10,528 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 13:21:10,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-07-25 13:21:10,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-07-25 13:21:10,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-07-25 13:21:10,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-07-25 13:21:10,531 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2018-07-25 13:21:10,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:10,532 INFO L472 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-07-25 13:21:10,532 INFO L473 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-07-25 13:21:10,532 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-07-25 13:21:10,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-07-25 13:21:10,532 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:10,532 INFO L354 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1] [2018-07-25 13:21:10,533 INFO L415 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:10,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1059786035, now seen corresponding path program 31 times [2018-07-25 13:21:10,533 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:10,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:10,674 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:10,674 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:10,674 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-07-25 13:21:10,675 INFO L451 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-07-25 13:21:10,675 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-07-25 13:21:10,676 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 13:21:10,676 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 34 states. [2018-07-25 13:21:10,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:10,695 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-07-25 13:21:10,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-25 13:21:10,695 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2018-07-25 13:21:10,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:10,696 INFO L225 Difference]: With dead ends: 71 [2018-07-25 13:21:10,696 INFO L226 Difference]: Without dead ends: 69 [2018-07-25 13:21:10,697 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 13:21:10,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-07-25 13:21:10,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-07-25 13:21:10,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-07-25 13:21:10,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-07-25 13:21:10,701 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2018-07-25 13:21:10,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:10,701 INFO L472 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-07-25 13:21:10,701 INFO L473 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-07-25 13:21:10,702 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-07-25 13:21:10,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-07-25 13:21:10,702 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:10,702 INFO L354 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1] [2018-07-25 13:21:10,703 INFO L415 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:10,703 INFO L82 PathProgramCache]: Analyzing trace with hash -547078393, now seen corresponding path program 32 times [2018-07-25 13:21:10,703 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:10,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:10,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:10,840 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:10,840 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-07-25 13:21:10,840 INFO L451 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-07-25 13:21:10,841 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-07-25 13:21:10,844 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 13:21:10,844 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 35 states. [2018-07-25 13:21:10,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:10,886 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-07-25 13:21:10,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-25 13:21:10,886 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2018-07-25 13:21:10,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:10,889 INFO L225 Difference]: With dead ends: 73 [2018-07-25 13:21:10,889 INFO L226 Difference]: Without dead ends: 71 [2018-07-25 13:21:10,893 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 13:21:10,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-07-25 13:21:10,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-07-25 13:21:10,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-07-25 13:21:10,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-07-25 13:21:10,896 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2018-07-25 13:21:10,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:10,897 INFO L472 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-07-25 13:21:10,897 INFO L473 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-07-25 13:21:10,897 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-07-25 13:21:10,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-07-25 13:21:10,897 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:10,898 INFO L354 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1] [2018-07-25 13:21:10,898 INFO L415 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:10,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1756273471, now seen corresponding path program 33 times [2018-07-25 13:21:10,899 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:10,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:11,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:11,061 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:11,061 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-07-25 13:21:11,062 INFO L451 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-07-25 13:21:11,062 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-07-25 13:21:11,063 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-07-25 13:21:11,063 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 36 states. [2018-07-25 13:21:11,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:11,089 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-07-25 13:21:11,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-07-25 13:21:11,090 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2018-07-25 13:21:11,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:11,090 INFO L225 Difference]: With dead ends: 75 [2018-07-25 13:21:11,091 INFO L226 Difference]: Without dead ends: 73 [2018-07-25 13:21:11,092 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 13:21:11,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-07-25 13:21:11,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-07-25 13:21:11,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-07-25 13:21:11,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-07-25 13:21:11,095 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2018-07-25 13:21:11,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:11,096 INFO L472 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-07-25 13:21:11,096 INFO L473 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-07-25 13:21:11,096 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-07-25 13:21:11,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-07-25 13:21:11,096 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:11,097 INFO L354 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1] [2018-07-25 13:21:11,097 INFO L415 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:11,097 INFO L82 PathProgramCache]: Analyzing trace with hash 143393787, now seen corresponding path program 34 times [2018-07-25 13:21:11,100 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:11,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:11,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:11,282 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:11,283 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-07-25 13:21:11,283 INFO L451 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-07-25 13:21:11,283 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-07-25 13:21:11,284 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 13:21:11,285 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 37 states. [2018-07-25 13:21:11,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:11,310 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-07-25 13:21:11,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-07-25 13:21:11,311 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2018-07-25 13:21:11,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:11,312 INFO L225 Difference]: With dead ends: 77 [2018-07-25 13:21:11,312 INFO L226 Difference]: Without dead ends: 75 [2018-07-25 13:21:11,313 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 13:21:11,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-07-25 13:21:11,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-07-25 13:21:11,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-07-25 13:21:11,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-07-25 13:21:11,316 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2018-07-25 13:21:11,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:11,317 INFO L472 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-07-25 13:21:11,317 INFO L473 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-07-25 13:21:11,317 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-07-25 13:21:11,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-07-25 13:21:11,318 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:11,318 INFO L354 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1] [2018-07-25 13:21:11,318 INFO L415 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:11,318 INFO L82 PathProgramCache]: Analyzing trace with hash 362527925, now seen corresponding path program 35 times [2018-07-25 13:21:11,318 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:11,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:11,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:11,505 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:11,505 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-07-25 13:21:11,506 INFO L451 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-07-25 13:21:11,506 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-07-25 13:21:11,507 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-07-25 13:21:11,507 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 38 states. [2018-07-25 13:21:11,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:11,538 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-07-25 13:21:11,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-07-25 13:21:11,538 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2018-07-25 13:21:11,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:11,539 INFO L225 Difference]: With dead ends: 79 [2018-07-25 13:21:11,539 INFO L226 Difference]: Without dead ends: 77 [2018-07-25 13:21:11,540 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 13:21:11,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-07-25 13:21:11,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-07-25 13:21:11,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-07-25 13:21:11,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-07-25 13:21:11,544 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2018-07-25 13:21:11,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:11,544 INFO L472 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-07-25 13:21:11,544 INFO L473 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-07-25 13:21:11,544 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-07-25 13:21:11,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-07-25 13:21:11,545 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:11,545 INFO L354 BasicCegarLoop]: trace histogram [37, 36, 1, 1, 1] [2018-07-25 13:21:11,545 INFO L415 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:11,545 INFO L82 PathProgramCache]: Analyzing trace with hash 497037039, now seen corresponding path program 36 times [2018-07-25 13:21:11,545 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:11,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:11,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:11,704 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:11,704 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-07-25 13:21:11,705 INFO L451 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-07-25 13:21:11,705 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-07-25 13:21:11,706 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-07-25 13:21:11,706 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 39 states. [2018-07-25 13:21:11,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:11,731 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-07-25 13:21:11,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-07-25 13:21:11,731 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2018-07-25 13:21:11,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:11,732 INFO L225 Difference]: With dead ends: 81 [2018-07-25 13:21:11,732 INFO L226 Difference]: Without dead ends: 79 [2018-07-25 13:21:11,733 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 13:21:11,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-07-25 13:21:11,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-07-25 13:21:11,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-07-25 13:21:11,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-07-25 13:21:11,737 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2018-07-25 13:21:11,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:11,737 INFO L472 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-07-25 13:21:11,737 INFO L473 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-07-25 13:21:11,737 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-07-25 13:21:11,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-07-25 13:21:11,738 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:11,740 INFO L354 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1] [2018-07-25 13:21:11,740 INFO L415 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:11,740 INFO L82 PathProgramCache]: Analyzing trace with hash 911276713, now seen corresponding path program 37 times [2018-07-25 13:21:11,740 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:11,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:11,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:11,902 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:11,902 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-07-25 13:21:11,903 INFO L451 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-07-25 13:21:11,903 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-07-25 13:21:11,904 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-07-25 13:21:11,904 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 40 states. [2018-07-25 13:21:11,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:11,938 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-07-25 13:21:11,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-07-25 13:21:11,939 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2018-07-25 13:21:11,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:11,940 INFO L225 Difference]: With dead ends: 83 [2018-07-25 13:21:11,940 INFO L226 Difference]: Without dead ends: 81 [2018-07-25 13:21:11,941 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 13:21:11,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-07-25 13:21:11,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-07-25 13:21:11,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-07-25 13:21:11,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-07-25 13:21:11,945 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2018-07-25 13:21:11,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:11,946 INFO L472 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-07-25 13:21:11,946 INFO L473 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-07-25 13:21:11,946 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-07-25 13:21:11,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-07-25 13:21:11,947 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:11,947 INFO L354 BasicCegarLoop]: trace histogram [39, 38, 1, 1, 1] [2018-07-25 13:21:11,947 INFO L415 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:11,947 INFO L82 PathProgramCache]: Analyzing trace with hash -436355101, now seen corresponding path program 38 times [2018-07-25 13:21:11,947 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:11,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:12,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:12,114 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:12,114 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-07-25 13:21:12,115 INFO L451 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-07-25 13:21:12,115 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-07-25 13:21:12,116 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-07-25 13:21:12,116 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 41 states. [2018-07-25 13:21:12,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:12,147 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-07-25 13:21:12,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-07-25 13:21:12,147 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2018-07-25 13:21:12,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:12,148 INFO L225 Difference]: With dead ends: 85 [2018-07-25 13:21:12,148 INFO L226 Difference]: Without dead ends: 83 [2018-07-25 13:21:12,149 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 13:21:12,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-07-25 13:21:12,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-07-25 13:21:12,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-07-25 13:21:12,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-07-25 13:21:12,153 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 80 [2018-07-25 13:21:12,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:12,153 INFO L472 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-07-25 13:21:12,154 INFO L473 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-07-25 13:21:12,154 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-07-25 13:21:12,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-07-25 13:21:12,154 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:12,155 INFO L354 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1] [2018-07-25 13:21:12,155 INFO L415 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:12,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1569595037, now seen corresponding path program 39 times [2018-07-25 13:21:12,155 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:12,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:12,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:12,333 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:12,334 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-07-25 13:21:12,334 INFO L451 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-07-25 13:21:12,334 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-07-25 13:21:12,335 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-07-25 13:21:12,335 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 42 states. [2018-07-25 13:21:12,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:12,364 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-07-25 13:21:12,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-07-25 13:21:12,364 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2018-07-25 13:21:12,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:12,365 INFO L225 Difference]: With dead ends: 87 [2018-07-25 13:21:12,365 INFO L226 Difference]: Without dead ends: 85 [2018-07-25 13:21:12,367 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 13:21:12,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-07-25 13:21:12,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-07-25 13:21:12,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-07-25 13:21:12,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-07-25 13:21:12,371 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 82 [2018-07-25 13:21:12,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:12,371 INFO L472 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-07-25 13:21:12,371 INFO L473 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-07-25 13:21:12,371 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-07-25 13:21:12,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-07-25 13:21:12,372 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:12,372 INFO L354 BasicCegarLoop]: trace histogram [41, 40, 1, 1, 1] [2018-07-25 13:21:12,373 INFO L415 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:12,373 INFO L82 PathProgramCache]: Analyzing trace with hash 847361751, now seen corresponding path program 40 times [2018-07-25 13:21:12,373 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:12,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:12,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:12,573 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:12,574 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-07-25 13:21:12,574 INFO L451 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-07-25 13:21:12,574 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-07-25 13:21:12,575 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-07-25 13:21:12,576 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 43 states. [2018-07-25 13:21:12,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:12,607 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-07-25 13:21:12,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-07-25 13:21:12,608 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 84 [2018-07-25 13:21:12,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:12,608 INFO L225 Difference]: With dead ends: 89 [2018-07-25 13:21:12,609 INFO L226 Difference]: Without dead ends: 87 [2018-07-25 13:21:12,610 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 13:21:12,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-07-25 13:21:12,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-07-25 13:21:12,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-07-25 13:21:12,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-07-25 13:21:12,615 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 84 [2018-07-25 13:21:12,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:12,615 INFO L472 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-07-25 13:21:12,615 INFO L473 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-07-25 13:21:12,616 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-07-25 13:21:12,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-07-25 13:21:12,616 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:12,617 INFO L354 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1] [2018-07-25 13:21:12,617 INFO L415 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:12,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1729091439, now seen corresponding path program 41 times [2018-07-25 13:21:12,617 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:12,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:12,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:12,838 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:12,839 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-07-25 13:21:12,839 INFO L451 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-07-25 13:21:12,840 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-07-25 13:21:12,841 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-07-25 13:21:12,841 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 44 states. [2018-07-25 13:21:12,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:12,881 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-07-25 13:21:12,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-07-25 13:21:12,882 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2018-07-25 13:21:12,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:12,883 INFO L225 Difference]: With dead ends: 91 [2018-07-25 13:21:12,883 INFO L226 Difference]: Without dead ends: 89 [2018-07-25 13:21:12,884 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 13:21:12,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-07-25 13:21:12,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-07-25 13:21:12,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-07-25 13:21:12,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-07-25 13:21:12,889 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 86 [2018-07-25 13:21:12,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:12,889 INFO L472 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-07-25 13:21:12,889 INFO L473 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-07-25 13:21:12,890 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-07-25 13:21:12,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-07-25 13:21:12,890 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:12,891 INFO L354 BasicCegarLoop]: trace histogram [43, 42, 1, 1, 1] [2018-07-25 13:21:12,891 INFO L415 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:12,891 INFO L82 PathProgramCache]: Analyzing trace with hash 495522763, now seen corresponding path program 42 times [2018-07-25 13:21:12,891 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:12,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:13,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:13,163 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:13,163 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-07-25 13:21:13,164 INFO L451 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-07-25 13:21:13,164 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-07-25 13:21:13,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-07-25 13:21:13,166 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 45 states. [2018-07-25 13:21:13,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:13,208 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-07-25 13:21:13,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-07-25 13:21:13,208 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2018-07-25 13:21:13,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:13,209 INFO L225 Difference]: With dead ends: 93 [2018-07-25 13:21:13,209 INFO L226 Difference]: Without dead ends: 91 [2018-07-25 13:21:13,212 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 13:21:13,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-07-25 13:21:13,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-07-25 13:21:13,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-07-25 13:21:13,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-07-25 13:21:13,218 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 88 [2018-07-25 13:21:13,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:13,218 INFO L472 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-07-25 13:21:13,218 INFO L473 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-07-25 13:21:13,219 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-07-25 13:21:13,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-07-25 13:21:13,220 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:13,220 INFO L354 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1] [2018-07-25 13:21:13,220 INFO L415 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:13,220 INFO L82 PathProgramCache]: Analyzing trace with hash -543942523, now seen corresponding path program 43 times [2018-07-25 13:21:13,220 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:13,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:13,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:13,440 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:13,441 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-07-25 13:21:13,441 INFO L451 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-07-25 13:21:13,442 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-07-25 13:21:13,443 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-07-25 13:21:13,443 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 46 states. [2018-07-25 13:21:13,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:13,477 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-07-25 13:21:13,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-07-25 13:21:13,477 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2018-07-25 13:21:13,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:13,478 INFO L225 Difference]: With dead ends: 95 [2018-07-25 13:21:13,478 INFO L226 Difference]: Without dead ends: 93 [2018-07-25 13:21:13,479 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 13:21:13,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-07-25 13:21:13,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-07-25 13:21:13,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-07-25 13:21:13,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-07-25 13:21:13,483 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 90 [2018-07-25 13:21:13,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:13,483 INFO L472 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-07-25 13:21:13,484 INFO L473 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-07-25 13:21:13,484 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-07-25 13:21:13,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-07-25 13:21:13,485 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:13,485 INFO L354 BasicCegarLoop]: trace histogram [45, 44, 1, 1, 1] [2018-07-25 13:21:13,485 INFO L415 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:13,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1257297599, now seen corresponding path program 44 times [2018-07-25 13:21:13,485 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:13,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:13,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:13,713 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:13,713 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-07-25 13:21:13,714 INFO L451 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-07-25 13:21:13,714 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-07-25 13:21:13,715 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-07-25 13:21:13,715 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 47 states. [2018-07-25 13:21:13,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:13,763 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-07-25 13:21:13,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-07-25 13:21:13,763 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 92 [2018-07-25 13:21:13,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:13,764 INFO L225 Difference]: With dead ends: 97 [2018-07-25 13:21:13,764 INFO L226 Difference]: Without dead ends: 95 [2018-07-25 13:21:13,765 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 13:21:13,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-07-25 13:21:13,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-07-25 13:21:13,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-07-25 13:21:13,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-07-25 13:21:13,770 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 92 [2018-07-25 13:21:13,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:13,771 INFO L472 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-07-25 13:21:13,771 INFO L473 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-07-25 13:21:13,771 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-07-25 13:21:13,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-07-25 13:21:13,772 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:13,772 INFO L354 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1] [2018-07-25 13:21:13,772 INFO L415 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:13,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1377234553, now seen corresponding path program 45 times [2018-07-25 13:21:13,772 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:13,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:14,017 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:14,018 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:14,018 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-07-25 13:21:14,018 INFO L451 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-07-25 13:21:14,019 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-07-25 13:21:14,019 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-07-25 13:21:14,020 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 48 states. [2018-07-25 13:21:14,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:14,069 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-07-25 13:21:14,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-07-25 13:21:14,070 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2018-07-25 13:21:14,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:14,070 INFO L225 Difference]: With dead ends: 99 [2018-07-25 13:21:14,071 INFO L226 Difference]: Without dead ends: 97 [2018-07-25 13:21:14,071 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-07-25 13:21:14,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-07-25 13:21:14,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-07-25 13:21:14,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-07-25 13:21:14,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-07-25 13:21:14,076 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 94 [2018-07-25 13:21:14,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:14,076 INFO L472 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-07-25 13:21:14,076 INFO L473 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-07-25 13:21:14,076 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-07-25 13:21:14,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-07-25 13:21:14,077 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:14,077 INFO L354 BasicCegarLoop]: trace histogram [47, 46, 1, 1, 1] [2018-07-25 13:21:14,078 INFO L415 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:14,078 INFO L82 PathProgramCache]: Analyzing trace with hash 672530355, now seen corresponding path program 46 times [2018-07-25 13:21:14,078 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:14,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:14,327 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:14,327 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:14,327 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-07-25 13:21:14,328 INFO L451 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-07-25 13:21:14,328 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-07-25 13:21:14,329 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-07-25 13:21:14,329 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 49 states. [2018-07-25 13:21:14,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:14,376 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-07-25 13:21:14,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-07-25 13:21:14,377 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2018-07-25 13:21:14,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:14,378 INFO L225 Difference]: With dead ends: 101 [2018-07-25 13:21:14,378 INFO L226 Difference]: Without dead ends: 99 [2018-07-25 13:21:14,379 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 13:21:14,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-07-25 13:21:14,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-07-25 13:21:14,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-07-25 13:21:14,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-07-25 13:21:14,383 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 96 [2018-07-25 13:21:14,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:14,383 INFO L472 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-07-25 13:21:14,383 INFO L473 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-07-25 13:21:14,383 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-07-25 13:21:14,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-07-25 13:21:14,384 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:14,384 INFO L354 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1] [2018-07-25 13:21:14,385 INFO L415 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:14,385 INFO L82 PathProgramCache]: Analyzing trace with hash 2056628845, now seen corresponding path program 47 times [2018-07-25 13:21:14,385 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:14,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:14,646 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:14,646 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:14,647 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-07-25 13:21:14,647 INFO L451 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-07-25 13:21:14,648 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-07-25 13:21:14,648 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-07-25 13:21:14,649 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 50 states. [2018-07-25 13:21:14,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:14,699 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-07-25 13:21:14,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-07-25 13:21:14,699 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2018-07-25 13:21:14,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:14,700 INFO L225 Difference]: With dead ends: 103 [2018-07-25 13:21:14,700 INFO L226 Difference]: Without dead ends: 101 [2018-07-25 13:21:14,701 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 13:21:14,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-07-25 13:21:14,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-07-25 13:21:14,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-07-25 13:21:14,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-07-25 13:21:14,705 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 98 [2018-07-25 13:21:14,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:14,706 INFO L472 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-07-25 13:21:14,706 INFO L473 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-07-25 13:21:14,706 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-07-25 13:21:14,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-07-25 13:21:14,707 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:14,707 INFO L354 BasicCegarLoop]: trace histogram [49, 48, 1, 1, 1] [2018-07-25 13:21:14,707 INFO L415 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:14,708 INFO L82 PathProgramCache]: Analyzing trace with hash 735415975, now seen corresponding path program 48 times [2018-07-25 13:21:14,708 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:14,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:14,979 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:14,979 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:14,980 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-07-25 13:21:14,980 INFO L451 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-07-25 13:21:14,981 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-07-25 13:21:14,981 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-07-25 13:21:14,982 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 51 states. [2018-07-25 13:21:15,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:15,036 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-07-25 13:21:15,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-07-25 13:21:15,037 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 100 [2018-07-25 13:21:15,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:15,038 INFO L225 Difference]: With dead ends: 105 [2018-07-25 13:21:15,038 INFO L226 Difference]: Without dead ends: 103 [2018-07-25 13:21:15,040 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-07-25 13:21:15,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-07-25 13:21:15,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-07-25 13:21:15,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-07-25 13:21:15,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-07-25 13:21:15,044 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 100 [2018-07-25 13:21:15,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:15,044 INFO L472 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-07-25 13:21:15,044 INFO L473 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-07-25 13:21:15,044 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-07-25 13:21:15,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-07-25 13:21:15,045 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:15,046 INFO L354 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1] [2018-07-25 13:21:15,046 INFO L415 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:15,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1934799775, now seen corresponding path program 49 times [2018-07-25 13:21:15,046 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:15,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:15,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:15,343 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:15,344 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-07-25 13:21:15,344 INFO L451 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-07-25 13:21:15,345 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-07-25 13:21:15,346 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-07-25 13:21:15,346 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 52 states. [2018-07-25 13:21:15,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:15,402 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-07-25 13:21:15,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-07-25 13:21:15,402 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2018-07-25 13:21:15,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:15,403 INFO L225 Difference]: With dead ends: 107 [2018-07-25 13:21:15,404 INFO L226 Difference]: Without dead ends: 105 [2018-07-25 13:21:15,405 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-07-25 13:21:15,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-07-25 13:21:15,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-07-25 13:21:15,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-07-25 13:21:15,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-07-25 13:21:15,410 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 102 [2018-07-25 13:21:15,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:15,410 INFO L472 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-07-25 13:21:15,411 INFO L473 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-07-25 13:21:15,411 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-07-25 13:21:15,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-07-25 13:21:15,412 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:15,412 INFO L354 BasicCegarLoop]: trace histogram [51, 50, 1, 1, 1] [2018-07-25 13:21:15,412 INFO L415 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:15,413 INFO L82 PathProgramCache]: Analyzing trace with hash 378307483, now seen corresponding path program 50 times [2018-07-25 13:21:15,413 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:15,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:15,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:15,766 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:15,767 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-07-25 13:21:15,767 INFO L451 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-07-25 13:21:15,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-07-25 13:21:15,770 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-07-25 13:21:15,770 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 53 states. [2018-07-25 13:21:15,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:15,827 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-07-25 13:21:15,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-07-25 13:21:15,828 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 104 [2018-07-25 13:21:15,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:15,829 INFO L225 Difference]: With dead ends: 109 [2018-07-25 13:21:15,829 INFO L226 Difference]: Without dead ends: 107 [2018-07-25 13:21:15,830 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-07-25 13:21:15,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-07-25 13:21:15,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-07-25 13:21:15,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-07-25 13:21:15,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-07-25 13:21:15,841 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 104 [2018-07-25 13:21:15,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:15,841 INFO L472 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-07-25 13:21:15,841 INFO L473 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-07-25 13:21:15,841 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-07-25 13:21:15,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-07-25 13:21:15,843 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:15,843 INFO L354 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1] [2018-07-25 13:21:15,843 INFO L415 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:15,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1518676907, now seen corresponding path program 51 times [2018-07-25 13:21:15,844 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:15,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:16,217 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:16,218 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:16,218 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-07-25 13:21:16,218 INFO L451 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-07-25 13:21:16,219 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-07-25 13:21:16,220 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-07-25 13:21:16,220 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 54 states. [2018-07-25 13:21:16,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:16,260 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-07-25 13:21:16,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-07-25 13:21:16,260 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2018-07-25 13:21:16,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:16,261 INFO L225 Difference]: With dead ends: 111 [2018-07-25 13:21:16,261 INFO L226 Difference]: Without dead ends: 109 [2018-07-25 13:21:16,262 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-07-25 13:21:16,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-07-25 13:21:16,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-07-25 13:21:16,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-07-25 13:21:16,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-07-25 13:21:16,267 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 106 [2018-07-25 13:21:16,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:16,267 INFO L472 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-07-25 13:21:16,267 INFO L473 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-07-25 13:21:16,268 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-07-25 13:21:16,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-07-25 13:21:16,268 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:16,269 INFO L354 BasicCegarLoop]: trace histogram [53, 52, 1, 1, 1] [2018-07-25 13:21:16,269 INFO L415 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:16,269 INFO L82 PathProgramCache]: Analyzing trace with hash 840425103, now seen corresponding path program 52 times [2018-07-25 13:21:16,269 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:16,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:16,559 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:16,559 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:16,560 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-07-25 13:21:16,560 INFO L451 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-07-25 13:21:16,561 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-07-25 13:21:16,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-07-25 13:21:16,562 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 55 states. [2018-07-25 13:21:16,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:16,631 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-07-25 13:21:16,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-07-25 13:21:16,632 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 108 [2018-07-25 13:21:16,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:16,633 INFO L225 Difference]: With dead ends: 113 [2018-07-25 13:21:16,633 INFO L226 Difference]: Without dead ends: 111 [2018-07-25 13:21:16,634 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-07-25 13:21:16,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-07-25 13:21:16,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-07-25 13:21:16,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-07-25 13:21:16,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-07-25 13:21:16,642 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 108 [2018-07-25 13:21:16,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:16,642 INFO L472 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-07-25 13:21:16,642 INFO L473 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-07-25 13:21:16,642 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-07-25 13:21:16,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-07-25 13:21:16,643 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:16,644 INFO L354 BasicCegarLoop]: trace histogram [54, 53, 1, 1, 1] [2018-07-25 13:21:16,644 INFO L415 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:16,644 INFO L82 PathProgramCache]: Analyzing trace with hash 194724425, now seen corresponding path program 53 times [2018-07-25 13:21:16,644 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:16,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:16,921 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:16,921 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:16,921 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-07-25 13:21:16,922 INFO L451 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-07-25 13:21:16,922 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-07-25 13:21:16,923 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-07-25 13:21:16,923 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 56 states. [2018-07-25 13:21:16,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:16,987 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-07-25 13:21:16,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-07-25 13:21:16,987 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 110 [2018-07-25 13:21:16,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:16,988 INFO L225 Difference]: With dead ends: 115 [2018-07-25 13:21:16,989 INFO L226 Difference]: Without dead ends: 113 [2018-07-25 13:21:16,992 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-07-25 13:21:16,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-07-25 13:21:16,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-07-25 13:21:16,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-07-25 13:21:16,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-07-25 13:21:16,996 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 110 [2018-07-25 13:21:16,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:16,997 INFO L472 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-07-25 13:21:16,997 INFO L473 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-07-25 13:21:16,997 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-07-25 13:21:16,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-07-25 13:21:16,998 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:16,998 INFO L354 BasicCegarLoop]: trace histogram [55, 54, 1, 1, 1] [2018-07-25 13:21:16,998 INFO L415 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:16,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1848336509, now seen corresponding path program 54 times [2018-07-25 13:21:16,999 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:17,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:17,302 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:17,302 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:17,302 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-07-25 13:21:17,303 INFO L451 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-07-25 13:21:17,304 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-07-25 13:21:17,304 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-07-25 13:21:17,305 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 57 states. [2018-07-25 13:21:17,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:17,364 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-07-25 13:21:17,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-07-25 13:21:17,364 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 112 [2018-07-25 13:21:17,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:17,365 INFO L225 Difference]: With dead ends: 117 [2018-07-25 13:21:17,366 INFO L226 Difference]: Without dead ends: 115 [2018-07-25 13:21:17,367 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-07-25 13:21:17,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-07-25 13:21:17,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-07-25 13:21:17,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-07-25 13:21:17,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-07-25 13:21:17,372 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 112 [2018-07-25 13:21:17,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:17,373 INFO L472 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-07-25 13:21:17,373 INFO L473 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-07-25 13:21:17,373 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-07-25 13:21:17,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-07-25 13:21:17,374 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:17,374 INFO L354 BasicCegarLoop]: trace histogram [56, 55, 1, 1, 1] [2018-07-25 13:21:17,374 INFO L415 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:17,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1865127485, now seen corresponding path program 55 times [2018-07-25 13:21:17,375 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:17,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:17,659 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:17,659 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:17,659 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-07-25 13:21:17,659 INFO L451 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-07-25 13:21:17,660 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-07-25 13:21:17,665 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-07-25 13:21:17,665 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 58 states. [2018-07-25 13:21:17,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:17,728 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-07-25 13:21:17,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-07-25 13:21:17,728 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 114 [2018-07-25 13:21:17,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:17,730 INFO L225 Difference]: With dead ends: 119 [2018-07-25 13:21:17,730 INFO L226 Difference]: Without dead ends: 117 [2018-07-25 13:21:17,731 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 13:21:17,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-07-25 13:21:17,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-07-25 13:21:17,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-07-25 13:21:17,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-07-25 13:21:17,735 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 114 [2018-07-25 13:21:17,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:17,735 INFO L472 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-07-25 13:21:17,736 INFO L473 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-07-25 13:21:17,736 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-07-25 13:21:17,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-07-25 13:21:17,737 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:17,737 INFO L354 BasicCegarLoop]: trace histogram [57, 56, 1, 1, 1] [2018-07-25 13:21:17,737 INFO L415 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:17,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1386202743, now seen corresponding path program 56 times [2018-07-25 13:21:17,738 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:17,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:17,999 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:18,000 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:18,000 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-07-25 13:21:18,004 INFO L451 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-07-25 13:21:18,005 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-07-25 13:21:18,006 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-07-25 13:21:18,006 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 59 states. [2018-07-25 13:21:18,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:18,053 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-07-25 13:21:18,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-07-25 13:21:18,053 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 116 [2018-07-25 13:21:18,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:18,055 INFO L225 Difference]: With dead ends: 121 [2018-07-25 13:21:18,055 INFO L226 Difference]: Without dead ends: 119 [2018-07-25 13:21:18,056 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-07-25 13:21:18,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-07-25 13:21:18,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-07-25 13:21:18,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-07-25 13:21:18,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-07-25 13:21:18,061 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 116 [2018-07-25 13:21:18,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:18,061 INFO L472 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-07-25 13:21:18,061 INFO L473 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-07-25 13:21:18,061 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-07-25 13:21:18,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-07-25 13:21:18,062 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:18,063 INFO L354 BasicCegarLoop]: trace histogram [58, 57, 1, 1, 1] [2018-07-25 13:21:18,063 INFO L415 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:18,063 INFO L82 PathProgramCache]: Analyzing trace with hash 701026353, now seen corresponding path program 57 times [2018-07-25 13:21:18,063 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:18,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:18,323 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:18,323 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:18,324 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-07-25 13:21:18,324 INFO L451 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-07-25 13:21:18,325 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-07-25 13:21:18,326 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-07-25 13:21:18,326 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 60 states. [2018-07-25 13:21:18,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:18,387 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-07-25 13:21:18,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-07-25 13:21:18,388 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 118 [2018-07-25 13:21:18,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:18,389 INFO L225 Difference]: With dead ends: 123 [2018-07-25 13:21:18,389 INFO L226 Difference]: Without dead ends: 121 [2018-07-25 13:21:18,390 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 13:21:18,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-07-25 13:21:18,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-07-25 13:21:18,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-07-25 13:21:18,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-07-25 13:21:18,395 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 118 [2018-07-25 13:21:18,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:18,395 INFO L472 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-07-25 13:21:18,395 INFO L473 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-07-25 13:21:18,395 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-07-25 13:21:18,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-07-25 13:21:18,396 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:18,397 INFO L354 BasicCegarLoop]: trace histogram [59, 58, 1, 1, 1] [2018-07-25 13:21:18,397 INFO L415 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:18,397 INFO L82 PathProgramCache]: Analyzing trace with hash -623488149, now seen corresponding path program 58 times [2018-07-25 13:21:18,397 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:18,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:18,691 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:18,691 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:18,691 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-07-25 13:21:18,692 INFO L451 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-07-25 13:21:18,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-07-25 13:21:18,694 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-07-25 13:21:18,694 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 61 states. [2018-07-25 13:21:18,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:18,777 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-07-25 13:21:18,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-07-25 13:21:18,777 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 120 [2018-07-25 13:21:18,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:18,779 INFO L225 Difference]: With dead ends: 125 [2018-07-25 13:21:18,779 INFO L226 Difference]: Without dead ends: 123 [2018-07-25 13:21:18,780 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-07-25 13:21:18,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-07-25 13:21:18,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-07-25 13:21:18,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-07-25 13:21:18,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-07-25 13:21:18,785 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 120 [2018-07-25 13:21:18,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:18,786 INFO L472 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-07-25 13:21:18,786 INFO L473 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-07-25 13:21:18,786 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-07-25 13:21:18,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-07-25 13:21:18,787 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:18,788 INFO L354 BasicCegarLoop]: trace histogram [60, 59, 1, 1, 1] [2018-07-25 13:21:18,788 INFO L415 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:18,789 INFO L82 PathProgramCache]: Analyzing trace with hash 2123362341, now seen corresponding path program 59 times [2018-07-25 13:21:18,789 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:18,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:19,138 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:19,139 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:19,139 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-07-25 13:21:19,139 INFO L451 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-07-25 13:21:19,140 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-07-25 13:21:19,141 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-07-25 13:21:19,141 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 62 states. [2018-07-25 13:21:19,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:19,203 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-07-25 13:21:19,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-07-25 13:21:19,203 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 122 [2018-07-25 13:21:19,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:19,204 INFO L225 Difference]: With dead ends: 127 [2018-07-25 13:21:19,204 INFO L226 Difference]: Without dead ends: 125 [2018-07-25 13:21:19,206 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-07-25 13:21:19,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-07-25 13:21:19,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-07-25 13:21:19,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-07-25 13:21:19,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-07-25 13:21:19,211 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 122 [2018-07-25 13:21:19,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:19,211 INFO L472 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-07-25 13:21:19,211 INFO L473 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-07-25 13:21:19,212 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-07-25 13:21:19,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-07-25 13:21:19,213 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:19,213 INFO L354 BasicCegarLoop]: trace histogram [61, 60, 1, 1, 1] [2018-07-25 13:21:19,213 INFO L415 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:19,213 INFO L82 PathProgramCache]: Analyzing trace with hash 441796191, now seen corresponding path program 60 times [2018-07-25 13:21:19,214 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:19,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:19,511 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:19,511 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:19,511 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-07-25 13:21:19,512 INFO L451 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-07-25 13:21:19,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-07-25 13:21:19,514 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-07-25 13:21:19,514 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 63 states. [2018-07-25 13:21:19,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:19,586 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-07-25 13:21:19,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-07-25 13:21:19,586 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 124 [2018-07-25 13:21:19,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:19,587 INFO L225 Difference]: With dead ends: 129 [2018-07-25 13:21:19,588 INFO L226 Difference]: Without dead ends: 127 [2018-07-25 13:21:19,589 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-07-25 13:21:19,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-07-25 13:21:19,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-07-25 13:21:19,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-07-25 13:21:19,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-07-25 13:21:19,595 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 124 [2018-07-25 13:21:19,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:19,595 INFO L472 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-07-25 13:21:19,595 INFO L473 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-07-25 13:21:19,595 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-07-25 13:21:19,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-07-25 13:21:19,596 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:19,596 INFO L354 BasicCegarLoop]: trace histogram [62, 61, 1, 1, 1] [2018-07-25 13:21:19,597 INFO L415 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:19,597 INFO L82 PathProgramCache]: Analyzing trace with hash -635570663, now seen corresponding path program 61 times [2018-07-25 13:21:19,597 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:19,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:19,858 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:19,859 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:19,859 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-07-25 13:21:19,859 INFO L451 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-07-25 13:21:19,860 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-07-25 13:21:19,861 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-07-25 13:21:19,861 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 64 states. [2018-07-25 13:21:19,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:19,943 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-07-25 13:21:19,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-07-25 13:21:19,943 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 126 [2018-07-25 13:21:19,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:19,944 INFO L225 Difference]: With dead ends: 131 [2018-07-25 13:21:19,944 INFO L226 Difference]: Without dead ends: 129 [2018-07-25 13:21:19,945 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 13:21:19,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-07-25 13:21:19,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-07-25 13:21:19,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-07-25 13:21:19,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-07-25 13:21:19,951 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 126 [2018-07-25 13:21:19,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:19,951 INFO L472 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-07-25 13:21:19,951 INFO L473 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-07-25 13:21:19,951 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-07-25 13:21:19,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-07-25 13:21:19,953 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:19,953 INFO L354 BasicCegarLoop]: trace histogram [63, 62, 1, 1, 1] [2018-07-25 13:21:19,953 INFO L415 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:19,953 INFO L82 PathProgramCache]: Analyzing trace with hash -897999021, now seen corresponding path program 62 times [2018-07-25 13:21:19,954 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:19,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:20,226 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:20,226 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:20,227 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-07-25 13:21:20,227 INFO L451 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-07-25 13:21:20,228 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-07-25 13:21:20,229 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-07-25 13:21:20,229 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 65 states. [2018-07-25 13:21:20,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:20,311 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-07-25 13:21:20,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-07-25 13:21:20,311 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 128 [2018-07-25 13:21:20,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:20,313 INFO L225 Difference]: With dead ends: 133 [2018-07-25 13:21:20,313 INFO L226 Difference]: Without dead ends: 131 [2018-07-25 13:21:20,314 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-07-25 13:21:20,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-07-25 13:21:20,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-07-25 13:21:20,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-07-25 13:21:20,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-07-25 13:21:20,319 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 128 [2018-07-25 13:21:20,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:20,319 INFO L472 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-07-25 13:21:20,319 INFO L473 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-07-25 13:21:20,319 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-07-25 13:21:20,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-07-25 13:21:20,320 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:20,321 INFO L354 BasicCegarLoop]: trace histogram [64, 63, 1, 1, 1] [2018-07-25 13:21:20,321 INFO L415 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:20,321 INFO L82 PathProgramCache]: Analyzing trace with hash 311419405, now seen corresponding path program 63 times [2018-07-25 13:21:20,321 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:20,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:20,594 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:20,594 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:20,595 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-07-25 13:21:20,595 INFO L451 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-07-25 13:21:20,596 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-07-25 13:21:20,597 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-07-25 13:21:20,597 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 66 states. [2018-07-25 13:21:20,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:20,654 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-07-25 13:21:20,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-07-25 13:21:20,654 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 130 [2018-07-25 13:21:20,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:20,655 INFO L225 Difference]: With dead ends: 135 [2018-07-25 13:21:20,655 INFO L226 Difference]: Without dead ends: 133 [2018-07-25 13:21:20,657 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-07-25 13:21:20,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-07-25 13:21:20,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-07-25 13:21:20,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-07-25 13:21:20,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-07-25 13:21:20,664 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 130 [2018-07-25 13:21:20,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:20,664 INFO L472 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-07-25 13:21:20,664 INFO L473 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-07-25 13:21:20,666 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-07-25 13:21:20,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-07-25 13:21:20,668 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:20,668 INFO L354 BasicCegarLoop]: trace histogram [65, 64, 1, 1, 1] [2018-07-25 13:21:20,668 INFO L415 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:20,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1373610425, now seen corresponding path program 64 times [2018-07-25 13:21:20,669 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:20,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:20,953 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:20,954 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:20,954 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-07-25 13:21:20,954 INFO L451 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-07-25 13:21:20,955 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-07-25 13:21:20,956 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-07-25 13:21:20,957 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 67 states. [2018-07-25 13:21:21,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:21,039 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-07-25 13:21:21,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-07-25 13:21:21,040 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 132 [2018-07-25 13:21:21,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:21,041 INFO L225 Difference]: With dead ends: 137 [2018-07-25 13:21:21,041 INFO L226 Difference]: Without dead ends: 135 [2018-07-25 13:21:21,043 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 13:21:21,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-07-25 13:21:21,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-07-25 13:21:21,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-07-25 13:21:21,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-07-25 13:21:21,048 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 132 [2018-07-25 13:21:21,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:21,049 INFO L472 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-07-25 13:21:21,049 INFO L473 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-07-25 13:21:21,049 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-07-25 13:21:21,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-07-25 13:21:21,052 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:21,053 INFO L354 BasicCegarLoop]: trace histogram [66, 65, 1, 1, 1] [2018-07-25 13:21:21,053 INFO L415 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:21,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1484606463, now seen corresponding path program 65 times [2018-07-25 13:21:21,053 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:21,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:21,332 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:21,333 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:21,333 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-07-25 13:21:21,334 INFO L451 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-07-25 13:21:21,334 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-07-25 13:21:21,335 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-07-25 13:21:21,336 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 68 states. [2018-07-25 13:21:21,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:21,433 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-07-25 13:21:21,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-07-25 13:21:21,433 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 134 [2018-07-25 13:21:21,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:21,435 INFO L225 Difference]: With dead ends: 139 [2018-07-25 13:21:21,435 INFO L226 Difference]: Without dead ends: 137 [2018-07-25 13:21:21,436 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 13:21:21,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-07-25 13:21:21,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-07-25 13:21:21,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-07-25 13:21:21,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-07-25 13:21:21,443 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 134 [2018-07-25 13:21:21,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:21,443 INFO L472 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-07-25 13:21:21,444 INFO L473 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-07-25 13:21:21,444 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-07-25 13:21:21,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-07-25 13:21:21,445 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:21,445 INFO L354 BasicCegarLoop]: trace histogram [67, 66, 1, 1, 1] [2018-07-25 13:21:21,445 INFO L415 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:21,445 INFO L82 PathProgramCache]: Analyzing trace with hash -777616581, now seen corresponding path program 66 times [2018-07-25 13:21:21,446 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:21,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:21,734 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:21,734 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:21,735 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-07-25 13:21:21,735 INFO L451 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-07-25 13:21:21,736 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-07-25 13:21:21,737 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-07-25 13:21:21,737 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 69 states. [2018-07-25 13:21:21,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:21,842 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-07-25 13:21:21,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-07-25 13:21:21,842 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 136 [2018-07-25 13:21:21,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:21,843 INFO L225 Difference]: With dead ends: 141 [2018-07-25 13:21:21,843 INFO L226 Difference]: Without dead ends: 139 [2018-07-25 13:21:21,845 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 13:21:21,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-07-25 13:21:21,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-07-25 13:21:21,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-07-25 13:21:21,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2018-07-25 13:21:21,850 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 136 [2018-07-25 13:21:21,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:21,851 INFO L472 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2018-07-25 13:21:21,851 INFO L473 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-07-25 13:21:21,851 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2018-07-25 13:21:21,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-07-25 13:21:21,852 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:21,853 INFO L354 BasicCegarLoop]: trace histogram [68, 67, 1, 1, 1] [2018-07-25 13:21:21,853 INFO L415 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:21,853 INFO L82 PathProgramCache]: Analyzing trace with hash 34827253, now seen corresponding path program 67 times [2018-07-25 13:21:21,853 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:21,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:22,201 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:22,202 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:22,202 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-07-25 13:21:22,202 INFO L451 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-07-25 13:21:22,203 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-07-25 13:21:22,204 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-07-25 13:21:22,205 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 70 states. [2018-07-25 13:21:22,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:22,293 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-07-25 13:21:22,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-07-25 13:21:22,294 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 138 [2018-07-25 13:21:22,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:22,295 INFO L225 Difference]: With dead ends: 143 [2018-07-25 13:21:22,295 INFO L226 Difference]: Without dead ends: 141 [2018-07-25 13:21:22,297 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-07-25 13:21:22,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-07-25 13:21:22,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-07-25 13:21:22,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-07-25 13:21:22,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-07-25 13:21:22,302 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 138 [2018-07-25 13:21:22,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:22,303 INFO L472 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-07-25 13:21:22,303 INFO L473 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-07-25 13:21:22,303 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-07-25 13:21:22,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-07-25 13:21:22,304 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:22,305 INFO L354 BasicCegarLoop]: trace histogram [69, 68, 1, 1, 1] [2018-07-25 13:21:22,305 INFO L415 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:22,305 INFO L82 PathProgramCache]: Analyzing trace with hash -890696145, now seen corresponding path program 68 times [2018-07-25 13:21:22,305 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:22,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:22,610 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:22,611 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:22,611 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-07-25 13:21:22,611 INFO L451 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-07-25 13:21:22,612 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-07-25 13:21:22,613 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-07-25 13:21:22,614 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 71 states. [2018-07-25 13:21:22,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:22,706 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-07-25 13:21:22,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-07-25 13:21:22,707 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 140 [2018-07-25 13:21:22,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:22,708 INFO L225 Difference]: With dead ends: 145 [2018-07-25 13:21:22,708 INFO L226 Difference]: Without dead ends: 143 [2018-07-25 13:21:22,709 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-07-25 13:21:22,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-07-25 13:21:22,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-07-25 13:21:22,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-07-25 13:21:22,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-07-25 13:21:22,715 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 140 [2018-07-25 13:21:22,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:22,715 INFO L472 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-07-25 13:21:22,715 INFO L473 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-07-25 13:21:22,715 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-07-25 13:21:22,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-07-25 13:21:22,717 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:22,717 INFO L354 BasicCegarLoop]: trace histogram [70, 69, 1, 1, 1] [2018-07-25 13:21:22,717 INFO L415 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:22,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1260451351, now seen corresponding path program 69 times [2018-07-25 13:21:22,718 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:22,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:23,030 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:23,030 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:23,031 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-07-25 13:21:23,031 INFO L451 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-07-25 13:21:23,032 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-07-25 13:21:23,034 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-07-25 13:21:23,034 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 72 states. [2018-07-25 13:21:23,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:23,152 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-07-25 13:21:23,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-07-25 13:21:23,152 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 142 [2018-07-25 13:21:23,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:23,153 INFO L225 Difference]: With dead ends: 147 [2018-07-25 13:21:23,153 INFO L226 Difference]: Without dead ends: 145 [2018-07-25 13:21:23,155 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-07-25 13:21:23,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-07-25 13:21:23,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-07-25 13:21:23,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-07-25 13:21:23,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-07-25 13:21:23,161 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 142 [2018-07-25 13:21:23,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:23,161 INFO L472 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-07-25 13:21:23,161 INFO L473 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-07-25 13:21:23,161 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-07-25 13:21:23,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-07-25 13:21:23,163 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:23,163 INFO L354 BasicCegarLoop]: trace histogram [71, 70, 1, 1, 1] [2018-07-25 13:21:23,163 INFO L415 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:23,164 INFO L82 PathProgramCache]: Analyzing trace with hash -112918749, now seen corresponding path program 70 times [2018-07-25 13:21:23,164 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:23,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:23,509 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:23,510 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:23,510 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-07-25 13:21:23,511 INFO L451 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-07-25 13:21:23,511 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-07-25 13:21:23,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-07-25 13:21:23,513 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 73 states. [2018-07-25 13:21:23,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:23,641 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-07-25 13:21:23,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-07-25 13:21:23,642 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 144 [2018-07-25 13:21:23,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:23,643 INFO L225 Difference]: With dead ends: 149 [2018-07-25 13:21:23,643 INFO L226 Difference]: Without dead ends: 147 [2018-07-25 13:21:23,647 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-07-25 13:21:23,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-07-25 13:21:23,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-07-25 13:21:23,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-07-25 13:21:23,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-07-25 13:21:23,652 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 144 [2018-07-25 13:21:23,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:23,653 INFO L472 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-07-25 13:21:23,653 INFO L473 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-07-25 13:21:23,653 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-07-25 13:21:23,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-07-25 13:21:23,655 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:23,655 INFO L354 BasicCegarLoop]: trace histogram [72, 71, 1, 1, 1] [2018-07-25 13:21:23,655 INFO L415 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:23,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1140683299, now seen corresponding path program 71 times [2018-07-25 13:21:23,656 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:23,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:24,002 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:24,003 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:24,003 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-07-25 13:21:24,003 INFO L451 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-07-25 13:21:24,005 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-07-25 13:21:24,006 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-07-25 13:21:24,006 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 74 states. [2018-07-25 13:21:24,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:24,115 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-07-25 13:21:24,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-07-25 13:21:24,115 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 146 [2018-07-25 13:21:24,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:24,118 INFO L225 Difference]: With dead ends: 151 [2018-07-25 13:21:24,119 INFO L226 Difference]: Without dead ends: 149 [2018-07-25 13:21:24,120 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-07-25 13:21:24,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-07-25 13:21:24,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-07-25 13:21:24,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-07-25 13:21:24,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-07-25 13:21:24,125 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 146 [2018-07-25 13:21:24,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:24,125 INFO L472 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-07-25 13:21:24,125 INFO L473 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-07-25 13:21:24,125 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-07-25 13:21:24,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-07-25 13:21:24,127 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:24,127 INFO L354 BasicCegarLoop]: trace histogram [73, 72, 1, 1, 1] [2018-07-25 13:21:24,127 INFO L415 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:24,127 INFO L82 PathProgramCache]: Analyzing trace with hash -979937769, now seen corresponding path program 72 times [2018-07-25 13:21:24,128 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:24,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:24,459 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:24,459 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:24,459 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-07-25 13:21:24,460 INFO L451 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-07-25 13:21:24,461 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-07-25 13:21:24,461 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-07-25 13:21:24,461 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 75 states. [2018-07-25 13:21:24,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:24,546 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-07-25 13:21:24,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-07-25 13:21:24,546 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 148 [2018-07-25 13:21:24,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:24,549 INFO L225 Difference]: With dead ends: 153 [2018-07-25 13:21:24,549 INFO L226 Difference]: Without dead ends: 151 [2018-07-25 13:21:24,550 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-07-25 13:21:24,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-07-25 13:21:24,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-07-25 13:21:24,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-07-25 13:21:24,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-07-25 13:21:24,557 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 148 [2018-07-25 13:21:24,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:24,558 INFO L472 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-07-25 13:21:24,558 INFO L473 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-07-25 13:21:24,558 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-07-25 13:21:24,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-07-25 13:21:24,560 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:24,560 INFO L354 BasicCegarLoop]: trace histogram [74, 73, 1, 1, 1] [2018-07-25 13:21:24,560 INFO L415 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:24,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1122306095, now seen corresponding path program 73 times [2018-07-25 13:21:24,561 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:24,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:24,980 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:24,981 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:24,981 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-07-25 13:21:24,982 INFO L451 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-07-25 13:21:24,983 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-07-25 13:21:24,984 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-07-25 13:21:24,985 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 76 states. [2018-07-25 13:21:25,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:25,081 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-07-25 13:21:25,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-07-25 13:21:25,082 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 150 [2018-07-25 13:21:25,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:25,083 INFO L225 Difference]: With dead ends: 155 [2018-07-25 13:21:25,083 INFO L226 Difference]: Without dead ends: 153 [2018-07-25 13:21:25,084 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-07-25 13:21:25,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-07-25 13:21:25,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-07-25 13:21:25,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-07-25 13:21:25,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-07-25 13:21:25,091 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 150 [2018-07-25 13:21:25,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:25,092 INFO L472 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-07-25 13:21:25,092 INFO L473 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-07-25 13:21:25,092 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-07-25 13:21:25,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-07-25 13:21:25,093 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:25,094 INFO L354 BasicCegarLoop]: trace histogram [75, 74, 1, 1, 1] [2018-07-25 13:21:25,094 INFO L415 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:25,094 INFO L82 PathProgramCache]: Analyzing trace with hash -499313909, now seen corresponding path program 74 times [2018-07-25 13:21:25,094 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:25,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:25,503 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:25,503 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:25,504 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-07-25 13:21:25,504 INFO L451 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-07-25 13:21:25,505 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-07-25 13:21:25,506 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-07-25 13:21:25,506 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 77 states. [2018-07-25 13:21:25,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:25,631 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2018-07-25 13:21:25,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-07-25 13:21:25,631 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 152 [2018-07-25 13:21:25,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:25,632 INFO L225 Difference]: With dead ends: 157 [2018-07-25 13:21:25,633 INFO L226 Difference]: Without dead ends: 155 [2018-07-25 13:21:25,633 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-07-25 13:21:25,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-07-25 13:21:25,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-07-25 13:21:25,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-07-25 13:21:25,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-07-25 13:21:25,639 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 152 [2018-07-25 13:21:25,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:25,640 INFO L472 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-07-25 13:21:25,640 INFO L473 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-07-25 13:21:25,640 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-07-25 13:21:25,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-07-25 13:21:25,641 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:25,642 INFO L354 BasicCegarLoop]: trace histogram [76, 75, 1, 1, 1] [2018-07-25 13:21:25,642 INFO L415 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:25,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1195722693, now seen corresponding path program 75 times [2018-07-25 13:21:25,642 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:25,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:25,966 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:25,966 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:25,967 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-07-25 13:21:25,967 INFO L451 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-07-25 13:21:25,968 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-07-25 13:21:25,969 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-07-25 13:21:25,969 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 78 states. [2018-07-25 13:21:26,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:26,041 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-07-25 13:21:26,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-07-25 13:21:26,041 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 154 [2018-07-25 13:21:26,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:26,042 INFO L225 Difference]: With dead ends: 159 [2018-07-25 13:21:26,042 INFO L226 Difference]: Without dead ends: 157 [2018-07-25 13:21:26,043 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-07-25 13:21:26,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-07-25 13:21:26,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-07-25 13:21:26,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-07-25 13:21:26,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-07-25 13:21:26,051 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 154 [2018-07-25 13:21:26,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:26,051 INFO L472 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-07-25 13:21:26,052 INFO L473 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-07-25 13:21:26,052 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-07-25 13:21:26,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-07-25 13:21:26,053 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:26,053 INFO L354 BasicCegarLoop]: trace histogram [77, 76, 1, 1, 1] [2018-07-25 13:21:26,053 INFO L415 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:26,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1961675265, now seen corresponding path program 76 times [2018-07-25 13:21:26,054 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:26,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:26,369 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:26,369 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:26,369 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-07-25 13:21:26,370 INFO L451 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-07-25 13:21:26,371 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-07-25 13:21:26,371 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-07-25 13:21:26,372 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 79 states. [2018-07-25 13:21:26,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:26,509 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-07-25 13:21:26,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-07-25 13:21:26,509 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 156 [2018-07-25 13:21:26,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:26,511 INFO L225 Difference]: With dead ends: 161 [2018-07-25 13:21:26,511 INFO L226 Difference]: Without dead ends: 159 [2018-07-25 13:21:26,512 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 13:21:26,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-07-25 13:21:26,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-07-25 13:21:26,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-07-25 13:21:26,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2018-07-25 13:21:26,518 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 156 [2018-07-25 13:21:26,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:26,518 INFO L472 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2018-07-25 13:21:26,519 INFO L473 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-07-25 13:21:26,519 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2018-07-25 13:21:26,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-07-25 13:21:26,520 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:26,521 INFO L354 BasicCegarLoop]: trace histogram [78, 77, 1, 1, 1] [2018-07-25 13:21:26,521 INFO L415 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:26,521 INFO L82 PathProgramCache]: Analyzing trace with hash 320765369, now seen corresponding path program 77 times [2018-07-25 13:21:26,521 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:26,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:26,839 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:26,840 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:26,840 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-07-25 13:21:26,840 INFO L451 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-07-25 13:21:26,841 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-07-25 13:21:26,842 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-07-25 13:21:26,842 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 80 states. [2018-07-25 13:21:26,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:26,955 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-07-25 13:21:26,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-07-25 13:21:26,956 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 158 [2018-07-25 13:21:26,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:26,957 INFO L225 Difference]: With dead ends: 163 [2018-07-25 13:21:26,957 INFO L226 Difference]: Without dead ends: 161 [2018-07-25 13:21:26,958 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 13:21:26,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-07-25 13:21:26,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-07-25 13:21:26,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-07-25 13:21:26,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-07-25 13:21:26,965 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 158 [2018-07-25 13:21:26,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:26,966 INFO L472 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-07-25 13:21:26,966 INFO L473 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-07-25 13:21:26,966 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-07-25 13:21:26,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-07-25 13:21:26,967 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:26,968 INFO L354 BasicCegarLoop]: trace histogram [79, 78, 1, 1, 1] [2018-07-25 13:21:26,968 INFO L415 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:26,968 INFO L82 PathProgramCache]: Analyzing trace with hash -982073613, now seen corresponding path program 78 times [2018-07-25 13:21:26,968 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:26,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:27,285 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:27,285 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:27,285 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-07-25 13:21:27,286 INFO L451 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-07-25 13:21:27,287 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-07-25 13:21:27,287 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-07-25 13:21:27,287 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 81 states. [2018-07-25 13:21:27,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:27,362 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-07-25 13:21:27,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-07-25 13:21:27,362 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 160 [2018-07-25 13:21:27,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:27,363 INFO L225 Difference]: With dead ends: 165 [2018-07-25 13:21:27,363 INFO L226 Difference]: Without dead ends: 163 [2018-07-25 13:21:27,364 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 13:21:27,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-07-25 13:21:27,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-07-25 13:21:27,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-07-25 13:21:27,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-07-25 13:21:27,370 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 160 [2018-07-25 13:21:27,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:27,370 INFO L472 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-07-25 13:21:27,370 INFO L473 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-07-25 13:21:27,370 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-07-25 13:21:27,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-07-25 13:21:27,372 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:27,372 INFO L354 BasicCegarLoop]: trace histogram [80, 79, 1, 1, 1] [2018-07-25 13:21:27,372 INFO L415 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:27,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1120115117, now seen corresponding path program 79 times [2018-07-25 13:21:27,373 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:27,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:27,686 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:27,686 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:27,687 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-07-25 13:21:27,687 INFO L451 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-07-25 13:21:27,688 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-07-25 13:21:27,689 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-07-25 13:21:27,689 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 82 states. [2018-07-25 13:21:27,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:27,819 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-07-25 13:21:27,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-07-25 13:21:27,819 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 162 [2018-07-25 13:21:27,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:27,821 INFO L225 Difference]: With dead ends: 167 [2018-07-25 13:21:27,821 INFO L226 Difference]: Without dead ends: 165 [2018-07-25 13:21:27,822 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 13:21:27,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-07-25 13:21:27,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-07-25 13:21:27,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-07-25 13:21:27,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-07-25 13:21:27,827 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 162 [2018-07-25 13:21:27,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:27,828 INFO L472 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-07-25 13:21:27,828 INFO L473 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-07-25 13:21:27,828 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-07-25 13:21:27,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-07-25 13:21:27,829 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:27,830 INFO L354 BasicCegarLoop]: trace histogram [81, 80, 1, 1, 1] [2018-07-25 13:21:27,830 INFO L415 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:27,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1606111769, now seen corresponding path program 80 times [2018-07-25 13:21:27,830 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:27,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:28,194 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:28,195 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:28,195 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-07-25 13:21:28,195 INFO L451 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-07-25 13:21:28,197 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-07-25 13:21:28,197 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-07-25 13:21:28,198 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 83 states. [2018-07-25 13:21:28,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:28,362 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2018-07-25 13:21:28,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-07-25 13:21:28,362 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 164 [2018-07-25 13:21:28,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:28,364 INFO L225 Difference]: With dead ends: 169 [2018-07-25 13:21:28,364 INFO L226 Difference]: Without dead ends: 167 [2018-07-25 13:21:28,365 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 13:21:28,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-07-25 13:21:28,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-07-25 13:21:28,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-07-25 13:21:28,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2018-07-25 13:21:28,370 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 164 [2018-07-25 13:21:28,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:28,371 INFO L472 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2018-07-25 13:21:28,371 INFO L473 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-07-25 13:21:28,371 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2018-07-25 13:21:28,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-07-25 13:21:28,373 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:28,373 INFO L354 BasicCegarLoop]: trace histogram [82, 81, 1, 1, 1] [2018-07-25 13:21:28,373 INFO L415 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:28,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1580098655, now seen corresponding path program 81 times [2018-07-25 13:21:28,374 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:28,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:28,706 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:28,706 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:28,706 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-07-25 13:21:28,707 INFO L451 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-07-25 13:21:28,708 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-07-25 13:21:28,708 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-07-25 13:21:28,708 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 84 states. [2018-07-25 13:21:28,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:28,877 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-07-25 13:21:28,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-07-25 13:21:28,877 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 166 [2018-07-25 13:21:28,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:28,879 INFO L225 Difference]: With dead ends: 171 [2018-07-25 13:21:28,879 INFO L226 Difference]: Without dead ends: 169 [2018-07-25 13:21:28,880 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 13:21:28,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-07-25 13:21:28,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-07-25 13:21:28,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-07-25 13:21:28,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2018-07-25 13:21:28,886 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 166 [2018-07-25 13:21:28,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:28,886 INFO L472 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2018-07-25 13:21:28,886 INFO L473 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-07-25 13:21:28,886 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2018-07-25 13:21:28,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-07-25 13:21:28,888 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:28,888 INFO L354 BasicCegarLoop]: trace histogram [83, 82, 1, 1, 1] [2018-07-25 13:21:28,888 INFO L415 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:28,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1943667419, now seen corresponding path program 82 times [2018-07-25 13:21:28,889 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:28,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:29,218 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:29,218 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:29,218 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-07-25 13:21:29,219 INFO L451 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-07-25 13:21:29,220 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-07-25 13:21:29,220 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-07-25 13:21:29,221 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 85 states. [2018-07-25 13:21:29,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:29,393 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2018-07-25 13:21:29,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-07-25 13:21:29,394 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 168 [2018-07-25 13:21:29,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:29,395 INFO L225 Difference]: With dead ends: 173 [2018-07-25 13:21:29,395 INFO L226 Difference]: Without dead ends: 171 [2018-07-25 13:21:29,396 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 13:21:29,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-07-25 13:21:29,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-07-25 13:21:29,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-07-25 13:21:29,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-07-25 13:21:29,403 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 168 [2018-07-25 13:21:29,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:29,403 INFO L472 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-07-25 13:21:29,403 INFO L473 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-07-25 13:21:29,403 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-07-25 13:21:29,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-07-25 13:21:29,405 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:29,405 INFO L354 BasicCegarLoop]: trace histogram [84, 83, 1, 1, 1] [2018-07-25 13:21:29,405 INFO L415 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:29,406 INFO L82 PathProgramCache]: Analyzing trace with hash -446332011, now seen corresponding path program 83 times [2018-07-25 13:21:29,406 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:29,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:29,745 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:29,746 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:29,746 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-07-25 13:21:29,746 INFO L451 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-07-25 13:21:29,747 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-07-25 13:21:29,748 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-07-25 13:21:29,748 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 86 states. [2018-07-25 13:21:29,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:29,914 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-07-25 13:21:29,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-07-25 13:21:29,914 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 170 [2018-07-25 13:21:29,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:29,915 INFO L225 Difference]: With dead ends: 175 [2018-07-25 13:21:29,916 INFO L226 Difference]: Without dead ends: 173 [2018-07-25 13:21:29,917 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-07-25 13:21:29,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-07-25 13:21:29,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-07-25 13:21:29,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-07-25 13:21:29,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-07-25 13:21:29,922 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 170 [2018-07-25 13:21:29,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:29,923 INFO L472 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-07-25 13:21:29,923 INFO L473 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-07-25 13:21:29,923 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-07-25 13:21:29,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-07-25 13:21:29,924 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:29,925 INFO L354 BasicCegarLoop]: trace histogram [85, 84, 1, 1, 1] [2018-07-25 13:21:29,925 INFO L415 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:29,925 INFO L82 PathProgramCache]: Analyzing trace with hash 571719119, now seen corresponding path program 84 times [2018-07-25 13:21:29,925 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:29,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:30,305 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 13:21:30,306 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:30,306 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-07-25 13:21:30,306 INFO L451 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-07-25 13:21:30,308 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-07-25 13:21:30,310 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-07-25 13:21:30,310 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 87 states. [2018-07-25 13:21:30,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:30,521 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2018-07-25 13:21:30,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-07-25 13:21:30,522 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 172 [2018-07-25 13:21:30,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:30,523 INFO L225 Difference]: With dead ends: 177 [2018-07-25 13:21:30,523 INFO L226 Difference]: Without dead ends: 175 [2018-07-25 13:21:30,525 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 13:21:30,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-07-25 13:21:30,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-07-25 13:21:30,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-07-25 13:21:30,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2018-07-25 13:21:30,534 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 172 [2018-07-25 13:21:30,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:30,534 INFO L472 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2018-07-25 13:21:30,534 INFO L473 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-07-25 13:21:30,534 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2018-07-25 13:21:30,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-07-25 13:21:30,538 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:30,539 INFO L354 BasicCegarLoop]: trace histogram [86, 85, 1, 1, 1] [2018-07-25 13:21:30,539 INFO L415 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:30,539 INFO L82 PathProgramCache]: Analyzing trace with hash -333688439, now seen corresponding path program 85 times [2018-07-25 13:21:30,539 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:30,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:30,953 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:30,953 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:30,953 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-07-25 13:21:30,954 INFO L451 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-07-25 13:21:30,957 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-07-25 13:21:30,958 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-07-25 13:21:30,958 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 88 states. [2018-07-25 13:21:31,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:31,135 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-07-25 13:21:31,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-07-25 13:21:31,135 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 174 [2018-07-25 13:21:31,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:31,136 INFO L225 Difference]: With dead ends: 179 [2018-07-25 13:21:31,136 INFO L226 Difference]: Without dead ends: 177 [2018-07-25 13:21:31,140 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 13:21:31,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-07-25 13:21:31,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-07-25 13:21:31,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-07-25 13:21:31,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-07-25 13:21:31,149 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 174 [2018-07-25 13:21:31,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:31,149 INFO L472 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-07-25 13:21:31,149 INFO L473 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-07-25 13:21:31,149 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-07-25 13:21:31,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-07-25 13:21:31,152 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:31,153 INFO L354 BasicCegarLoop]: trace histogram [87, 86, 1, 1, 1] [2018-07-25 13:21:31,153 INFO L415 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:31,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1448009411, now seen corresponding path program 86 times [2018-07-25 13:21:31,153 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:31,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:31,672 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:31,673 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:31,673 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-07-25 13:21:31,674 INFO L451 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-07-25 13:21:31,675 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-07-25 13:21:31,677 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-07-25 13:21:31,677 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 89 states. [2018-07-25 13:21:31,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:31,758 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2018-07-25 13:21:31,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-07-25 13:21:31,759 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 176 [2018-07-25 13:21:31,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:31,760 INFO L225 Difference]: With dead ends: 181 [2018-07-25 13:21:31,760 INFO L226 Difference]: Without dead ends: 179 [2018-07-25 13:21:31,762 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-07-25 13:21:31,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-07-25 13:21:31,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-07-25 13:21:31,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-07-25 13:21:31,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2018-07-25 13:21:31,773 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 176 [2018-07-25 13:21:31,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:31,773 INFO L472 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2018-07-25 13:21:31,773 INFO L473 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-07-25 13:21:31,773 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2018-07-25 13:21:31,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-07-25 13:21:31,775 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:31,776 INFO L354 BasicCegarLoop]: trace histogram [88, 87, 1, 1, 1] [2018-07-25 13:21:31,776 INFO L415 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:31,776 INFO L82 PathProgramCache]: Analyzing trace with hash -32307843, now seen corresponding path program 87 times [2018-07-25 13:21:31,776 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:31,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:32,143 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:32,143 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:32,144 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-07-25 13:21:32,144 INFO L451 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-07-25 13:21:32,145 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-07-25 13:21:32,146 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-07-25 13:21:32,146 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 90 states. [2018-07-25 13:21:32,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:32,320 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-07-25 13:21:32,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-07-25 13:21:32,320 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 178 [2018-07-25 13:21:32,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:32,322 INFO L225 Difference]: With dead ends: 183 [2018-07-25 13:21:32,322 INFO L226 Difference]: Without dead ends: 181 [2018-07-25 13:21:32,323 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-07-25 13:21:32,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-07-25 13:21:32,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-07-25 13:21:32,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-07-25 13:21:32,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-07-25 13:21:32,328 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 178 [2018-07-25 13:21:32,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:32,329 INFO L472 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-07-25 13:21:32,329 INFO L473 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-07-25 13:21:32,329 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-07-25 13:21:32,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-07-25 13:21:32,331 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:32,331 INFO L354 BasicCegarLoop]: trace histogram [89, 88, 1, 1, 1] [2018-07-25 13:21:32,331 INFO L415 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:32,332 INFO L82 PathProgramCache]: Analyzing trace with hash -983013961, now seen corresponding path program 88 times [2018-07-25 13:21:32,332 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:32,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:32,684 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:32,685 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:32,685 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-07-25 13:21:32,685 INFO L451 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-07-25 13:21:32,686 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-07-25 13:21:32,687 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-07-25 13:21:32,687 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 91 states. [2018-07-25 13:21:32,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:32,850 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2018-07-25 13:21:32,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-07-25 13:21:32,851 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 180 [2018-07-25 13:21:32,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:32,852 INFO L225 Difference]: With dead ends: 185 [2018-07-25 13:21:32,852 INFO L226 Difference]: Without dead ends: 183 [2018-07-25 13:21:32,853 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 13:21:32,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-07-25 13:21:32,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-07-25 13:21:32,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-07-25 13:21:32,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-07-25 13:21:32,861 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 180 [2018-07-25 13:21:32,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:32,862 INFO L472 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-07-25 13:21:32,862 INFO L473 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-07-25 13:21:32,862 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-07-25 13:21:32,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-07-25 13:21:32,867 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:32,867 INFO L354 BasicCegarLoop]: trace histogram [90, 89, 1, 1, 1] [2018-07-25 13:21:32,867 INFO L415 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:32,868 INFO L82 PathProgramCache]: Analyzing trace with hash 216440689, now seen corresponding path program 89 times [2018-07-25 13:21:32,868 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:32,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:33,231 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:33,231 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:33,231 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-07-25 13:21:33,232 INFO L451 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-07-25 13:21:33,232 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-07-25 13:21:33,233 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-07-25 13:21:33,233 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 92 states. [2018-07-25 13:21:33,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:33,359 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2018-07-25 13:21:33,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-07-25 13:21:33,360 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 182 [2018-07-25 13:21:33,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:33,362 INFO L225 Difference]: With dead ends: 187 [2018-07-25 13:21:33,362 INFO L226 Difference]: Without dead ends: 185 [2018-07-25 13:21:33,363 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 13:21:33,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-07-25 13:21:33,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-07-25 13:21:33,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-07-25 13:21:33,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-07-25 13:21:33,373 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 182 [2018-07-25 13:21:33,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:33,375 INFO L472 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-07-25 13:21:33,375 INFO L473 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-07-25 13:21:33,375 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-07-25 13:21:33,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-07-25 13:21:33,378 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:33,378 INFO L354 BasicCegarLoop]: trace histogram [91, 90, 1, 1, 1] [2018-07-25 13:21:33,378 INFO L415 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:33,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1841124011, now seen corresponding path program 90 times [2018-07-25 13:21:33,379 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:33,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:33,695 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:33,696 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:33,696 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-07-25 13:21:33,696 INFO L451 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-07-25 13:21:33,697 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-07-25 13:21:33,698 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-07-25 13:21:33,698 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 93 states. [2018-07-25 13:21:33,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:33,876 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2018-07-25 13:21:33,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-07-25 13:21:33,876 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 184 [2018-07-25 13:21:33,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:33,878 INFO L225 Difference]: With dead ends: 189 [2018-07-25 13:21:33,878 INFO L226 Difference]: Without dead ends: 187 [2018-07-25 13:21:33,879 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 13:21:33,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-07-25 13:21:33,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-07-25 13:21:33,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-07-25 13:21:33,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2018-07-25 13:21:33,884 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 184 [2018-07-25 13:21:33,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:33,885 INFO L472 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2018-07-25 13:21:33,885 INFO L473 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-07-25 13:21:33,885 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2018-07-25 13:21:33,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-07-25 13:21:33,886 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:33,886 INFO L354 BasicCegarLoop]: trace histogram [92, 91, 1, 1, 1] [2018-07-25 13:21:33,887 INFO L415 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:33,887 INFO L82 PathProgramCache]: Analyzing trace with hash -206299291, now seen corresponding path program 91 times [2018-07-25 13:21:33,887 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:33,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:34,197 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:34,198 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:34,198 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-07-25 13:21:34,199 INFO L451 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-07-25 13:21:34,199 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-07-25 13:21:34,200 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-07-25 13:21:34,200 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 94 states. [2018-07-25 13:21:34,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:34,367 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-07-25 13:21:34,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-07-25 13:21:34,368 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 186 [2018-07-25 13:21:34,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:34,369 INFO L225 Difference]: With dead ends: 191 [2018-07-25 13:21:34,369 INFO L226 Difference]: Without dead ends: 189 [2018-07-25 13:21:34,370 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-07-25 13:21:34,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-07-25 13:21:34,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-07-25 13:21:34,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-07-25 13:21:34,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2018-07-25 13:21:34,375 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 186 [2018-07-25 13:21:34,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:34,376 INFO L472 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2018-07-25 13:21:34,376 INFO L473 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-07-25 13:21:34,376 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2018-07-25 13:21:34,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-07-25 13:21:34,377 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:34,377 INFO L354 BasicCegarLoop]: trace histogram [93, 92, 1, 1, 1] [2018-07-25 13:21:34,377 INFO L415 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:34,378 INFO L82 PathProgramCache]: Analyzing trace with hash -685070945, now seen corresponding path program 92 times [2018-07-25 13:21:34,378 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:34,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:34,846 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:34,846 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:34,846 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-07-25 13:21:34,847 INFO L451 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-07-25 13:21:34,848 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-07-25 13:21:34,848 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-07-25 13:21:34,848 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 95 states. [2018-07-25 13:21:34,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:34,945 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2018-07-25 13:21:34,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-07-25 13:21:34,945 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 188 [2018-07-25 13:21:34,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:34,947 INFO L225 Difference]: With dead ends: 193 [2018-07-25 13:21:34,947 INFO L226 Difference]: Without dead ends: 191 [2018-07-25 13:21:34,948 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-07-25 13:21:34,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-07-25 13:21:34,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-07-25 13:21:34,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-07-25 13:21:34,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-07-25 13:21:34,953 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 188 [2018-07-25 13:21:34,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:34,953 INFO L472 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2018-07-25 13:21:34,953 INFO L473 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-07-25 13:21:34,953 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-07-25 13:21:34,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-07-25 13:21:34,954 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:34,955 INFO L354 BasicCegarLoop]: trace histogram [94, 93, 1, 1, 1] [2018-07-25 13:21:34,955 INFO L415 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:34,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1223129767, now seen corresponding path program 93 times [2018-07-25 13:21:34,955 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:34,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:35,349 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:35,349 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:35,349 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-07-25 13:21:35,350 INFO L451 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-07-25 13:21:35,351 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-07-25 13:21:35,352 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-07-25 13:21:35,352 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 96 states. [2018-07-25 13:21:35,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:35,519 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-07-25 13:21:35,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-07-25 13:21:35,520 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 190 [2018-07-25 13:21:35,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:35,521 INFO L225 Difference]: With dead ends: 195 [2018-07-25 13:21:35,521 INFO L226 Difference]: Without dead ends: 193 [2018-07-25 13:21:35,522 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-07-25 13:21:35,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-07-25 13:21:35,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-07-25 13:21:35,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-07-25 13:21:35,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-07-25 13:21:35,529 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 190 [2018-07-25 13:21:35,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:35,529 INFO L472 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-07-25 13:21:35,530 INFO L473 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-07-25 13:21:35,530 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-07-25 13:21:35,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-07-25 13:21:35,531 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:35,531 INFO L354 BasicCegarLoop]: trace histogram [95, 94, 1, 1, 1] [2018-07-25 13:21:35,531 INFO L415 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:35,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1393385107, now seen corresponding path program 94 times [2018-07-25 13:21:35,531 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:35,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:35,928 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:35,928 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:35,929 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-07-25 13:21:35,929 INFO L451 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-07-25 13:21:35,930 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-07-25 13:21:35,931 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-07-25 13:21:35,931 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 97 states. [2018-07-25 13:21:36,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:36,178 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2018-07-25 13:21:36,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-07-25 13:21:36,178 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 192 [2018-07-25 13:21:36,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:36,179 INFO L225 Difference]: With dead ends: 197 [2018-07-25 13:21:36,180 INFO L226 Difference]: Without dead ends: 195 [2018-07-25 13:21:36,181 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-07-25 13:21:36,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-07-25 13:21:36,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2018-07-25 13:21:36,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-07-25 13:21:36,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2018-07-25 13:21:36,186 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 192 [2018-07-25 13:21:36,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:36,186 INFO L472 AbstractCegarLoop]: Abstraction has 195 states and 195 transitions. [2018-07-25 13:21:36,186 INFO L473 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-07-25 13:21:36,186 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2018-07-25 13:21:36,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-07-25 13:21:36,187 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:36,187 INFO L354 BasicCegarLoop]: trace histogram [96, 95, 1, 1, 1] [2018-07-25 13:21:36,188 INFO L415 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:36,188 INFO L82 PathProgramCache]: Analyzing trace with hash -986656435, now seen corresponding path program 95 times [2018-07-25 13:21:36,188 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:36,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:36,497 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:36,497 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:36,498 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-07-25 13:21:36,498 INFO L451 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-07-25 13:21:36,499 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-07-25 13:21:36,500 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-07-25 13:21:36,500 INFO L87 Difference]: Start difference. First operand 195 states and 195 transitions. Second operand 98 states. [2018-07-25 13:21:36,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:36,736 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2018-07-25 13:21:36,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-07-25 13:21:36,736 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 194 [2018-07-25 13:21:36,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:36,737 INFO L225 Difference]: With dead ends: 199 [2018-07-25 13:21:36,737 INFO L226 Difference]: Without dead ends: 197 [2018-07-25 13:21:36,739 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-07-25 13:21:36,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-07-25 13:21:36,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-07-25 13:21:36,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-07-25 13:21:36,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2018-07-25 13:21:36,743 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 194 [2018-07-25 13:21:36,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:36,744 INFO L472 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2018-07-25 13:21:36,744 INFO L473 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-07-25 13:21:36,744 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2018-07-25 13:21:36,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-07-25 13:21:36,745 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:36,745 INFO L354 BasicCegarLoop]: trace histogram [97, 96, 1, 1, 1] [2018-07-25 13:21:36,745 INFO L415 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:36,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1010990471, now seen corresponding path program 96 times [2018-07-25 13:21:36,746 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:36,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:37,098 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 9312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:37,098 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:37,098 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-07-25 13:21:37,099 INFO L451 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-07-25 13:21:37,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-07-25 13:21:37,100 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-07-25 13:21:37,100 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 99 states. [2018-07-25 13:21:37,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:37,272 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2018-07-25 13:21:37,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-07-25 13:21:37,273 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 196 [2018-07-25 13:21:37,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:37,274 INFO L225 Difference]: With dead ends: 201 [2018-07-25 13:21:37,275 INFO L226 Difference]: Without dead ends: 199 [2018-07-25 13:21:37,276 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-07-25 13:21:37,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-07-25 13:21:37,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-07-25 13:21:37,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-07-25 13:21:37,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2018-07-25 13:21:37,280 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 196 [2018-07-25 13:21:37,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:37,281 INFO L472 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2018-07-25 13:21:37,281 INFO L473 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-07-25 13:21:37,281 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2018-07-25 13:21:37,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-07-25 13:21:37,282 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:37,282 INFO L354 BasicCegarLoop]: trace histogram [98, 97, 1, 1, 1] [2018-07-25 13:21:37,282 INFO L415 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:37,283 INFO L82 PathProgramCache]: Analyzing trace with hash 899285825, now seen corresponding path program 97 times [2018-07-25 13:21:37,283 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:37,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:37,630 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 9506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:37,630 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:37,630 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-07-25 13:21:37,630 INFO L451 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-07-25 13:21:37,631 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-07-25 13:21:37,632 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-07-25 13:21:37,632 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand 100 states. [2018-07-25 13:21:37,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:37,824 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2018-07-25 13:21:37,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-07-25 13:21:37,824 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 198 [2018-07-25 13:21:37,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:37,825 INFO L225 Difference]: With dead ends: 203 [2018-07-25 13:21:37,825 INFO L226 Difference]: Without dead ends: 201 [2018-07-25 13:21:37,826 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-07-25 13:21:37,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-07-25 13:21:37,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2018-07-25 13:21:37,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-07-25 13:21:37,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-07-25 13:21:37,832 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 198 [2018-07-25 13:21:37,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:37,833 INFO L472 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-07-25 13:21:37,833 INFO L473 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-07-25 13:21:37,833 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-07-25 13:21:37,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-07-25 13:21:37,834 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:37,835 INFO L354 BasicCegarLoop]: trace histogram [99, 98, 1, 1, 1] [2018-07-25 13:21:37,835 INFO L415 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:37,835 INFO L82 PathProgramCache]: Analyzing trace with hash 925303419, now seen corresponding path program 98 times [2018-07-25 13:21:37,835 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:37,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:38,307 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 9702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:38,307 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:38,307 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-07-25 13:21:38,308 INFO L451 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-07-25 13:21:38,308 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-07-25 13:21:38,309 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-07-25 13:21:38,309 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 101 states. [2018-07-25 13:21:38,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:38,471 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2018-07-25 13:21:38,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-07-25 13:21:38,471 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 200 [2018-07-25 13:21:38,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:38,472 INFO L225 Difference]: With dead ends: 205 [2018-07-25 13:21:38,473 INFO L226 Difference]: Without dead ends: 203 [2018-07-25 13:21:38,474 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 13:21:38,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-07-25 13:21:38,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-07-25 13:21:38,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-07-25 13:21:38,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2018-07-25 13:21:38,478 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 200 [2018-07-25 13:21:38,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:38,479 INFO L472 AbstractCegarLoop]: Abstraction has 203 states and 203 transitions. [2018-07-25 13:21:38,479 INFO L473 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-07-25 13:21:38,479 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2018-07-25 13:21:38,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-07-25 13:21:38,480 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:38,480 INFO L354 BasicCegarLoop]: trace histogram [100, 99, 1, 1, 1] [2018-07-25 13:21:38,480 INFO L415 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:38,480 INFO L82 PathProgramCache]: Analyzing trace with hash 158407477, now seen corresponding path program 99 times [2018-07-25 13:21:38,481 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:38,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:38,841 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 9900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:38,842 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:38,842 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-07-25 13:21:38,842 INFO L451 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-07-25 13:21:38,843 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-07-25 13:21:38,844 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-07-25 13:21:38,844 INFO L87 Difference]: Start difference. First operand 203 states and 203 transitions. Second operand 102 states. [2018-07-25 13:21:39,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:39,029 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2018-07-25 13:21:39,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-07-25 13:21:39,029 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 202 [2018-07-25 13:21:39,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:39,030 INFO L225 Difference]: With dead ends: 207 [2018-07-25 13:21:39,031 INFO L226 Difference]: Without dead ends: 205 [2018-07-25 13:21:39,032 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 13:21:39,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-07-25 13:21:39,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-07-25 13:21:39,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-07-25 13:21:39,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2018-07-25 13:21:39,037 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 202 [2018-07-25 13:21:39,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:39,037 INFO L472 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2018-07-25 13:21:39,037 INFO L473 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-07-25 13:21:39,038 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2018-07-25 13:21:39,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-07-25 13:21:39,039 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:39,039 INFO L354 BasicCegarLoop]: trace histogram [101, 100, 1, 1, 1] [2018-07-25 13:21:39,039 INFO L415 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:39,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1905782127, now seen corresponding path program 100 times [2018-07-25 13:21:39,039 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:39,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:39,361 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 10100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:39,361 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:39,361 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-07-25 13:21:39,362 INFO L451 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-07-25 13:21:39,362 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-07-25 13:21:39,363 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-07-25 13:21:39,363 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 103 states. [2018-07-25 13:21:39,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:39,440 INFO L93 Difference]: Finished difference Result 209 states and 209 transitions. [2018-07-25 13:21:39,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-07-25 13:21:39,441 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 204 [2018-07-25 13:21:39,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:39,442 INFO L225 Difference]: With dead ends: 209 [2018-07-25 13:21:39,442 INFO L226 Difference]: Without dead ends: 207 [2018-07-25 13:21:39,443 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 13:21:39,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-07-25 13:21:39,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2018-07-25 13:21:39,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-07-25 13:21:39,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2018-07-25 13:21:39,448 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 204 [2018-07-25 13:21:39,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:39,449 INFO L472 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2018-07-25 13:21:39,449 INFO L473 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-07-25 13:21:39,449 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2018-07-25 13:21:39,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-07-25 13:21:39,450 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:39,450 INFO L354 BasicCegarLoop]: trace histogram [102, 101, 1, 1, 1] [2018-07-25 13:21:39,451 INFO L415 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:39,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1800608041, now seen corresponding path program 101 times [2018-07-25 13:21:39,451 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:39,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:39,803 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 10302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:39,804 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:39,804 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-07-25 13:21:39,804 INFO L451 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-07-25 13:21:39,806 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-07-25 13:21:39,806 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-07-25 13:21:39,806 INFO L87 Difference]: Start difference. First operand 207 states and 207 transitions. Second operand 104 states. [2018-07-25 13:21:39,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:39,936 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2018-07-25 13:21:39,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-07-25 13:21:39,936 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 206 [2018-07-25 13:21:39,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:39,937 INFO L225 Difference]: With dead ends: 211 [2018-07-25 13:21:39,938 INFO L226 Difference]: Without dead ends: 209 [2018-07-25 13:21:39,939 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 13:21:39,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-07-25 13:21:39,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2018-07-25 13:21:39,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-07-25 13:21:39,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2018-07-25 13:21:39,944 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 206 [2018-07-25 13:21:39,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:39,944 INFO L472 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2018-07-25 13:21:39,944 INFO L473 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-07-25 13:21:39,944 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2018-07-25 13:21:39,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-07-25 13:21:39,945 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:39,946 INFO L354 BasicCegarLoop]: trace histogram [103, 102, 1, 1, 1] [2018-07-25 13:21:39,946 INFO L415 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:39,946 INFO L82 PathProgramCache]: Analyzing trace with hash -487440797, now seen corresponding path program 102 times [2018-07-25 13:21:39,946 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:39,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:40,326 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 10506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:40,326 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:40,326 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2018-07-25 13:21:40,327 INFO L451 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-07-25 13:21:40,328 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-07-25 13:21:40,328 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2018-07-25 13:21:40,329 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 105 states. [2018-07-25 13:21:40,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:40,561 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2018-07-25 13:21:40,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-07-25 13:21:40,561 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 208 [2018-07-25 13:21:40,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:40,562 INFO L225 Difference]: With dead ends: 213 [2018-07-25 13:21:40,562 INFO L226 Difference]: Without dead ends: 211 [2018-07-25 13:21:40,563 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 13:21:40,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-07-25 13:21:40,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-07-25 13:21:40,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-07-25 13:21:40,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2018-07-25 13:21:40,568 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 208 [2018-07-25 13:21:40,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:40,568 INFO L472 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2018-07-25 13:21:40,568 INFO L473 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-07-25 13:21:40,568 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2018-07-25 13:21:40,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-07-25 13:21:40,569 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:40,570 INFO L354 BasicCegarLoop]: trace histogram [104, 103, 1, 1, 1] [2018-07-25 13:21:40,570 INFO L415 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:40,570 INFO L82 PathProgramCache]: Analyzing trace with hash -279118563, now seen corresponding path program 103 times [2018-07-25 13:21:40,570 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:40,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:40,938 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 10712 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:40,938 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:40,938 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-07-25 13:21:40,939 INFO L451 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-07-25 13:21:40,940 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-07-25 13:21:40,940 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-07-25 13:21:40,940 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 106 states. [2018-07-25 13:21:41,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:41,019 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2018-07-25 13:21:41,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-07-25 13:21:41,019 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 210 [2018-07-25 13:21:41,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:41,020 INFO L225 Difference]: With dead ends: 215 [2018-07-25 13:21:41,020 INFO L226 Difference]: Without dead ends: 213 [2018-07-25 13:21:41,021 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 13:21:41,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-07-25 13:21:41,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2018-07-25 13:21:41,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-07-25 13:21:41,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2018-07-25 13:21:41,026 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 210 [2018-07-25 13:21:41,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:41,026 INFO L472 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2018-07-25 13:21:41,026 INFO L473 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-07-25 13:21:41,026 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2018-07-25 13:21:41,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-07-25 13:21:41,027 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:41,027 INFO L354 BasicCegarLoop]: trace histogram [105, 104, 1, 1, 1] [2018-07-25 13:21:41,028 INFO L415 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:41,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1944914601, now seen corresponding path program 104 times [2018-07-25 13:21:41,028 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:41,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:41,426 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 0 proven. 10920 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:41,426 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:41,426 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2018-07-25 13:21:41,427 INFO L451 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-07-25 13:21:41,428 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-07-25 13:21:41,429 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2018-07-25 13:21:41,429 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 107 states. [2018-07-25 13:21:41,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:41,601 INFO L93 Difference]: Finished difference Result 217 states and 217 transitions. [2018-07-25 13:21:41,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-07-25 13:21:41,601 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 212 [2018-07-25 13:21:41,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:41,602 INFO L225 Difference]: With dead ends: 217 [2018-07-25 13:21:41,602 INFO L226 Difference]: Without dead ends: 215 [2018-07-25 13:21:41,603 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 13:21:41,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-07-25 13:21:41,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2018-07-25 13:21:41,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-07-25 13:21:41,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 215 transitions. [2018-07-25 13:21:41,606 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 215 transitions. Word has length 212 [2018-07-25 13:21:41,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:41,606 INFO L472 AbstractCegarLoop]: Abstraction has 215 states and 215 transitions. [2018-07-25 13:21:41,606 INFO L473 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-07-25 13:21:41,606 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 215 transitions. [2018-07-25 13:21:41,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-07-25 13:21:41,607 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:41,607 INFO L354 BasicCegarLoop]: trace histogram [106, 105, 1, 1, 1] [2018-07-25 13:21:41,607 INFO L415 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:41,608 INFO L82 PathProgramCache]: Analyzing trace with hash -752105711, now seen corresponding path program 105 times [2018-07-25 13:21:41,608 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:41,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:41,915 INFO L134 CoverageAnalysis]: Checked inductivity of 11130 backedges. 0 proven. 11130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:41,916 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:41,916 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-07-25 13:21:41,916 INFO L451 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-07-25 13:21:41,917 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-07-25 13:21:41,918 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-07-25 13:21:41,918 INFO L87 Difference]: Start difference. First operand 215 states and 215 transitions. Second operand 108 states. [2018-07-25 13:21:42,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:42,059 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2018-07-25 13:21:42,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-07-25 13:21:42,060 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 214 [2018-07-25 13:21:42,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:42,060 INFO L225 Difference]: With dead ends: 219 [2018-07-25 13:21:42,060 INFO L226 Difference]: Without dead ends: 217 [2018-07-25 13:21:42,061 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 13:21:42,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-07-25 13:21:42,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2018-07-25 13:21:42,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-07-25 13:21:42,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2018-07-25 13:21:42,065 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 214 [2018-07-25 13:21:42,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:42,065 INFO L472 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2018-07-25 13:21:42,065 INFO L473 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-07-25 13:21:42,065 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2018-07-25 13:21:42,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-07-25 13:21:42,066 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:42,066 INFO L354 BasicCegarLoop]: trace histogram [107, 106, 1, 1, 1] [2018-07-25 13:21:42,066 INFO L415 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:42,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1219030453, now seen corresponding path program 106 times [2018-07-25 13:21:42,066 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:42,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:42,393 INFO L134 CoverageAnalysis]: Checked inductivity of 11342 backedges. 0 proven. 11342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:42,393 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:42,393 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-07-25 13:21:42,394 INFO L451 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-07-25 13:21:42,395 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-07-25 13:21:42,396 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2018-07-25 13:21:42,396 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 109 states. [2018-07-25 13:21:42,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:42,552 INFO L93 Difference]: Finished difference Result 221 states and 221 transitions. [2018-07-25 13:21:42,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-07-25 13:21:42,552 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 216 [2018-07-25 13:21:42,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:42,552 INFO L225 Difference]: With dead ends: 221 [2018-07-25 13:21:42,552 INFO L226 Difference]: Without dead ends: 219 [2018-07-25 13:21:42,553 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 13:21:42,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-07-25 13:21:42,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-07-25 13:21:42,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-07-25 13:21:42,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 219 transitions. [2018-07-25 13:21:42,558 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 219 transitions. Word has length 216 [2018-07-25 13:21:42,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:42,558 INFO L472 AbstractCegarLoop]: Abstraction has 219 states and 219 transitions. [2018-07-25 13:21:42,558 INFO L473 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-07-25 13:21:42,558 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 219 transitions. [2018-07-25 13:21:42,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-07-25 13:21:42,559 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:42,559 INFO L354 BasicCegarLoop]: trace histogram [108, 107, 1, 1, 1] [2018-07-25 13:21:42,559 INFO L415 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:42,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1037858565, now seen corresponding path program 107 times [2018-07-25 13:21:42,560 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:42,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:42,916 INFO L134 CoverageAnalysis]: Checked inductivity of 11556 backedges. 0 proven. 11556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:42,916 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:42,917 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-07-25 13:21:42,917 INFO L451 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-07-25 13:21:42,918 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-07-25 13:21:42,918 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-07-25 13:21:42,919 INFO L87 Difference]: Start difference. First operand 219 states and 219 transitions. Second operand 110 states. [2018-07-25 13:21:43,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:43,151 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2018-07-25 13:21:43,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-07-25 13:21:43,151 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 218 [2018-07-25 13:21:43,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:43,152 INFO L225 Difference]: With dead ends: 223 [2018-07-25 13:21:43,152 INFO L226 Difference]: Without dead ends: 221 [2018-07-25 13:21:43,153 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 13:21:43,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-07-25 13:21:43,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2018-07-25 13:21:43,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-07-25 13:21:43,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2018-07-25 13:21:43,160 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 218 [2018-07-25 13:21:43,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:43,160 INFO L472 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2018-07-25 13:21:43,160 INFO L473 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-07-25 13:21:43,160 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2018-07-25 13:21:43,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-07-25 13:21:43,161 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:43,164 INFO L354 BasicCegarLoop]: trace histogram [109, 108, 1, 1, 1] [2018-07-25 13:21:43,164 INFO L415 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:43,164 INFO L82 PathProgramCache]: Analyzing trace with hash 949720383, now seen corresponding path program 108 times [2018-07-25 13:21:43,164 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:43,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:43,659 INFO L134 CoverageAnalysis]: Checked inductivity of 11772 backedges. 0 proven. 11772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:43,659 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:43,660 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2018-07-25 13:21:43,660 INFO L451 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-07-25 13:21:43,662 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-07-25 13:21:43,663 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2018-07-25 13:21:43,663 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 111 states. [2018-07-25 13:21:43,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:43,907 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2018-07-25 13:21:43,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-07-25 13:21:43,907 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 220 [2018-07-25 13:21:43,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:43,908 INFO L225 Difference]: With dead ends: 225 [2018-07-25 13:21:43,908 INFO L226 Difference]: Without dead ends: 223 [2018-07-25 13:21:43,909 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2018-07-25 13:21:43,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-07-25 13:21:43,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-07-25 13:21:43,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-07-25 13:21:43,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 223 transitions. [2018-07-25 13:21:43,914 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 223 transitions. Word has length 220 [2018-07-25 13:21:43,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:43,914 INFO L472 AbstractCegarLoop]: Abstraction has 223 states and 223 transitions. [2018-07-25 13:21:43,914 INFO L473 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-07-25 13:21:43,914 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 223 transitions. [2018-07-25 13:21:43,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-07-25 13:21:43,915 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:43,915 INFO L354 BasicCegarLoop]: trace histogram [110, 109, 1, 1, 1] [2018-07-25 13:21:43,916 INFO L415 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:43,916 INFO L82 PathProgramCache]: Analyzing trace with hash -2146693895, now seen corresponding path program 109 times [2018-07-25 13:21:43,916 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:43,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:44,339 INFO L134 CoverageAnalysis]: Checked inductivity of 11990 backedges. 0 proven. 11990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:44,339 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:44,339 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-07-25 13:21:44,340 INFO L451 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-07-25 13:21:44,341 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-07-25 13:21:44,341 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-07-25 13:21:44,342 INFO L87 Difference]: Start difference. First operand 223 states and 223 transitions. Second operand 112 states. [2018-07-25 13:21:44,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:44,511 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2018-07-25 13:21:44,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-07-25 13:21:44,511 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 222 [2018-07-25 13:21:44,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:44,512 INFO L225 Difference]: With dead ends: 227 [2018-07-25 13:21:44,512 INFO L226 Difference]: Without dead ends: 225 [2018-07-25 13:21:44,513 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 13:21:44,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-07-25 13:21:44,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2018-07-25 13:21:44,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-07-25 13:21:44,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2018-07-25 13:21:44,516 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 222 [2018-07-25 13:21:44,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:44,516 INFO L472 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2018-07-25 13:21:44,517 INFO L473 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-07-25 13:21:44,517 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2018-07-25 13:21:44,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-07-25 13:21:44,517 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:44,518 INFO L354 BasicCegarLoop]: trace histogram [111, 110, 1, 1, 1] [2018-07-25 13:21:44,518 INFO L415 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:44,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1388478925, now seen corresponding path program 110 times [2018-07-25 13:21:44,518 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:44,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:44,894 INFO L134 CoverageAnalysis]: Checked inductivity of 12210 backedges. 0 proven. 12210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:44,895 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:44,895 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2018-07-25 13:21:44,895 INFO L451 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-07-25 13:21:44,896 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-07-25 13:21:44,897 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2018-07-25 13:21:44,897 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 113 states. [2018-07-25 13:21:45,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:45,044 INFO L93 Difference]: Finished difference Result 229 states and 229 transitions. [2018-07-25 13:21:45,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-07-25 13:21:45,044 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 224 [2018-07-25 13:21:45,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:45,045 INFO L225 Difference]: With dead ends: 229 [2018-07-25 13:21:45,045 INFO L226 Difference]: Without dead ends: 227 [2018-07-25 13:21:45,046 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 13:21:45,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-07-25 13:21:45,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2018-07-25 13:21:45,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-07-25 13:21:45,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2018-07-25 13:21:45,050 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 224 [2018-07-25 13:21:45,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:45,051 INFO L472 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2018-07-25 13:21:45,051 INFO L473 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-07-25 13:21:45,051 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2018-07-25 13:21:45,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-07-25 13:21:45,052 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:45,052 INFO L354 BasicCegarLoop]: trace histogram [112, 111, 1, 1, 1] [2018-07-25 13:21:45,052 INFO L415 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:45,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1406634221, now seen corresponding path program 111 times [2018-07-25 13:21:45,053 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:45,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:45,440 INFO L134 CoverageAnalysis]: Checked inductivity of 12432 backedges. 0 proven. 12432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:45,441 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:45,441 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-07-25 13:21:45,441 INFO L451 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-07-25 13:21:45,442 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-07-25 13:21:45,443 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-07-25 13:21:45,443 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 114 states. [2018-07-25 13:21:45,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:45,599 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2018-07-25 13:21:45,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-07-25 13:21:45,599 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 226 [2018-07-25 13:21:45,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:45,599 INFO L225 Difference]: With dead ends: 231 [2018-07-25 13:21:45,600 INFO L226 Difference]: Without dead ends: 229 [2018-07-25 13:21:45,601 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 13:21:45,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-07-25 13:21:45,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2018-07-25 13:21:45,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-07-25 13:21:45,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2018-07-25 13:21:45,605 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 226 [2018-07-25 13:21:45,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:45,605 INFO L472 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2018-07-25 13:21:45,606 INFO L473 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-07-25 13:21:45,606 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2018-07-25 13:21:45,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-07-25 13:21:45,607 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:45,607 INFO L354 BasicCegarLoop]: trace histogram [113, 112, 1, 1, 1] [2018-07-25 13:21:45,607 INFO L415 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:45,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1139159769, now seen corresponding path program 112 times [2018-07-25 13:21:45,607 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:45,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:46,004 INFO L134 CoverageAnalysis]: Checked inductivity of 12656 backedges. 0 proven. 12656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:46,004 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:46,005 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2018-07-25 13:21:46,005 INFO L451 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-07-25 13:21:46,006 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-07-25 13:21:46,006 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2018-07-25 13:21:46,007 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 115 states. [2018-07-25 13:21:46,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:46,205 INFO L93 Difference]: Finished difference Result 233 states and 233 transitions. [2018-07-25 13:21:46,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-07-25 13:21:46,205 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 228 [2018-07-25 13:21:46,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:46,205 INFO L225 Difference]: With dead ends: 233 [2018-07-25 13:21:46,206 INFO L226 Difference]: Without dead ends: 231 [2018-07-25 13:21:46,207 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 13:21:46,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-07-25 13:21:46,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2018-07-25 13:21:46,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-07-25 13:21:46,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2018-07-25 13:21:46,211 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 228 [2018-07-25 13:21:46,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:46,211 INFO L472 AbstractCegarLoop]: Abstraction has 231 states and 231 transitions. [2018-07-25 13:21:46,211 INFO L473 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-07-25 13:21:46,211 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 231 transitions. [2018-07-25 13:21:46,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-07-25 13:21:46,212 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:46,213 INFO L354 BasicCegarLoop]: trace histogram [114, 113, 1, 1, 1] [2018-07-25 13:21:46,213 INFO L415 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:46,213 INFO L82 PathProgramCache]: Analyzing trace with hash 484174561, now seen corresponding path program 113 times [2018-07-25 13:21:46,213 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:46,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:46,680 INFO L134 CoverageAnalysis]: Checked inductivity of 12882 backedges. 0 proven. 12882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:46,680 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:46,680 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-07-25 13:21:46,680 INFO L451 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-07-25 13:21:46,681 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-07-25 13:21:46,681 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-07-25 13:21:46,682 INFO L87 Difference]: Start difference. First operand 231 states and 231 transitions. Second operand 116 states. [2018-07-25 13:21:46,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:46,953 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2018-07-25 13:21:46,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-07-25 13:21:46,953 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 230 [2018-07-25 13:21:46,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:46,954 INFO L225 Difference]: With dead ends: 235 [2018-07-25 13:21:46,954 INFO L226 Difference]: Without dead ends: 233 [2018-07-25 13:21:46,955 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-07-25 13:21:46,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-07-25 13:21:46,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2018-07-25 13:21:46,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-07-25 13:21:46,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2018-07-25 13:21:46,960 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 230 [2018-07-25 13:21:46,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:46,960 INFO L472 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2018-07-25 13:21:46,960 INFO L473 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-07-25 13:21:46,960 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2018-07-25 13:21:46,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-07-25 13:21:46,961 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:46,961 INFO L354 BasicCegarLoop]: trace histogram [115, 114, 1, 1, 1] [2018-07-25 13:21:46,961 INFO L415 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:46,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1435337243, now seen corresponding path program 114 times [2018-07-25 13:21:46,962 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:47,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:47,349 INFO L134 CoverageAnalysis]: Checked inductivity of 13110 backedges. 0 proven. 13110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:47,349 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:47,349 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2018-07-25 13:21:47,350 INFO L451 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-07-25 13:21:47,351 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-07-25 13:21:47,351 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2018-07-25 13:21:47,352 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 117 states. [2018-07-25 13:21:47,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:47,644 INFO L93 Difference]: Finished difference Result 237 states and 237 transitions. [2018-07-25 13:21:47,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-07-25 13:21:47,644 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 232 [2018-07-25 13:21:47,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:47,645 INFO L225 Difference]: With dead ends: 237 [2018-07-25 13:21:47,645 INFO L226 Difference]: Without dead ends: 235 [2018-07-25 13:21:47,646 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2018-07-25 13:21:47,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-07-25 13:21:47,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2018-07-25 13:21:47,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-07-25 13:21:47,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 235 transitions. [2018-07-25 13:21:47,650 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 235 transitions. Word has length 232 [2018-07-25 13:21:47,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:47,650 INFO L472 AbstractCegarLoop]: Abstraction has 235 states and 235 transitions. [2018-07-25 13:21:47,650 INFO L473 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-07-25 13:21:47,651 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 235 transitions. [2018-07-25 13:21:47,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-07-25 13:21:47,652 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:47,652 INFO L354 BasicCegarLoop]: trace histogram [116, 115, 1, 1, 1] [2018-07-25 13:21:47,652 INFO L415 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:47,652 INFO L82 PathProgramCache]: Analyzing trace with hash 674640597, now seen corresponding path program 115 times [2018-07-25 13:21:47,652 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:47,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:48,053 INFO L134 CoverageAnalysis]: Checked inductivity of 13340 backedges. 0 proven. 13340 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:48,053 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:48,053 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-07-25 13:21:48,054 INFO L451 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-07-25 13:21:48,055 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-07-25 13:21:48,056 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-07-25 13:21:48,056 INFO L87 Difference]: Start difference. First operand 235 states and 235 transitions. Second operand 118 states. [2018-07-25 13:21:48,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:48,275 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2018-07-25 13:21:48,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-07-25 13:21:48,275 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 234 [2018-07-25 13:21:48,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:48,276 INFO L225 Difference]: With dead ends: 239 [2018-07-25 13:21:48,276 INFO L226 Difference]: Without dead ends: 237 [2018-07-25 13:21:48,277 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 13:21:48,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-07-25 13:21:48,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2018-07-25 13:21:48,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-07-25 13:21:48,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2018-07-25 13:21:48,281 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 234 [2018-07-25 13:21:48,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:48,281 INFO L472 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2018-07-25 13:21:48,282 INFO L473 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-07-25 13:21:48,282 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2018-07-25 13:21:48,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-07-25 13:21:48,283 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:48,283 INFO L354 BasicCegarLoop]: trace histogram [117, 116, 1, 1, 1] [2018-07-25 13:21:48,283 INFO L415 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:48,283 INFO L82 PathProgramCache]: Analyzing trace with hash -210395889, now seen corresponding path program 116 times [2018-07-25 13:21:48,283 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:48,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:48,697 INFO L134 CoverageAnalysis]: Checked inductivity of 13572 backedges. 0 proven. 13572 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:48,697 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:48,698 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2018-07-25 13:21:48,698 INFO L451 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-07-25 13:21:48,699 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-07-25 13:21:48,700 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2018-07-25 13:21:48,700 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 119 states. [2018-07-25 13:21:48,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:48,964 INFO L93 Difference]: Finished difference Result 241 states and 241 transitions. [2018-07-25 13:21:48,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-07-25 13:21:48,964 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 236 [2018-07-25 13:21:48,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:48,964 INFO L225 Difference]: With dead ends: 241 [2018-07-25 13:21:48,965 INFO L226 Difference]: Without dead ends: 239 [2018-07-25 13:21:48,966 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 13:21:48,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-07-25 13:21:48,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2018-07-25 13:21:48,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-07-25 13:21:48,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 239 transitions. [2018-07-25 13:21:48,969 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 239 transitions. Word has length 236 [2018-07-25 13:21:48,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:48,969 INFO L472 AbstractCegarLoop]: Abstraction has 239 states and 239 transitions. [2018-07-25 13:21:48,969 INFO L473 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-07-25 13:21:48,969 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 239 transitions. [2018-07-25 13:21:48,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-07-25 13:21:48,970 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:48,970 INFO L354 BasicCegarLoop]: trace histogram [118, 117, 1, 1, 1] [2018-07-25 13:21:48,970 INFO L415 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:48,971 INFO L82 PathProgramCache]: Analyzing trace with hash -326934327, now seen corresponding path program 117 times [2018-07-25 13:21:48,971 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:49,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:49,389 INFO L134 CoverageAnalysis]: Checked inductivity of 13806 backedges. 0 proven. 13806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:49,389 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:49,389 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-07-25 13:21:49,390 INFO L451 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-07-25 13:21:49,391 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-07-25 13:21:49,392 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-07-25 13:21:49,392 INFO L87 Difference]: Start difference. First operand 239 states and 239 transitions. Second operand 120 states. [2018-07-25 13:21:49,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:49,579 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2018-07-25 13:21:49,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-07-25 13:21:49,580 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 238 [2018-07-25 13:21:49,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:49,580 INFO L225 Difference]: With dead ends: 243 [2018-07-25 13:21:49,580 INFO L226 Difference]: Without dead ends: 241 [2018-07-25 13:21:49,582 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 13:21:49,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-07-25 13:21:49,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2018-07-25 13:21:49,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-07-25 13:21:49,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2018-07-25 13:21:49,586 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 238 [2018-07-25 13:21:49,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:49,587 INFO L472 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2018-07-25 13:21:49,587 INFO L473 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-07-25 13:21:49,587 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2018-07-25 13:21:49,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-07-25 13:21:49,588 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:49,588 INFO L354 BasicCegarLoop]: trace histogram [119, 118, 1, 1, 1] [2018-07-25 13:21:49,588 INFO L415 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:49,588 INFO L82 PathProgramCache]: Analyzing trace with hash -651223549, now seen corresponding path program 118 times [2018-07-25 13:21:49,589 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:49,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:50,199 INFO L134 CoverageAnalysis]: Checked inductivity of 14042 backedges. 0 proven. 14042 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:50,199 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:50,199 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [120] total 120 [2018-07-25 13:21:50,200 INFO L451 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-07-25 13:21:50,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-07-25 13:21:50,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7260, Invalid=7260, Unknown=0, NotChecked=0, Total=14520 [2018-07-25 13:21:50,201 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 121 states. [2018-07-25 13:21:50,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:50,392 INFO L93 Difference]: Finished difference Result 245 states and 245 transitions. [2018-07-25 13:21:50,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-07-25 13:21:50,392 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 240 [2018-07-25 13:21:50,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:50,393 INFO L225 Difference]: With dead ends: 245 [2018-07-25 13:21:50,393 INFO L226 Difference]: Without dead ends: 243 [2018-07-25 13:21:50,394 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=7260, Invalid=7260, Unknown=0, NotChecked=0, Total=14520 [2018-07-25 13:21:50,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-07-25 13:21:50,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2018-07-25 13:21:50,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-07-25 13:21:50,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 243 transitions. [2018-07-25 13:21:50,397 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 243 transitions. Word has length 240 [2018-07-25 13:21:50,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:50,397 INFO L472 AbstractCegarLoop]: Abstraction has 243 states and 243 transitions. [2018-07-25 13:21:50,397 INFO L473 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-07-25 13:21:50,398 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 243 transitions. [2018-07-25 13:21:50,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-07-25 13:21:50,398 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:50,398 INFO L354 BasicCegarLoop]: trace histogram [120, 119, 1, 1, 1] [2018-07-25 13:21:50,399 INFO L415 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:50,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1239446717, now seen corresponding path program 119 times [2018-07-25 13:21:50,399 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:50,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:50,829 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 14280 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:50,829 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:50,829 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-07-25 13:21:50,830 INFO L451 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-07-25 13:21:50,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-07-25 13:21:50,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-07-25 13:21:50,832 INFO L87 Difference]: Start difference. First operand 243 states and 243 transitions. Second operand 122 states. [2018-07-25 13:21:51,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:51,134 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2018-07-25 13:21:51,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-07-25 13:21:51,134 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 242 [2018-07-25 13:21:51,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:51,135 INFO L225 Difference]: With dead ends: 247 [2018-07-25 13:21:51,135 INFO L226 Difference]: Without dead ends: 245 [2018-07-25 13:21:51,136 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-07-25 13:21:51,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-07-25 13:21:51,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2018-07-25 13:21:51,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-07-25 13:21:51,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2018-07-25 13:21:51,140 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 242 [2018-07-25 13:21:51,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:51,140 INFO L472 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2018-07-25 13:21:51,140 INFO L473 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-07-25 13:21:51,140 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2018-07-25 13:21:51,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-07-25 13:21:51,141 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:51,141 INFO L354 BasicCegarLoop]: trace histogram [121, 120, 1, 1, 1] [2018-07-25 13:21:51,142 INFO L415 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:51,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1402406135, now seen corresponding path program 120 times [2018-07-25 13:21:51,142 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:51,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:51,574 INFO L134 CoverageAnalysis]: Checked inductivity of 14520 backedges. 0 proven. 14520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:51,575 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:51,575 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [122] total 122 [2018-07-25 13:21:51,575 INFO L451 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-07-25 13:21:51,577 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-07-25 13:21:51,577 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7503, Invalid=7503, Unknown=0, NotChecked=0, Total=15006 [2018-07-25 13:21:51,578 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 123 states. [2018-07-25 13:21:51,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:51,917 INFO L93 Difference]: Finished difference Result 249 states and 249 transitions. [2018-07-25 13:21:51,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-07-25 13:21:51,917 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 244 [2018-07-25 13:21:51,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:51,918 INFO L225 Difference]: With dead ends: 249 [2018-07-25 13:21:51,918 INFO L226 Difference]: Without dead ends: 247 [2018-07-25 13:21:51,919 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7503, Invalid=7503, Unknown=0, NotChecked=0, Total=15006 [2018-07-25 13:21:51,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-07-25 13:21:51,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2018-07-25 13:21:51,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-07-25 13:21:51,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 247 transitions. [2018-07-25 13:21:51,923 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 247 transitions. Word has length 244 [2018-07-25 13:21:51,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:51,924 INFO L472 AbstractCegarLoop]: Abstraction has 247 states and 247 transitions. [2018-07-25 13:21:51,924 INFO L473 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-07-25 13:21:51,924 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 247 transitions. [2018-07-25 13:21:51,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-07-25 13:21:51,925 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:51,925 INFO L354 BasicCegarLoop]: trace histogram [122, 121, 1, 1, 1] [2018-07-25 13:21:51,925 INFO L415 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:51,926 INFO L82 PathProgramCache]: Analyzing trace with hash -907383119, now seen corresponding path program 121 times [2018-07-25 13:21:51,926 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:51,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:52,379 INFO L134 CoverageAnalysis]: Checked inductivity of 14762 backedges. 0 proven. 14762 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:52,380 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:52,380 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-07-25 13:21:52,380 INFO L451 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-07-25 13:21:52,381 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-07-25 13:21:52,382 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-07-25 13:21:52,382 INFO L87 Difference]: Start difference. First operand 247 states and 247 transitions. Second operand 124 states. [2018-07-25 13:21:52,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:52,585 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2018-07-25 13:21:52,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-07-25 13:21:52,585 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 246 [2018-07-25 13:21:52,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:52,586 INFO L225 Difference]: With dead ends: 251 [2018-07-25 13:21:52,586 INFO L226 Difference]: Without dead ends: 249 [2018-07-25 13:21:52,588 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 13:21:52,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-07-25 13:21:52,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2018-07-25 13:21:52,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-07-25 13:21:52,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2018-07-25 13:21:52,593 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 246 [2018-07-25 13:21:52,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:52,593 INFO L472 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2018-07-25 13:21:52,594 INFO L473 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-07-25 13:21:52,594 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2018-07-25 13:21:52,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-07-25 13:21:52,595 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:52,595 INFO L354 BasicCegarLoop]: trace histogram [123, 122, 1, 1, 1] [2018-07-25 13:21:52,595 INFO L415 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:52,595 INFO L82 PathProgramCache]: Analyzing trace with hash -116764181, now seen corresponding path program 122 times [2018-07-25 13:21:52,595 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:52,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:53,065 INFO L134 CoverageAnalysis]: Checked inductivity of 15006 backedges. 0 proven. 15006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:53,066 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:53,066 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [124] total 124 [2018-07-25 13:21:53,066 INFO L451 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-07-25 13:21:53,067 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-07-25 13:21:53,068 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7750, Invalid=7750, Unknown=0, NotChecked=0, Total=15500 [2018-07-25 13:21:53,069 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 125 states. [2018-07-25 13:21:53,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:53,350 INFO L93 Difference]: Finished difference Result 253 states and 253 transitions. [2018-07-25 13:21:53,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-07-25 13:21:53,351 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 248 [2018-07-25 13:21:53,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:53,352 INFO L225 Difference]: With dead ends: 253 [2018-07-25 13:21:53,352 INFO L226 Difference]: Without dead ends: 251 [2018-07-25 13:21:53,354 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=7750, Invalid=7750, Unknown=0, NotChecked=0, Total=15500 [2018-07-25 13:21:53,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-07-25 13:21:53,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2018-07-25 13:21:53,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-07-25 13:21:53,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2018-07-25 13:21:53,358 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 248 [2018-07-25 13:21:53,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:53,359 INFO L472 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2018-07-25 13:21:53,359 INFO L473 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-07-25 13:21:53,359 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2018-07-25 13:21:53,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-07-25 13:21:53,360 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:53,360 INFO L354 BasicCegarLoop]: trace histogram [124, 123, 1, 1, 1] [2018-07-25 13:21:53,360 INFO L415 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:53,360 INFO L82 PathProgramCache]: Analyzing trace with hash -541176155, now seen corresponding path program 123 times [2018-07-25 13:21:53,360 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:53,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:53,950 INFO L134 CoverageAnalysis]: Checked inductivity of 15252 backedges. 0 proven. 15252 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:53,950 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:53,950 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-07-25 13:21:53,951 INFO L451 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-07-25 13:21:53,952 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-07-25 13:21:53,952 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-07-25 13:21:53,952 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 126 states. [2018-07-25 13:21:54,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:54,104 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2018-07-25 13:21:54,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-07-25 13:21:54,104 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 250 [2018-07-25 13:21:54,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:54,104 INFO L225 Difference]: With dead ends: 255 [2018-07-25 13:21:54,105 INFO L226 Difference]: Without dead ends: 253 [2018-07-25 13:21:54,105 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-07-25 13:21:54,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-07-25 13:21:54,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2018-07-25 13:21:54,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-07-25 13:21:54,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2018-07-25 13:21:54,109 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 250 [2018-07-25 13:21:54,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:54,109 INFO L472 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2018-07-25 13:21:54,110 INFO L473 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-07-25 13:21:54,110 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2018-07-25 13:21:54,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-07-25 13:21:54,111 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:54,111 INFO L354 BasicCegarLoop]: trace histogram [125, 124, 1, 1, 1] [2018-07-25 13:21:54,112 INFO L415 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:54,112 INFO L82 PathProgramCache]: Analyzing trace with hash -379190049, now seen corresponding path program 124 times [2018-07-25 13:21:54,112 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:54,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:54,562 INFO L134 CoverageAnalysis]: Checked inductivity of 15500 backedges. 0 proven. 15500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:54,562 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:54,562 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [126] total 126 [2018-07-25 13:21:54,563 INFO L451 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-07-25 13:21:54,564 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-07-25 13:21:54,564 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8001, Invalid=8001, Unknown=0, NotChecked=0, Total=16002 [2018-07-25 13:21:54,565 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 127 states. [2018-07-25 13:21:54,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:54,929 INFO L93 Difference]: Finished difference Result 257 states and 257 transitions. [2018-07-25 13:21:54,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-07-25 13:21:54,930 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 252 [2018-07-25 13:21:54,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:54,930 INFO L225 Difference]: With dead ends: 257 [2018-07-25 13:21:54,930 INFO L226 Difference]: Without dead ends: 255 [2018-07-25 13:21:54,932 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 13:21:54,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-07-25 13:21:54,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2018-07-25 13:21:54,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-07-25 13:21:54,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 255 transitions. [2018-07-25 13:21:54,935 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 255 transitions. Word has length 252 [2018-07-25 13:21:54,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:54,935 INFO L472 AbstractCegarLoop]: Abstraction has 255 states and 255 transitions. [2018-07-25 13:21:54,935 INFO L473 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-07-25 13:21:54,935 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 255 transitions. [2018-07-25 13:21:54,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-07-25 13:21:54,936 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:54,936 INFO L354 BasicCegarLoop]: trace histogram [126, 125, 1, 1, 1] [2018-07-25 13:21:54,937 INFO L415 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:54,937 INFO L82 PathProgramCache]: Analyzing trace with hash 670635161, now seen corresponding path program 125 times [2018-07-25 13:21:54,937 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:54,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:55,415 INFO L134 CoverageAnalysis]: Checked inductivity of 15750 backedges. 0 proven. 15750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:55,416 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:55,416 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-07-25 13:21:55,416 INFO L451 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-07-25 13:21:55,417 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-07-25 13:21:55,418 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-07-25 13:21:55,418 INFO L87 Difference]: Start difference. First operand 255 states and 255 transitions. Second operand 128 states. [2018-07-25 13:21:55,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:55,635 INFO L93 Difference]: Finished difference Result 259 states and 259 transitions. [2018-07-25 13:21:55,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-07-25 13:21:55,635 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 254 [2018-07-25 13:21:55,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:55,636 INFO L225 Difference]: With dead ends: 259 [2018-07-25 13:21:55,636 INFO L226 Difference]: Without dead ends: 257 [2018-07-25 13:21:55,637 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-07-25 13:21:55,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-07-25 13:21:55,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2018-07-25 13:21:55,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-07-25 13:21:55,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2018-07-25 13:21:55,642 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 254 [2018-07-25 13:21:55,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:55,642 INFO L472 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2018-07-25 13:21:55,642 INFO L473 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-07-25 13:21:55,642 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2018-07-25 13:21:55,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-07-25 13:21:55,643 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:55,644 INFO L354 BasicCegarLoop]: trace histogram [127, 126, 1, 1, 1] [2018-07-25 13:21:55,644 INFO L415 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:55,644 INFO L82 PathProgramCache]: Analyzing trace with hash 235347411, now seen corresponding path program 126 times [2018-07-25 13:21:55,644 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:55,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:56,140 INFO L134 CoverageAnalysis]: Checked inductivity of 16002 backedges. 0 proven. 16002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:56,141 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:56,141 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [128] total 128 [2018-07-25 13:21:56,141 INFO L451 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-07-25 13:21:56,142 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-07-25 13:21:56,143 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8256, Invalid=8256, Unknown=0, NotChecked=0, Total=16512 [2018-07-25 13:21:56,143 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 129 states. [2018-07-25 13:21:56,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:56,465 INFO L93 Difference]: Finished difference Result 261 states and 261 transitions. [2018-07-25 13:21:56,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-07-25 13:21:56,466 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 256 [2018-07-25 13:21:56,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:56,466 INFO L225 Difference]: With dead ends: 261 [2018-07-25 13:21:56,467 INFO L226 Difference]: Without dead ends: 259 [2018-07-25 13:21:56,468 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 13:21:56,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-07-25 13:21:56,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2018-07-25 13:21:56,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-07-25 13:21:56,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 259 transitions. [2018-07-25 13:21:56,473 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 259 transitions. Word has length 256 [2018-07-25 13:21:56,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:56,474 INFO L472 AbstractCegarLoop]: Abstraction has 259 states and 259 transitions. [2018-07-25 13:21:56,474 INFO L473 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-07-25 13:21:56,474 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 259 transitions. [2018-07-25 13:21:56,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-07-25 13:21:56,475 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:56,475 INFO L354 BasicCegarLoop]: trace histogram [128, 127, 1, 1, 1] [2018-07-25 13:21:56,475 INFO L415 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:56,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1464352627, now seen corresponding path program 127 times [2018-07-25 13:21:56,476 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:56,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:57,005 INFO L134 CoverageAnalysis]: Checked inductivity of 16256 backedges. 0 proven. 16256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:57,005 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:57,005 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-07-25 13:21:57,006 INFO L451 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-07-25 13:21:57,007 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-07-25 13:21:57,008 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-07-25 13:21:57,012 INFO L87 Difference]: Start difference. First operand 259 states and 259 transitions. Second operand 130 states. [2018-07-25 13:21:57,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:57,159 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions. [2018-07-25 13:21:57,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-07-25 13:21:57,159 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 258 [2018-07-25 13:21:57,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:57,160 INFO L225 Difference]: With dead ends: 263 [2018-07-25 13:21:57,160 INFO L226 Difference]: Without dead ends: 261 [2018-07-25 13:21:57,163 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 13:21:57,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-07-25 13:21:57,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2018-07-25 13:21:57,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-07-25 13:21:57,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2018-07-25 13:21:57,169 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 258 [2018-07-25 13:21:57,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:57,169 INFO L472 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2018-07-25 13:21:57,169 INFO L473 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-07-25 13:21:57,169 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2018-07-25 13:21:57,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-07-25 13:21:57,170 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:57,170 INFO L354 BasicCegarLoop]: trace histogram [129, 128, 1, 1, 1] [2018-07-25 13:21:57,171 INFO L415 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:57,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1506450631, now seen corresponding path program 128 times [2018-07-25 13:21:57,171 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:57,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:57,852 INFO L134 CoverageAnalysis]: Checked inductivity of 16512 backedges. 0 proven. 16512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:57,852 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:57,852 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [130] total 130 [2018-07-25 13:21:57,853 INFO L451 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-07-25 13:21:57,854 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-07-25 13:21:57,855 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8515, Invalid=8515, Unknown=0, NotChecked=0, Total=17030 [2018-07-25 13:21:57,855 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 131 states. [2018-07-25 13:21:58,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:58,185 INFO L93 Difference]: Finished difference Result 265 states and 265 transitions. [2018-07-25 13:21:58,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-07-25 13:21:58,185 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 260 [2018-07-25 13:21:58,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:58,186 INFO L225 Difference]: With dead ends: 265 [2018-07-25 13:21:58,186 INFO L226 Difference]: Without dead ends: 263 [2018-07-25 13:21:58,187 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=8515, Invalid=8515, Unknown=0, NotChecked=0, Total=17030 [2018-07-25 13:21:58,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-07-25 13:21:58,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2018-07-25 13:21:58,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-07-25 13:21:58,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 263 transitions. [2018-07-25 13:21:58,191 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 263 transitions. Word has length 260 [2018-07-25 13:21:58,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:58,191 INFO L472 AbstractCegarLoop]: Abstraction has 263 states and 263 transitions. [2018-07-25 13:21:58,191 INFO L473 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-07-25 13:21:58,192 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 263 transitions. [2018-07-25 13:21:58,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-07-25 13:21:58,193 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:58,193 INFO L354 BasicCegarLoop]: trace histogram [130, 129, 1, 1, 1] [2018-07-25 13:21:58,193 INFO L415 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:58,193 INFO L82 PathProgramCache]: Analyzing trace with hash 295129729, now seen corresponding path program 129 times [2018-07-25 13:21:58,193 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:58,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:58,704 INFO L134 CoverageAnalysis]: Checked inductivity of 16770 backedges. 0 proven. 16770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:58,705 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:58,705 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-07-25 13:21:58,705 INFO L451 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-07-25 13:21:58,707 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-07-25 13:21:58,707 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-07-25 13:21:58,707 INFO L87 Difference]: Start difference. First operand 263 states and 263 transitions. Second operand 132 states. [2018-07-25 13:21:59,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:59,082 INFO L93 Difference]: Finished difference Result 267 states and 267 transitions. [2018-07-25 13:21:59,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-07-25 13:21:59,082 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 262 [2018-07-25 13:21:59,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:59,083 INFO L225 Difference]: With dead ends: 267 [2018-07-25 13:21:59,083 INFO L226 Difference]: Without dead ends: 265 [2018-07-25 13:21:59,084 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-07-25 13:21:59,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-07-25 13:21:59,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2018-07-25 13:21:59,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-07-25 13:21:59,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2018-07-25 13:21:59,089 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 262 [2018-07-25 13:21:59,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:59,089 INFO L472 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2018-07-25 13:21:59,089 INFO L473 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-07-25 13:21:59,089 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2018-07-25 13:21:59,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-07-25 13:21:59,090 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:59,091 INFO L354 BasicCegarLoop]: trace histogram [131, 130, 1, 1, 1] [2018-07-25 13:21:59,091 INFO L415 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:59,091 INFO L82 PathProgramCache]: Analyzing trace with hash 151880123, now seen corresponding path program 130 times [2018-07-25 13:21:59,091 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:59,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:59,643 INFO L134 CoverageAnalysis]: Checked inductivity of 17030 backedges. 0 proven. 17030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:59,643 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:59,643 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [132] total 132 [2018-07-25 13:21:59,644 INFO L451 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-07-25 13:21:59,645 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-07-25 13:21:59,646 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8778, Invalid=8778, Unknown=0, NotChecked=0, Total=17556 [2018-07-25 13:21:59,646 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 133 states. [2018-07-25 13:21:59,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:59,864 INFO L93 Difference]: Finished difference Result 269 states and 269 transitions. [2018-07-25 13:21:59,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-07-25 13:21:59,865 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 264 [2018-07-25 13:21:59,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:59,865 INFO L225 Difference]: With dead ends: 269 [2018-07-25 13:21:59,865 INFO L226 Difference]: Without dead ends: 267 [2018-07-25 13:21:59,867 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 13:21:59,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-07-25 13:21:59,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2018-07-25 13:21:59,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-07-25 13:21:59,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 267 transitions. [2018-07-25 13:21:59,870 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 267 transitions. Word has length 264 [2018-07-25 13:21:59,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:59,871 INFO L472 AbstractCegarLoop]: Abstraction has 267 states and 267 transitions. [2018-07-25 13:21:59,871 INFO L473 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-07-25 13:21:59,871 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 267 transitions. [2018-07-25 13:21:59,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-07-25 13:21:59,872 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:59,872 INFO L354 BasicCegarLoop]: trace histogram [132, 131, 1, 1, 1] [2018-07-25 13:21:59,872 INFO L415 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:59,872 INFO L82 PathProgramCache]: Analyzing trace with hash -72037771, now seen corresponding path program 131 times [2018-07-25 13:21:59,872 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:59,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:00,397 INFO L134 CoverageAnalysis]: Checked inductivity of 17292 backedges. 0 proven. 17292 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:00,397 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:00,397 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-07-25 13:22:00,397 INFO L451 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-07-25 13:22:00,399 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-07-25 13:22:00,399 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-07-25 13:22:00,400 INFO L87 Difference]: Start difference. First operand 267 states and 267 transitions. Second operand 134 states. [2018-07-25 13:22:00,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:00,796 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions. [2018-07-25 13:22:00,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-07-25 13:22:00,796 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 266 [2018-07-25 13:22:00,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:00,797 INFO L225 Difference]: With dead ends: 271 [2018-07-25 13:22:00,797 INFO L226 Difference]: Without dead ends: 269 [2018-07-25 13:22:00,799 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 13:22:00,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-07-25 13:22:00,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2018-07-25 13:22:00,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-07-25 13:22:00,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 269 transitions. [2018-07-25 13:22:00,802 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 269 transitions. Word has length 266 [2018-07-25 13:22:00,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:00,803 INFO L472 AbstractCegarLoop]: Abstraction has 269 states and 269 transitions. [2018-07-25 13:22:00,803 INFO L473 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-07-25 13:22:00,803 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 269 transitions. [2018-07-25 13:22:00,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-07-25 13:22:00,804 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:00,804 INFO L354 BasicCegarLoop]: trace histogram [133, 132, 1, 1, 1] [2018-07-25 13:22:00,804 INFO L415 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:00,804 INFO L82 PathProgramCache]: Analyzing trace with hash -508769105, now seen corresponding path program 132 times [2018-07-25 13:22:00,804 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:00,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:01,350 INFO L134 CoverageAnalysis]: Checked inductivity of 17556 backedges. 0 proven. 17556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:01,351 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:01,351 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [134] total 134 [2018-07-25 13:22:01,351 INFO L451 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-07-25 13:22:01,353 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-07-25 13:22:01,353 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9045, Invalid=9045, Unknown=0, NotChecked=0, Total=18090 [2018-07-25 13:22:01,354 INFO L87 Difference]: Start difference. First operand 269 states and 269 transitions. Second operand 135 states. [2018-07-25 13:22:01,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:01,855 INFO L93 Difference]: Finished difference Result 273 states and 273 transitions. [2018-07-25 13:22:01,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-07-25 13:22:01,856 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 268 [2018-07-25 13:22:01,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:01,857 INFO L225 Difference]: With dead ends: 273 [2018-07-25 13:22:01,857 INFO L226 Difference]: Without dead ends: 271 [2018-07-25 13:22:01,859 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 13:22:01,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-07-25 13:22:01,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2018-07-25 13:22:01,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-07-25 13:22:01,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 271 transitions. [2018-07-25 13:22:01,864 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 271 transitions. Word has length 268 [2018-07-25 13:22:01,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:01,865 INFO L472 AbstractCegarLoop]: Abstraction has 271 states and 271 transitions. [2018-07-25 13:22:01,865 INFO L473 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-07-25 13:22:01,865 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 271 transitions. [2018-07-25 13:22:01,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-07-25 13:22:01,866 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:01,866 INFO L354 BasicCegarLoop]: trace histogram [134, 133, 1, 1, 1] [2018-07-25 13:22:01,866 INFO L415 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:01,866 INFO L82 PathProgramCache]: Analyzing trace with hash 699213929, now seen corresponding path program 133 times [2018-07-25 13:22:01,867 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:01,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:02,626 INFO L134 CoverageAnalysis]: Checked inductivity of 17822 backedges. 0 proven. 17822 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:02,627 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:02,627 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-07-25 13:22:02,627 INFO L451 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-07-25 13:22:02,629 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-07-25 13:22:02,630 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-07-25 13:22:02,630 INFO L87 Difference]: Start difference. First operand 271 states and 271 transitions. Second operand 136 states. [2018-07-25 13:22:02,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:02,903 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2018-07-25 13:22:02,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-07-25 13:22:02,903 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 270 [2018-07-25 13:22:02,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:02,904 INFO L225 Difference]: With dead ends: 275 [2018-07-25 13:22:02,904 INFO L226 Difference]: Without dead ends: 273 [2018-07-25 13:22:02,905 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-07-25 13:22:02,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-07-25 13:22:02,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2018-07-25 13:22:02,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-07-25 13:22:02,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2018-07-25 13:22:02,910 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 270 [2018-07-25 13:22:02,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:02,910 INFO L472 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2018-07-25 13:22:02,910 INFO L473 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-07-25 13:22:02,910 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2018-07-25 13:22:02,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-07-25 13:22:02,911 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:02,911 INFO L354 BasicCegarLoop]: trace histogram [135, 134, 1, 1, 1] [2018-07-25 13:22:02,911 INFO L415 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:02,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1929739683, now seen corresponding path program 134 times [2018-07-25 13:22:02,912 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:02,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:03,453 INFO L134 CoverageAnalysis]: Checked inductivity of 18090 backedges. 0 proven. 18090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:03,454 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:03,454 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [136] total 136 [2018-07-25 13:22:03,454 INFO L451 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-07-25 13:22:03,456 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-07-25 13:22:03,456 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9316, Invalid=9316, Unknown=0, NotChecked=0, Total=18632 [2018-07-25 13:22:03,457 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 137 states. [2018-07-25 13:22:03,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:03,654 INFO L93 Difference]: Finished difference Result 277 states and 277 transitions. [2018-07-25 13:22:03,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-07-25 13:22:03,654 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 272 [2018-07-25 13:22:03,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:03,655 INFO L225 Difference]: With dead ends: 277 [2018-07-25 13:22:03,655 INFO L226 Difference]: Without dead ends: 275 [2018-07-25 13:22:03,657 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 13:22:03,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-07-25 13:22:03,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2018-07-25 13:22:03,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-07-25 13:22:03,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 275 transitions. [2018-07-25 13:22:03,662 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 275 transitions. Word has length 272 [2018-07-25 13:22:03,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:03,662 INFO L472 AbstractCegarLoop]: Abstraction has 275 states and 275 transitions. [2018-07-25 13:22:03,662 INFO L473 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-07-25 13:22:03,662 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 275 transitions. [2018-07-25 13:22:03,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-07-25 13:22:03,663 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:03,664 INFO L354 BasicCegarLoop]: trace histogram [136, 135, 1, 1, 1] [2018-07-25 13:22:03,664 INFO L415 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:03,664 INFO L82 PathProgramCache]: Analyzing trace with hash -945984419, now seen corresponding path program 135 times [2018-07-25 13:22:03,664 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:03,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:04,315 INFO L134 CoverageAnalysis]: Checked inductivity of 18360 backedges. 0 proven. 18360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:04,315 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:04,315 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-07-25 13:22:04,316 INFO L451 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-07-25 13:22:04,317 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-07-25 13:22:04,318 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-07-25 13:22:04,318 INFO L87 Difference]: Start difference. First operand 275 states and 275 transitions. Second operand 138 states. [2018-07-25 13:22:04,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:04,795 INFO L93 Difference]: Finished difference Result 279 states and 279 transitions. [2018-07-25 13:22:04,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-07-25 13:22:04,796 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 274 [2018-07-25 13:22:04,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:04,796 INFO L225 Difference]: With dead ends: 279 [2018-07-25 13:22:04,796 INFO L226 Difference]: Without dead ends: 277 [2018-07-25 13:22:04,798 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-07-25 13:22:04,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-07-25 13:22:04,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2018-07-25 13:22:04,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-07-25 13:22:04,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2018-07-25 13:22:04,802 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 274 [2018-07-25 13:22:04,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:04,802 INFO L472 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2018-07-25 13:22:04,802 INFO L473 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-07-25 13:22:04,802 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2018-07-25 13:22:04,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-07-25 13:22:04,803 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:04,803 INFO L354 BasicCegarLoop]: trace histogram [137, 136, 1, 1, 1] [2018-07-25 13:22:04,803 INFO L415 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:04,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1442092183, now seen corresponding path program 136 times [2018-07-25 13:22:04,803 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:04,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:05,387 INFO L134 CoverageAnalysis]: Checked inductivity of 18632 backedges. 0 proven. 18632 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:05,388 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:05,388 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [138] total 138 [2018-07-25 13:22:05,388 INFO L451 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-07-25 13:22:05,390 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-07-25 13:22:05,391 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9591, Invalid=9591, Unknown=0, NotChecked=0, Total=19182 [2018-07-25 13:22:05,391 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 139 states. [2018-07-25 13:22:05,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:05,886 INFO L93 Difference]: Finished difference Result 281 states and 281 transitions. [2018-07-25 13:22:05,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-07-25 13:22:05,887 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 276 [2018-07-25 13:22:05,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:05,887 INFO L225 Difference]: With dead ends: 281 [2018-07-25 13:22:05,887 INFO L226 Difference]: Without dead ends: 279 [2018-07-25 13:22:05,889 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9591, Invalid=9591, Unknown=0, NotChecked=0, Total=19182 [2018-07-25 13:22:05,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-07-25 13:22:05,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2018-07-25 13:22:05,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-07-25 13:22:05,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 279 transitions. [2018-07-25 13:22:05,894 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 279 transitions. Word has length 276 [2018-07-25 13:22:05,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:05,895 INFO L472 AbstractCegarLoop]: Abstraction has 279 states and 279 transitions. [2018-07-25 13:22:05,895 INFO L473 AbstractCegarLoop]: Interpolant automaton has 139 states. [2018-07-25 13:22:05,895 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 279 transitions. [2018-07-25 13:22:05,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-07-25 13:22:05,896 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:05,896 INFO L354 BasicCegarLoop]: trace histogram [138, 137, 1, 1, 1] [2018-07-25 13:22:05,896 INFO L415 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:05,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1423796655, now seen corresponding path program 137 times [2018-07-25 13:22:05,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:05,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:06,639 INFO L134 CoverageAnalysis]: Checked inductivity of 18906 backedges. 0 proven. 18906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:06,640 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:06,640 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-07-25 13:22:06,640 INFO L451 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-07-25 13:22:06,641 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-07-25 13:22:06,642 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-07-25 13:22:06,642 INFO L87 Difference]: Start difference. First operand 279 states and 279 transitions. Second operand 140 states. [2018-07-25 13:22:07,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:07,100 INFO L93 Difference]: Finished difference Result 283 states and 283 transitions. [2018-07-25 13:22:07,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2018-07-25 13:22:07,100 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 278 [2018-07-25 13:22:07,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:07,101 INFO L225 Difference]: With dead ends: 283 [2018-07-25 13:22:07,101 INFO L226 Difference]: Without dead ends: 281 [2018-07-25 13:22:07,102 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-07-25 13:22:07,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-07-25 13:22:07,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2018-07-25 13:22:07,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-07-25 13:22:07,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2018-07-25 13:22:07,107 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 278 [2018-07-25 13:22:07,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:07,107 INFO L472 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2018-07-25 13:22:07,107 INFO L473 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-07-25 13:22:07,107 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2018-07-25 13:22:07,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-07-25 13:22:07,108 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:07,109 INFO L354 BasicCegarLoop]: trace histogram [139, 138, 1, 1, 1] [2018-07-25 13:22:07,109 INFO L415 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:07,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1826034059, now seen corresponding path program 138 times [2018-07-25 13:22:07,109 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:07,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:07,692 INFO L134 CoverageAnalysis]: Checked inductivity of 19182 backedges. 0 proven. 19182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:07,692 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:07,692 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [140] total 140 [2018-07-25 13:22:07,692 INFO L451 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-07-25 13:22:07,694 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-07-25 13:22:07,695 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9870, Invalid=9870, Unknown=0, NotChecked=0, Total=19740 [2018-07-25 13:22:07,695 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 141 states. [2018-07-25 13:22:08,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:08,195 INFO L93 Difference]: Finished difference Result 285 states and 285 transitions. [2018-07-25 13:22:08,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-07-25 13:22:08,196 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 280 [2018-07-25 13:22:08,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:08,196 INFO L225 Difference]: With dead ends: 285 [2018-07-25 13:22:08,196 INFO L226 Difference]: Without dead ends: 283 [2018-07-25 13:22:08,198 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9870, Invalid=9870, Unknown=0, NotChecked=0, Total=19740 [2018-07-25 13:22:08,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-07-25 13:22:08,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2018-07-25 13:22:08,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-07-25 13:22:08,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 283 transitions. [2018-07-25 13:22:08,202 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 283 transitions. Word has length 280 [2018-07-25 13:22:08,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:08,202 INFO L472 AbstractCegarLoop]: Abstraction has 283 states and 283 transitions. [2018-07-25 13:22:08,202 INFO L473 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-07-25 13:22:08,202 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 283 transitions. [2018-07-25 13:22:08,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-07-25 13:22:08,203 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:08,203 INFO L354 BasicCegarLoop]: trace histogram [140, 139, 1, 1, 1] [2018-07-25 13:22:08,203 INFO L415 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:08,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1822841275, now seen corresponding path program 139 times [2018-07-25 13:22:08,203 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:08,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:08,792 INFO L134 CoverageAnalysis]: Checked inductivity of 19460 backedges. 0 proven. 19460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:08,793 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:08,793 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2018-07-25 13:22:08,793 INFO L451 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-07-25 13:22:08,795 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-07-25 13:22:08,796 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-07-25 13:22:08,796 INFO L87 Difference]: Start difference. First operand 283 states and 283 transitions. Second operand 142 states. [2018-07-25 13:22:09,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:09,326 INFO L93 Difference]: Finished difference Result 287 states and 287 transitions. [2018-07-25 13:22:09,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2018-07-25 13:22:09,326 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 282 [2018-07-25 13:22:09,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:09,327 INFO L225 Difference]: With dead ends: 287 [2018-07-25 13:22:09,327 INFO L226 Difference]: Without dead ends: 285 [2018-07-25 13:22:09,328 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 13:22:09,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-07-25 13:22:09,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2018-07-25 13:22:09,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-07-25 13:22:09,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 285 transitions. [2018-07-25 13:22:09,331 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 285 transitions. Word has length 282 [2018-07-25 13:22:09,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:09,332 INFO L472 AbstractCegarLoop]: Abstraction has 285 states and 285 transitions. [2018-07-25 13:22:09,332 INFO L473 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-07-25 13:22:09,332 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 285 transitions. [2018-07-25 13:22:09,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-07-25 13:22:09,332 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:09,333 INFO L354 BasicCegarLoop]: trace histogram [141, 140, 1, 1, 1] [2018-07-25 13:22:09,333 INFO L415 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:09,333 INFO L82 PathProgramCache]: Analyzing trace with hash 596243583, now seen corresponding path program 140 times [2018-07-25 13:22:09,333 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:09,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:09,917 INFO L134 CoverageAnalysis]: Checked inductivity of 19740 backedges. 0 proven. 19740 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:09,917 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:09,917 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [142] total 142 [2018-07-25 13:22:09,917 INFO L451 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-07-25 13:22:09,919 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-07-25 13:22:09,920 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10153, Invalid=10153, Unknown=0, NotChecked=0, Total=20306 [2018-07-25 13:22:09,920 INFO L87 Difference]: Start difference. First operand 285 states and 285 transitions. Second operand 143 states. [2018-07-25 13:22:10,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:10,464 INFO L93 Difference]: Finished difference Result 289 states and 289 transitions. [2018-07-25 13:22:10,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-07-25 13:22:10,464 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 284 [2018-07-25 13:22:10,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:10,465 INFO L225 Difference]: With dead ends: 289 [2018-07-25 13:22:10,465 INFO L226 Difference]: Without dead ends: 287 [2018-07-25 13:22:10,468 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 13:22:10,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-07-25 13:22:10,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2018-07-25 13:22:10,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-07-25 13:22:10,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 287 transitions. [2018-07-25 13:22:10,473 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 287 transitions. Word has length 284 [2018-07-25 13:22:10,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:10,473 INFO L472 AbstractCegarLoop]: Abstraction has 287 states and 287 transitions. [2018-07-25 13:22:10,474 INFO L473 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-07-25 13:22:10,474 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 287 transitions. [2018-07-25 13:22:10,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-07-25 13:22:10,475 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:10,475 INFO L354 BasicCegarLoop]: trace histogram [142, 141, 1, 1, 1] [2018-07-25 13:22:10,475 INFO L415 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:10,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1759484985, now seen corresponding path program 141 times [2018-07-25 13:22:10,476 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:10,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:11,159 INFO L134 CoverageAnalysis]: Checked inductivity of 20022 backedges. 0 proven. 20022 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:11,160 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:11,160 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2018-07-25 13:22:11,160 INFO L451 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-07-25 13:22:11,161 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-07-25 13:22:11,161 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-07-25 13:22:11,161 INFO L87 Difference]: Start difference. First operand 287 states and 287 transitions. Second operand 144 states. [2018-07-25 13:22:11,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:11,669 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2018-07-25 13:22:11,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-07-25 13:22:11,669 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 286 [2018-07-25 13:22:11,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:11,670 INFO L225 Difference]: With dead ends: 291 [2018-07-25 13:22:11,670 INFO L226 Difference]: Without dead ends: 289 [2018-07-25 13:22:11,671 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-07-25 13:22:11,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-07-25 13:22:11,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2018-07-25 13:22:11,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-07-25 13:22:11,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 289 transitions. [2018-07-25 13:22:11,674 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 289 transitions. Word has length 286 [2018-07-25 13:22:11,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:11,675 INFO L472 AbstractCegarLoop]: Abstraction has 289 states and 289 transitions. [2018-07-25 13:22:11,675 INFO L473 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-07-25 13:22:11,675 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 289 transitions. [2018-07-25 13:22:11,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-07-25 13:22:11,676 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:11,676 INFO L354 BasicCegarLoop]: trace histogram [143, 142, 1, 1, 1] [2018-07-25 13:22:11,676 INFO L415 AbstractCegarLoop]: === Iteration 143 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:11,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1351991949, now seen corresponding path program 142 times [2018-07-25 13:22:11,677 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:11,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:12,509 INFO L134 CoverageAnalysis]: Checked inductivity of 20306 backedges. 0 proven. 20306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:12,509 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:12,509 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [144] total 144 [2018-07-25 13:22:12,510 INFO L451 AbstractCegarLoop]: Interpolant automaton has 145 states [2018-07-25 13:22:12,512 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2018-07-25 13:22:12,514 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10440, Invalid=10440, Unknown=0, NotChecked=0, Total=20880 [2018-07-25 13:22:12,514 INFO L87 Difference]: Start difference. First operand 289 states and 289 transitions. Second operand 145 states. [2018-07-25 13:22:13,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:13,177 INFO L93 Difference]: Finished difference Result 293 states and 293 transitions. [2018-07-25 13:22:13,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2018-07-25 13:22:13,177 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 288 [2018-07-25 13:22:13,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:13,178 INFO L225 Difference]: With dead ends: 293 [2018-07-25 13:22:13,178 INFO L226 Difference]: Without dead ends: 291 [2018-07-25 13:22:13,180 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 13:22:13,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-07-25 13:22:13,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2018-07-25 13:22:13,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-07-25 13:22:13,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 291 transitions. [2018-07-25 13:22:13,185 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 291 transitions. Word has length 288 [2018-07-25 13:22:13,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:13,185 INFO L472 AbstractCegarLoop]: Abstraction has 291 states and 291 transitions. [2018-07-25 13:22:13,186 INFO L473 AbstractCegarLoop]: Interpolant automaton has 145 states. [2018-07-25 13:22:13,186 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 291 transitions. [2018-07-25 13:22:13,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-07-25 13:22:13,187 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:13,187 INFO L354 BasicCegarLoop]: trace histogram [144, 143, 1, 1, 1] [2018-07-25 13:22:13,187 INFO L415 AbstractCegarLoop]: === Iteration 144 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:13,188 INFO L82 PathProgramCache]: Analyzing trace with hash 2110879789, now seen corresponding path program 143 times [2018-07-25 13:22:13,188 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:13,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:13,941 INFO L134 CoverageAnalysis]: Checked inductivity of 20592 backedges. 0 proven. 20592 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:13,941 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:13,942 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2018-07-25 13:22:13,942 INFO L451 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-07-25 13:22:13,944 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-07-25 13:22:13,946 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-07-25 13:22:13,946 INFO L87 Difference]: Start difference. First operand 291 states and 291 transitions. Second operand 146 states. [2018-07-25 13:22:14,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:14,254 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2018-07-25 13:22:14,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-07-25 13:22:14,254 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 290 [2018-07-25 13:22:14,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:14,255 INFO L225 Difference]: With dead ends: 295 [2018-07-25 13:22:14,255 INFO L226 Difference]: Without dead ends: 293 [2018-07-25 13:22:14,256 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-07-25 13:22:14,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-07-25 13:22:14,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2018-07-25 13:22:14,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-07-25 13:22:14,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2018-07-25 13:22:14,260 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 290 [2018-07-25 13:22:14,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:14,260 INFO L472 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2018-07-25 13:22:14,260 INFO L473 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-07-25 13:22:14,260 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2018-07-25 13:22:14,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-07-25 13:22:14,262 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:14,262 INFO L354 BasicCegarLoop]: trace histogram [145, 144, 1, 1, 1] [2018-07-25 13:22:14,262 INFO L415 AbstractCegarLoop]: === Iteration 145 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:14,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1330965607, now seen corresponding path program 144 times [2018-07-25 13:22:14,262 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:14,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:14,849 INFO L134 CoverageAnalysis]: Checked inductivity of 20880 backedges. 0 proven. 20880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:14,850 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:14,850 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [146] total 146 [2018-07-25 13:22:14,850 INFO L451 AbstractCegarLoop]: Interpolant automaton has 147 states [2018-07-25 13:22:14,852 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2018-07-25 13:22:14,852 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10731, Invalid=10731, Unknown=0, NotChecked=0, Total=21462 [2018-07-25 13:22:14,853 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 147 states. [2018-07-25 13:22:15,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:15,031 INFO L93 Difference]: Finished difference Result 297 states and 297 transitions. [2018-07-25 13:22:15,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-07-25 13:22:15,031 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 292 [2018-07-25 13:22:15,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:15,031 INFO L225 Difference]: With dead ends: 297 [2018-07-25 13:22:15,031 INFO L226 Difference]: Without dead ends: 295 [2018-07-25 13:22:15,033 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10731, Invalid=10731, Unknown=0, NotChecked=0, Total=21462 [2018-07-25 13:22:15,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-07-25 13:22:15,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2018-07-25 13:22:15,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-07-25 13:22:15,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 295 transitions. [2018-07-25 13:22:15,036 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 295 transitions. Word has length 292 [2018-07-25 13:22:15,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:15,036 INFO L472 AbstractCegarLoop]: Abstraction has 295 states and 295 transitions. [2018-07-25 13:22:15,036 INFO L473 AbstractCegarLoop]: Interpolant automaton has 147 states. [2018-07-25 13:22:15,036 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 295 transitions. [2018-07-25 13:22:15,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-07-25 13:22:15,037 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:15,037 INFO L354 BasicCegarLoop]: trace histogram [146, 145, 1, 1, 1] [2018-07-25 13:22:15,038 INFO L415 AbstractCegarLoop]: === Iteration 146 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:15,038 INFO L82 PathProgramCache]: Analyzing trace with hash -842253791, now seen corresponding path program 145 times [2018-07-25 13:22:15,038 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:15,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:15,708 INFO L134 CoverageAnalysis]: Checked inductivity of 21170 backedges. 0 proven. 21170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:15,708 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:15,708 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147] total 147 [2018-07-25 13:22:15,709 INFO L451 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-07-25 13:22:15,709 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-07-25 13:22:15,710 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-07-25 13:22:15,710 INFO L87 Difference]: Start difference. First operand 295 states and 295 transitions. Second operand 148 states. [2018-07-25 13:22:16,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:16,250 INFO L93 Difference]: Finished difference Result 299 states and 299 transitions. [2018-07-25 13:22:16,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2018-07-25 13:22:16,250 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 294 [2018-07-25 13:22:16,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:16,250 INFO L225 Difference]: With dead ends: 299 [2018-07-25 13:22:16,251 INFO L226 Difference]: Without dead ends: 297 [2018-07-25 13:22:16,251 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 13:22:16,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-07-25 13:22:16,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2018-07-25 13:22:16,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-07-25 13:22:16,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2018-07-25 13:22:16,255 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 294 [2018-07-25 13:22:16,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:16,255 INFO L472 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions. [2018-07-25 13:22:16,255 INFO L473 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-07-25 13:22:16,255 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions. [2018-07-25 13:22:16,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-07-25 13:22:16,256 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:16,256 INFO L354 BasicCegarLoop]: trace histogram [147, 146, 1, 1, 1] [2018-07-25 13:22:16,256 INFO L415 AbstractCegarLoop]: === Iteration 147 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:16,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1951989413, now seen corresponding path program 146 times [2018-07-25 13:22:16,256 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:16,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:16,914 INFO L134 CoverageAnalysis]: Checked inductivity of 21462 backedges. 0 proven. 21462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:16,914 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:16,914 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [148] total 148 [2018-07-25 13:22:16,914 INFO L451 AbstractCegarLoop]: Interpolant automaton has 149 states [2018-07-25 13:22:16,916 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2018-07-25 13:22:16,917 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11026, Invalid=11026, Unknown=0, NotChecked=0, Total=22052 [2018-07-25 13:22:16,917 INFO L87 Difference]: Start difference. First operand 297 states and 297 transitions. Second operand 149 states. [2018-07-25 13:22:17,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:17,671 INFO L93 Difference]: Finished difference Result 301 states and 301 transitions. [2018-07-25 13:22:17,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2018-07-25 13:22:17,671 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 296 [2018-07-25 13:22:17,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:17,672 INFO L225 Difference]: With dead ends: 301 [2018-07-25 13:22:17,672 INFO L226 Difference]: Without dead ends: 299 [2018-07-25 13:22:17,675 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 13:22:17,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-07-25 13:22:17,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2018-07-25 13:22:17,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-07-25 13:22:17,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 299 transitions. [2018-07-25 13:22:17,679 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 299 transitions. Word has length 296 [2018-07-25 13:22:17,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:17,680 INFO L472 AbstractCegarLoop]: Abstraction has 299 states and 299 transitions. [2018-07-25 13:22:17,680 INFO L473 AbstractCegarLoop]: Interpolant automaton has 149 states. [2018-07-25 13:22:17,680 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 299 transitions. [2018-07-25 13:22:17,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-07-25 13:22:17,681 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:17,681 INFO L354 BasicCegarLoop]: trace histogram [148, 147, 1, 1, 1] [2018-07-25 13:22:17,682 INFO L415 AbstractCegarLoop]: === Iteration 148 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:17,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1038934549, now seen corresponding path program 147 times [2018-07-25 13:22:17,682 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:17,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:18,390 INFO L134 CoverageAnalysis]: Checked inductivity of 21756 backedges. 0 proven. 21756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:18,391 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:18,391 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149] total 149 [2018-07-25 13:22:18,391 INFO L451 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-07-25 13:22:18,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-07-25 13:22:18,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-07-25 13:22:18,394 INFO L87 Difference]: Start difference. First operand 299 states and 299 transitions. Second operand 150 states. [2018-07-25 13:22:19,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:19,034 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2018-07-25 13:22:19,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-07-25 13:22:19,034 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 298 [2018-07-25 13:22:19,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:19,035 INFO L225 Difference]: With dead ends: 303 [2018-07-25 13:22:19,035 INFO L226 Difference]: Without dead ends: 301 [2018-07-25 13:22:19,037 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 13:22:19,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-07-25 13:22:19,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2018-07-25 13:22:19,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-07-25 13:22:19,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2018-07-25 13:22:19,042 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 298 [2018-07-25 13:22:19,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:19,042 INFO L472 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2018-07-25 13:22:19,042 INFO L473 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-07-25 13:22:19,042 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2018-07-25 13:22:19,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-07-25 13:22:19,044 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:19,044 INFO L354 BasicCegarLoop]: trace histogram [149, 148, 1, 1, 1] [2018-07-25 13:22:19,044 INFO L415 AbstractCegarLoop]: === Iteration 149 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:19,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1983741007, now seen corresponding path program 148 times [2018-07-25 13:22:19,044 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:19,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:19,846 INFO L134 CoverageAnalysis]: Checked inductivity of 22052 backedges. 0 proven. 22052 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:19,847 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:19,847 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [150] total 150 [2018-07-25 13:22:19,847 INFO L451 AbstractCegarLoop]: Interpolant automaton has 151 states [2018-07-25 13:22:19,849 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 151 interpolants. [2018-07-25 13:22:19,851 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11325, Invalid=11325, Unknown=0, NotChecked=0, Total=22650 [2018-07-25 13:22:19,851 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 151 states. [2018-07-25 13:22:20,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:20,101 INFO L93 Difference]: Finished difference Result 305 states and 305 transitions. [2018-07-25 13:22:20,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2018-07-25 13:22:20,101 INFO L78 Accepts]: Start accepts. Automaton has 151 states. Word has length 300 [2018-07-25 13:22:20,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:20,102 INFO L225 Difference]: With dead ends: 305 [2018-07-25 13:22:20,102 INFO L226 Difference]: Without dead ends: 303 [2018-07-25 13:22:20,103 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=11325, Invalid=11325, Unknown=0, NotChecked=0, Total=22650 [2018-07-25 13:22:20,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-07-25 13:22:20,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2018-07-25 13:22:20,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-07-25 13:22:20,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 303 transitions. [2018-07-25 13:22:20,106 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 303 transitions. Word has length 300 [2018-07-25 13:22:20,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:20,106 INFO L472 AbstractCegarLoop]: Abstraction has 303 states and 303 transitions. [2018-07-25 13:22:20,106 INFO L473 AbstractCegarLoop]: Interpolant automaton has 151 states. [2018-07-25 13:22:20,106 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 303 transitions. [2018-07-25 13:22:20,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-07-25 13:22:20,107 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:20,107 INFO L354 BasicCegarLoop]: trace histogram [150, 149, 1, 1, 1] [2018-07-25 13:22:20,107 INFO L415 AbstractCegarLoop]: === Iteration 150 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:20,108 INFO L82 PathProgramCache]: Analyzing trace with hash -590319607, now seen corresponding path program 149 times [2018-07-25 13:22:20,108 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:20,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:20,750 INFO L134 CoverageAnalysis]: Checked inductivity of 22350 backedges. 0 proven. 22350 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:20,750 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:20,750 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [151] total 151 [2018-07-25 13:22:20,750 INFO L451 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-07-25 13:22:20,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-07-25 13:22:20,753 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-07-25 13:22:20,753 INFO L87 Difference]: Start difference. First operand 303 states and 303 transitions. Second operand 152 states. [2018-07-25 13:22:21,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:21,579 INFO L93 Difference]: Finished difference Result 307 states and 307 transitions. [2018-07-25 13:22:21,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-07-25 13:22:21,579 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 302 [2018-07-25 13:22:21,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:21,580 INFO L225 Difference]: With dead ends: 307 [2018-07-25 13:22:21,580 INFO L226 Difference]: Without dead ends: 305 [2018-07-25 13:22:21,581 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 13:22:21,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-07-25 13:22:21,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2018-07-25 13:22:21,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-07-25 13:22:21,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 305 transitions. [2018-07-25 13:22:21,585 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 305 transitions. Word has length 302 [2018-07-25 13:22:21,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:21,585 INFO L472 AbstractCegarLoop]: Abstraction has 305 states and 305 transitions. [2018-07-25 13:22:21,585 INFO L473 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-07-25 13:22:21,585 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 305 transitions. [2018-07-25 13:22:21,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-07-25 13:22:21,586 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:21,586 INFO L354 BasicCegarLoop]: trace histogram [151, 150, 1, 1, 1] [2018-07-25 13:22:21,586 INFO L415 AbstractCegarLoop]: === Iteration 151 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:21,586 INFO L82 PathProgramCache]: Analyzing trace with hash -361407165, now seen corresponding path program 150 times [2018-07-25 13:22:21,586 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:21,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:22,267 INFO L134 CoverageAnalysis]: Checked inductivity of 22650 backedges. 0 proven. 22650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:22,268 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:22,268 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [152] total 152 [2018-07-25 13:22:22,268 INFO L451 AbstractCegarLoop]: Interpolant automaton has 153 states [2018-07-25 13:22:22,270 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2018-07-25 13:22:22,271 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11628, Invalid=11628, Unknown=0, NotChecked=0, Total=23256 [2018-07-25 13:22:22,271 INFO L87 Difference]: Start difference. First operand 305 states and 305 transitions. Second operand 153 states. [2018-07-25 13:22:23,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:23,021 INFO L93 Difference]: Finished difference Result 309 states and 309 transitions. [2018-07-25 13:22:23,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-07-25 13:22:23,021 INFO L78 Accepts]: Start accepts. Automaton has 153 states. Word has length 304 [2018-07-25 13:22:23,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:23,022 INFO L225 Difference]: With dead ends: 309 [2018-07-25 13:22:23,022 INFO L226 Difference]: Without dead ends: 307 [2018-07-25 13:22:23,025 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 13:22:23,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-07-25 13:22:23,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2018-07-25 13:22:23,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-07-25 13:22:23,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 307 transitions. [2018-07-25 13:22:23,028 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 307 transitions. Word has length 304 [2018-07-25 13:22:23,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:23,028 INFO L472 AbstractCegarLoop]: Abstraction has 307 states and 307 transitions. [2018-07-25 13:22:23,028 INFO L473 AbstractCegarLoop]: Interpolant automaton has 153 states. [2018-07-25 13:22:23,029 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 307 transitions. [2018-07-25 13:22:23,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-07-25 13:22:23,029 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:23,030 INFO L354 BasicCegarLoop]: trace histogram [152, 151, 1, 1, 1] [2018-07-25 13:22:23,030 INFO L415 AbstractCegarLoop]: === Iteration 152 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:23,030 INFO L82 PathProgramCache]: Analyzing trace with hash 580117501, now seen corresponding path program 151 times [2018-07-25 13:22:23,030 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:23,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:23,738 INFO L134 CoverageAnalysis]: Checked inductivity of 22952 backedges. 0 proven. 22952 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:23,738 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:23,738 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [153] total 153 [2018-07-25 13:22:23,739 INFO L451 AbstractCegarLoop]: Interpolant automaton has 154 states [2018-07-25 13:22:23,741 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2018-07-25 13:22:23,742 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-07-25 13:22:23,742 INFO L87 Difference]: Start difference. First operand 307 states and 307 transitions. Second operand 154 states. [2018-07-25 13:22:24,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:24,299 INFO L93 Difference]: Finished difference Result 311 states and 311 transitions. [2018-07-25 13:22:24,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2018-07-25 13:22:24,299 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 306 [2018-07-25 13:22:24,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:24,300 INFO L225 Difference]: With dead ends: 311 [2018-07-25 13:22:24,300 INFO L226 Difference]: Without dead ends: 309 [2018-07-25 13:22:24,302 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 13:22:24,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-07-25 13:22:24,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2018-07-25 13:22:24,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-07-25 13:22:24,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 309 transitions. [2018-07-25 13:22:24,307 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 309 transitions. Word has length 306 [2018-07-25 13:22:24,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:24,307 INFO L472 AbstractCegarLoop]: Abstraction has 309 states and 309 transitions. [2018-07-25 13:22:24,308 INFO L473 AbstractCegarLoop]: Interpolant automaton has 154 states. [2018-07-25 13:22:24,308 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 309 transitions. [2018-07-25 13:22:24,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-07-25 13:22:24,309 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:24,309 INFO L354 BasicCegarLoop]: trace histogram [153, 152, 1, 1, 1] [2018-07-25 13:22:24,309 INFO L415 AbstractCegarLoop]: === Iteration 153 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:24,309 INFO L82 PathProgramCache]: Analyzing trace with hash -852777929, now seen corresponding path program 152 times [2018-07-25 13:22:24,310 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:24,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:25,095 INFO L134 CoverageAnalysis]: Checked inductivity of 23256 backedges. 0 proven. 23256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:25,096 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:25,096 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [154] total 154 [2018-07-25 13:22:25,096 INFO L451 AbstractCegarLoop]: Interpolant automaton has 155 states [2018-07-25 13:22:25,098 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2018-07-25 13:22:25,099 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11935, Invalid=11935, Unknown=0, NotChecked=0, Total=23870 [2018-07-25 13:22:25,099 INFO L87 Difference]: Start difference. First operand 309 states and 309 transitions. Second operand 155 states. [2018-07-25 13:22:25,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:25,667 INFO L93 Difference]: Finished difference Result 313 states and 313 transitions. [2018-07-25 13:22:25,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2018-07-25 13:22:25,667 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 308 [2018-07-25 13:22:25,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:25,668 INFO L225 Difference]: With dead ends: 313 [2018-07-25 13:22:25,668 INFO L226 Difference]: Without dead ends: 311 [2018-07-25 13:22:25,669 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=11935, Invalid=11935, Unknown=0, NotChecked=0, Total=23870 [2018-07-25 13:22:25,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-07-25 13:22:25,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2018-07-25 13:22:25,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-07-25 13:22:25,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 311 transitions. [2018-07-25 13:22:25,672 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 311 transitions. Word has length 308 [2018-07-25 13:22:25,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:25,672 INFO L472 AbstractCegarLoop]: Abstraction has 311 states and 311 transitions. [2018-07-25 13:22:25,672 INFO L473 AbstractCegarLoop]: Interpolant automaton has 155 states. [2018-07-25 13:22:25,672 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 311 transitions. [2018-07-25 13:22:25,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-07-25 13:22:25,673 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:25,673 INFO L354 BasicCegarLoop]: trace histogram [154, 153, 1, 1, 1] [2018-07-25 13:22:25,673 INFO L415 AbstractCegarLoop]: === Iteration 154 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:25,673 INFO L82 PathProgramCache]: Analyzing trace with hash 819215857, now seen corresponding path program 153 times [2018-07-25 13:22:25,673 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:25,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:26,373 INFO L134 CoverageAnalysis]: Checked inductivity of 23562 backedges. 0 proven. 23562 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:26,373 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:26,373 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [155] total 155 [2018-07-25 13:22:26,374 INFO L451 AbstractCegarLoop]: Interpolant automaton has 156 states [2018-07-25 13:22:26,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2018-07-25 13:22:26,377 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-07-25 13:22:26,377 INFO L87 Difference]: Start difference. First operand 311 states and 311 transitions. Second operand 156 states. [2018-07-25 13:22:26,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:26,787 INFO L93 Difference]: Finished difference Result 315 states and 315 transitions. [2018-07-25 13:22:26,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-07-25 13:22:26,787 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 310 [2018-07-25 13:22:26,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:26,788 INFO L225 Difference]: With dead ends: 315 [2018-07-25 13:22:26,788 INFO L226 Difference]: Without dead ends: 313 [2018-07-25 13:22:26,790 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 13:22:26,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-07-25 13:22:26,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2018-07-25 13:22:26,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-07-25 13:22:26,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 313 transitions. [2018-07-25 13:22:26,794 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 313 transitions. Word has length 310 [2018-07-25 13:22:26,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:26,794 INFO L472 AbstractCegarLoop]: Abstraction has 313 states and 313 transitions. [2018-07-25 13:22:26,794 INFO L473 AbstractCegarLoop]: Interpolant automaton has 156 states. [2018-07-25 13:22:26,794 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 313 transitions. [2018-07-25 13:22:26,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-07-25 13:22:26,795 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:26,795 INFO L354 BasicCegarLoop]: trace histogram [155, 154, 1, 1, 1] [2018-07-25 13:22:26,795 INFO L415 AbstractCegarLoop]: === Iteration 155 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:26,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1287475499, now seen corresponding path program 154 times [2018-07-25 13:22:26,796 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:26,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:27,558 INFO L134 CoverageAnalysis]: Checked inductivity of 23870 backedges. 0 proven. 23870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:27,558 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:27,558 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [156] total 156 [2018-07-25 13:22:27,559 INFO L451 AbstractCegarLoop]: Interpolant automaton has 157 states [2018-07-25 13:22:27,560 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 157 interpolants. [2018-07-25 13:22:27,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12246, Invalid=12246, Unknown=0, NotChecked=0, Total=24492 [2018-07-25 13:22:27,562 INFO L87 Difference]: Start difference. First operand 313 states and 313 transitions. Second operand 157 states. [2018-07-25 13:22:28,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:28,410 INFO L93 Difference]: Finished difference Result 317 states and 317 transitions. [2018-07-25 13:22:28,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2018-07-25 13:22:28,410 INFO L78 Accepts]: Start accepts. Automaton has 157 states. Word has length 312 [2018-07-25 13:22:28,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:28,411 INFO L225 Difference]: With dead ends: 317 [2018-07-25 13:22:28,411 INFO L226 Difference]: Without dead ends: 315 [2018-07-25 13:22:28,413 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 13:22:28,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-07-25 13:22:28,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2018-07-25 13:22:28,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-07-25 13:22:28,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 315 transitions. [2018-07-25 13:22:28,418 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 315 transitions. Word has length 312 [2018-07-25 13:22:28,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:28,418 INFO L472 AbstractCegarLoop]: Abstraction has 315 states and 315 transitions. [2018-07-25 13:22:28,418 INFO L473 AbstractCegarLoop]: Interpolant automaton has 157 states. [2018-07-25 13:22:28,418 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 315 transitions. [2018-07-25 13:22:28,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-07-25 13:22:28,420 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:28,420 INFO L354 BasicCegarLoop]: trace histogram [156, 155, 1, 1, 1] [2018-07-25 13:22:28,420 INFO L415 AbstractCegarLoop]: === Iteration 156 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:28,420 INFO L82 PathProgramCache]: Analyzing trace with hash 313425381, now seen corresponding path program 155 times [2018-07-25 13:22:28,420 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:28,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:29,321 INFO L134 CoverageAnalysis]: Checked inductivity of 24180 backedges. 0 proven. 24180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:29,322 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:29,322 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [157] total 157 [2018-07-25 13:22:29,322 INFO L451 AbstractCegarLoop]: Interpolant automaton has 158 states [2018-07-25 13:22:29,324 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2018-07-25 13:22:29,325 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-07-25 13:22:29,325 INFO L87 Difference]: Start difference. First operand 315 states and 315 transitions. Second operand 158 states. [2018-07-25 13:22:29,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:29,927 INFO L93 Difference]: Finished difference Result 319 states and 319 transitions. [2018-07-25 13:22:29,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2018-07-25 13:22:29,927 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 314 [2018-07-25 13:22:29,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:29,928 INFO L225 Difference]: With dead ends: 319 [2018-07-25 13:22:29,928 INFO L226 Difference]: Without dead ends: 317 [2018-07-25 13:22:29,930 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-07-25 13:22:29,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-07-25 13:22:29,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2018-07-25 13:22:29,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-07-25 13:22:29,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 317 transitions. [2018-07-25 13:22:29,934 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 317 transitions. Word has length 314 [2018-07-25 13:22:29,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:29,934 INFO L472 AbstractCegarLoop]: Abstraction has 317 states and 317 transitions. [2018-07-25 13:22:29,934 INFO L473 AbstractCegarLoop]: Interpolant automaton has 158 states. [2018-07-25 13:22:29,934 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 317 transitions. [2018-07-25 13:22:29,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2018-07-25 13:22:29,935 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:29,935 INFO L354 BasicCegarLoop]: trace histogram [157, 156, 1, 1, 1] [2018-07-25 13:22:29,935 INFO L415 AbstractCegarLoop]: === Iteration 157 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:29,935 INFO L82 PathProgramCache]: Analyzing trace with hash 554132511, now seen corresponding path program 156 times [2018-07-25 13:22:29,935 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:30,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:30,727 INFO L134 CoverageAnalysis]: Checked inductivity of 24492 backedges. 0 proven. 24492 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:30,727 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:30,727 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [158] total 158 [2018-07-25 13:22:30,728 INFO L451 AbstractCegarLoop]: Interpolant automaton has 159 states [2018-07-25 13:22:30,729 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 159 interpolants. [2018-07-25 13:22:30,730 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12561, Invalid=12561, Unknown=0, NotChecked=0, Total=25122 [2018-07-25 13:22:30,731 INFO L87 Difference]: Start difference. First operand 317 states and 317 transitions. Second operand 159 states. [2018-07-25 13:22:31,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:31,532 INFO L93 Difference]: Finished difference Result 321 states and 321 transitions. [2018-07-25 13:22:31,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2018-07-25 13:22:31,532 INFO L78 Accepts]: Start accepts. Automaton has 159 states. Word has length 316 [2018-07-25 13:22:31,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:31,533 INFO L225 Difference]: With dead ends: 321 [2018-07-25 13:22:31,533 INFO L226 Difference]: Without dead ends: 319 [2018-07-25 13:22:31,535 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=12561, Invalid=12561, Unknown=0, NotChecked=0, Total=25122 [2018-07-25 13:22:31,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-07-25 13:22:31,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2018-07-25 13:22:31,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-07-25 13:22:31,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 319 transitions. [2018-07-25 13:22:31,539 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 319 transitions. Word has length 316 [2018-07-25 13:22:31,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:31,539 INFO L472 AbstractCegarLoop]: Abstraction has 319 states and 319 transitions. [2018-07-25 13:22:31,539 INFO L473 AbstractCegarLoop]: Interpolant automaton has 159 states. [2018-07-25 13:22:31,539 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 319 transitions. [2018-07-25 13:22:31,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-07-25 13:22:31,540 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:31,540 INFO L354 BasicCegarLoop]: trace histogram [158, 157, 1, 1, 1] [2018-07-25 13:22:31,540 INFO L415 AbstractCegarLoop]: === Iteration 158 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:31,540 INFO L82 PathProgramCache]: Analyzing trace with hash -54549543, now seen corresponding path program 157 times [2018-07-25 13:22:31,540 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:31,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:32,287 INFO L134 CoverageAnalysis]: Checked inductivity of 24806 backedges. 0 proven. 24806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:32,288 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:32,288 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [159] total 159 [2018-07-25 13:22:32,288 INFO L451 AbstractCegarLoop]: Interpolant automaton has 160 states [2018-07-25 13:22:32,290 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2018-07-25 13:22:32,292 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-07-25 13:22:32,292 INFO L87 Difference]: Start difference. First operand 319 states and 319 transitions. Second operand 160 states. [2018-07-25 13:22:33,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:33,376 INFO L93 Difference]: Finished difference Result 323 states and 323 transitions. [2018-07-25 13:22:33,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2018-07-25 13:22:33,377 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 318 [2018-07-25 13:22:33,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:33,377 INFO L225 Difference]: With dead ends: 323 [2018-07-25 13:22:33,377 INFO L226 Difference]: Without dead ends: 321 [2018-07-25 13:22:33,380 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-07-25 13:22:33,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-07-25 13:22:33,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2018-07-25 13:22:33,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-07-25 13:22:33,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 321 transitions. [2018-07-25 13:22:33,383 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 321 transitions. Word has length 318 [2018-07-25 13:22:33,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:33,383 INFO L472 AbstractCegarLoop]: Abstraction has 321 states and 321 transitions. [2018-07-25 13:22:33,384 INFO L473 AbstractCegarLoop]: Interpolant automaton has 160 states. [2018-07-25 13:22:33,384 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 321 transitions. [2018-07-25 13:22:33,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2018-07-25 13:22:33,384 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:33,385 INFO L354 BasicCegarLoop]: trace histogram [159, 158, 1, 1, 1] [2018-07-25 13:22:33,385 INFO L415 AbstractCegarLoop]: === Iteration 159 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:33,385 INFO L82 PathProgramCache]: Analyzing trace with hash -882451181, now seen corresponding path program 158 times [2018-07-25 13:22:33,385 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:33,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:34,164 INFO L134 CoverageAnalysis]: Checked inductivity of 25122 backedges. 0 proven. 25122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:34,164 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:34,165 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [160] total 160 [2018-07-25 13:22:34,165 INFO L451 AbstractCegarLoop]: Interpolant automaton has 161 states [2018-07-25 13:22:34,167 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 161 interpolants. [2018-07-25 13:22:34,168 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12880, Invalid=12880, Unknown=0, NotChecked=0, Total=25760 [2018-07-25 13:22:34,168 INFO L87 Difference]: Start difference. First operand 321 states and 321 transitions. Second operand 161 states. [2018-07-25 13:22:34,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:34,483 INFO L93 Difference]: Finished difference Result 325 states and 325 transitions. [2018-07-25 13:22:34,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2018-07-25 13:22:34,483 INFO L78 Accepts]: Start accepts. Automaton has 161 states. Word has length 320 [2018-07-25 13:22:34,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:34,484 INFO L225 Difference]: With dead ends: 325 [2018-07-25 13:22:34,484 INFO L226 Difference]: Without dead ends: 323 [2018-07-25 13:22:34,485 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 13:22:34,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-07-25 13:22:34,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2018-07-25 13:22:34,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-07-25 13:22:34,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 323 transitions. [2018-07-25 13:22:34,488 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 323 transitions. Word has length 320 [2018-07-25 13:22:34,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:34,489 INFO L472 AbstractCegarLoop]: Abstraction has 323 states and 323 transitions. [2018-07-25 13:22:34,489 INFO L473 AbstractCegarLoop]: Interpolant automaton has 161 states. [2018-07-25 13:22:34,489 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 323 transitions. [2018-07-25 13:22:34,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-07-25 13:22:34,490 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:34,490 INFO L354 BasicCegarLoop]: trace histogram [160, 159, 1, 1, 1] [2018-07-25 13:22:34,490 INFO L415 AbstractCegarLoop]: === Iteration 160 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:34,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1926975539, now seen corresponding path program 159 times [2018-07-25 13:22:34,490 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:34,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:35,288 INFO L134 CoverageAnalysis]: Checked inductivity of 25440 backedges. 0 proven. 25440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:35,288 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:35,288 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [161] total 161 [2018-07-25 13:22:35,288 INFO L451 AbstractCegarLoop]: Interpolant automaton has 162 states [2018-07-25 13:22:35,290 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2018-07-25 13:22:35,291 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-07-25 13:22:35,291 INFO L87 Difference]: Start difference. First operand 323 states and 323 transitions. Second operand 162 states. [2018-07-25 13:22:36,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:36,174 INFO L93 Difference]: Finished difference Result 327 states and 327 transitions. [2018-07-25 13:22:36,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2018-07-25 13:22:36,174 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 322 [2018-07-25 13:22:36,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:36,175 INFO L225 Difference]: With dead ends: 327 [2018-07-25 13:22:36,175 INFO L226 Difference]: Without dead ends: 325 [2018-07-25 13:22:36,176 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-07-25 13:22:36,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-07-25 13:22:36,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2018-07-25 13:22:36,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-07-25 13:22:36,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 325 transitions. [2018-07-25 13:22:36,180 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 325 transitions. Word has length 322 [2018-07-25 13:22:36,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:36,180 INFO L472 AbstractCegarLoop]: Abstraction has 325 states and 325 transitions. [2018-07-25 13:22:36,180 INFO L473 AbstractCegarLoop]: Interpolant automaton has 162 states. [2018-07-25 13:22:36,180 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 325 transitions. [2018-07-25 13:22:36,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-07-25 13:22:36,181 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:36,181 INFO L354 BasicCegarLoop]: trace histogram [161, 160, 1, 1, 1] [2018-07-25 13:22:36,181 INFO L415 AbstractCegarLoop]: === Iteration 161 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:36,181 INFO L82 PathProgramCache]: Analyzing trace with hash -692536313, now seen corresponding path program 160 times [2018-07-25 13:22:36,182 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:36,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:36,994 INFO L134 CoverageAnalysis]: Checked inductivity of 25760 backedges. 0 proven. 25760 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:36,995 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:36,995 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [162] total 162 [2018-07-25 13:22:36,995 INFO L451 AbstractCegarLoop]: Interpolant automaton has 163 states [2018-07-25 13:22:36,998 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 163 interpolants. [2018-07-25 13:22:36,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13203, Invalid=13203, Unknown=0, NotChecked=0, Total=26406 [2018-07-25 13:22:37,000 INFO L87 Difference]: Start difference. First operand 325 states and 325 transitions. Second operand 163 states. [2018-07-25 13:22:38,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:38,174 INFO L93 Difference]: Finished difference Result 329 states and 329 transitions. [2018-07-25 13:22:38,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2018-07-25 13:22:38,175 INFO L78 Accepts]: Start accepts. Automaton has 163 states. Word has length 324 [2018-07-25 13:22:38,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:38,175 INFO L225 Difference]: With dead ends: 329 [2018-07-25 13:22:38,175 INFO L226 Difference]: Without dead ends: 327 [2018-07-25 13:22:38,177 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 13:22:38,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-07-25 13:22:38,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 327. [2018-07-25 13:22:38,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-07-25 13:22:38,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 327 transitions. [2018-07-25 13:22:38,181 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 327 transitions. Word has length 324 [2018-07-25 13:22:38,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:38,181 INFO L472 AbstractCegarLoop]: Abstraction has 327 states and 327 transitions. [2018-07-25 13:22:38,181 INFO L473 AbstractCegarLoop]: Interpolant automaton has 163 states. [2018-07-25 13:22:38,181 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 327 transitions. [2018-07-25 13:22:38,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2018-07-25 13:22:38,182 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:38,182 INFO L354 BasicCegarLoop]: trace histogram [162, 161, 1, 1, 1] [2018-07-25 13:22:38,183 INFO L415 AbstractCegarLoop]: === Iteration 162 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:38,183 INFO L82 PathProgramCache]: Analyzing trace with hash 192586177, now seen corresponding path program 161 times [2018-07-25 13:22:38,183 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:38,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:39,053 INFO L134 CoverageAnalysis]: Checked inductivity of 26082 backedges. 0 proven. 26082 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:39,053 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:39,054 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [163] total 163 [2018-07-25 13:22:39,054 INFO L451 AbstractCegarLoop]: Interpolant automaton has 164 states [2018-07-25 13:22:39,056 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2018-07-25 13:22:39,057 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-07-25 13:22:39,058 INFO L87 Difference]: Start difference. First operand 327 states and 327 transitions. Second operand 164 states. [2018-07-25 13:22:39,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:39,781 INFO L93 Difference]: Finished difference Result 331 states and 331 transitions. [2018-07-25 13:22:39,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2018-07-25 13:22:39,781 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 326 [2018-07-25 13:22:39,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:39,782 INFO L225 Difference]: With dead ends: 331 [2018-07-25 13:22:39,782 INFO L226 Difference]: Without dead ends: 329 [2018-07-25 13:22:39,783 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-07-25 13:22:39,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-07-25 13:22:39,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2018-07-25 13:22:39,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-07-25 13:22:39,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 329 transitions. [2018-07-25 13:22:39,786 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 329 transitions. Word has length 326 [2018-07-25 13:22:39,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:39,786 INFO L472 AbstractCegarLoop]: Abstraction has 329 states and 329 transitions. [2018-07-25 13:22:39,786 INFO L473 AbstractCegarLoop]: Interpolant automaton has 164 states. [2018-07-25 13:22:39,786 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 329 transitions. [2018-07-25 13:22:39,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-07-25 13:22:39,787 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:39,787 INFO L354 BasicCegarLoop]: trace histogram [163, 162, 1, 1, 1] [2018-07-25 13:22:39,788 INFO L415 AbstractCegarLoop]: === Iteration 163 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:39,788 INFO L82 PathProgramCache]: Analyzing trace with hash 391774459, now seen corresponding path program 162 times [2018-07-25 13:22:39,788 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:39,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:40,638 INFO L134 CoverageAnalysis]: Checked inductivity of 26406 backedges. 0 proven. 26406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:40,638 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:40,638 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [164] total 164 [2018-07-25 13:22:40,639 INFO L451 AbstractCegarLoop]: Interpolant automaton has 165 states [2018-07-25 13:22:40,640 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 165 interpolants. [2018-07-25 13:22:40,641 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13530, Invalid=13530, Unknown=0, NotChecked=0, Total=27060 [2018-07-25 13:22:40,641 INFO L87 Difference]: Start difference. First operand 329 states and 329 transitions. Second operand 165 states. [2018-07-25 13:22:40,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:40,957 INFO L93 Difference]: Finished difference Result 333 states and 333 transitions. [2018-07-25 13:22:40,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2018-07-25 13:22:40,957 INFO L78 Accepts]: Start accepts. Automaton has 165 states. Word has length 328 [2018-07-25 13:22:40,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:40,958 INFO L225 Difference]: With dead ends: 333 [2018-07-25 13:22:40,958 INFO L226 Difference]: Without dead ends: 331 [2018-07-25 13:22:40,959 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=13530, Invalid=13530, Unknown=0, NotChecked=0, Total=27060 [2018-07-25 13:22:40,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-07-25 13:22:40,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 331. [2018-07-25 13:22:40,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-07-25 13:22:40,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 331 transitions. [2018-07-25 13:22:40,962 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 331 transitions. Word has length 328 [2018-07-25 13:22:40,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:40,963 INFO L472 AbstractCegarLoop]: Abstraction has 331 states and 331 transitions. [2018-07-25 13:22:40,963 INFO L473 AbstractCegarLoop]: Interpolant automaton has 165 states. [2018-07-25 13:22:40,963 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 331 transitions. [2018-07-25 13:22:40,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-07-25 13:22:40,964 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:40,964 INFO L354 BasicCegarLoop]: trace histogram [164, 163, 1, 1, 1] [2018-07-25 13:22:40,965 INFO L415 AbstractCegarLoop]: === Iteration 164 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:40,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1461814859, now seen corresponding path program 163 times [2018-07-25 13:22:40,965 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:41,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:41,790 INFO L134 CoverageAnalysis]: Checked inductivity of 26732 backedges. 0 proven. 26732 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:41,790 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:41,790 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [165] total 165 [2018-07-25 13:22:41,791 INFO L451 AbstractCegarLoop]: Interpolant automaton has 166 states [2018-07-25 13:22:41,793 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2018-07-25 13:22:41,794 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-07-25 13:22:41,794 INFO L87 Difference]: Start difference. First operand 331 states and 331 transitions. Second operand 166 states. [2018-07-25 13:22:42,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:42,347 INFO L93 Difference]: Finished difference Result 335 states and 335 transitions. [2018-07-25 13:22:42,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2018-07-25 13:22:42,347 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 330 [2018-07-25 13:22:42,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:42,348 INFO L225 Difference]: With dead ends: 335 [2018-07-25 13:22:42,348 INFO L226 Difference]: Without dead ends: 333 [2018-07-25 13:22:42,350 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 13:22:42,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-07-25 13:22:42,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2018-07-25 13:22:42,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-07-25 13:22:42,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 333 transitions. [2018-07-25 13:22:42,355 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 333 transitions. Word has length 330 [2018-07-25 13:22:42,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:42,355 INFO L472 AbstractCegarLoop]: Abstraction has 333 states and 333 transitions. [2018-07-25 13:22:42,356 INFO L473 AbstractCegarLoop]: Interpolant automaton has 166 states. [2018-07-25 13:22:42,356 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 333 transitions. [2018-07-25 13:22:42,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-07-25 13:22:42,357 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:42,357 INFO L354 BasicCegarLoop]: trace histogram [165, 164, 1, 1, 1] [2018-07-25 13:22:42,357 INFO L415 AbstractCegarLoop]: === Iteration 165 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:42,358 INFO L82 PathProgramCache]: Analyzing trace with hash -349721617, now seen corresponding path program 164 times [2018-07-25 13:22:42,358 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:42,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:43,409 INFO L134 CoverageAnalysis]: Checked inductivity of 27060 backedges. 0 proven. 27060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:43,410 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:43,410 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [166] total 166 [2018-07-25 13:22:43,410 INFO L451 AbstractCegarLoop]: Interpolant automaton has 167 states [2018-07-25 13:22:43,412 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 167 interpolants. [2018-07-25 13:22:43,414 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13861, Invalid=13861, Unknown=0, NotChecked=0, Total=27722 [2018-07-25 13:22:43,414 INFO L87 Difference]: Start difference. First operand 333 states and 333 transitions. Second operand 167 states. [2018-07-25 13:22:44,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:44,492 INFO L93 Difference]: Finished difference Result 337 states and 337 transitions. [2018-07-25 13:22:44,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2018-07-25 13:22:44,492 INFO L78 Accepts]: Start accepts. Automaton has 167 states. Word has length 332 [2018-07-25 13:22:44,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:44,493 INFO L225 Difference]: With dead ends: 337 [2018-07-25 13:22:44,493 INFO L226 Difference]: Without dead ends: 335 [2018-07-25 13:22:44,496 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=13861, Invalid=13861, Unknown=0, NotChecked=0, Total=27722 [2018-07-25 13:22:44,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-07-25 13:22:44,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 335. [2018-07-25 13:22:44,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-07-25 13:22:44,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 335 transitions. [2018-07-25 13:22:44,499 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 335 transitions. Word has length 332 [2018-07-25 13:22:44,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:44,500 INFO L472 AbstractCegarLoop]: Abstraction has 335 states and 335 transitions. [2018-07-25 13:22:44,500 INFO L473 AbstractCegarLoop]: Interpolant automaton has 167 states. [2018-07-25 13:22:44,500 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 335 transitions. [2018-07-25 13:22:44,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2018-07-25 13:22:44,501 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:44,501 INFO L354 BasicCegarLoop]: trace histogram [166, 165, 1, 1, 1] [2018-07-25 13:22:44,501 INFO L415 AbstractCegarLoop]: === Iteration 166 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:44,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1074972759, now seen corresponding path program 165 times [2018-07-25 13:22:44,501 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:44,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:45,389 INFO L134 CoverageAnalysis]: Checked inductivity of 27390 backedges. 0 proven. 27390 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:45,389 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:45,389 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [167] total 167 [2018-07-25 13:22:45,389 INFO L451 AbstractCegarLoop]: Interpolant automaton has 168 states [2018-07-25 13:22:45,391 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2018-07-25 13:22:45,392 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-07-25 13:22:45,392 INFO L87 Difference]: Start difference. First operand 335 states and 335 transitions. Second operand 168 states. [2018-07-25 13:22:46,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:46,440 INFO L93 Difference]: Finished difference Result 339 states and 339 transitions. [2018-07-25 13:22:46,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2018-07-25 13:22:46,440 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 334 [2018-07-25 13:22:46,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:46,441 INFO L225 Difference]: With dead ends: 339 [2018-07-25 13:22:46,441 INFO L226 Difference]: Without dead ends: 337 [2018-07-25 13:22:46,442 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 13:22:46,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-07-25 13:22:46,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2018-07-25 13:22:46,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-07-25 13:22:46,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 337 transitions. [2018-07-25 13:22:46,446 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 337 transitions. Word has length 334 [2018-07-25 13:22:46,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:46,447 INFO L472 AbstractCegarLoop]: Abstraction has 337 states and 337 transitions. [2018-07-25 13:22:46,447 INFO L473 AbstractCegarLoop]: Interpolant automaton has 168 states. [2018-07-25 13:22:46,447 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 337 transitions. [2018-07-25 13:22:46,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-07-25 13:22:46,448 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:46,448 INFO L354 BasicCegarLoop]: trace histogram [167, 166, 1, 1, 1] [2018-07-25 13:22:46,448 INFO L415 AbstractCegarLoop]: === Iteration 167 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:46,448 INFO L82 PathProgramCache]: Analyzing trace with hash 2038349027, now seen corresponding path program 166 times [2018-07-25 13:22:46,448 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:46,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:47,305 INFO L134 CoverageAnalysis]: Checked inductivity of 27722 backedges. 0 proven. 27722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:47,305 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:47,305 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [168] total 168 [2018-07-25 13:22:47,305 INFO L451 AbstractCegarLoop]: Interpolant automaton has 169 states [2018-07-25 13:22:47,307 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 169 interpolants. [2018-07-25 13:22:47,309 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14196, Invalid=14196, Unknown=0, NotChecked=0, Total=28392 [2018-07-25 13:22:47,309 INFO L87 Difference]: Start difference. First operand 337 states and 337 transitions. Second operand 169 states. [2018-07-25 13:22:48,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:48,543 INFO L93 Difference]: Finished difference Result 341 states and 341 transitions. [2018-07-25 13:22:48,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2018-07-25 13:22:48,543 INFO L78 Accepts]: Start accepts. Automaton has 169 states. Word has length 336 [2018-07-25 13:22:48,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:48,544 INFO L225 Difference]: With dead ends: 341 [2018-07-25 13:22:48,544 INFO L226 Difference]: Without dead ends: 339 [2018-07-25 13:22:48,546 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 13:22:48,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-07-25 13:22:48,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2018-07-25 13:22:48,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-07-25 13:22:48,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 339 transitions. [2018-07-25 13:22:48,550 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 339 transitions. Word has length 336 [2018-07-25 13:22:48,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:48,550 INFO L472 AbstractCegarLoop]: Abstraction has 339 states and 339 transitions. [2018-07-25 13:22:48,550 INFO L473 AbstractCegarLoop]: Interpolant automaton has 169 states. [2018-07-25 13:22:48,550 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 339 transitions. [2018-07-25 13:22:48,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2018-07-25 13:22:48,551 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:48,551 INFO L354 BasicCegarLoop]: trace histogram [168, 167, 1, 1, 1] [2018-07-25 13:22:48,551 INFO L415 AbstractCegarLoop]: === Iteration 168 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:48,551 INFO L82 PathProgramCache]: Analyzing trace with hash 348380061, now seen corresponding path program 167 times [2018-07-25 13:22:48,552 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:48,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:49,430 INFO L134 CoverageAnalysis]: Checked inductivity of 28056 backedges. 0 proven. 28056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:49,430 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:49,430 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [169] total 169 [2018-07-25 13:22:49,431 INFO L451 AbstractCegarLoop]: Interpolant automaton has 170 states [2018-07-25 13:22:49,432 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2018-07-25 13:22:49,434 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-07-25 13:22:49,434 INFO L87 Difference]: Start difference. First operand 339 states and 339 transitions. Second operand 170 states. [2018-07-25 13:22:50,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:50,729 INFO L93 Difference]: Finished difference Result 343 states and 343 transitions. [2018-07-25 13:22:50,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2018-07-25 13:22:50,729 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 338 [2018-07-25 13:22:50,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:50,730 INFO L225 Difference]: With dead ends: 343 [2018-07-25 13:22:50,730 INFO L226 Difference]: Without dead ends: 341 [2018-07-25 13:22:50,732 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 13:22:50,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-07-25 13:22:50,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2018-07-25 13:22:50,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-07-25 13:22:50,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 341 transitions. [2018-07-25 13:22:50,736 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 341 transitions. Word has length 338 [2018-07-25 13:22:50,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:50,737 INFO L472 AbstractCegarLoop]: Abstraction has 341 states and 341 transitions. [2018-07-25 13:22:50,737 INFO L473 AbstractCegarLoop]: Interpolant automaton has 170 states. [2018-07-25 13:22:50,737 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 341 transitions. [2018-07-25 13:22:50,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2018-07-25 13:22:50,738 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:50,738 INFO L354 BasicCegarLoop]: trace histogram [169, 168, 1, 1, 1] [2018-07-25 13:22:50,738 INFO L415 AbstractCegarLoop]: === Iteration 169 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:50,738 INFO L82 PathProgramCache]: Analyzing trace with hash -214158377, now seen corresponding path program 168 times [2018-07-25 13:22:50,738 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:50,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:51,694 INFO L134 CoverageAnalysis]: Checked inductivity of 28392 backedges. 0 proven. 28392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:51,695 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:51,695 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [170] total 170 [2018-07-25 13:22:51,695 INFO L451 AbstractCegarLoop]: Interpolant automaton has 171 states [2018-07-25 13:22:51,697 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 171 interpolants. [2018-07-25 13:22:51,698 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14535, Invalid=14535, Unknown=0, NotChecked=0, Total=29070 [2018-07-25 13:22:51,698 INFO L87 Difference]: Start difference. First operand 341 states and 341 transitions. Second operand 171 states. [2018-07-25 13:22:52,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:52,951 INFO L93 Difference]: Finished difference Result 345 states and 345 transitions. [2018-07-25 13:22:52,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2018-07-25 13:22:52,951 INFO L78 Accepts]: Start accepts. Automaton has 171 states. Word has length 340 [2018-07-25 13:22:52,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:52,952 INFO L225 Difference]: With dead ends: 345 [2018-07-25 13:22:52,952 INFO L226 Difference]: Without dead ends: 343 [2018-07-25 13:22:52,954 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=14535, Invalid=14535, Unknown=0, NotChecked=0, Total=29070 [2018-07-25 13:22:52,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-07-25 13:22:52,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2018-07-25 13:22:52,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-07-25 13:22:52,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 343 transitions. [2018-07-25 13:22:52,957 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 343 transitions. Word has length 340 [2018-07-25 13:22:52,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:52,958 INFO L472 AbstractCegarLoop]: Abstraction has 343 states and 343 transitions. [2018-07-25 13:22:52,958 INFO L473 AbstractCegarLoop]: Interpolant automaton has 171 states. [2018-07-25 13:22:52,958 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 343 transitions. [2018-07-25 13:22:52,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-07-25 13:22:52,959 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:52,959 INFO L354 BasicCegarLoop]: trace histogram [170, 169, 1, 1, 1] [2018-07-25 13:22:52,959 INFO L415 AbstractCegarLoop]: === Iteration 170 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:52,959 INFO L82 PathProgramCache]: Analyzing trace with hash 352282001, now seen corresponding path program 169 times [2018-07-25 13:22:52,959 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:53,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:53,859 INFO L134 CoverageAnalysis]: Checked inductivity of 28730 backedges. 0 proven. 28730 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:53,859 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:53,860 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [171] total 171 [2018-07-25 13:22:53,860 INFO L451 AbstractCegarLoop]: Interpolant automaton has 172 states [2018-07-25 13:22:53,862 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2018-07-25 13:22:53,864 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-07-25 13:22:53,864 INFO L87 Difference]: Start difference. First operand 343 states and 343 transitions. Second operand 172 states. [2018-07-25 13:22:55,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:55,125 INFO L93 Difference]: Finished difference Result 347 states and 347 transitions. [2018-07-25 13:22:55,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2018-07-25 13:22:55,125 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 342 [2018-07-25 13:22:55,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:55,126 INFO L225 Difference]: With dead ends: 347 [2018-07-25 13:22:55,126 INFO L226 Difference]: Without dead ends: 345 [2018-07-25 13:22:55,129 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-07-25 13:22:55,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2018-07-25 13:22:55,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 345. [2018-07-25 13:22:55,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-07-25 13:22:55,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 345 transitions. [2018-07-25 13:22:55,132 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 345 transitions. Word has length 342 [2018-07-25 13:22:55,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:55,133 INFO L472 AbstractCegarLoop]: Abstraction has 345 states and 345 transitions. [2018-07-25 13:22:55,133 INFO L473 AbstractCegarLoop]: Interpolant automaton has 172 states. [2018-07-25 13:22:55,133 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 345 transitions. [2018-07-25 13:22:55,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2018-07-25 13:22:55,134 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:55,134 INFO L354 BasicCegarLoop]: trace histogram [171, 170, 1, 1, 1] [2018-07-25 13:22:55,134 INFO L415 AbstractCegarLoop]: === Iteration 171 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:55,134 INFO L82 PathProgramCache]: Analyzing trace with hash -759361333, now seen corresponding path program 170 times [2018-07-25 13:22:55,134 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:55,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:56,069 INFO L134 CoverageAnalysis]: Checked inductivity of 29070 backedges. 0 proven. 29070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:56,069 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:56,069 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [172] total 172 [2018-07-25 13:22:56,070 INFO L451 AbstractCegarLoop]: Interpolant automaton has 173 states [2018-07-25 13:22:56,072 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 173 interpolants. [2018-07-25 13:22:56,075 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14878, Invalid=14878, Unknown=0, NotChecked=0, Total=29756 [2018-07-25 13:22:56,075 INFO L87 Difference]: Start difference. First operand 345 states and 345 transitions. Second operand 173 states. [2018-07-25 13:22:57,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:57,335 INFO L93 Difference]: Finished difference Result 349 states and 349 transitions. [2018-07-25 13:22:57,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2018-07-25 13:22:57,336 INFO L78 Accepts]: Start accepts. Automaton has 173 states. Word has length 344 [2018-07-25 13:22:57,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:57,337 INFO L225 Difference]: With dead ends: 349 [2018-07-25 13:22:57,337 INFO L226 Difference]: Without dead ends: 347 [2018-07-25 13:22:57,341 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=14878, Invalid=14878, Unknown=0, NotChecked=0, Total=29756 [2018-07-25 13:22:57,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-07-25 13:22:57,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2018-07-25 13:22:57,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-07-25 13:22:57,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 347 transitions. [2018-07-25 13:22:57,346 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 347 transitions. Word has length 344 [2018-07-25 13:22:57,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:57,346 INFO L472 AbstractCegarLoop]: Abstraction has 347 states and 347 transitions. [2018-07-25 13:22:57,346 INFO L473 AbstractCegarLoop]: Interpolant automaton has 173 states. [2018-07-25 13:22:57,346 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 347 transitions. [2018-07-25 13:22:57,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-07-25 13:22:57,348 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:57,348 INFO L354 BasicCegarLoop]: trace histogram [172, 171, 1, 1, 1] [2018-07-25 13:22:57,349 INFO L415 AbstractCegarLoop]: === Iteration 172 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:57,349 INFO L82 PathProgramCache]: Analyzing trace with hash 398251397, now seen corresponding path program 171 times [2018-07-25 13:22:57,349 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:57,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:58,265 INFO L134 CoverageAnalysis]: Checked inductivity of 29412 backedges. 0 proven. 29412 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:58,265 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:58,266 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [173] total 173 [2018-07-25 13:22:58,266 INFO L451 AbstractCegarLoop]: Interpolant automaton has 174 states [2018-07-25 13:22:58,268 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2018-07-25 13:22:58,270 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-07-25 13:22:58,270 INFO L87 Difference]: Start difference. First operand 347 states and 347 transitions. Second operand 174 states. [2018-07-25 13:22:59,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:59,053 INFO L93 Difference]: Finished difference Result 351 states and 351 transitions. [2018-07-25 13:22:59,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2018-07-25 13:22:59,053 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 346 [2018-07-25 13:22:59,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:59,054 INFO L225 Difference]: With dead ends: 351 [2018-07-25 13:22:59,054 INFO L226 Difference]: Without dead ends: 349 [2018-07-25 13:22:59,056 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-07-25 13:22:59,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-07-25 13:22:59,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2018-07-25 13:22:59,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-07-25 13:22:59,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 349 transitions. [2018-07-25 13:22:59,062 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 349 transitions. Word has length 346 [2018-07-25 13:22:59,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:59,062 INFO L472 AbstractCegarLoop]: Abstraction has 349 states and 349 transitions. [2018-07-25 13:22:59,062 INFO L473 AbstractCegarLoop]: Interpolant automaton has 174 states. [2018-07-25 13:22:59,063 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 349 transitions. [2018-07-25 13:22:59,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-07-25 13:22:59,064 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:59,064 INFO L354 BasicCegarLoop]: trace histogram [173, 172, 1, 1, 1] [2018-07-25 13:22:59,064 INFO L415 AbstractCegarLoop]: === Iteration 173 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:59,064 INFO L82 PathProgramCache]: Analyzing trace with hash 467555263, now seen corresponding path program 172 times [2018-07-25 13:22:59,065 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:59,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:23:00,115 INFO L134 CoverageAnalysis]: Checked inductivity of 29756 backedges. 0 proven. 29756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:23:00,115 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:23:00,115 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [174] total 174 [2018-07-25 13:23:00,115 INFO L451 AbstractCegarLoop]: Interpolant automaton has 175 states [2018-07-25 13:23:00,117 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 175 interpolants. [2018-07-25 13:23:00,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15225, Invalid=15225, Unknown=0, NotChecked=0, Total=30450 [2018-07-25 13:23:00,119 INFO L87 Difference]: Start difference. First operand 349 states and 349 transitions. Second operand 175 states. [2018-07-25 13:23:00,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:23:00,542 INFO L93 Difference]: Finished difference Result 353 states and 353 transitions. [2018-07-25 13:23:00,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2018-07-25 13:23:00,542 INFO L78 Accepts]: Start accepts. Automaton has 175 states. Word has length 348 [2018-07-25 13:23:00,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:23:00,543 INFO L225 Difference]: With dead ends: 353 [2018-07-25 13:23:00,543 INFO L226 Difference]: Without dead ends: 351 [2018-07-25 13:23:00,546 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 13:23:00,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-07-25 13:23:00,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2018-07-25 13:23:00,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-07-25 13:23:00,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 351 transitions. [2018-07-25 13:23:00,550 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 351 transitions. Word has length 348 [2018-07-25 13:23:00,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:23:00,550 INFO L472 AbstractCegarLoop]: Abstraction has 351 states and 351 transitions. [2018-07-25 13:23:00,550 INFO L473 AbstractCegarLoop]: Interpolant automaton has 175 states. [2018-07-25 13:23:00,550 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 351 transitions. [2018-07-25 13:23:00,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-07-25 13:23:00,551 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:23:00,551 INFO L354 BasicCegarLoop]: trace histogram [174, 173, 1, 1, 1] [2018-07-25 13:23:00,551 INFO L415 AbstractCegarLoop]: === Iteration 174 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:23:00,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1650906247, now seen corresponding path program 173 times [2018-07-25 13:23:00,552 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:23:00,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:23:01,535 INFO L134 CoverageAnalysis]: Checked inductivity of 30102 backedges. 0 proven. 30102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:23:01,535 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:23:01,535 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [175] total 175 [2018-07-25 13:23:01,536 INFO L451 AbstractCegarLoop]: Interpolant automaton has 176 states [2018-07-25 13:23:01,538 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2018-07-25 13:23:01,540 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-07-25 13:23:01,540 INFO L87 Difference]: Start difference. First operand 351 states and 351 transitions. Second operand 176 states. [2018-07-25 13:23:02,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:23:02,190 INFO L93 Difference]: Finished difference Result 355 states and 355 transitions. [2018-07-25 13:23:02,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2018-07-25 13:23:02,190 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 350 [2018-07-25 13:23:02,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:23:02,191 INFO L225 Difference]: With dead ends: 355 [2018-07-25 13:23:02,191 INFO L226 Difference]: Without dead ends: 353 [2018-07-25 13:23:02,192 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-07-25 13:23:02,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-07-25 13:23:02,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 353. [2018-07-25 13:23:02,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-07-25 13:23:02,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 353 transitions. [2018-07-25 13:23:02,196 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 353 transitions. Word has length 350 [2018-07-25 13:23:02,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:23:02,196 INFO L472 AbstractCegarLoop]: Abstraction has 353 states and 353 transitions. [2018-07-25 13:23:02,196 INFO L473 AbstractCegarLoop]: Interpolant automaton has 176 states. [2018-07-25 13:23:02,196 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 353 transitions. [2018-07-25 13:23:02,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-07-25 13:23:02,197 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:23:02,197 INFO L354 BasicCegarLoop]: trace histogram [175, 174, 1, 1, 1] [2018-07-25 13:23:02,197 INFO L415 AbstractCegarLoop]: === Iteration 175 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:23:02,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1677919053, now seen corresponding path program 174 times [2018-07-25 13:23:02,198 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:23:02,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:23:03,149 INFO L134 CoverageAnalysis]: Checked inductivity of 30450 backedges. 0 proven. 30450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:23:03,149 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:23:03,150 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [176] total 176 [2018-07-25 13:23:03,150 INFO L451 AbstractCegarLoop]: Interpolant automaton has 177 states [2018-07-25 13:23:03,152 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 177 interpolants. [2018-07-25 13:23:03,154 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15576, Invalid=15576, Unknown=0, NotChecked=0, Total=31152 [2018-07-25 13:23:03,154 INFO L87 Difference]: Start difference. First operand 353 states and 353 transitions. Second operand 177 states. [2018-07-25 13:23:04,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:23:04,790 INFO L93 Difference]: Finished difference Result 357 states and 357 transitions. [2018-07-25 13:23:04,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2018-07-25 13:23:04,791 INFO L78 Accepts]: Start accepts. Automaton has 177 states. Word has length 352 [2018-07-25 13:23:04,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:23:04,791 INFO L225 Difference]: With dead ends: 357 [2018-07-25 13:23:04,791 INFO L226 Difference]: Without dead ends: 355 [2018-07-25 13:23:04,794 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15576, Invalid=15576, Unknown=0, NotChecked=0, Total=31152 [2018-07-25 13:23:04,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-07-25 13:23:04,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2018-07-25 13:23:04,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-07-25 13:23:04,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 355 transitions. [2018-07-25 13:23:04,798 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 355 transitions. Word has length 352 [2018-07-25 13:23:04,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:23:04,798 INFO L472 AbstractCegarLoop]: Abstraction has 355 states and 355 transitions. [2018-07-25 13:23:04,798 INFO L473 AbstractCegarLoop]: Interpolant automaton has 177 states. [2018-07-25 13:23:04,798 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 355 transitions. [2018-07-25 13:23:04,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2018-07-25 13:23:04,799 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:23:04,799 INFO L354 BasicCegarLoop]: trace histogram [176, 175, 1, 1, 1] [2018-07-25 13:23:04,799 INFO L415 AbstractCegarLoop]: === Iteration 176 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:23:04,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1867421843, now seen corresponding path program 175 times [2018-07-25 13:23:04,800 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:23:04,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:23:05,783 INFO L134 CoverageAnalysis]: Checked inductivity of 30800 backedges. 0 proven. 30800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:23:05,784 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:23:05,784 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [177] total 177 [2018-07-25 13:23:05,784 INFO L451 AbstractCegarLoop]: Interpolant automaton has 178 states [2018-07-25 13:23:05,786 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2018-07-25 13:23:05,788 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-07-25 13:23:05,788 INFO L87 Difference]: Start difference. First operand 355 states and 355 transitions. Second operand 178 states. [2018-07-25 13:23:07,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:23:07,296 INFO L93 Difference]: Finished difference Result 359 states and 359 transitions. [2018-07-25 13:23:07,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2018-07-25 13:23:07,296 INFO L78 Accepts]: Start accepts. Automaton has 178 states. Word has length 354 [2018-07-25 13:23:07,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:23:07,297 INFO L225 Difference]: With dead ends: 359 [2018-07-25 13:23:07,297 INFO L226 Difference]: Without dead ends: 357 [2018-07-25 13:23:07,300 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-07-25 13:23:07,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-07-25 13:23:07,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2018-07-25 13:23:07,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2018-07-25 13:23:07,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 357 transitions. [2018-07-25 13:23:07,304 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 357 transitions. Word has length 354 [2018-07-25 13:23:07,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:23:07,304 INFO L472 AbstractCegarLoop]: Abstraction has 357 states and 357 transitions. [2018-07-25 13:23:07,304 INFO L473 AbstractCegarLoop]: Interpolant automaton has 178 states. [2018-07-25 13:23:07,304 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 357 transitions. [2018-07-25 13:23:07,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2018-07-25 13:23:07,305 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:23:07,305 INFO L354 BasicCegarLoop]: trace histogram [177, 176, 1, 1, 1] [2018-07-25 13:23:07,305 INFO L415 AbstractCegarLoop]: === Iteration 177 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:23:07,305 INFO L82 PathProgramCache]: Analyzing trace with hash 703990695, now seen corresponding path program 176 times [2018-07-25 13:23:07,306 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:23:07,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:23:08,333 INFO L134 CoverageAnalysis]: Checked inductivity of 31152 backedges. 0 proven. 31152 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:23:08,333 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:23:08,333 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [178] total 178 [2018-07-25 13:23:08,334 INFO L451 AbstractCegarLoop]: Interpolant automaton has 179 states [2018-07-25 13:23:08,336 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 179 interpolants. [2018-07-25 13:23:08,337 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15931, Invalid=15931, Unknown=0, NotChecked=0, Total=31862 [2018-07-25 13:23:08,337 INFO L87 Difference]: Start difference. First operand 357 states and 357 transitions. Second operand 179 states. [2018-07-25 13:23:08,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:23:08,883 INFO L93 Difference]: Finished difference Result 361 states and 361 transitions. [2018-07-25 13:23:08,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2018-07-25 13:23:08,883 INFO L78 Accepts]: Start accepts. Automaton has 179 states. Word has length 356 [2018-07-25 13:23:08,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:23:08,884 INFO L225 Difference]: With dead ends: 361 [2018-07-25 13:23:08,884 INFO L226 Difference]: Without dead ends: 359 [2018-07-25 13:23:08,886 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 13:23:08,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-07-25 13:23:08,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2018-07-25 13:23:08,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-07-25 13:23:08,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 359 transitions. [2018-07-25 13:23:08,890 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 359 transitions. Word has length 356 [2018-07-25 13:23:08,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:23:08,890 INFO L472 AbstractCegarLoop]: Abstraction has 359 states and 359 transitions. [2018-07-25 13:23:08,890 INFO L473 AbstractCegarLoop]: Interpolant automaton has 179 states. [2018-07-25 13:23:08,890 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 359 transitions. [2018-07-25 13:23:08,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2018-07-25 13:23:08,891 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:23:08,891 INFO L354 BasicCegarLoop]: trace histogram [178, 177, 1, 1, 1] [2018-07-25 13:23:08,891 INFO L415 AbstractCegarLoop]: === Iteration 178 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:23:08,891 INFO L82 PathProgramCache]: Analyzing trace with hash -2069722783, now seen corresponding path program 177 times [2018-07-25 13:23:08,892 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:23:09,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:23:09,903 INFO L134 CoverageAnalysis]: Checked inductivity of 31506 backedges. 0 proven. 31506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:23:09,903 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:23:09,903 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [179] total 179 [2018-07-25 13:23:09,904 INFO L451 AbstractCegarLoop]: Interpolant automaton has 180 states [2018-07-25 13:23:09,906 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 180 interpolants. [2018-07-25 13:23:09,907 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-07-25 13:23:09,908 INFO L87 Difference]: Start difference. First operand 359 states and 359 transitions. Second operand 180 states. [2018-07-25 13:23:11,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:23:11,069 INFO L93 Difference]: Finished difference Result 363 states and 363 transitions. [2018-07-25 13:23:11,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2018-07-25 13:23:11,070 INFO L78 Accepts]: Start accepts. Automaton has 180 states. Word has length 358 [2018-07-25 13:23:11,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:23:11,070 INFO L225 Difference]: With dead ends: 363 [2018-07-25 13:23:11,070 INFO L226 Difference]: Without dead ends: 361 [2018-07-25 13:23:11,073 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 13:23:11,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2018-07-25 13:23:11,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2018-07-25 13:23:11,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-07-25 13:23:11,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 361 transitions. [2018-07-25 13:23:11,077 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 361 transitions. Word has length 358 [2018-07-25 13:23:11,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:23:11,078 INFO L472 AbstractCegarLoop]: Abstraction has 361 states and 361 transitions. [2018-07-25 13:23:11,078 INFO L473 AbstractCegarLoop]: Interpolant automaton has 180 states. [2018-07-25 13:23:11,078 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 361 transitions. [2018-07-25 13:23:11,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2018-07-25 13:23:11,079 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:23:11,079 INFO L354 BasicCegarLoop]: trace histogram [179, 178, 1, 1, 1] [2018-07-25 13:23:11,079 INFO L415 AbstractCegarLoop]: === Iteration 179 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:23:11,079 INFO L82 PathProgramCache]: Analyzing trace with hash -433684325, now seen corresponding path program 178 times [2018-07-25 13:23:11,079 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:23:11,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:23:12,108 INFO L134 CoverageAnalysis]: Checked inductivity of 31862 backedges. 0 proven. 31862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:23:12,108 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:23:12,109 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [180] total 180 [2018-07-25 13:23:12,109 INFO L451 AbstractCegarLoop]: Interpolant automaton has 181 states [2018-07-25 13:23:12,112 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 181 interpolants. [2018-07-25 13:23:12,114 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16290, Invalid=16290, Unknown=0, NotChecked=0, Total=32580 [2018-07-25 13:23:12,115 INFO L87 Difference]: Start difference. First operand 361 states and 361 transitions. Second operand 181 states. [2018-07-25 13:23:13,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:23:13,738 INFO L93 Difference]: Finished difference Result 365 states and 365 transitions. [2018-07-25 13:23:13,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2018-07-25 13:23:13,738 INFO L78 Accepts]: Start accepts. Automaton has 181 states. Word has length 360 [2018-07-25 13:23:13,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:23:13,739 INFO L225 Difference]: With dead ends: 365 [2018-07-25 13:23:13,739 INFO L226 Difference]: Without dead ends: 363 [2018-07-25 13:23:13,741 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=16290, Invalid=16290, Unknown=0, NotChecked=0, Total=32580 [2018-07-25 13:23:13,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-07-25 13:23:13,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2018-07-25 13:23:13,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-07-25 13:23:13,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 363 transitions. [2018-07-25 13:23:13,782 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 363 transitions. Word has length 360 [2018-07-25 13:23:13,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:23:13,782 INFO L472 AbstractCegarLoop]: Abstraction has 363 states and 363 transitions. [2018-07-25 13:23:13,782 INFO L473 AbstractCegarLoop]: Interpolant automaton has 181 states. [2018-07-25 13:23:13,782 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 363 transitions. [2018-07-25 13:23:13,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2018-07-25 13:23:13,783 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:23:13,783 INFO L354 BasicCegarLoop]: trace histogram [180, 179, 1, 1, 1] [2018-07-25 13:23:13,783 INFO L415 AbstractCegarLoop]: === Iteration 180 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:23:13,784 INFO L82 PathProgramCache]: Analyzing trace with hash -158756523, now seen corresponding path program 179 times [2018-07-25 13:23:13,784 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:23:13,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:23:14,798 INFO L134 CoverageAnalysis]: Checked inductivity of 32220 backedges. 0 proven. 32220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:23:14,798 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:23:14,798 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [181] total 181 [2018-07-25 13:23:14,799 INFO L451 AbstractCegarLoop]: Interpolant automaton has 182 states [2018-07-25 13:23:14,801 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 182 interpolants. [2018-07-25 13:23:14,803 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-07-25 13:23:14,803 INFO L87 Difference]: Start difference. First operand 363 states and 363 transitions. Second operand 182 states. [2018-07-25 13:23:15,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:23:15,242 INFO L93 Difference]: Finished difference Result 367 states and 367 transitions. [2018-07-25 13:23:15,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2018-07-25 13:23:15,243 INFO L78 Accepts]: Start accepts. Automaton has 182 states. Word has length 362 [2018-07-25 13:23:15,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:23:15,243 INFO L225 Difference]: With dead ends: 367 [2018-07-25 13:23:15,243 INFO L226 Difference]: Without dead ends: 365 [2018-07-25 13:23:15,246 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 13:23:15,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-07-25 13:23:15,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2018-07-25 13:23:15,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-07-25 13:23:15,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 365 transitions. [2018-07-25 13:23:15,250 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 365 transitions. Word has length 362 [2018-07-25 13:23:15,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:23:15,251 INFO L472 AbstractCegarLoop]: Abstraction has 365 states and 365 transitions. [2018-07-25 13:23:15,251 INFO L473 AbstractCegarLoop]: Interpolant automaton has 182 states. [2018-07-25 13:23:15,251 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 365 transitions. [2018-07-25 13:23:15,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2018-07-25 13:23:15,252 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:23:15,252 INFO L354 BasicCegarLoop]: trace histogram [181, 180, 1, 1, 1] [2018-07-25 13:23:15,252 INFO L415 AbstractCegarLoop]: === Iteration 181 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:23:15,252 INFO L82 PathProgramCache]: Analyzing trace with hash 2053856143, now seen corresponding path program 180 times [2018-07-25 13:23:15,252 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:23:15,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:23:16,308 INFO L134 CoverageAnalysis]: Checked inductivity of 32580 backedges. 0 proven. 32580 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:23:16,308 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:23:16,309 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [182] total 182 [2018-07-25 13:23:16,309 INFO L451 AbstractCegarLoop]: Interpolant automaton has 183 states [2018-07-25 13:23:16,312 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 183 interpolants. [2018-07-25 13:23:16,314 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16653, Invalid=16653, Unknown=0, NotChecked=0, Total=33306 [2018-07-25 13:23:16,314 INFO L87 Difference]: Start difference. First operand 365 states and 365 transitions. Second operand 183 states. [2018-07-25 13:23:18,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:23:18,236 INFO L93 Difference]: Finished difference Result 369 states and 369 transitions. [2018-07-25 13:23:18,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2018-07-25 13:23:18,236 INFO L78 Accepts]: Start accepts. Automaton has 183 states. Word has length 364 [2018-07-25 13:23:18,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:23:18,236 INFO L225 Difference]: With dead ends: 369 [2018-07-25 13:23:18,237 INFO L226 Difference]: Without dead ends: 367 [2018-07-25 13:23:18,239 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=16653, Invalid=16653, Unknown=0, NotChecked=0, Total=33306 [2018-07-25 13:23:18,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-07-25 13:23:18,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2018-07-25 13:23:18,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-07-25 13:23:18,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 367 transitions. [2018-07-25 13:23:18,243 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 367 transitions. Word has length 364 [2018-07-25 13:23:18,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:23:18,244 INFO L472 AbstractCegarLoop]: Abstraction has 367 states and 367 transitions. [2018-07-25 13:23:18,244 INFO L473 AbstractCegarLoop]: Interpolant automaton has 183 states. [2018-07-25 13:23:18,244 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 367 transitions. [2018-07-25 13:23:18,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2018-07-25 13:23:18,245 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:23:18,245 INFO L354 BasicCegarLoop]: trace histogram [182, 181, 1, 1, 1] [2018-07-25 13:23:18,245 INFO L415 AbstractCegarLoop]: === Iteration 182 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:23:18,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1929150647, now seen corresponding path program 181 times [2018-07-25 13:23:18,245 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:23:18,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:23:19,334 INFO L134 CoverageAnalysis]: Checked inductivity of 32942 backedges. 0 proven. 32942 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:23:19,335 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:23:19,335 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [183] total 183 [2018-07-25 13:23:19,335 INFO L451 AbstractCegarLoop]: Interpolant automaton has 184 states [2018-07-25 13:23:19,337 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 184 interpolants. [2018-07-25 13:23:19,338 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-07-25 13:23:19,339 INFO L87 Difference]: Start difference. First operand 367 states and 367 transitions. Second operand 184 states. [2018-07-25 13:23:20,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:23:20,000 INFO L93 Difference]: Finished difference Result 371 states and 371 transitions. [2018-07-25 13:23:20,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2018-07-25 13:23:20,000 INFO L78 Accepts]: Start accepts. Automaton has 184 states. Word has length 366 [2018-07-25 13:23:20,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:23:20,001 INFO L225 Difference]: With dead ends: 371 [2018-07-25 13:23:20,001 INFO L226 Difference]: Without dead ends: 369 [2018-07-25 13:23:20,003 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-07-25 13:23:20,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-07-25 13:23:20,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2018-07-25 13:23:20,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-07-25 13:23:20,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 369 transitions. [2018-07-25 13:23:20,007 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 369 transitions. Word has length 366 [2018-07-25 13:23:20,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:23:20,008 INFO L472 AbstractCegarLoop]: Abstraction has 369 states and 369 transitions. [2018-07-25 13:23:20,008 INFO L473 AbstractCegarLoop]: Interpolant automaton has 184 states. [2018-07-25 13:23:20,008 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 369 transitions. [2018-07-25 13:23:20,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2018-07-25 13:23:20,009 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:23:20,009 INFO L354 BasicCegarLoop]: trace histogram [183, 182, 1, 1, 1] [2018-07-25 13:23:20,009 INFO L415 AbstractCegarLoop]: === Iteration 183 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:23:20,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1512152195, now seen corresponding path program 182 times [2018-07-25 13:23:20,009 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:23:20,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:23:21,080 INFO L134 CoverageAnalysis]: Checked inductivity of 33306 backedges. 0 proven. 33306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:23:21,080 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:23:21,080 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [184] total 184 [2018-07-25 13:23:21,081 INFO L451 AbstractCegarLoop]: Interpolant automaton has 185 states [2018-07-25 13:23:21,083 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 185 interpolants. [2018-07-25 13:23:21,086 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17020, Invalid=17020, Unknown=0, NotChecked=0, Total=34040 [2018-07-25 13:23:21,086 INFO L87 Difference]: Start difference. First operand 369 states and 369 transitions. Second operand 185 states. [2018-07-25 13:23:23,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:23:23,080 INFO L93 Difference]: Finished difference Result 373 states and 373 transitions. [2018-07-25 13:23:23,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2018-07-25 13:23:23,081 INFO L78 Accepts]: Start accepts. Automaton has 185 states. Word has length 368 [2018-07-25 13:23:23,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:23:23,081 INFO L225 Difference]: With dead ends: 373 [2018-07-25 13:23:23,081 INFO L226 Difference]: Without dead ends: 371 [2018-07-25 13:23:23,084 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=17020, Invalid=17020, Unknown=0, NotChecked=0, Total=34040 [2018-07-25 13:23:23,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-07-25 13:23:23,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 371. [2018-07-25 13:23:23,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-07-25 13:23:23,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 371 transitions. [2018-07-25 13:23:23,088 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 371 transitions. Word has length 368 [2018-07-25 13:23:23,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:23:23,089 INFO L472 AbstractCegarLoop]: Abstraction has 371 states and 371 transitions. [2018-07-25 13:23:23,089 INFO L473 AbstractCegarLoop]: Interpolant automaton has 185 states. [2018-07-25 13:23:23,089 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 371 transitions. [2018-07-25 13:23:23,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2018-07-25 13:23:23,090 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:23:23,090 INFO L354 BasicCegarLoop]: trace histogram [184, 183, 1, 1, 1] [2018-07-25 13:23:23,090 INFO L415 AbstractCegarLoop]: === Iteration 184 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:23:23,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1479365437, now seen corresponding path program 183 times [2018-07-25 13:23:23,090 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:23:23,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:23:24,202 INFO L134 CoverageAnalysis]: Checked inductivity of 33672 backedges. 0 proven. 33672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:23:24,203 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:23:24,203 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [185] total 185 [2018-07-25 13:23:24,203 INFO L451 AbstractCegarLoop]: Interpolant automaton has 186 states [2018-07-25 13:23:24,204 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 186 interpolants. [2018-07-25 13:23:24,205 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-07-25 13:23:24,205 INFO L87 Difference]: Start difference. First operand 371 states and 371 transitions. Second operand 186 states. [2018-07-25 13:23:24,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:23:24,753 INFO L93 Difference]: Finished difference Result 375 states and 375 transitions. [2018-07-25 13:23:24,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2018-07-25 13:23:24,753 INFO L78 Accepts]: Start accepts. Automaton has 186 states. Word has length 370 [2018-07-25 13:23:24,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:23:24,754 INFO L225 Difference]: With dead ends: 375 [2018-07-25 13:23:24,754 INFO L226 Difference]: Without dead ends: 373 [2018-07-25 13:23:24,755 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 13:23:24,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2018-07-25 13:23:24,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2018-07-25 13:23:24,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-07-25 13:23:24,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 373 transitions. [2018-07-25 13:23:24,759 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 373 transitions. Word has length 370 [2018-07-25 13:23:24,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:23:24,759 INFO L472 AbstractCegarLoop]: Abstraction has 373 states and 373 transitions. [2018-07-25 13:23:24,759 INFO L473 AbstractCegarLoop]: Interpolant automaton has 186 states. [2018-07-25 13:23:24,759 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 373 transitions. [2018-07-25 13:23:24,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2018-07-25 13:23:24,760 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:23:24,760 INFO L354 BasicCegarLoop]: trace histogram [185, 184, 1, 1, 1] [2018-07-25 13:23:24,761 INFO L415 AbstractCegarLoop]: === Iteration 185 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:23:24,761 INFO L82 PathProgramCache]: Analyzing trace with hash 36062071, now seen corresponding path program 184 times [2018-07-25 13:23:24,761 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:23:24,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:23:25,871 INFO L134 CoverageAnalysis]: Checked inductivity of 34040 backedges. 0 proven. 34040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:23:25,871 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:23:25,871 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [186] total 186 [2018-07-25 13:23:25,872 INFO L451 AbstractCegarLoop]: Interpolant automaton has 187 states [2018-07-25 13:23:25,874 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 187 interpolants. [2018-07-25 13:23:25,876 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17391, Invalid=17391, Unknown=0, NotChecked=0, Total=34782 [2018-07-25 13:23:25,877 INFO L87 Difference]: Start difference. First operand 373 states and 373 transitions. Second operand 187 states. [2018-07-25 13:23:27,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:23:27,956 INFO L93 Difference]: Finished difference Result 377 states and 377 transitions. [2018-07-25 13:23:27,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2018-07-25 13:23:27,956 INFO L78 Accepts]: Start accepts. Automaton has 187 states. Word has length 372 [2018-07-25 13:23:27,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:23:27,957 INFO L225 Difference]: With dead ends: 377 [2018-07-25 13:23:27,957 INFO L226 Difference]: Without dead ends: 375 [2018-07-25 13:23:27,960 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=17391, Invalid=17391, Unknown=0, NotChecked=0, Total=34782 [2018-07-25 13:23:27,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-07-25 13:23:27,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 375. [2018-07-25 13:23:27,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-07-25 13:23:27,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 375 transitions. [2018-07-25 13:23:27,964 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 375 transitions. Word has length 372 [2018-07-25 13:23:27,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:23:27,964 INFO L472 AbstractCegarLoop]: Abstraction has 375 states and 375 transitions. [2018-07-25 13:23:27,964 INFO L473 AbstractCegarLoop]: Interpolant automaton has 187 states. [2018-07-25 13:23:27,964 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 375 transitions. [2018-07-25 13:23:27,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2018-07-25 13:23:27,965 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:23:27,965 INFO L354 BasicCegarLoop]: trace histogram [186, 185, 1, 1, 1] [2018-07-25 13:23:27,966 INFO L415 AbstractCegarLoop]: === Iteration 186 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:23:27,966 INFO L82 PathProgramCache]: Analyzing trace with hash 295963953, now seen corresponding path program 185 times [2018-07-25 13:23:27,966 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:23:28,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:23:29,074 INFO L134 CoverageAnalysis]: Checked inductivity of 34410 backedges. 0 proven. 34410 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:23:29,074 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:23:29,074 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [187] total 187 [2018-07-25 13:23:29,074 INFO L451 AbstractCegarLoop]: Interpolant automaton has 188 states [2018-07-25 13:23:29,077 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 188 interpolants. [2018-07-25 13:23:29,079 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-07-25 13:23:29,079 INFO L87 Difference]: Start difference. First operand 375 states and 375 transitions. Second operand 188 states. [2018-07-25 13:23:29,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:23:29,799 INFO L93 Difference]: Finished difference Result 379 states and 379 transitions. [2018-07-25 13:23:29,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 188 states. [2018-07-25 13:23:29,799 INFO L78 Accepts]: Start accepts. Automaton has 188 states. Word has length 374 [2018-07-25 13:23:29,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:23:29,800 INFO L225 Difference]: With dead ends: 379 [2018-07-25 13:23:29,800 INFO L226 Difference]: Without dead ends: 377 [2018-07-25 13:23:29,804 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-07-25 13:23:29,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-07-25 13:23:29,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2018-07-25 13:23:29,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2018-07-25 13:23:29,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 377 transitions. [2018-07-25 13:23:29,808 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 377 transitions. Word has length 374 [2018-07-25 13:23:29,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:23:29,808 INFO L472 AbstractCegarLoop]: Abstraction has 377 states and 377 transitions. [2018-07-25 13:23:29,808 INFO L473 AbstractCegarLoop]: Interpolant automaton has 188 states. [2018-07-25 13:23:29,808 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 377 transitions. [2018-07-25 13:23:29,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2018-07-25 13:23:29,809 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:23:29,810 INFO L354 BasicCegarLoop]: trace histogram [187, 186, 1, 1, 1] [2018-07-25 13:23:29,810 INFO L415 AbstractCegarLoop]: === Iteration 187 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:23:29,810 INFO L82 PathProgramCache]: Analyzing trace with hash 953569387, now seen corresponding path program 186 times [2018-07-25 13:23:29,810 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:23:30,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:23:30,968 INFO L134 CoverageAnalysis]: Checked inductivity of 34782 backedges. 0 proven. 34782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:23:30,968 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:23:30,968 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [188] total 188 [2018-07-25 13:23:30,968 INFO L451 AbstractCegarLoop]: Interpolant automaton has 189 states [2018-07-25 13:23:30,971 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 189 interpolants. [2018-07-25 13:23:30,973 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17766, Invalid=17766, Unknown=0, NotChecked=0, Total=35532 [2018-07-25 13:23:30,974 INFO L87 Difference]: Start difference. First operand 377 states and 377 transitions. Second operand 189 states. [2018-07-25 13:23:32,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:23:32,334 INFO L93 Difference]: Finished difference Result 381 states and 381 transitions. [2018-07-25 13:23:32,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2018-07-25 13:23:32,335 INFO L78 Accepts]: Start accepts. Automaton has 189 states. Word has length 376 [2018-07-25 13:23:32,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:23:32,335 INFO L225 Difference]: With dead ends: 381 [2018-07-25 13:23:32,335 INFO L226 Difference]: Without dead ends: 379 [2018-07-25 13:23:32,339 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=17766, Invalid=17766, Unknown=0, NotChecked=0, Total=35532 [2018-07-25 13:23:32,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-07-25 13:23:32,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2018-07-25 13:23:32,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-07-25 13:23:32,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 379 transitions. [2018-07-25 13:23:32,343 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 379 transitions. Word has length 376 [2018-07-25 13:23:32,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:23:32,343 INFO L472 AbstractCegarLoop]: Abstraction has 379 states and 379 transitions. [2018-07-25 13:23:32,343 INFO L473 AbstractCegarLoop]: Interpolant automaton has 189 states. [2018-07-25 13:23:32,343 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 379 transitions. [2018-07-25 13:23:32,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2018-07-25 13:23:32,344 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:23:32,344 INFO L354 BasicCegarLoop]: trace histogram [188, 187, 1, 1, 1] [2018-07-25 13:23:32,345 INFO L415 AbstractCegarLoop]: === Iteration 188 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:23:32,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1552198949, now seen corresponding path program 187 times [2018-07-25 13:23:32,345 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:23:32,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:23:33,546 INFO L134 CoverageAnalysis]: Checked inductivity of 35156 backedges. 0 proven. 35156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:23:33,546 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:23:33,546 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [189] total 189 [2018-07-25 13:23:33,546 INFO L451 AbstractCegarLoop]: Interpolant automaton has 190 states [2018-07-25 13:23:33,549 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 190 interpolants. [2018-07-25 13:23:33,552 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-07-25 13:23:33,552 INFO L87 Difference]: Start difference. First operand 379 states and 379 transitions. Second operand 190 states. [2018-07-25 13:23:35,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:23:35,790 INFO L93 Difference]: Finished difference Result 383 states and 383 transitions. [2018-07-25 13:23:35,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2018-07-25 13:23:35,790 INFO L78 Accepts]: Start accepts. Automaton has 190 states. Word has length 378 [2018-07-25 13:23:35,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:23:35,791 INFO L225 Difference]: With dead ends: 383 [2018-07-25 13:23:35,791 INFO L226 Difference]: Without dead ends: 381 [2018-07-25 13:23:35,794 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-07-25 13:23:35,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-07-25 13:23:35,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2018-07-25 13:23:35,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-07-25 13:23:35,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 381 transitions. [2018-07-25 13:23:35,798 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 381 transitions. Word has length 378 [2018-07-25 13:23:35,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:23:35,798 INFO L472 AbstractCegarLoop]: Abstraction has 381 states and 381 transitions. [2018-07-25 13:23:35,798 INFO L473 AbstractCegarLoop]: Interpolant automaton has 190 states. [2018-07-25 13:23:35,798 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 381 transitions. [2018-07-25 13:23:35,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2018-07-25 13:23:35,800 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:23:35,800 INFO L354 BasicCegarLoop]: trace histogram [189, 188, 1, 1, 1] [2018-07-25 13:23:35,800 INFO L415 AbstractCegarLoop]: === Iteration 189 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:23:35,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1309590367, now seen corresponding path program 188 times [2018-07-25 13:23:35,800 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:23:35,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:23:36,981 INFO L134 CoverageAnalysis]: Checked inductivity of 35532 backedges. 0 proven. 35532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:23:36,981 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:23:36,981 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [190] total 190 [2018-07-25 13:23:36,982 INFO L451 AbstractCegarLoop]: Interpolant automaton has 191 states [2018-07-25 13:23:36,984 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 191 interpolants. [2018-07-25 13:23:36,986 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18145, Invalid=18145, Unknown=0, NotChecked=0, Total=36290 [2018-07-25 13:23:36,986 INFO L87 Difference]: Start difference. First operand 381 states and 381 transitions. Second operand 191 states. [2018-07-25 13:23:37,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:23:37,893 INFO L93 Difference]: Finished difference Result 385 states and 385 transitions. [2018-07-25 13:23:37,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 191 states. [2018-07-25 13:23:37,893 INFO L78 Accepts]: Start accepts. Automaton has 191 states. Word has length 380 [2018-07-25 13:23:37,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:23:37,894 INFO L225 Difference]: With dead ends: 385 [2018-07-25 13:23:37,894 INFO L226 Difference]: Without dead ends: 383 [2018-07-25 13:23:37,897 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=18145, Invalid=18145, Unknown=0, NotChecked=0, Total=36290 [2018-07-25 13:23:37,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-07-25 13:23:37,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 383. [2018-07-25 13:23:37,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-07-25 13:23:37,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 383 transitions. [2018-07-25 13:23:37,901 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 383 transitions. Word has length 380 [2018-07-25 13:23:37,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:23:37,901 INFO L472 AbstractCegarLoop]: Abstraction has 383 states and 383 transitions. [2018-07-25 13:23:37,901 INFO L473 AbstractCegarLoop]: Interpolant automaton has 191 states. [2018-07-25 13:23:37,901 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 383 transitions. [2018-07-25 13:23:37,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2018-07-25 13:23:37,902 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:23:37,903 INFO L354 BasicCegarLoop]: trace histogram [190, 189, 1, 1, 1] [2018-07-25 13:23:37,903 INFO L415 AbstractCegarLoop]: === Iteration 190 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:23:37,903 INFO L82 PathProgramCache]: Analyzing trace with hash 90977049, now seen corresponding path program 189 times [2018-07-25 13:23:37,903 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:23:38,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:23:39,065 INFO L134 CoverageAnalysis]: Checked inductivity of 35910 backedges. 0 proven. 35910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:23:39,065 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:23:39,065 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [191] total 191 [2018-07-25 13:23:39,065 INFO L451 AbstractCegarLoop]: Interpolant automaton has 192 states [2018-07-25 13:23:39,068 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2018-07-25 13:23:39,069 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-07-25 13:23:39,069 INFO L87 Difference]: Start difference. First operand 383 states and 383 transitions. Second operand 192 states. [2018-07-25 13:23:39,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:23:39,705 INFO L93 Difference]: Finished difference Result 387 states and 387 transitions. [2018-07-25 13:23:39,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2018-07-25 13:23:39,705 INFO L78 Accepts]: Start accepts. Automaton has 192 states. Word has length 382 [2018-07-25 13:23:39,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:23:39,706 INFO L225 Difference]: With dead ends: 387 [2018-07-25 13:23:39,706 INFO L226 Difference]: Without dead ends: 385 [2018-07-25 13:23:39,708 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-07-25 13:23:39,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2018-07-25 13:23:39,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2018-07-25 13:23:39,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-07-25 13:23:39,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 385 transitions. [2018-07-25 13:23:39,711 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 385 transitions. Word has length 382 [2018-07-25 13:23:39,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:23:39,712 INFO L472 AbstractCegarLoop]: Abstraction has 385 states and 385 transitions. [2018-07-25 13:23:39,712 INFO L473 AbstractCegarLoop]: Interpolant automaton has 192 states. [2018-07-25 13:23:39,712 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 385 transitions. [2018-07-25 13:23:39,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2018-07-25 13:23:39,713 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:23:39,713 INFO L354 BasicCegarLoop]: trace histogram [191, 190, 1, 1, 1] [2018-07-25 13:23:39,713 INFO L415 AbstractCegarLoop]: === Iteration 191 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:23:39,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1529650259, now seen corresponding path program 190 times [2018-07-25 13:23:39,713 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:23:39,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:23:40,866 INFO L134 CoverageAnalysis]: Checked inductivity of 36290 backedges. 0 proven. 36290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:23:40,866 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:23:40,866 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [192] total 192 [2018-07-25 13:23:40,867 INFO L451 AbstractCegarLoop]: Interpolant automaton has 193 states [2018-07-25 13:23:40,868 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 193 interpolants. [2018-07-25 13:23:40,870 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18528, Invalid=18528, Unknown=0, NotChecked=0, Total=37056 [2018-07-25 13:23:40,870 INFO L87 Difference]: Start difference. First operand 385 states and 385 transitions. Second operand 193 states. [2018-07-25 13:23:42,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:23:42,717 INFO L93 Difference]: Finished difference Result 389 states and 389 transitions. [2018-07-25 13:23:42,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 193 states. [2018-07-25 13:23:42,717 INFO L78 Accepts]: Start accepts. Automaton has 193 states. Word has length 384 [2018-07-25 13:23:42,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:23:42,718 INFO L225 Difference]: With dead ends: 389 [2018-07-25 13:23:42,718 INFO L226 Difference]: Without dead ends: 387 [2018-07-25 13:23:42,720 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=18528, Invalid=18528, Unknown=0, NotChecked=0, Total=37056 [2018-07-25 13:23:42,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-07-25 13:23:42,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 387. [2018-07-25 13:23:42,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-07-25 13:23:42,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 387 transitions. [2018-07-25 13:23:42,723 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 387 transitions. Word has length 384 [2018-07-25 13:23:42,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:23:42,724 INFO L472 AbstractCegarLoop]: Abstraction has 387 states and 387 transitions. [2018-07-25 13:23:42,724 INFO L473 AbstractCegarLoop]: Interpolant automaton has 193 states. [2018-07-25 13:23:42,724 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 387 transitions. [2018-07-25 13:23:42,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2018-07-25 13:23:42,726 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:23:42,726 INFO L354 BasicCegarLoop]: trace histogram [192, 191, 1, 1, 1] [2018-07-25 13:23:42,726 INFO L415 AbstractCegarLoop]: === Iteration 192 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:23:42,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1115135757, now seen corresponding path program 191 times [2018-07-25 13:23:42,726 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:23:42,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:23:43,934 INFO L134 CoverageAnalysis]: Checked inductivity of 36672 backedges. 0 proven. 36672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:23:43,934 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:23:43,934 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [193] total 193 [2018-07-25 13:23:43,935 INFO L451 AbstractCegarLoop]: Interpolant automaton has 194 states [2018-07-25 13:23:43,938 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 194 interpolants. [2018-07-25 13:23:43,941 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-07-25 13:23:43,941 INFO L87 Difference]: Start difference. First operand 387 states and 387 transitions. Second operand 194 states. [2018-07-25 13:23:46,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:23:46,299 INFO L93 Difference]: Finished difference Result 391 states and 391 transitions. [2018-07-25 13:23:46,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 194 states. [2018-07-25 13:23:46,299 INFO L78 Accepts]: Start accepts. Automaton has 194 states. Word has length 386 [2018-07-25 13:23:46,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:23:46,300 INFO L225 Difference]: With dead ends: 391 [2018-07-25 13:23:46,300 INFO L226 Difference]: Without dead ends: 389 [2018-07-25 13:23:46,305 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 13:23:46,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-07-25 13:23:46,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 389. [2018-07-25 13:23:46,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2018-07-25 13:23:46,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 389 transitions. [2018-07-25 13:23:46,310 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 389 transitions. Word has length 386 [2018-07-25 13:23:46,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:23:46,311 INFO L472 AbstractCegarLoop]: Abstraction has 389 states and 389 transitions. [2018-07-25 13:23:46,311 INFO L473 AbstractCegarLoop]: Interpolant automaton has 194 states. [2018-07-25 13:23:46,311 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 389 transitions. [2018-07-25 13:23:46,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2018-07-25 13:23:46,313 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:23:46,313 INFO L354 BasicCegarLoop]: trace histogram [193, 192, 1, 1, 1] [2018-07-25 13:23:46,313 INFO L415 AbstractCegarLoop]: === Iteration 193 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:23:46,313 INFO L82 PathProgramCache]: Analyzing trace with hash -2096309433, now seen corresponding path program 192 times [2018-07-25 13:23:46,313 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:23:46,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:23:47,509 INFO L134 CoverageAnalysis]: Checked inductivity of 37056 backedges. 0 proven. 37056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:23:47,509 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:23:47,510 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [194] total 194 [2018-07-25 13:23:47,510 INFO L451 AbstractCegarLoop]: Interpolant automaton has 195 states [2018-07-25 13:23:47,511 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 195 interpolants. [2018-07-25 13:23:47,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18915, Invalid=18915, Unknown=0, NotChecked=0, Total=37830 [2018-07-25 13:23:47,513 INFO L87 Difference]: Start difference. First operand 389 states and 389 transitions. Second operand 195 states. [2018-07-25 13:23:49,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:23:49,215 INFO L93 Difference]: Finished difference Result 393 states and 393 transitions. [2018-07-25 13:23:49,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2018-07-25 13:23:49,216 INFO L78 Accepts]: Start accepts. Automaton has 195 states. Word has length 388 [2018-07-25 13:23:49,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:23:49,216 INFO L225 Difference]: With dead ends: 393 [2018-07-25 13:23:49,217 INFO L226 Difference]: Without dead ends: 391 [2018-07-25 13:23:49,218 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=18915, Invalid=18915, Unknown=0, NotChecked=0, Total=37830 [2018-07-25 13:23:49,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2018-07-25 13:23:49,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2018-07-25 13:23:49,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-07-25 13:23:49,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 391 transitions. [2018-07-25 13:23:49,223 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 391 transitions. Word has length 388 [2018-07-25 13:23:49,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:23:49,223 INFO L472 AbstractCegarLoop]: Abstraction has 391 states and 391 transitions. [2018-07-25 13:23:49,223 INFO L473 AbstractCegarLoop]: Interpolant automaton has 195 states. [2018-07-25 13:23:49,223 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 391 transitions. [2018-07-25 13:23:49,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2018-07-25 13:23:49,225 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:23:49,225 INFO L354 BasicCegarLoop]: trace histogram [194, 193, 1, 1, 1] [2018-07-25 13:23:49,225 INFO L415 AbstractCegarLoop]: === Iteration 194 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:23:49,225 INFO L82 PathProgramCache]: Analyzing trace with hash -213651199, now seen corresponding path program 193 times [2018-07-25 13:23:49,225 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:23:49,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:23:50,515 INFO L134 CoverageAnalysis]: Checked inductivity of 37442 backedges. 0 proven. 37442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:23:50,515 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:23:50,515 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [195] total 195 [2018-07-25 13:23:50,515 INFO L451 AbstractCegarLoop]: Interpolant automaton has 196 states [2018-07-25 13:23:50,518 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 196 interpolants. [2018-07-25 13:23:50,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-07-25 13:23:50,520 INFO L87 Difference]: Start difference. First operand 391 states and 391 transitions. Second operand 196 states. [2018-07-25 13:23:51,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:23:51,906 INFO L93 Difference]: Finished difference Result 395 states and 395 transitions. [2018-07-25 13:23:51,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 196 states. [2018-07-25 13:23:51,906 INFO L78 Accepts]: Start accepts. Automaton has 196 states. Word has length 390 [2018-07-25 13:23:51,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:23:51,907 INFO L225 Difference]: With dead ends: 395 [2018-07-25 13:23:51,907 INFO L226 Difference]: Without dead ends: 393 [2018-07-25 13:23:51,911 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-07-25 13:23:51,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-07-25 13:23:51,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2018-07-25 13:23:51,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-07-25 13:23:51,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 393 transitions. [2018-07-25 13:23:51,915 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 393 transitions. Word has length 390 [2018-07-25 13:23:51,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:23:51,915 INFO L472 AbstractCegarLoop]: Abstraction has 393 states and 393 transitions. [2018-07-25 13:23:51,916 INFO L473 AbstractCegarLoop]: Interpolant automaton has 196 states. [2018-07-25 13:23:51,916 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 393 transitions. [2018-07-25 13:23:51,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2018-07-25 13:23:51,917 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:23:51,917 INFO L354 BasicCegarLoop]: trace histogram [195, 194, 1, 1, 1] [2018-07-25 13:23:51,917 INFO L415 AbstractCegarLoop]: === Iteration 195 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:23:51,917 INFO L82 PathProgramCache]: Analyzing trace with hash 839680059, now seen corresponding path program 194 times [2018-07-25 13:23:51,917 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:23:52,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:23:53,376 INFO L134 CoverageAnalysis]: Checked inductivity of 37830 backedges. 0 proven. 37830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:23:53,377 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:23:53,377 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [196] total 196 [2018-07-25 13:23:53,377 INFO L451 AbstractCegarLoop]: Interpolant automaton has 197 states [2018-07-25 13:23:53,379 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 197 interpolants. [2018-07-25 13:23:53,380 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19306, Invalid=19306, Unknown=0, NotChecked=0, Total=38612 [2018-07-25 13:23:53,380 INFO L87 Difference]: Start difference. First operand 393 states and 393 transitions. Second operand 197 states. [2018-07-25 13:23:54,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:23:54,346 INFO L93 Difference]: Finished difference Result 397 states and 397 transitions. [2018-07-25 13:23:54,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 197 states. [2018-07-25 13:23:54,346 INFO L78 Accepts]: Start accepts. Automaton has 197 states. Word has length 392 [2018-07-25 13:23:54,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:23:54,347 INFO L225 Difference]: With dead ends: 397 [2018-07-25 13:23:54,347 INFO L226 Difference]: Without dead ends: 395 [2018-07-25 13:23:54,348 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=19306, Invalid=19306, Unknown=0, NotChecked=0, Total=38612 [2018-07-25 13:23:54,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-07-25 13:23:54,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2018-07-25 13:23:54,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-07-25 13:23:54,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 395 transitions. [2018-07-25 13:23:54,351 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 395 transitions. Word has length 392 [2018-07-25 13:23:54,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:23:54,352 INFO L472 AbstractCegarLoop]: Abstraction has 395 states and 395 transitions. [2018-07-25 13:23:54,352 INFO L473 AbstractCegarLoop]: Interpolant automaton has 197 states. [2018-07-25 13:23:54,352 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 395 transitions. [2018-07-25 13:23:54,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2018-07-25 13:23:54,353 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:23:54,353 INFO L354 BasicCegarLoop]: trace histogram [196, 195, 1, 1, 1] [2018-07-25 13:23:54,353 INFO L415 AbstractCegarLoop]: === Iteration 196 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:23:54,353 INFO L82 PathProgramCache]: Analyzing trace with hash -521262859, now seen corresponding path program 195 times [2018-07-25 13:23:54,353 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:23:54,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:23:55,674 INFO L134 CoverageAnalysis]: Checked inductivity of 38220 backedges. 0 proven. 38220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:23:55,674 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:23:55,675 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [197] total 197 [2018-07-25 13:23:55,675 INFO L451 AbstractCegarLoop]: Interpolant automaton has 198 states [2018-07-25 13:23:55,678 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 198 interpolants. [2018-07-25 13:23:55,680 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-07-25 13:23:55,680 INFO L87 Difference]: Start difference. First operand 395 states and 395 transitions. Second operand 198 states. [2018-07-25 13:23:56,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:23:56,614 INFO L93 Difference]: Finished difference Result 399 states and 399 transitions. [2018-07-25 13:23:56,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2018-07-25 13:23:56,614 INFO L78 Accepts]: Start accepts. Automaton has 198 states. Word has length 394 [2018-07-25 13:23:56,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:23:56,615 INFO L225 Difference]: With dead ends: 399 [2018-07-25 13:23:56,615 INFO L226 Difference]: Without dead ends: 397 [2018-07-25 13:23:56,617 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-07-25 13:23:56,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-07-25 13:23:56,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2018-07-25 13:23:56,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-07-25 13:23:56,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 397 transitions. [2018-07-25 13:23:56,621 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 397 transitions. Word has length 394 [2018-07-25 13:23:56,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:23:56,621 INFO L472 AbstractCegarLoop]: Abstraction has 397 states and 397 transitions. [2018-07-25 13:23:56,621 INFO L473 AbstractCegarLoop]: Interpolant automaton has 198 states. [2018-07-25 13:23:56,621 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 397 transitions. [2018-07-25 13:23:56,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2018-07-25 13:23:56,622 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:23:56,622 INFO L354 BasicCegarLoop]: trace histogram [197, 196, 1, 1, 1] [2018-07-25 13:23:56,622 INFO L415 AbstractCegarLoop]: === Iteration 197 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:23:56,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1577618223, now seen corresponding path program 196 times [2018-07-25 13:23:56,623 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:23:56,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:23:57,935 INFO L134 CoverageAnalysis]: Checked inductivity of 38612 backedges. 0 proven. 38612 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:23:57,935 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:23:57,935 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [198] total 198 [2018-07-25 13:23:57,936 INFO L451 AbstractCegarLoop]: Interpolant automaton has 199 states [2018-07-25 13:23:57,937 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 199 interpolants. [2018-07-25 13:23:57,938 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19701, Invalid=19701, Unknown=0, NotChecked=0, Total=39402 [2018-07-25 13:23:57,938 INFO L87 Difference]: Start difference. First operand 397 states and 397 transitions. Second operand 199 states. [2018-07-25 13:23:58,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:23:58,675 INFO L93 Difference]: Finished difference Result 401 states and 401 transitions. [2018-07-25 13:23:58,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 199 states. [2018-07-25 13:23:58,675 INFO L78 Accepts]: Start accepts. Automaton has 199 states. Word has length 396 [2018-07-25 13:23:58,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:23:58,676 INFO L225 Difference]: With dead ends: 401 [2018-07-25 13:23:58,676 INFO L226 Difference]: Without dead ends: 399 [2018-07-25 13:23:58,677 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 13:23:58,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-07-25 13:23:58,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2018-07-25 13:23:58,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-07-25 13:23:58,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 399 transitions. [2018-07-25 13:23:58,681 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 399 transitions. Word has length 396 [2018-07-25 13:23:58,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:23:58,681 INFO L472 AbstractCegarLoop]: Abstraction has 399 states and 399 transitions. [2018-07-25 13:23:58,681 INFO L473 AbstractCegarLoop]: Interpolant automaton has 199 states. [2018-07-25 13:23:58,681 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 399 transitions. [2018-07-25 13:23:58,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2018-07-25 13:23:58,682 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:23:58,682 INFO L354 BasicCegarLoop]: trace histogram [198, 197, 1, 1, 1] [2018-07-25 13:23:58,682 INFO L415 AbstractCegarLoop]: === Iteration 198 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:23:58,683 INFO L82 PathProgramCache]: Analyzing trace with hash -32291095, now seen corresponding path program 197 times [2018-07-25 13:23:58,683 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:23:58,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:23:59,920 INFO L134 CoverageAnalysis]: Checked inductivity of 39006 backedges. 0 proven. 39006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:23:59,920 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:23:59,920 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [199] total 199 [2018-07-25 13:23:59,921 INFO L451 AbstractCegarLoop]: Interpolant automaton has 200 states [2018-07-25 13:23:59,924 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 200 interpolants. [2018-07-25 13:23:59,926 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-07-25 13:23:59,927 INFO L87 Difference]: Start difference. First operand 399 states and 399 transitions. Second operand 200 states. [2018-07-25 13:24:00,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:00,815 INFO L93 Difference]: Finished difference Result 403 states and 403 transitions. [2018-07-25 13:24:00,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2018-07-25 13:24:00,815 INFO L78 Accepts]: Start accepts. Automaton has 200 states. Word has length 398 [2018-07-25 13:24:00,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:00,816 INFO L225 Difference]: With dead ends: 403 [2018-07-25 13:24:00,816 INFO L226 Difference]: Without dead ends: 401 [2018-07-25 13:24:00,818 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 13:24:00,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2018-07-25 13:24:00,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 401. [2018-07-25 13:24:00,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-07-25 13:24:00,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 401 transitions. [2018-07-25 13:24:00,822 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 401 transitions. Word has length 398 [2018-07-25 13:24:00,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:00,822 INFO L472 AbstractCegarLoop]: Abstraction has 401 states and 401 transitions. [2018-07-25 13:24:00,822 INFO L473 AbstractCegarLoop]: Interpolant automaton has 200 states. [2018-07-25 13:24:00,822 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 401 transitions. [2018-07-25 13:24:00,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2018-07-25 13:24:00,823 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:00,824 INFO L354 BasicCegarLoop]: trace histogram [199, 198, 1, 1, 1] [2018-07-25 13:24:00,824 INFO L415 AbstractCegarLoop]: === Iteration 199 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:00,824 INFO L82 PathProgramCache]: Analyzing trace with hash -966919133, now seen corresponding path program 198 times [2018-07-25 13:24:00,824 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:01,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:02,131 INFO L134 CoverageAnalysis]: Checked inductivity of 39402 backedges. 0 proven. 39402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:02,131 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:02,131 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [200] total 200 [2018-07-25 13:24:02,132 INFO L451 AbstractCegarLoop]: Interpolant automaton has 201 states [2018-07-25 13:24:02,133 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 201 interpolants. [2018-07-25 13:24:02,134 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20100, Invalid=20100, Unknown=0, NotChecked=0, Total=40200 [2018-07-25 13:24:02,134 INFO L87 Difference]: Start difference. First operand 401 states and 401 transitions. Second operand 201 states. [2018-07-25 13:24:03,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:03,248 INFO L93 Difference]: Finished difference Result 405 states and 405 transitions. [2018-07-25 13:24:03,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2018-07-25 13:24:03,248 INFO L78 Accepts]: Start accepts. Automaton has 201 states. Word has length 400 [2018-07-25 13:24:03,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:03,249 INFO L225 Difference]: With dead ends: 405 [2018-07-25 13:24:03,249 INFO L226 Difference]: Without dead ends: 403 [2018-07-25 13:24:03,250 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=20100, Invalid=20100, Unknown=0, NotChecked=0, Total=40200 [2018-07-25 13:24:03,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-07-25 13:24:03,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2018-07-25 13:24:03,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-07-25 13:24:03,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 403 transitions. [2018-07-25 13:24:03,254 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 403 transitions. Word has length 400 [2018-07-25 13:24:03,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:03,254 INFO L472 AbstractCegarLoop]: Abstraction has 403 states and 403 transitions. [2018-07-25 13:24:03,254 INFO L473 AbstractCegarLoop]: Interpolant automaton has 201 states. [2018-07-25 13:24:03,254 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 403 transitions. [2018-07-25 13:24:03,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2018-07-25 13:24:03,255 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:03,256 INFO L354 BasicCegarLoop]: trace histogram [200, 199, 1, 1, 1] [2018-07-25 13:24:03,256 INFO L415 AbstractCegarLoop]: === Iteration 200 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:03,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1496298787, now seen corresponding path program 199 times [2018-07-25 13:24:03,256 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:03,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:04,657 INFO L134 CoverageAnalysis]: Checked inductivity of 39800 backedges. 0 proven. 39800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:04,657 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:04,657 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [201] total 201 [2018-07-25 13:24:04,657 INFO L451 AbstractCegarLoop]: Interpolant automaton has 202 states [2018-07-25 13:24:04,660 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 202 interpolants. [2018-07-25 13:24:04,664 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-07-25 13:24:04,664 INFO L87 Difference]: Start difference. First operand 403 states and 403 transitions. Second operand 202 states. [2018-07-25 13:24:06,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:06,790 INFO L93 Difference]: Finished difference Result 407 states and 407 transitions. [2018-07-25 13:24:06,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2018-07-25 13:24:06,790 INFO L78 Accepts]: Start accepts. Automaton has 202 states. Word has length 402 [2018-07-25 13:24:06,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:06,791 INFO L225 Difference]: With dead ends: 407 [2018-07-25 13:24:06,791 INFO L226 Difference]: Without dead ends: 405 [2018-07-25 13:24:06,796 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-07-25 13:24:06,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2018-07-25 13:24:06,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 405. [2018-07-25 13:24:06,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-07-25 13:24:06,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 405 transitions. [2018-07-25 13:24:06,800 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 405 transitions. Word has length 402 [2018-07-25 13:24:06,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:06,800 INFO L472 AbstractCegarLoop]: Abstraction has 405 states and 405 transitions. [2018-07-25 13:24:06,800 INFO L473 AbstractCegarLoop]: Interpolant automaton has 202 states. [2018-07-25 13:24:06,801 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 405 transitions. [2018-07-25 13:24:06,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2018-07-25 13:24:06,802 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:06,802 INFO L354 BasicCegarLoop]: trace histogram [201, 200, 1, 1, 1] [2018-07-25 13:24:06,802 INFO L415 AbstractCegarLoop]: === Iteration 201 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:06,802 INFO L82 PathProgramCache]: Analyzing trace with hash 870961943, now seen corresponding path program 200 times [2018-07-25 13:24:06,802 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:07,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:08,323 INFO L134 CoverageAnalysis]: Checked inductivity of 40200 backedges. 0 proven. 40200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:08,323 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:08,323 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [202] total 202 [2018-07-25 13:24:08,323 INFO L451 AbstractCegarLoop]: Interpolant automaton has 203 states [2018-07-25 13:24:08,325 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 203 interpolants. [2018-07-25 13:24:08,325 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20503, Invalid=20503, Unknown=0, NotChecked=0, Total=41006 [2018-07-25 13:24:08,326 INFO L87 Difference]: Start difference. First operand 405 states and 405 transitions. Second operand 203 states. [2018-07-25 13:24:10,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:10,781 INFO L93 Difference]: Finished difference Result 409 states and 409 transitions. [2018-07-25 13:24:10,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 203 states. [2018-07-25 13:24:10,781 INFO L78 Accepts]: Start accepts. Automaton has 203 states. Word has length 404 [2018-07-25 13:24:10,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:10,782 INFO L225 Difference]: With dead ends: 409 [2018-07-25 13:24:10,782 INFO L226 Difference]: Without dead ends: 407 [2018-07-25 13:24:10,783 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=20503, Invalid=20503, Unknown=0, NotChecked=0, Total=41006 [2018-07-25 13:24:10,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2018-07-25 13:24:10,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 407. [2018-07-25 13:24:10,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2018-07-25 13:24:10,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 407 transitions. [2018-07-25 13:24:10,787 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 407 transitions. Word has length 404 [2018-07-25 13:24:10,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:10,787 INFO L472 AbstractCegarLoop]: Abstraction has 407 states and 407 transitions. [2018-07-25 13:24:10,787 INFO L473 AbstractCegarLoop]: Interpolant automaton has 203 states. [2018-07-25 13:24:10,788 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 407 transitions. [2018-07-25 13:24:10,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2018-07-25 13:24:10,789 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:10,789 INFO L354 BasicCegarLoop]: trace histogram [202, 201, 1, 1, 1] [2018-07-25 13:24:10,790 INFO L415 AbstractCegarLoop]: === Iteration 202 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:10,790 INFO L82 PathProgramCache]: Analyzing trace with hash -524143407, now seen corresponding path program 201 times [2018-07-25 13:24:10,790 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:11,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:12,250 INFO L134 CoverageAnalysis]: Checked inductivity of 40602 backedges. 0 proven. 40602 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:12,250 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:12,250 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [203] total 203 [2018-07-25 13:24:12,250 INFO L451 AbstractCegarLoop]: Interpolant automaton has 204 states [2018-07-25 13:24:12,254 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 204 interpolants. [2018-07-25 13:24:12,257 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-07-25 13:24:12,257 INFO L87 Difference]: Start difference. First operand 407 states and 407 transitions. Second operand 204 states. [2018-07-25 13:24:14,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:14,812 INFO L93 Difference]: Finished difference Result 411 states and 411 transitions. [2018-07-25 13:24:14,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 204 states. [2018-07-25 13:24:14,813 INFO L78 Accepts]: Start accepts. Automaton has 204 states. Word has length 406 [2018-07-25 13:24:14,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:14,814 INFO L225 Difference]: With dead ends: 411 [2018-07-25 13:24:14,814 INFO L226 Difference]: Without dead ends: 409 [2018-07-25 13:24:14,818 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-07-25 13:24:14,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2018-07-25 13:24:14,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 409. [2018-07-25 13:24:14,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-07-25 13:24:14,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 409 transitions. [2018-07-25 13:24:14,822 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 409 transitions. Word has length 406 [2018-07-25 13:24:14,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:14,822 INFO L472 AbstractCegarLoop]: Abstraction has 409 states and 409 transitions. [2018-07-25 13:24:14,822 INFO L473 AbstractCegarLoop]: Interpolant automaton has 204 states. [2018-07-25 13:24:14,823 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 409 transitions. [2018-07-25 13:24:14,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2018-07-25 13:24:14,824 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:14,824 INFO L354 BasicCegarLoop]: trace histogram [203, 202, 1, 1, 1] [2018-07-25 13:24:14,824 INFO L415 AbstractCegarLoop]: === Iteration 203 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:14,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1190588405, now seen corresponding path program 202 times [2018-07-25 13:24:14,824 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:15,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:16,252 INFO L134 CoverageAnalysis]: Checked inductivity of 41006 backedges. 0 proven. 41006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:16,253 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:16,253 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [204] total 204 [2018-07-25 13:24:16,253 INFO L451 AbstractCegarLoop]: Interpolant automaton has 205 states [2018-07-25 13:24:16,254 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 205 interpolants. [2018-07-25 13:24:16,255 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20910, Invalid=20910, Unknown=0, NotChecked=0, Total=41820 [2018-07-25 13:24:16,256 INFO L87 Difference]: Start difference. First operand 409 states and 409 transitions. Second operand 205 states. [2018-07-25 13:24:17,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:17,370 INFO L93 Difference]: Finished difference Result 413 states and 413 transitions. [2018-07-25 13:24:17,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 205 states. [2018-07-25 13:24:17,370 INFO L78 Accepts]: Start accepts. Automaton has 205 states. Word has length 408 [2018-07-25 13:24:17,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:17,371 INFO L225 Difference]: With dead ends: 413 [2018-07-25 13:24:17,371 INFO L226 Difference]: Without dead ends: 411 [2018-07-25 13:24:17,372 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=20910, Invalid=20910, Unknown=0, NotChecked=0, Total=41820 [2018-07-25 13:24:17,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-07-25 13:24:17,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2018-07-25 13:24:17,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-07-25 13:24:17,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 411 transitions. [2018-07-25 13:24:17,376 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 411 transitions. Word has length 408 [2018-07-25 13:24:17,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:17,377 INFO L472 AbstractCegarLoop]: Abstraction has 411 states and 411 transitions. [2018-07-25 13:24:17,377 INFO L473 AbstractCegarLoop]: Interpolant automaton has 205 states. [2018-07-25 13:24:17,377 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 411 transitions. [2018-07-25 13:24:17,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2018-07-25 13:24:17,378 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:17,378 INFO L354 BasicCegarLoop]: trace histogram [204, 203, 1, 1, 1] [2018-07-25 13:24:17,378 INFO L415 AbstractCegarLoop]: === Iteration 204 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:17,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1694104379, now seen corresponding path program 203 times [2018-07-25 13:24:17,379 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:17,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:18,832 INFO L134 CoverageAnalysis]: Checked inductivity of 41412 backedges. 0 proven. 41412 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:18,832 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:18,832 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [205] total 205 [2018-07-25 13:24:18,833 INFO L451 AbstractCegarLoop]: Interpolant automaton has 206 states [2018-07-25 13:24:18,836 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 206 interpolants. [2018-07-25 13:24:18,839 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-07-25 13:24:18,839 INFO L87 Difference]: Start difference. First operand 411 states and 411 transitions. Second operand 206 states. [2018-07-25 13:24:19,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:19,884 INFO L93 Difference]: Finished difference Result 415 states and 415 transitions. [2018-07-25 13:24:19,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 206 states. [2018-07-25 13:24:19,884 INFO L78 Accepts]: Start accepts. Automaton has 206 states. Word has length 410 [2018-07-25 13:24:19,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:19,885 INFO L225 Difference]: With dead ends: 415 [2018-07-25 13:24:19,885 INFO L226 Difference]: Without dead ends: 413 [2018-07-25 13:24:19,888 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-07-25 13:24:19,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2018-07-25 13:24:19,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2018-07-25 13:24:19,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2018-07-25 13:24:19,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 413 transitions. [2018-07-25 13:24:19,892 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 413 transitions. Word has length 410 [2018-07-25 13:24:19,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:19,892 INFO L472 AbstractCegarLoop]: Abstraction has 413 states and 413 transitions. [2018-07-25 13:24:19,892 INFO L473 AbstractCegarLoop]: Interpolant automaton has 206 states. [2018-07-25 13:24:19,892 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 413 transitions. [2018-07-25 13:24:19,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2018-07-25 13:24:19,894 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:19,894 INFO L354 BasicCegarLoop]: trace histogram [205, 204, 1, 1, 1] [2018-07-25 13:24:19,894 INFO L415 AbstractCegarLoop]: === Iteration 205 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:19,894 INFO L82 PathProgramCache]: Analyzing trace with hash -241650945, now seen corresponding path program 204 times [2018-07-25 13:24:19,894 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:20,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:21,299 INFO L134 CoverageAnalysis]: Checked inductivity of 41820 backedges. 0 proven. 41820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:21,300 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:21,300 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [206] total 206 [2018-07-25 13:24:21,300 INFO L451 AbstractCegarLoop]: Interpolant automaton has 207 states [2018-07-25 13:24:21,302 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 207 interpolants. [2018-07-25 13:24:21,304 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21321, Invalid=21321, Unknown=0, NotChecked=0, Total=42642 [2018-07-25 13:24:21,304 INFO L87 Difference]: Start difference. First operand 413 states and 413 transitions. Second operand 207 states. [2018-07-25 13:24:23,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:23,586 INFO L93 Difference]: Finished difference Result 417 states and 417 transitions. [2018-07-25 13:24:23,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 207 states. [2018-07-25 13:24:23,586 INFO L78 Accepts]: Start accepts. Automaton has 207 states. Word has length 412 [2018-07-25 13:24:23,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:23,587 INFO L225 Difference]: With dead ends: 417 [2018-07-25 13:24:23,587 INFO L226 Difference]: Without dead ends: 415 [2018-07-25 13:24:23,590 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=21321, Invalid=21321, Unknown=0, NotChecked=0, Total=42642 [2018-07-25 13:24:23,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2018-07-25 13:24:23,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 415. [2018-07-25 13:24:23,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2018-07-25 13:24:23,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 415 transitions. [2018-07-25 13:24:23,595 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 415 transitions. Word has length 412 [2018-07-25 13:24:23,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:23,595 INFO L472 AbstractCegarLoop]: Abstraction has 415 states and 415 transitions. [2018-07-25 13:24:23,595 INFO L473 AbstractCegarLoop]: Interpolant automaton has 207 states. [2018-07-25 13:24:23,595 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 415 transitions. [2018-07-25 13:24:23,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2018-07-25 13:24:23,596 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:23,597 INFO L354 BasicCegarLoop]: trace histogram [206, 205, 1, 1, 1] [2018-07-25 13:24:23,597 INFO L415 AbstractCegarLoop]: === Iteration 206 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:23,597 INFO L82 PathProgramCache]: Analyzing trace with hash -298272071, now seen corresponding path program 205 times [2018-07-25 13:24:23,597 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:23,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:25,026 INFO L134 CoverageAnalysis]: Checked inductivity of 42230 backedges. 0 proven. 42230 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:25,026 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:25,026 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [207] total 207 [2018-07-25 13:24:25,026 INFO L451 AbstractCegarLoop]: Interpolant automaton has 208 states [2018-07-25 13:24:25,030 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 208 interpolants. [2018-07-25 13:24:25,032 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-07-25 13:24:25,032 INFO L87 Difference]: Start difference. First operand 415 states and 415 transitions. Second operand 208 states. [2018-07-25 13:24:27,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:27,855 INFO L93 Difference]: Finished difference Result 419 states and 419 transitions. [2018-07-25 13:24:27,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 208 states. [2018-07-25 13:24:27,855 INFO L78 Accepts]: Start accepts. Automaton has 208 states. Word has length 414 [2018-07-25 13:24:27,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:27,856 INFO L225 Difference]: With dead ends: 419 [2018-07-25 13:24:27,856 INFO L226 Difference]: Without dead ends: 417 [2018-07-25 13:24:27,859 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-07-25 13:24:27,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-07-25 13:24:27,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2018-07-25 13:24:27,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-07-25 13:24:27,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 417 transitions. [2018-07-25 13:24:27,864 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 417 transitions. Word has length 414 [2018-07-25 13:24:27,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:27,864 INFO L472 AbstractCegarLoop]: Abstraction has 417 states and 417 transitions. [2018-07-25 13:24:27,864 INFO L473 AbstractCegarLoop]: Interpolant automaton has 208 states. [2018-07-25 13:24:27,864 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 417 transitions. [2018-07-25 13:24:27,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2018-07-25 13:24:27,866 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:27,866 INFO L354 BasicCegarLoop]: trace histogram [207, 206, 1, 1, 1] [2018-07-25 13:24:27,866 INFO L415 AbstractCegarLoop]: === Iteration 207 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:27,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1123400691, now seen corresponding path program 206 times [2018-07-25 13:24:27,866 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:28,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:29,344 INFO L134 CoverageAnalysis]: Checked inductivity of 42642 backedges. 0 proven. 42642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:29,344 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:29,345 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [208] total 208 [2018-07-25 13:24:29,345 INFO L451 AbstractCegarLoop]: Interpolant automaton has 209 states [2018-07-25 13:24:29,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 209 interpolants. [2018-07-25 13:24:29,350 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21736, Invalid=21736, Unknown=0, NotChecked=0, Total=43472 [2018-07-25 13:24:29,351 INFO L87 Difference]: Start difference. First operand 417 states and 417 transitions. Second operand 209 states. [2018-07-25 13:24:30,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:30,464 INFO L93 Difference]: Finished difference Result 421 states and 421 transitions. [2018-07-25 13:24:30,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 209 states. [2018-07-25 13:24:30,464 INFO L78 Accepts]: Start accepts. Automaton has 209 states. Word has length 416 [2018-07-25 13:24:30,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:30,465 INFO L225 Difference]: With dead ends: 421 [2018-07-25 13:24:30,465 INFO L226 Difference]: Without dead ends: 419 [2018-07-25 13:24:30,467 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=21736, Invalid=21736, Unknown=0, NotChecked=0, Total=43472 [2018-07-25 13:24:30,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-07-25 13:24:30,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2018-07-25 13:24:30,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-07-25 13:24:30,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 419 transitions. [2018-07-25 13:24:30,471 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 419 transitions. Word has length 416 [2018-07-25 13:24:30,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:30,471 INFO L472 AbstractCegarLoop]: Abstraction has 419 states and 419 transitions. [2018-07-25 13:24:30,471 INFO L473 AbstractCegarLoop]: Interpolant automaton has 209 states. [2018-07-25 13:24:30,471 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 419 transitions. [2018-07-25 13:24:30,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2018-07-25 13:24:30,473 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:30,473 INFO L354 BasicCegarLoop]: trace histogram [208, 207, 1, 1, 1] [2018-07-25 13:24:30,473 INFO L415 AbstractCegarLoop]: === Iteration 208 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:30,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1551324845, now seen corresponding path program 207 times [2018-07-25 13:24:30,474 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:30,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:31,788 INFO L134 CoverageAnalysis]: Checked inductivity of 43056 backedges. 0 proven. 43056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:31,788 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:31,788 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [209] total 209 [2018-07-25 13:24:31,789 INFO L451 AbstractCegarLoop]: Interpolant automaton has 210 states [2018-07-25 13:24:31,793 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 210 interpolants. [2018-07-25 13:24:31,797 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-07-25 13:24:31,797 INFO L87 Difference]: Start difference. First operand 419 states and 419 transitions. Second operand 210 states. [2018-07-25 13:24:34,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:34,236 INFO L93 Difference]: Finished difference Result 423 states and 423 transitions. [2018-07-25 13:24:34,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 210 states. [2018-07-25 13:24:34,236 INFO L78 Accepts]: Start accepts. Automaton has 210 states. Word has length 418 [2018-07-25 13:24:34,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:34,237 INFO L225 Difference]: With dead ends: 423 [2018-07-25 13:24:34,237 INFO L226 Difference]: Without dead ends: 421 [2018-07-25 13:24:34,240 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-07-25 13:24:34,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2018-07-25 13:24:34,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2018-07-25 13:24:34,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-07-25 13:24:34,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 421 transitions. [2018-07-25 13:24:34,244 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 421 transitions. Word has length 418 [2018-07-25 13:24:34,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:34,244 INFO L472 AbstractCegarLoop]: Abstraction has 421 states and 421 transitions. [2018-07-25 13:24:34,244 INFO L473 AbstractCegarLoop]: Interpolant automaton has 210 states. [2018-07-25 13:24:34,244 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 421 transitions. [2018-07-25 13:24:34,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2018-07-25 13:24:34,245 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:34,245 INFO L354 BasicCegarLoop]: trace histogram [209, 208, 1, 1, 1] [2018-07-25 13:24:34,246 INFO L415 AbstractCegarLoop]: === Iteration 209 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:34,246 INFO L82 PathProgramCache]: Analyzing trace with hash 469576423, now seen corresponding path program 208 times [2018-07-25 13:24:34,246 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:34,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:35,824 INFO L134 CoverageAnalysis]: Checked inductivity of 43472 backedges. 0 proven. 43472 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:35,824 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:35,824 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [210] total 210 [2018-07-25 13:24:35,825 INFO L451 AbstractCegarLoop]: Interpolant automaton has 211 states [2018-07-25 13:24:35,828 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 211 interpolants. [2018-07-25 13:24:35,831 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22155, Invalid=22155, Unknown=0, NotChecked=0, Total=44310 [2018-07-25 13:24:35,831 INFO L87 Difference]: Start difference. First operand 421 states and 421 transitions. Second operand 211 states. [2018-07-25 13:24:37,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:37,345 INFO L93 Difference]: Finished difference Result 425 states and 425 transitions. [2018-07-25 13:24:37,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 211 states. [2018-07-25 13:24:37,346 INFO L78 Accepts]: Start accepts. Automaton has 211 states. Word has length 420 [2018-07-25 13:24:37,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:37,346 INFO L225 Difference]: With dead ends: 425 [2018-07-25 13:24:37,346 INFO L226 Difference]: Without dead ends: 423 [2018-07-25 13:24:37,350 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=22155, Invalid=22155, Unknown=0, NotChecked=0, Total=44310 [2018-07-25 13:24:37,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-07-25 13:24:37,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 423. [2018-07-25 13:24:37,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-07-25 13:24:37,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 423 transitions. [2018-07-25 13:24:37,355 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 423 transitions. Word has length 420 [2018-07-25 13:24:37,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:37,355 INFO L472 AbstractCegarLoop]: Abstraction has 423 states and 423 transitions. [2018-07-25 13:24:37,355 INFO L473 AbstractCegarLoop]: Interpolant automaton has 211 states. [2018-07-25 13:24:37,355 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 423 transitions. [2018-07-25 13:24:37,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2018-07-25 13:24:37,357 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:37,357 INFO L354 BasicCegarLoop]: trace histogram [210, 209, 1, 1, 1] [2018-07-25 13:24:37,357 INFO L415 AbstractCegarLoop]: === Iteration 210 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:37,357 INFO L82 PathProgramCache]: Analyzing trace with hash 291428513, now seen corresponding path program 209 times [2018-07-25 13:24:37,357 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:37,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:38,951 INFO L134 CoverageAnalysis]: Checked inductivity of 43890 backedges. 0 proven. 43890 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:38,951 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:38,951 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [211] total 211 [2018-07-25 13:24:38,951 INFO L451 AbstractCegarLoop]: Interpolant automaton has 212 states [2018-07-25 13:24:38,955 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 212 interpolants. [2018-07-25 13:24:38,958 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-07-25 13:24:38,958 INFO L87 Difference]: Start difference. First operand 423 states and 423 transitions. Second operand 212 states. [2018-07-25 13:24:41,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:41,090 INFO L93 Difference]: Finished difference Result 427 states and 427 transitions. [2018-07-25 13:24:41,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 212 states. [2018-07-25 13:24:41,090 INFO L78 Accepts]: Start accepts. Automaton has 212 states. Word has length 422 [2018-07-25 13:24:41,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:41,091 INFO L225 Difference]: With dead ends: 427 [2018-07-25 13:24:41,091 INFO L226 Difference]: Without dead ends: 425 [2018-07-25 13:24:41,092 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-07-25 13:24:41,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2018-07-25 13:24:41,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 425. [2018-07-25 13:24:41,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-07-25 13:24:41,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 425 transitions. [2018-07-25 13:24:41,096 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 425 transitions. Word has length 422 [2018-07-25 13:24:41,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:41,096 INFO L472 AbstractCegarLoop]: Abstraction has 425 states and 425 transitions. [2018-07-25 13:24:41,096 INFO L473 AbstractCegarLoop]: Interpolant automaton has 212 states. [2018-07-25 13:24:41,096 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 425 transitions. [2018-07-25 13:24:41,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2018-07-25 13:24:41,097 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:41,098 INFO L354 BasicCegarLoop]: trace histogram [211, 210, 1, 1, 1] [2018-07-25 13:24:41,098 INFO L415 AbstractCegarLoop]: === Iteration 211 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:41,098 INFO L82 PathProgramCache]: Analyzing trace with hash 889978843, now seen corresponding path program 210 times [2018-07-25 13:24:41,098 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:41,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:42,555 INFO L134 CoverageAnalysis]: Checked inductivity of 44310 backedges. 0 proven. 44310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:42,555 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:42,555 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [212] total 212 [2018-07-25 13:24:42,555 INFO L451 AbstractCegarLoop]: Interpolant automaton has 213 states [2018-07-25 13:24:42,559 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 213 interpolants. [2018-07-25 13:24:42,561 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22578, Invalid=22578, Unknown=0, NotChecked=0, Total=45156 [2018-07-25 13:24:42,561 INFO L87 Difference]: Start difference. First operand 425 states and 425 transitions. Second operand 213 states. [2018-07-25 13:24:45,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:45,384 INFO L93 Difference]: Finished difference Result 429 states and 429 transitions. [2018-07-25 13:24:45,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 213 states. [2018-07-25 13:24:45,384 INFO L78 Accepts]: Start accepts. Automaton has 213 states. Word has length 424 [2018-07-25 13:24:45,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:45,385 INFO L225 Difference]: With dead ends: 429 [2018-07-25 13:24:45,385 INFO L226 Difference]: Without dead ends: 427 [2018-07-25 13:24:45,389 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=22578, Invalid=22578, Unknown=0, NotChecked=0, Total=45156 [2018-07-25 13:24:45,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2018-07-25 13:24:45,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2018-07-25 13:24:45,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2018-07-25 13:24:45,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 427 transitions. [2018-07-25 13:24:45,393 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 427 transitions. Word has length 424 [2018-07-25 13:24:45,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:45,394 INFO L472 AbstractCegarLoop]: Abstraction has 427 states and 427 transitions. [2018-07-25 13:24:45,394 INFO L473 AbstractCegarLoop]: Interpolant automaton has 213 states. [2018-07-25 13:24:45,394 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 427 transitions. [2018-07-25 13:24:45,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2018-07-25 13:24:45,395 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:45,395 INFO L354 BasicCegarLoop]: trace histogram [212, 211, 1, 1, 1] [2018-07-25 13:24:45,395 INFO L415 AbstractCegarLoop]: === Iteration 212 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:45,396 INFO L82 PathProgramCache]: Analyzing trace with hash 571228309, now seen corresponding path program 211 times [2018-07-25 13:24:45,396 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:45,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:47,001 INFO L134 CoverageAnalysis]: Checked inductivity of 44732 backedges. 0 proven. 44732 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:47,001 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:47,001 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [213] total 213 [2018-07-25 13:24:47,002 INFO L451 AbstractCegarLoop]: Interpolant automaton has 214 states [2018-07-25 13:24:47,003 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 214 interpolants. [2018-07-25 13:24:47,005 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-07-25 13:24:47,005 INFO L87 Difference]: Start difference. First operand 427 states and 427 transitions. Second operand 214 states. [2018-07-25 13:24:48,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:48,728 INFO L93 Difference]: Finished difference Result 431 states and 431 transitions. [2018-07-25 13:24:48,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 214 states. [2018-07-25 13:24:48,729 INFO L78 Accepts]: Start accepts. Automaton has 214 states. Word has length 426 [2018-07-25 13:24:48,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:48,729 INFO L225 Difference]: With dead ends: 431 [2018-07-25 13:24:48,730 INFO L226 Difference]: Without dead ends: 429 [2018-07-25 13:24:48,731 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-07-25 13:24:48,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2018-07-25 13:24:48,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2018-07-25 13:24:48,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2018-07-25 13:24:48,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 429 transitions. [2018-07-25 13:24:48,735 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 429 transitions. Word has length 426 [2018-07-25 13:24:48,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:48,735 INFO L472 AbstractCegarLoop]: Abstraction has 429 states and 429 transitions. [2018-07-25 13:24:48,735 INFO L473 AbstractCegarLoop]: Interpolant automaton has 214 states. [2018-07-25 13:24:48,736 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 429 transitions. [2018-07-25 13:24:48,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2018-07-25 13:24:48,737 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:48,737 INFO L354 BasicCegarLoop]: trace histogram [213, 212, 1, 1, 1] [2018-07-25 13:24:48,737 INFO L415 AbstractCegarLoop]: === Iteration 213 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:48,737 INFO L82 PathProgramCache]: Analyzing trace with hash -805356849, now seen corresponding path program 212 times [2018-07-25 13:24:48,737 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:49,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:50,318 INFO L134 CoverageAnalysis]: Checked inductivity of 45156 backedges. 0 proven. 45156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:50,318 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:50,319 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [214] total 214 [2018-07-25 13:24:50,319 INFO L451 AbstractCegarLoop]: Interpolant automaton has 215 states [2018-07-25 13:24:50,323 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 215 interpolants. [2018-07-25 13:24:50,326 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23005, Invalid=23005, Unknown=0, NotChecked=0, Total=46010 [2018-07-25 13:24:50,326 INFO L87 Difference]: Start difference. First operand 429 states and 429 transitions. Second operand 215 states. [2018-07-25 13:24:51,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:51,839 INFO L93 Difference]: Finished difference Result 433 states and 433 transitions. [2018-07-25 13:24:51,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 215 states. [2018-07-25 13:24:51,839 INFO L78 Accepts]: Start accepts. Automaton has 215 states. Word has length 428 [2018-07-25 13:24:51,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:51,840 INFO L225 Difference]: With dead ends: 433 [2018-07-25 13:24:51,840 INFO L226 Difference]: Without dead ends: 431 [2018-07-25 13:24:51,843 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=23005, Invalid=23005, Unknown=0, NotChecked=0, Total=46010 [2018-07-25 13:24:51,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-07-25 13:24:51,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 431. [2018-07-25 13:24:51,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2018-07-25 13:24:51,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 431 transitions. [2018-07-25 13:24:51,848 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 431 transitions. Word has length 428 [2018-07-25 13:24:51,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:51,848 INFO L472 AbstractCegarLoop]: Abstraction has 431 states and 431 transitions. [2018-07-25 13:24:51,848 INFO L473 AbstractCegarLoop]: Interpolant automaton has 215 states. [2018-07-25 13:24:51,848 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 431 transitions. [2018-07-25 13:24:51,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2018-07-25 13:24:51,849 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:51,849 INFO L354 BasicCegarLoop]: trace histogram [214, 213, 1, 1, 1] [2018-07-25 13:24:51,850 INFO L415 AbstractCegarLoop]: === Iteration 214 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:51,850 INFO L82 PathProgramCache]: Analyzing trace with hash -853766519, now seen corresponding path program 213 times [2018-07-25 13:24:51,850 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:52,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:53,479 INFO L134 CoverageAnalysis]: Checked inductivity of 45582 backedges. 0 proven. 45582 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:53,479 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:53,480 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [215] total 215 [2018-07-25 13:24:53,480 INFO L451 AbstractCegarLoop]: Interpolant automaton has 216 states [2018-07-25 13:24:53,483 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 216 interpolants. [2018-07-25 13:24:53,485 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2018-07-25 13:24:53,485 INFO L87 Difference]: Start difference. First operand 431 states and 431 transitions. Second operand 216 states. [2018-07-25 13:24:56,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:56,604 INFO L93 Difference]: Finished difference Result 435 states and 435 transitions. [2018-07-25 13:24:56,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 216 states. [2018-07-25 13:24:56,604 INFO L78 Accepts]: Start accepts. Automaton has 216 states. Word has length 430 [2018-07-25 13:24:56,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:56,605 INFO L225 Difference]: With dead ends: 435 [2018-07-25 13:24:56,605 INFO L226 Difference]: Without dead ends: 433 [2018-07-25 13:24:56,609 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2018-07-25 13:24:56,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2018-07-25 13:24:56,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 433. [2018-07-25 13:24:56,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2018-07-25 13:24:56,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 433 transitions. [2018-07-25 13:24:56,613 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 433 transitions. Word has length 430 [2018-07-25 13:24:56,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:56,614 INFO L472 AbstractCegarLoop]: Abstraction has 433 states and 433 transitions. [2018-07-25 13:24:56,614 INFO L473 AbstractCegarLoop]: Interpolant automaton has 216 states. [2018-07-25 13:24:56,614 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 433 transitions. [2018-07-25 13:24:56,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2018-07-25 13:24:56,615 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:56,615 INFO L354 BasicCegarLoop]: trace histogram [215, 214, 1, 1, 1] [2018-07-25 13:24:56,616 INFO L415 AbstractCegarLoop]: === Iteration 215 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:56,616 INFO L82 PathProgramCache]: Analyzing trace with hash -130819133, now seen corresponding path program 214 times [2018-07-25 13:24:56,616 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:56,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:58,242 INFO L134 CoverageAnalysis]: Checked inductivity of 46010 backedges. 0 proven. 46010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:58,243 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:58,243 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [216] total 216 [2018-07-25 13:24:58,243 INFO L451 AbstractCegarLoop]: Interpolant automaton has 217 states [2018-07-25 13:24:58,247 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 217 interpolants. [2018-07-25 13:24:58,250 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23436, Invalid=23436, Unknown=0, NotChecked=0, Total=46872 [2018-07-25 13:24:58,250 INFO L87 Difference]: Start difference. First operand 433 states and 433 transitions. Second operand 217 states. [2018-07-25 13:24:59,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:59,598 INFO L93 Difference]: Finished difference Result 437 states and 437 transitions. [2018-07-25 13:24:59,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 217 states. [2018-07-25 13:24:59,598 INFO L78 Accepts]: Start accepts. Automaton has 217 states. Word has length 432 [2018-07-25 13:24:59,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:59,599 INFO L225 Difference]: With dead ends: 437 [2018-07-25 13:24:59,599 INFO L226 Difference]: Without dead ends: 435 [2018-07-25 13:24:59,601 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=23436, Invalid=23436, Unknown=0, NotChecked=0, Total=46872 [2018-07-25 13:24:59,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2018-07-25 13:24:59,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 435. [2018-07-25 13:24:59,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-07-25 13:24:59,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 435 transitions. [2018-07-25 13:24:59,605 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 435 transitions. Word has length 432 [2018-07-25 13:24:59,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:59,606 INFO L472 AbstractCegarLoop]: Abstraction has 435 states and 435 transitions. [2018-07-25 13:24:59,606 INFO L473 AbstractCegarLoop]: Interpolant automaton has 217 states. [2018-07-25 13:24:59,606 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 435 transitions. [2018-07-25 13:24:59,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2018-07-25 13:24:59,607 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:59,607 INFO L354 BasicCegarLoop]: trace histogram [216, 215, 1, 1, 1] [2018-07-25 13:24:59,607 INFO L415 AbstractCegarLoop]: === Iteration 216 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:59,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1163083139, now seen corresponding path program 215 times [2018-07-25 13:24:59,607 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:59,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:01,165 INFO L134 CoverageAnalysis]: Checked inductivity of 46440 backedges. 0 proven. 46440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:01,165 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:01,165 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [217] total 217 [2018-07-25 13:25:01,165 INFO L451 AbstractCegarLoop]: Interpolant automaton has 218 states [2018-07-25 13:25:01,169 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 218 interpolants. [2018-07-25 13:25:01,172 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2018-07-25 13:25:01,172 INFO L87 Difference]: Start difference. First operand 435 states and 435 transitions. Second operand 218 states. [2018-07-25 13:25:04,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:04,433 INFO L93 Difference]: Finished difference Result 439 states and 439 transitions. [2018-07-25 13:25:04,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 218 states. [2018-07-25 13:25:04,433 INFO L78 Accepts]: Start accepts. Automaton has 218 states. Word has length 434 [2018-07-25 13:25:04,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:04,434 INFO L225 Difference]: With dead ends: 439 [2018-07-25 13:25:04,434 INFO L226 Difference]: Without dead ends: 437 [2018-07-25 13:25:04,439 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2018-07-25 13:25:04,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2018-07-25 13:25:04,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2018-07-25 13:25:04,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2018-07-25 13:25:04,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 437 transitions. [2018-07-25 13:25:04,443 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 437 transitions. Word has length 434 [2018-07-25 13:25:04,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:04,444 INFO L472 AbstractCegarLoop]: Abstraction has 437 states and 437 transitions. [2018-07-25 13:25:04,444 INFO L473 AbstractCegarLoop]: Interpolant automaton has 218 states. [2018-07-25 13:25:04,444 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 437 transitions. [2018-07-25 13:25:04,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2018-07-25 13:25:04,445 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:04,445 INFO L354 BasicCegarLoop]: trace histogram [217, 216, 1, 1, 1] [2018-07-25 13:25:04,446 INFO L415 AbstractCegarLoop]: === Iteration 217 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:04,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1031347529, now seen corresponding path program 216 times [2018-07-25 13:25:04,446 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:04,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:06,099 INFO L134 CoverageAnalysis]: Checked inductivity of 46872 backedges. 0 proven. 46872 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:06,099 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:06,099 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [218] total 218 [2018-07-25 13:25:06,100 INFO L451 AbstractCegarLoop]: Interpolant automaton has 219 states [2018-07-25 13:25:06,102 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 219 interpolants. [2018-07-25 13:25:06,103 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23871, Invalid=23871, Unknown=0, NotChecked=0, Total=47742 [2018-07-25 13:25:06,103 INFO L87 Difference]: Start difference. First operand 437 states and 437 transitions. Second operand 219 states. [2018-07-25 13:25:09,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:09,057 INFO L93 Difference]: Finished difference Result 441 states and 441 transitions. [2018-07-25 13:25:09,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2018-07-25 13:25:09,057 INFO L78 Accepts]: Start accepts. Automaton has 219 states. Word has length 436 [2018-07-25 13:25:09,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:09,058 INFO L225 Difference]: With dead ends: 441 [2018-07-25 13:25:09,058 INFO L226 Difference]: Without dead ends: 439 [2018-07-25 13:25:09,060 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=23871, Invalid=23871, Unknown=0, NotChecked=0, Total=47742 [2018-07-25 13:25:09,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2018-07-25 13:25:09,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439. [2018-07-25 13:25:09,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2018-07-25 13:25:09,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 439 transitions. [2018-07-25 13:25:09,064 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 439 transitions. Word has length 436 [2018-07-25 13:25:09,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:09,065 INFO L472 AbstractCegarLoop]: Abstraction has 439 states and 439 transitions. [2018-07-25 13:25:09,065 INFO L473 AbstractCegarLoop]: Interpolant automaton has 219 states. [2018-07-25 13:25:09,065 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 439 transitions. [2018-07-25 13:25:09,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2018-07-25 13:25:09,066 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:09,066 INFO L354 BasicCegarLoop]: trace histogram [218, 217, 1, 1, 1] [2018-07-25 13:25:09,067 INFO L415 AbstractCegarLoop]: === Iteration 218 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:09,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1012522097, now seen corresponding path program 217 times [2018-07-25 13:25:09,067 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:09,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:10,755 INFO L134 CoverageAnalysis]: Checked inductivity of 47306 backedges. 0 proven. 47306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:10,755 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:10,756 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [219] total 219 [2018-07-25 13:25:10,756 INFO L451 AbstractCegarLoop]: Interpolant automaton has 220 states [2018-07-25 13:25:10,760 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 220 interpolants. [2018-07-25 13:25:10,763 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2018-07-25 13:25:10,763 INFO L87 Difference]: Start difference. First operand 439 states and 439 transitions. Second operand 220 states. [2018-07-25 13:25:11,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:11,850 INFO L93 Difference]: Finished difference Result 443 states and 443 transitions. [2018-07-25 13:25:11,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 220 states. [2018-07-25 13:25:11,851 INFO L78 Accepts]: Start accepts. Automaton has 220 states. Word has length 438 [2018-07-25 13:25:11,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:11,851 INFO L225 Difference]: With dead ends: 443 [2018-07-25 13:25:11,851 INFO L226 Difference]: Without dead ends: 441 [2018-07-25 13:25:11,854 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2018-07-25 13:25:11,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2018-07-25 13:25:11,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 441. [2018-07-25 13:25:11,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2018-07-25 13:25:11,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 441 transitions. [2018-07-25 13:25:11,858 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 441 transitions. Word has length 438 [2018-07-25 13:25:11,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:11,859 INFO L472 AbstractCegarLoop]: Abstraction has 441 states and 441 transitions. [2018-07-25 13:25:11,859 INFO L473 AbstractCegarLoop]: Interpolant automaton has 220 states. [2018-07-25 13:25:11,859 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 441 transitions. [2018-07-25 13:25:11,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2018-07-25 13:25:11,860 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:11,860 INFO L354 BasicCegarLoop]: trace histogram [219, 218, 1, 1, 1] [2018-07-25 13:25:11,860 INFO L415 AbstractCegarLoop]: === Iteration 219 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:11,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1923788885, now seen corresponding path program 218 times [2018-07-25 13:25:11,860 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:12,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:13,512 INFO L134 CoverageAnalysis]: Checked inductivity of 47742 backedges. 0 proven. 47742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:13,512 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:13,512 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [220] total 220 [2018-07-25 13:25:13,513 INFO L451 AbstractCegarLoop]: Interpolant automaton has 221 states [2018-07-25 13:25:13,517 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 221 interpolants. [2018-07-25 13:25:13,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24310, Invalid=24310, Unknown=0, NotChecked=0, Total=48620 [2018-07-25 13:25:13,520 INFO L87 Difference]: Start difference. First operand 441 states and 441 transitions. Second operand 221 states. [2018-07-25 13:25:14,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:14,627 INFO L93 Difference]: Finished difference Result 445 states and 445 transitions. [2018-07-25 13:25:14,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 221 states. [2018-07-25 13:25:14,627 INFO L78 Accepts]: Start accepts. Automaton has 221 states. Word has length 440 [2018-07-25 13:25:14,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:14,628 INFO L225 Difference]: With dead ends: 445 [2018-07-25 13:25:14,628 INFO L226 Difference]: Without dead ends: 443 [2018-07-25 13:25:14,631 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=24310, Invalid=24310, Unknown=0, NotChecked=0, Total=48620 [2018-07-25 13:25:14,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-07-25 13:25:14,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2018-07-25 13:25:14,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2018-07-25 13:25:14,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 443 transitions. [2018-07-25 13:25:14,636 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 443 transitions. Word has length 440 [2018-07-25 13:25:14,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:14,636 INFO L472 AbstractCegarLoop]: Abstraction has 443 states and 443 transitions. [2018-07-25 13:25:14,636 INFO L473 AbstractCegarLoop]: Interpolant automaton has 221 states. [2018-07-25 13:25:14,636 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 443 transitions. [2018-07-25 13:25:14,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2018-07-25 13:25:14,638 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:14,638 INFO L354 BasicCegarLoop]: trace histogram [220, 219, 1, 1, 1] [2018-07-25 13:25:14,638 INFO L415 AbstractCegarLoop]: === Iteration 220 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:14,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1925129115, now seen corresponding path program 219 times [2018-07-25 13:25:14,638 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:14,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:16,428 INFO L134 CoverageAnalysis]: Checked inductivity of 48180 backedges. 0 proven. 48180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:16,429 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:16,429 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [221] total 221 [2018-07-25 13:25:16,430 INFO L451 AbstractCegarLoop]: Interpolant automaton has 222 states [2018-07-25 13:25:16,432 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 222 interpolants. [2018-07-25 13:25:16,434 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2018-07-25 13:25:16,434 INFO L87 Difference]: Start difference. First operand 443 states and 443 transitions. Second operand 222 states. [2018-07-25 13:25:18,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:18,977 INFO L93 Difference]: Finished difference Result 447 states and 447 transitions. [2018-07-25 13:25:18,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 222 states. [2018-07-25 13:25:18,977 INFO L78 Accepts]: Start accepts. Automaton has 222 states. Word has length 442 [2018-07-25 13:25:18,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:18,978 INFO L225 Difference]: With dead ends: 447 [2018-07-25 13:25:18,978 INFO L226 Difference]: Without dead ends: 445 [2018-07-25 13:25:18,979 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 13:25:18,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-07-25 13:25:18,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 445. [2018-07-25 13:25:18,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-07-25 13:25:18,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 445 transitions. [2018-07-25 13:25:18,984 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 445 transitions. Word has length 442 [2018-07-25 13:25:18,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:18,984 INFO L472 AbstractCegarLoop]: Abstraction has 445 states and 445 transitions. [2018-07-25 13:25:18,984 INFO L473 AbstractCegarLoop]: Interpolant automaton has 222 states. [2018-07-25 13:25:18,984 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 445 transitions. [2018-07-25 13:25:18,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2018-07-25 13:25:18,986 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:18,986 INFO L354 BasicCegarLoop]: trace histogram [221, 220, 1, 1, 1] [2018-07-25 13:25:18,986 INFO L415 AbstractCegarLoop]: === Iteration 221 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:18,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1081877151, now seen corresponding path program 220 times [2018-07-25 13:25:18,986 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy Received shutdown request... [2018-07-25 13:25:19,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:19,298 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Timeout exceeded at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:215) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:919) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:262) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:193) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:284) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:204) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:210) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.FixedRefinementStrategy.getTraceCheck(FixedRefinementStrategy.java:130) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:220) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:194) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:309) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:151) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:120) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-07-25 13:25:19,302 INFO L168 Benchmark]: Toolchain (without parser) took 253484.46 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 2.6 GB in the end (delta: -1.1 GB). Peak memory consumption was 855.9 MB. Max. memory is 7.1 GB. [2018-07-25 13:25:19,303 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 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 13:25:19,303 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.11 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 13:25:19,304 INFO L168 Benchmark]: Boogie Preprocessor took 22.12 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 13:25:19,304 INFO L168 Benchmark]: RCFGBuilder took 232.18 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-25 13:25:19,305 INFO L168 Benchmark]: TraceAbstraction took 253183.60 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 2.6 GB in the end (delta: -1.1 GB). Peak memory consumption was 845.3 MB. Max. memory is 7.1 GB. [2018-07-25 13:25:19,307 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.18 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.11 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.12 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 232.18 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 253183.60 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 2.6 GB in the end (delta: -1.1 GB). Peak memory consumption was 845.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Timeout exceeded de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Timeout exceeded: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:215) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/array2.i_3.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-07-25_13-25-19-316.csv Completed graceful shutdown