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/toy/tooDifficultLoopInvariant/DivisibilityInterpolantRequired01-BackwardSuccess.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-e6fd87c [2018-07-25 08:50:38,565 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-25 08:50:38,568 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-25 08:50:38,585 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-25 08:50:38,585 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-25 08:50:38,589 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-25 08:50:38,590 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-25 08:50:38,592 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-25 08:50:38,595 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-25 08:50:38,604 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-25 08:50:38,605 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-25 08:50:38,606 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-25 08:50:38,607 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-25 08:50:38,608 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-25 08:50:38,614 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-25 08:50:38,615 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-25 08:50:38,616 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-25 08:50:38,620 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-25 08:50:38,624 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-25 08:50:38,626 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-25 08:50:38,627 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-25 08:50:38,632 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-25 08:50:38,635 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-25 08:50:38,635 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-25 08:50:38,635 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-25 08:50:38,639 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-25 08:50:38,640 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-25 08:50:38,641 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-25 08:50:38,642 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-25 08:50:38,646 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-25 08:50:38,646 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-25 08:50:38,647 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-25 08:50:38,647 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-25 08:50:38,647 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-25 08:50:38,648 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-25 08:50:38,650 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-25 08:50:38,650 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-07-25 08:50:38,672 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-25 08:50:38,673 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-25 08:50:38,675 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-25 08:50:38,675 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-25 08:50:38,675 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-25 08:50:38,676 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-25 08:50:38,676 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-25 08:50:38,676 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-25 08:50:38,728 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-25 08:50:38,748 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-25 08:50:38,754 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-25 08:50:38,756 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-25 08:50:38,757 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-25 08:50:38,758 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/DivisibilityInterpolantRequired01-BackwardSuccess.bpl [2018-07-25 08:50:38,758 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/DivisibilityInterpolantRequired01-BackwardSuccess.bpl' [2018-07-25 08:50:38,816 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-25 08:50:38,818 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-07-25 08:50:38,819 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-25 08:50:38,820 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-25 08:50:38,820 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-25 08:50:38,843 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:50:38" (1/1) ... [2018-07-25 08:50:38,857 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:50:38" (1/1) ... [2018-07-25 08:50:38,863 WARN L165 Inliner]: Program contained no entry procedure! [2018-07-25 08:50:38,863 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-07-25 08:50:38,864 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-07-25 08:50:38,866 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-25 08:50:38,867 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-25 08:50:38,867 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-25 08:50:38,867 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-25 08:50:38,879 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:50:38" (1/1) ... [2018-07-25 08:50:38,880 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:50:38" (1/1) ... [2018-07-25 08:50:38,880 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:50:38" (1/1) ... [2018-07-25 08:50:38,881 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:50:38" (1/1) ... [2018-07-25 08:50:38,885 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:50:38" (1/1) ... [2018-07-25 08:50:38,889 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:50:38" (1/1) ... [2018-07-25 08:50:38,892 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:50:38" (1/1) ... [2018-07-25 08:50:38,893 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-25 08:50:38,894 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-25 08:50:38,894 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-25 08:50:38,894 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-25 08:50:38,895 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:50:38" (1/1) ... [2018-07-25 08:50:38,970 INFO L130 BoogieDeclarations]: Found specification of procedure proc [2018-07-25 08:50:38,970 INFO L138 BoogieDeclarations]: Found implementation of procedure proc [2018-07-25 08:50:39,080 INFO L270 CfgBuilder]: Using library mode [2018-07-25 08:50:39,081 INFO L202 PluginConnector]: Adding new model DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 08:50:39 BoogieIcfgContainer [2018-07-25 08:50:39,081 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-25 08:50:39,082 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-25 08:50:39,082 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-25 08:50:39,086 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-25 08:50:39,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:50:38" (1/2) ... [2018-07-25 08:50:39,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16f6f0e1 and model type DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.07 08:50:39, skipping insertion in model container [2018-07-25 08:50:39,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 08:50:39" (2/2) ... [2018-07-25 08:50:39,093 INFO L112 eAbstractionObserver]: Analyzing ICFG DivisibilityInterpolantRequired01-BackwardSuccess.bpl [2018-07-25 08:50:39,103 INFO L133 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-25 08:50:39,112 INFO L145 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-25 08:50:39,161 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-25 08:50:39,162 INFO L374 AbstractCegarLoop]: Interprodecural is true [2018-07-25 08:50:39,162 INFO L375 AbstractCegarLoop]: Hoare is true [2018-07-25 08:50:39,162 INFO L376 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-25 08:50:39,163 INFO L377 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-25 08:50:39,163 INFO L378 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-25 08:50:39,163 INFO L379 AbstractCegarLoop]: Difference is false [2018-07-25 08:50:39,163 INFO L380 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-25 08:50:39,164 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-25 08:50:39,179 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states. [2018-07-25 08:50:39,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-07-25 08:50:39,188 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:39,189 INFO L354 BasicCegarLoop]: trace histogram [1, 1] [2018-07-25 08:50:39,190 INFO L415 AbstractCegarLoop]: === Iteration 1 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:39,196 INFO L82 PathProgramCache]: Analyzing trace with hash 967, now seen corresponding path program 1 times [2018-07-25 08:50:39,202 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:39,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:39,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:39,286 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:50:39,287 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-07-25 08:50:39,292 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 08:50:39,306 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 08:50:39,307 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 08:50:39,310 INFO L87 Difference]: Start difference. First operand 4 states. Second operand 3 states. [2018-07-25 08:50:39,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:39,343 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2018-07-25 08:50:39,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 08:50:39,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-07-25 08:50:39,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:39,355 INFO L225 Difference]: With dead ends: 7 [2018-07-25 08:50:39,355 INFO L226 Difference]: Without dead ends: 4 [2018-07-25 08:50:39,359 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 08:50:39,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4 states. [2018-07-25 08:50:39,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4 to 4. [2018-07-25 08:50:39,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-07-25 08:50:39,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2018-07-25 08:50:39,397 INFO L78 Accepts]: Start accepts. Automaton has 4 states and 4 transitions. Word has length 2 [2018-07-25 08:50:39,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:39,398 INFO L472 AbstractCegarLoop]: Abstraction has 4 states and 4 transitions. [2018-07-25 08:50:39,398 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 08:50:39,398 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2018-07-25 08:50:39,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-07-25 08:50:39,399 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:39,399 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-07-25 08:50:39,400 INFO L415 AbstractCegarLoop]: === Iteration 2 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:39,400 INFO L82 PathProgramCache]: Analyzing trace with hash 29921, now seen corresponding path program 1 times [2018-07-25 08:50:39,400 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:39,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:39,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:39,446 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:39,446 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2018-07-25 08:50:39,450 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 08:50:39,450 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 08:50:39,451 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-25 08:50:39,451 INFO L87 Difference]: Start difference. First operand 4 states and 4 transitions. Second operand 4 states. [2018-07-25 08:50:39,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:39,470 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2018-07-25 08:50:39,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 08:50:39,470 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-07-25 08:50:39,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:39,471 INFO L225 Difference]: With dead ends: 6 [2018-07-25 08:50:39,471 INFO L226 Difference]: Without dead ends: 5 [2018-07-25 08:50:39,472 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-25 08:50:39,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-07-25 08:50:39,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-07-25 08:50:39,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-07-25 08:50:39,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-07-25 08:50:39,475 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-07-25 08:50:39,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:39,476 INFO L472 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-07-25 08:50:39,476 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 08:50:39,476 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-07-25 08:50:39,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-25 08:50:39,477 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:39,477 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1] [2018-07-25 08:50:39,477 INFO L415 AbstractCegarLoop]: === Iteration 3 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:39,478 INFO L82 PathProgramCache]: Analyzing trace with hash 927495, now seen corresponding path program 2 times [2018-07-25 08:50:39,478 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:39,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:39,517 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:39,517 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:39,517 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-25 08:50:39,518 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 08:50:39,518 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 08:50:39,518 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-25 08:50:39,519 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2018-07-25 08:50:39,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:39,559 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2018-07-25 08:50:39,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-25 08:50:39,560 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-07-25 08:50:39,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:39,560 INFO L225 Difference]: With dead ends: 7 [2018-07-25 08:50:39,561 INFO L226 Difference]: Without dead ends: 6 [2018-07-25 08:50:39,561 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-25 08:50:39,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-07-25 08:50:39,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-07-25 08:50:39,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-07-25 08:50:39,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-07-25 08:50:39,565 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-07-25 08:50:39,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:39,565 INFO L472 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-07-25 08:50:39,565 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 08:50:39,565 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-07-25 08:50:39,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-07-25 08:50:39,566 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:39,566 INFO L354 BasicCegarLoop]: trace histogram [3, 1, 1] [2018-07-25 08:50:39,566 INFO L415 AbstractCegarLoop]: === Iteration 4 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:39,567 INFO L82 PathProgramCache]: Analyzing trace with hash 28752289, now seen corresponding path program 3 times [2018-07-25 08:50:39,567 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:39,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:39,610 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:39,611 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:39,611 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-25 08:50:39,611 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 08:50:39,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 08:50:39,612 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-25 08:50:39,612 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2018-07-25 08:50:39,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:39,645 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-07-25 08:50:39,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-25 08:50:39,646 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-07-25 08:50:39,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:39,646 INFO L225 Difference]: With dead ends: 8 [2018-07-25 08:50:39,647 INFO L226 Difference]: Without dead ends: 7 [2018-07-25 08:50:39,647 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-25 08:50:39,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-07-25 08:50:39,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-07-25 08:50:39,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-07-25 08:50:39,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-07-25 08:50:39,651 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-07-25 08:50:39,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:39,651 INFO L472 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-07-25 08:50:39,651 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 08:50:39,651 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-07-25 08:50:39,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 08:50:39,652 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:39,652 INFO L354 BasicCegarLoop]: trace histogram [4, 1, 1] [2018-07-25 08:50:39,652 INFO L415 AbstractCegarLoop]: === Iteration 5 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:39,653 INFO L82 PathProgramCache]: Analyzing trace with hash 891320903, now seen corresponding path program 4 times [2018-07-25 08:50:39,653 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:39,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:39,739 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:39,740 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:39,740 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-25 08:50:39,741 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 08:50:39,741 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 08:50:39,741 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:50:39,742 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2018-07-25 08:50:39,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:39,802 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-07-25 08:50:39,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-25 08:50:39,803 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-25 08:50:39,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:39,804 INFO L225 Difference]: With dead ends: 9 [2018-07-25 08:50:39,804 INFO L226 Difference]: Without dead ends: 8 [2018-07-25 08:50:39,805 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:50:39,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-07-25 08:50:39,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-07-25 08:50:39,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-07-25 08:50:39,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-07-25 08:50:39,811 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-07-25 08:50:39,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:39,811 INFO L472 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-07-25 08:50:39,812 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 08:50:39,812 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-07-25 08:50:39,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-25 08:50:39,813 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:39,813 INFO L354 BasicCegarLoop]: trace histogram [5, 1, 1] [2018-07-25 08:50:39,813 INFO L415 AbstractCegarLoop]: === Iteration 6 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:39,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144161, now seen corresponding path program 5 times [2018-07-25 08:50:39,813 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:39,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:39,879 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:39,880 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:39,880 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 08:50:39,880 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:50:39,880 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:50:39,881 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:50:39,881 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2018-07-25 08:50:39,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:39,919 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-07-25 08:50:39,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-25 08:50:39,919 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-25 08:50:39,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:39,920 INFO L225 Difference]: With dead ends: 10 [2018-07-25 08:50:39,920 INFO L226 Difference]: Without dead ends: 9 [2018-07-25 08:50:39,921 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:50:39,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-07-25 08:50:39,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-07-25 08:50:39,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-25 08:50:39,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-07-25 08:50:39,927 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-07-25 08:50:39,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:39,927 INFO L472 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-07-25 08:50:39,928 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:50:39,928 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-07-25 08:50:39,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 08:50:39,928 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:39,929 INFO L354 BasicCegarLoop]: trace histogram [6, 1, 1] [2018-07-25 08:50:39,929 INFO L415 AbstractCegarLoop]: === Iteration 7 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:39,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894087, now seen corresponding path program 6 times [2018-07-25 08:50:39,930 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:39,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:39,989 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:39,989 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:39,990 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:50:39,990 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 08:50:39,990 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 08:50:39,991 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:50:39,991 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 9 states. [2018-07-25 08:50:40,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:40,029 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-07-25 08:50:40,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-25 08:50:40,029 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2018-07-25 08:50:40,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:40,030 INFO L225 Difference]: With dead ends: 11 [2018-07-25 08:50:40,030 INFO L226 Difference]: Without dead ends: 10 [2018-07-25 08:50:40,031 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:50:40,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-07-25 08:50:40,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-07-25 08:50:40,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-07-25 08:50:40,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-07-25 08:50:40,035 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-07-25 08:50:40,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:40,035 INFO L472 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-07-25 08:50:40,036 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 08:50:40,036 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-07-25 08:50:40,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-07-25 08:50:40,036 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:40,037 INFO L354 BasicCegarLoop]: trace histogram [7, 1, 1] [2018-07-25 08:50:40,037 INFO L415 AbstractCegarLoop]: === Iteration 8 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:40,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141793, now seen corresponding path program 7 times [2018-07-25 08:50:40,037 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:40,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:40,121 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:40,121 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:40,122 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 08:50:40,123 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 08:50:40,123 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 08:50:40,123 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-07-25 08:50:40,124 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 10 states. [2018-07-25 08:50:40,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:40,158 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-07-25 08:50:40,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 08:50:40,159 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2018-07-25 08:50:40,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:40,159 INFO L225 Difference]: With dead ends: 12 [2018-07-25 08:50:40,160 INFO L226 Difference]: Without dead ends: 11 [2018-07-25 08:50:40,160 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-07-25 08:50:40,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-25 08:50:40,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-07-25 08:50:40,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-25 08:50:40,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-07-25 08:50:40,165 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-07-25 08:50:40,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:40,165 INFO L472 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-07-25 08:50:40,165 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 08:50:40,166 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-07-25 08:50:40,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 08:50:40,166 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:40,166 INFO L354 BasicCegarLoop]: trace histogram [8, 1, 1] [2018-07-25 08:50:40,167 INFO L415 AbstractCegarLoop]: === Iteration 9 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:40,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820679, now seen corresponding path program 8 times [2018-07-25 08:50:40,167 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:40,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:40,233 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:40,233 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:40,234 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 08:50:40,234 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:50:40,234 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:50:40,234 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:50:40,235 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 11 states. [2018-07-25 08:50:40,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:40,281 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-07-25 08:50:40,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 08:50:40,281 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2018-07-25 08:50:40,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:40,282 INFO L225 Difference]: With dead ends: 13 [2018-07-25 08:50:40,282 INFO L226 Difference]: Without dead ends: 12 [2018-07-25 08:50:40,286 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:50:40,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-07-25 08:50:40,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-07-25 08:50:40,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-07-25 08:50:40,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-07-25 08:50:40,292 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-07-25 08:50:40,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:40,292 INFO L472 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-07-25 08:50:40,293 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:50:40,293 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-07-25 08:50:40,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-25 08:50:40,294 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:40,294 INFO L354 BasicCegarLoop]: trace histogram [9, 1, 1] [2018-07-25 08:50:40,294 INFO L415 AbstractCegarLoop]: === Iteration 10 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:40,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166559, now seen corresponding path program 9 times [2018-07-25 08:50:40,295 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:40,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:40,389 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:40,390 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:40,390 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 08:50:40,390 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 08:50:40,391 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 08:50:40,391 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:50:40,391 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 12 states. [2018-07-25 08:50:40,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:40,443 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-07-25 08:50:40,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 08:50:40,444 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2018-07-25 08:50:40,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:40,448 INFO L225 Difference]: With dead ends: 14 [2018-07-25 08:50:40,448 INFO L226 Difference]: Without dead ends: 13 [2018-07-25 08:50:40,449 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:50:40,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-07-25 08:50:40,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-07-25 08:50:40,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-25 08:50:40,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-07-25 08:50:40,454 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-07-25 08:50:40,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:40,456 INFO L472 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-07-25 08:50:40,456 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 08:50:40,456 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-07-25 08:50:40,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 08:50:40,457 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:40,457 INFO L354 BasicCegarLoop]: trace histogram [10, 1, 1] [2018-07-25 08:50:40,459 INFO L415 AbstractCegarLoop]: === Iteration 11 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:40,460 INFO L82 PathProgramCache]: Analyzing trace with hash -562523129, now seen corresponding path program 10 times [2018-07-25 08:50:40,460 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:40,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:40,516 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:40,516 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:40,517 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 08:50:40,517 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 08:50:40,517 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 08:50:40,518 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-07-25 08:50:40,518 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 13 states. [2018-07-25 08:50:40,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:40,567 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-07-25 08:50:40,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 08:50:40,568 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2018-07-25 08:50:40,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:40,570 INFO L225 Difference]: With dead ends: 15 [2018-07-25 08:50:40,571 INFO L226 Difference]: Without dead ends: 14 [2018-07-25 08:50:40,571 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-07-25 08:50:40,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-07-25 08:50:40,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-07-25 08:50:40,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-07-25 08:50:40,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-07-25 08:50:40,576 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-07-25 08:50:40,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:40,576 INFO L472 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-07-25 08:50:40,577 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 08:50:40,577 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-07-25 08:50:40,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 08:50:40,577 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:40,578 INFO L354 BasicCegarLoop]: trace histogram [11, 1, 1] [2018-07-25 08:50:40,578 INFO L415 AbstractCegarLoop]: === Iteration 12 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:40,578 INFO L82 PathProgramCache]: Analyzing trace with hash -258347871, now seen corresponding path program 11 times [2018-07-25 08:50:40,579 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:40,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:40,639 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:40,639 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:40,639 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 08:50:40,640 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 08:50:40,640 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 08:50:40,640 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-07-25 08:50:40,641 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 14 states. [2018-07-25 08:50:40,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:40,682 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-07-25 08:50:40,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 08:50:40,684 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-07-25 08:50:40,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:40,685 INFO L225 Difference]: With dead ends: 16 [2018-07-25 08:50:40,685 INFO L226 Difference]: Without dead ends: 15 [2018-07-25 08:50:40,686 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-07-25 08:50:40,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-07-25 08:50:40,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-07-25 08:50:40,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-25 08:50:40,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-07-25 08:50:40,699 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-07-25 08:50:40,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:40,702 INFO L472 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-07-25 08:50:40,702 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 08:50:40,702 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-07-25 08:50:40,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-25 08:50:40,703 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:40,703 INFO L354 BasicCegarLoop]: trace histogram [12, 1, 1] [2018-07-25 08:50:40,703 INFO L415 AbstractCegarLoop]: === Iteration 13 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:40,704 INFO L82 PathProgramCache]: Analyzing trace with hash 581150535, now seen corresponding path program 12 times [2018-07-25 08:50:40,704 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:40,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:40,767 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:40,768 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:40,768 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 08:50:40,768 INFO L451 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-25 08:50:40,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-25 08:50:40,769 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-07-25 08:50:40,769 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 15 states. [2018-07-25 08:50:40,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:40,812 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-07-25 08:50:40,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 08:50:40,812 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2018-07-25 08:50:40,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:40,813 INFO L225 Difference]: With dead ends: 17 [2018-07-25 08:50:40,813 INFO L226 Difference]: Without dead ends: 16 [2018-07-25 08:50:40,814 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-07-25 08:50:40,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-07-25 08:50:40,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-07-25 08:50:40,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-07-25 08:50:40,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-07-25 08:50:40,818 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-07-25 08:50:40,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:40,819 INFO L472 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-07-25 08:50:40,819 INFO L473 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-25 08:50:40,819 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-07-25 08:50:40,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 08:50:40,820 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:40,820 INFO L354 BasicCegarLoop]: trace histogram [13, 1, 1] [2018-07-25 08:50:40,820 INFO L415 AbstractCegarLoop]: === Iteration 14 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:40,821 INFO L82 PathProgramCache]: Analyzing trace with hash 835797345, now seen corresponding path program 13 times [2018-07-25 08:50:40,821 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:40,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:40,895 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:40,896 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:40,896 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-25 08:50:40,903 INFO L451 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-25 08:50:40,904 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-25 08:50:40,904 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-07-25 08:50:40,905 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 16 states. [2018-07-25 08:50:40,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:40,969 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-07-25 08:50:40,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-25 08:50:40,969 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2018-07-25 08:50:40,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:40,970 INFO L225 Difference]: With dead ends: 18 [2018-07-25 08:50:40,970 INFO L226 Difference]: Without dead ends: 17 [2018-07-25 08:50:40,971 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-07-25 08:50:40,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-07-25 08:50:40,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-07-25 08:50:40,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-07-25 08:50:40,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-07-25 08:50:40,978 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-07-25 08:50:40,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:40,978 INFO L472 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-07-25 08:50:40,978 INFO L473 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-25 08:50:40,979 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-07-25 08:50:40,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 08:50:40,979 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:40,979 INFO L354 BasicCegarLoop]: trace histogram [14, 1, 1] [2018-07-25 08:50:40,980 INFO L415 AbstractCegarLoop]: === Iteration 15 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:40,980 INFO L82 PathProgramCache]: Analyzing trace with hash 139913863, now seen corresponding path program 14 times [2018-07-25 08:50:40,981 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:40,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:41,074 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:41,074 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:41,075 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-25 08:50:41,075 INFO L451 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-25 08:50:41,075 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-25 08:50:41,076 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-07-25 08:50:41,076 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 17 states. [2018-07-25 08:50:41,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:41,137 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-07-25 08:50:41,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 08:50:41,138 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-07-25 08:50:41,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:41,138 INFO L225 Difference]: With dead ends: 19 [2018-07-25 08:50:41,139 INFO L226 Difference]: Without dead ends: 18 [2018-07-25 08:50:41,140 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-07-25 08:50:41,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-07-25 08:50:41,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-07-25 08:50:41,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-07-25 08:50:41,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-07-25 08:50:41,147 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-07-25 08:50:41,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:41,147 INFO L472 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-07-25 08:50:41,147 INFO L473 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-25 08:50:41,148 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-07-25 08:50:41,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-25 08:50:41,148 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:41,151 INFO L354 BasicCegarLoop]: trace histogram [15, 1, 1] [2018-07-25 08:50:41,152 INFO L415 AbstractCegarLoop]: === Iteration 16 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:41,152 INFO L82 PathProgramCache]: Analyzing trace with hash 42362401, now seen corresponding path program 15 times [2018-07-25 08:50:41,152 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:41,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:41,272 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:41,272 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:41,273 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-07-25 08:50:41,273 INFO L451 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-25 08:50:41,277 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-25 08:50:41,277 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-07-25 08:50:41,277 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 18 states. [2018-07-25 08:50:41,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:41,340 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-07-25 08:50:41,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-25 08:50:41,340 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2018-07-25 08:50:41,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:41,341 INFO L225 Difference]: With dead ends: 20 [2018-07-25 08:50:41,341 INFO L226 Difference]: Without dead ends: 19 [2018-07-25 08:50:41,343 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-07-25 08:50:41,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-07-25 08:50:41,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-07-25 08:50:41,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-07-25 08:50:41,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-07-25 08:50:41,349 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-07-25 08:50:41,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:41,350 INFO L472 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-07-25 08:50:41,350 INFO L473 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-25 08:50:41,352 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-07-25 08:50:41,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 08:50:41,353 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:41,353 INFO L354 BasicCegarLoop]: trace histogram [16, 1, 1] [2018-07-25 08:50:41,353 INFO L415 AbstractCegarLoop]: === Iteration 17 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:41,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234375, now seen corresponding path program 16 times [2018-07-25 08:50:41,354 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:41,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:41,459 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:41,459 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:41,459 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-07-25 08:50:41,460 INFO L451 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-07-25 08:50:41,460 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-07-25 08:50:41,460 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-07-25 08:50:41,461 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 19 states. [2018-07-25 08:50:41,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:41,533 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-07-25 08:50:41,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-25 08:50:41,533 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2018-07-25 08:50:41,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:41,534 INFO L225 Difference]: With dead ends: 21 [2018-07-25 08:50:41,534 INFO L226 Difference]: Without dead ends: 20 [2018-07-25 08:50:41,535 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-07-25 08:50:41,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-07-25 08:50:41,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-07-25 08:50:41,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-07-25 08:50:41,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-07-25 08:50:41,540 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-07-25 08:50:41,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:41,541 INFO L472 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-07-25 08:50:41,541 INFO L473 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-07-25 08:50:41,541 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-07-25 08:50:41,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-25 08:50:41,543 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:41,543 INFO L354 BasicCegarLoop]: trace histogram [17, 1, 1] [2018-07-25 08:50:41,543 INFO L415 AbstractCegarLoop]: === Iteration 18 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:41,544 INFO L82 PathProgramCache]: Analyzing trace with hash 2055559905, now seen corresponding path program 17 times [2018-07-25 08:50:41,544 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:41,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:41,642 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:41,642 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:41,642 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-07-25 08:50:41,643 INFO L451 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-07-25 08:50:41,643 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-07-25 08:50:41,647 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-07-25 08:50:41,648 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 20 states. [2018-07-25 08:50:41,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:41,728 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-07-25 08:50:41,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-25 08:50:41,728 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2018-07-25 08:50:41,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:41,729 INFO L225 Difference]: With dead ends: 22 [2018-07-25 08:50:41,729 INFO L226 Difference]: Without dead ends: 21 [2018-07-25 08:50:41,730 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-07-25 08:50:41,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-07-25 08:50:41,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-07-25 08:50:41,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-07-25 08:50:41,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-07-25 08:50:41,737 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-07-25 08:50:41,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:41,738 INFO L472 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-07-25 08:50:41,738 INFO L473 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-07-25 08:50:41,738 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-07-25 08:50:41,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 08:50:41,739 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:41,739 INFO L354 BasicCegarLoop]: trace histogram [18, 1, 1] [2018-07-25 08:50:41,740 INFO L415 AbstractCegarLoop]: === Iteration 19 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:41,741 INFO L82 PathProgramCache]: Analyzing trace with hash -702152441, now seen corresponding path program 18 times [2018-07-25 08:50:41,741 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:41,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:41,864 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:41,864 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:41,864 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-07-25 08:50:41,865 INFO L451 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-07-25 08:50:41,865 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-07-25 08:50:41,865 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-07-25 08:50:41,866 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 21 states. [2018-07-25 08:50:41,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:41,957 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-07-25 08:50:41,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-25 08:50:41,957 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2018-07-25 08:50:41,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:41,958 INFO L225 Difference]: With dead ends: 23 [2018-07-25 08:50:41,958 INFO L226 Difference]: Without dead ends: 22 [2018-07-25 08:50:41,959 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-07-25 08:50:41,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-07-25 08:50:41,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-07-25 08:50:41,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-07-25 08:50:41,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-07-25 08:50:41,965 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-07-25 08:50:41,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:41,970 INFO L472 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-07-25 08:50:41,971 INFO L473 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-07-25 08:50:41,971 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-07-25 08:50:41,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-25 08:50:41,972 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:41,972 INFO L354 BasicCegarLoop]: trace histogram [19, 1, 1] [2018-07-25 08:50:41,972 INFO L415 AbstractCegarLoop]: === Iteration 20 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:41,972 INFO L82 PathProgramCache]: Analyzing trace with hash -291889247, now seen corresponding path program 19 times [2018-07-25 08:50:41,973 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:41,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:42,092 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:42,093 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:42,093 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-07-25 08:50:42,093 INFO L451 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-07-25 08:50:42,094 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-07-25 08:50:42,094 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-07-25 08:50:42,094 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 22 states. [2018-07-25 08:50:42,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:42,191 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-07-25 08:50:42,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-25 08:50:42,191 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2018-07-25 08:50:42,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:42,192 INFO L225 Difference]: With dead ends: 24 [2018-07-25 08:50:42,193 INFO L226 Difference]: Without dead ends: 23 [2018-07-25 08:50:42,194 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-07-25 08:50:42,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-07-25 08:50:42,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-07-25 08:50:42,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-07-25 08:50:42,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-07-25 08:50:42,203 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-07-25 08:50:42,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:42,203 INFO L472 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-07-25 08:50:42,204 INFO L473 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-07-25 08:50:42,204 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-07-25 08:50:42,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-25 08:50:42,204 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:42,205 INFO L354 BasicCegarLoop]: trace histogram [20, 1, 1] [2018-07-25 08:50:42,205 INFO L415 AbstractCegarLoop]: === Iteration 21 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:42,205 INFO L82 PathProgramCache]: Analyzing trace with hash -458632121, now seen corresponding path program 20 times [2018-07-25 08:50:42,205 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:42,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:42,323 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:42,324 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:42,324 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-07-25 08:50:42,325 INFO L451 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-07-25 08:50:42,325 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-07-25 08:50:42,327 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-07-25 08:50:42,328 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 23 states. [2018-07-25 08:50:42,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:42,426 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-07-25 08:50:42,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-25 08:50:42,427 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2018-07-25 08:50:42,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:42,428 INFO L225 Difference]: With dead ends: 25 [2018-07-25 08:50:42,428 INFO L226 Difference]: Without dead ends: 24 [2018-07-25 08:50:42,429 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-07-25 08:50:42,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-07-25 08:50:42,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-07-25 08:50:42,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-07-25 08:50:42,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-07-25 08:50:42,434 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-07-25 08:50:42,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:42,434 INFO L472 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-07-25 08:50:42,434 INFO L473 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-07-25 08:50:42,434 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-07-25 08:50:42,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-25 08:50:42,435 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:42,435 INFO L354 BasicCegarLoop]: trace histogram [21, 1, 1] [2018-07-25 08:50:42,435 INFO L415 AbstractCegarLoop]: === Iteration 22 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:42,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693919, now seen corresponding path program 21 times [2018-07-25 08:50:42,436 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:42,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:42,561 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:42,561 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:42,562 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-07-25 08:50:42,562 INFO L451 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-07-25 08:50:42,562 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-07-25 08:50:42,563 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-07-25 08:50:42,563 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 24 states. [2018-07-25 08:50:42,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:42,663 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-07-25 08:50:42,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 08:50:42,663 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2018-07-25 08:50:42,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:42,664 INFO L225 Difference]: With dead ends: 26 [2018-07-25 08:50:42,664 INFO L226 Difference]: Without dead ends: 25 [2018-07-25 08:50:42,665 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-07-25 08:50:42,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-07-25 08:50:42,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-07-25 08:50:42,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-07-25 08:50:42,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-07-25 08:50:42,669 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-07-25 08:50:42,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:42,670 INFO L472 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-07-25 08:50:42,670 INFO L473 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-07-25 08:50:42,670 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-07-25 08:50:42,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-07-25 08:50:42,671 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:42,671 INFO L354 BasicCegarLoop]: trace histogram [22, 1, 1] [2018-07-25 08:50:42,671 INFO L415 AbstractCegarLoop]: === Iteration 23 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:42,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161415, now seen corresponding path program 22 times [2018-07-25 08:50:42,672 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:42,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:42,795 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:42,796 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:42,796 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-07-25 08:50:42,796 INFO L451 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-07-25 08:50:42,796 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-07-25 08:50:42,797 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-07-25 08:50:42,797 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 25 states. [2018-07-25 08:50:42,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:42,902 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-07-25 08:50:42,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-25 08:50:42,902 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2018-07-25 08:50:42,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:42,903 INFO L225 Difference]: With dead ends: 27 [2018-07-25 08:50:42,903 INFO L226 Difference]: Without dead ends: 26 [2018-07-25 08:50:42,904 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-07-25 08:50:42,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-07-25 08:50:42,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-07-25 08:50:42,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-07-25 08:50:42,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-07-25 08:50:42,909 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-07-25 08:50:42,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:42,909 INFO L472 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-07-25 08:50:42,909 INFO L473 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-07-25 08:50:42,909 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-07-25 08:50:42,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-25 08:50:42,910 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:42,910 INFO L354 BasicCegarLoop]: trace histogram [23, 1, 1] [2018-07-25 08:50:42,911 INFO L415 AbstractCegarLoop]: === Iteration 24 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:42,911 INFO L82 PathProgramCache]: Analyzing trace with hash -818603743, now seen corresponding path program 23 times [2018-07-25 08:50:42,911 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:42,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:43,043 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:43,043 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:43,043 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-07-25 08:50:43,044 INFO L451 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-07-25 08:50:43,044 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-07-25 08:50:43,044 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-07-25 08:50:43,045 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 26 states. [2018-07-25 08:50:43,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:43,165 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-07-25 08:50:43,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-25 08:50:43,166 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2018-07-25 08:50:43,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:43,166 INFO L225 Difference]: With dead ends: 28 [2018-07-25 08:50:43,167 INFO L226 Difference]: Without dead ends: 27 [2018-07-25 08:50:43,167 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-07-25 08:50:43,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-07-25 08:50:43,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-07-25 08:50:43,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-07-25 08:50:43,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-07-25 08:50:43,172 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-07-25 08:50:43,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:43,174 INFO L472 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-07-25 08:50:43,174 INFO L473 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-07-25 08:50:43,174 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-07-25 08:50:43,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-07-25 08:50:43,175 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:43,175 INFO L354 BasicCegarLoop]: trace histogram [24, 1, 1] [2018-07-25 08:50:43,175 INFO L415 AbstractCegarLoop]: === Iteration 25 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:43,176 INFO L82 PathProgramCache]: Analyzing trace with hash 393087687, now seen corresponding path program 24 times [2018-07-25 08:50:43,176 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:43,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:43,380 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:43,381 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:43,381 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-07-25 08:50:43,382 INFO L451 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-07-25 08:50:43,382 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-07-25 08:50:43,382 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-07-25 08:50:43,382 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 27 states. [2018-07-25 08:50:43,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:43,490 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-07-25 08:50:43,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-25 08:50:43,490 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 26 [2018-07-25 08:50:43,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:43,491 INFO L225 Difference]: With dead ends: 29 [2018-07-25 08:50:43,491 INFO L226 Difference]: Without dead ends: 28 [2018-07-25 08:50:43,491 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-07-25 08:50:43,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-07-25 08:50:43,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-07-25 08:50:43,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-07-25 08:50:43,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-07-25 08:50:43,503 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-07-25 08:50:43,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:43,503 INFO L472 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-07-25 08:50:43,503 INFO L473 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-07-25 08:50:43,503 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-07-25 08:50:43,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-07-25 08:50:43,504 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:43,504 INFO L354 BasicCegarLoop]: trace histogram [25, 1, 1] [2018-07-25 08:50:43,504 INFO L415 AbstractCegarLoop]: === Iteration 26 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:43,505 INFO L82 PathProgramCache]: Analyzing trace with hash -699183647, now seen corresponding path program 25 times [2018-07-25 08:50:43,505 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:43,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:43,640 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:43,640 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:43,640 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-07-25 08:50:43,640 INFO L451 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-07-25 08:50:43,641 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-07-25 08:50:43,641 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-07-25 08:50:43,642 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 28 states. [2018-07-25 08:50:43,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:43,752 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-07-25 08:50:43,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-25 08:50:43,752 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2018-07-25 08:50:43,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:43,753 INFO L225 Difference]: With dead ends: 30 [2018-07-25 08:50:43,753 INFO L226 Difference]: Without dead ends: 29 [2018-07-25 08:50:43,754 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-07-25 08:50:43,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-07-25 08:50:43,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-07-25 08:50:43,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-07-25 08:50:43,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-07-25 08:50:43,761 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-07-25 08:50:43,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:43,761 INFO L472 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-07-25 08:50:43,761 INFO L473 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-07-25 08:50:43,761 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-07-25 08:50:43,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-07-25 08:50:43,762 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:43,762 INFO L354 BasicCegarLoop]: trace histogram [26, 1, 1] [2018-07-25 08:50:43,763 INFO L415 AbstractCegarLoop]: === Iteration 27 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:43,763 INFO L82 PathProgramCache]: Analyzing trace with hash -199856633, now seen corresponding path program 26 times [2018-07-25 08:50:43,763 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:43,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:43,905 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:43,906 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:43,906 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-07-25 08:50:43,906 INFO L451 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-07-25 08:50:43,907 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-07-25 08:50:43,907 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-07-25 08:50:43,908 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 29 states. [2018-07-25 08:50:44,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:44,029 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-07-25 08:50:44,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-25 08:50:44,029 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 28 [2018-07-25 08:50:44,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:44,030 INFO L225 Difference]: With dead ends: 31 [2018-07-25 08:50:44,030 INFO L226 Difference]: Without dead ends: 30 [2018-07-25 08:50:44,031 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-07-25 08:50:44,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-07-25 08:50:44,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-07-25 08:50:44,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-07-25 08:50:44,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-07-25 08:50:44,036 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-07-25 08:50:44,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:44,036 INFO L472 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-07-25 08:50:44,036 INFO L473 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-07-25 08:50:44,037 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-07-25 08:50:44,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-07-25 08:50:44,037 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:44,037 INFO L354 BasicCegarLoop]: trace histogram [27, 1, 1] [2018-07-25 08:50:44,038 INFO L415 AbstractCegarLoop]: === Iteration 28 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:44,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588383, now seen corresponding path program 27 times [2018-07-25 08:50:44,038 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:44,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:44,194 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:44,195 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:44,195 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-07-25 08:50:44,195 INFO L451 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-07-25 08:50:44,195 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-07-25 08:50:44,196 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-07-25 08:50:44,196 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 30 states. [2018-07-25 08:50:44,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:44,325 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-07-25 08:50:44,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-25 08:50:44,325 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 [2018-07-25 08:50:44,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:44,326 INFO L225 Difference]: With dead ends: 32 [2018-07-25 08:50:44,326 INFO L226 Difference]: Without dead ends: 31 [2018-07-25 08:50:44,327 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-07-25 08:50:44,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-07-25 08:50:44,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-07-25 08:50:44,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-07-25 08:50:44,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-07-25 08:50:44,334 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-07-25 08:50:44,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:44,335 INFO L472 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-07-25 08:50:44,335 INFO L473 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-07-25 08:50:44,335 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-07-25 08:50:44,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-07-25 08:50:44,335 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:44,335 INFO L354 BasicCegarLoop]: trace histogram [28, 1, 1] [2018-07-25 08:50:44,336 INFO L415 AbstractCegarLoop]: === Iteration 29 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:44,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302215, now seen corresponding path program 28 times [2018-07-25 08:50:44,336 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:44,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:44,498 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:44,498 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:44,498 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-07-25 08:50:44,498 INFO L451 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-07-25 08:50:44,499 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-07-25 08:50:44,499 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-07-25 08:50:44,500 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 31 states. [2018-07-25 08:50:44,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:44,645 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-07-25 08:50:44,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-25 08:50:44,645 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 30 [2018-07-25 08:50:44,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:44,646 INFO L225 Difference]: With dead ends: 33 [2018-07-25 08:50:44,646 INFO L226 Difference]: Without dead ends: 32 [2018-07-25 08:50:44,647 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-07-25 08:50:44,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-07-25 08:50:44,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-07-25 08:50:44,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-07-25 08:50:44,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-07-25 08:50:44,659 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-07-25 08:50:44,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:44,659 INFO L472 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-07-25 08:50:44,659 INFO L473 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-07-25 08:50:44,662 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-07-25 08:50:44,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-07-25 08:50:44,662 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:44,662 INFO L354 BasicCegarLoop]: trace histogram [29, 1, 1] [2018-07-25 08:50:44,663 INFO L415 AbstractCegarLoop]: === Iteration 30 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:44,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1104337055, now seen corresponding path program 29 times [2018-07-25 08:50:44,663 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:44,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:44,833 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:44,834 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:44,834 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-07-25 08:50:44,834 INFO L451 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-07-25 08:50:44,834 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-07-25 08:50:44,835 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-07-25 08:50:44,835 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 32 states. [2018-07-25 08:50:44,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:44,986 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-07-25 08:50:44,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-07-25 08:50:44,986 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 31 [2018-07-25 08:50:44,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:44,987 INFO L225 Difference]: With dead ends: 34 [2018-07-25 08:50:44,987 INFO L226 Difference]: Without dead ends: 33 [2018-07-25 08:50:44,989 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-07-25 08:50:44,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-07-25 08:50:44,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-07-25 08:50:44,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-07-25 08:50:44,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-07-25 08:50:44,993 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-07-25 08:50:44,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:44,993 INFO L472 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-07-25 08:50:44,993 INFO L473 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-07-25 08:50:44,994 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-07-25 08:50:44,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-07-25 08:50:44,994 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:44,994 INFO L354 BasicCegarLoop]: trace histogram [30, 1, 1] [2018-07-25 08:50:44,995 INFO L415 AbstractCegarLoop]: === Iteration 31 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:44,995 INFO L82 PathProgramCache]: Analyzing trace with hash 125289607, now seen corresponding path program 30 times [2018-07-25 08:50:44,995 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:45,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:45,167 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:45,168 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:45,168 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-07-25 08:50:45,168 INFO L451 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-07-25 08:50:45,169 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-07-25 08:50:45,169 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 08:50:45,169 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 33 states. [2018-07-25 08:50:45,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:45,330 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-07-25 08:50:45,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-25 08:50:45,330 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 32 [2018-07-25 08:50:45,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:45,331 INFO L225 Difference]: With dead ends: 35 [2018-07-25 08:50:45,331 INFO L226 Difference]: Without dead ends: 34 [2018-07-25 08:50:45,332 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 08:50:45,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-07-25 08:50:45,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-07-25 08:50:45,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-07-25 08:50:45,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-07-25 08:50:45,335 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-07-25 08:50:45,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:45,336 INFO L472 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-07-25 08:50:45,336 INFO L473 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-07-25 08:50:45,336 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-07-25 08:50:45,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-07-25 08:50:45,336 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:45,337 INFO L354 BasicCegarLoop]: trace histogram [31, 1, 1] [2018-07-25 08:50:45,337 INFO L415 AbstractCegarLoop]: === Iteration 32 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:45,337 INFO L82 PathProgramCache]: Analyzing trace with hash -410989535, now seen corresponding path program 31 times [2018-07-25 08:50:45,337 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:45,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:45,524 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:45,525 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:45,525 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-07-25 08:50:45,525 INFO L451 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-07-25 08:50:45,526 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-07-25 08:50:45,527 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 08:50:45,527 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 34 states. [2018-07-25 08:50:45,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:45,687 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-07-25 08:50:45,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-25 08:50:45,687 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 33 [2018-07-25 08:50:45,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:45,688 INFO L225 Difference]: With dead ends: 36 [2018-07-25 08:50:45,688 INFO L226 Difference]: Without dead ends: 35 [2018-07-25 08:50:45,689 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 08:50:45,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-07-25 08:50:45,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-07-25 08:50:45,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-07-25 08:50:45,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-07-25 08:50:45,693 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-07-25 08:50:45,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:45,693 INFO L472 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-07-25 08:50:45,693 INFO L473 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-07-25 08:50:45,693 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-07-25 08:50:45,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-07-25 08:50:45,694 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:45,694 INFO L354 BasicCegarLoop]: trace histogram [32, 1, 1] [2018-07-25 08:50:45,694 INFO L415 AbstractCegarLoop]: === Iteration 33 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:45,694 INFO L82 PathProgramCache]: Analyzing trace with hash 144226247, now seen corresponding path program 32 times [2018-07-25 08:50:45,694 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:45,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:45,892 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:45,892 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:45,893 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-07-25 08:50:45,893 INFO L451 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-07-25 08:50:45,893 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-07-25 08:50:45,894 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 08:50:45,894 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 35 states. [2018-07-25 08:50:46,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:46,080 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-07-25 08:50:46,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-25 08:50:46,081 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 34 [2018-07-25 08:50:46,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:46,081 INFO L225 Difference]: With dead ends: 37 [2018-07-25 08:50:46,082 INFO L226 Difference]: Without dead ends: 36 [2018-07-25 08:50:46,083 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 08:50:46,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-07-25 08:50:46,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-07-25 08:50:46,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-07-25 08:50:46,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-07-25 08:50:46,096 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-07-25 08:50:46,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:46,096 INFO L472 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-07-25 08:50:46,096 INFO L473 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-07-25 08:50:46,097 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-07-25 08:50:46,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-07-25 08:50:46,097 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:46,098 INFO L354 BasicCegarLoop]: trace histogram [33, 1, 1] [2018-07-25 08:50:46,098 INFO L415 AbstractCegarLoop]: === Iteration 34 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:46,098 INFO L82 PathProgramCache]: Analyzing trace with hash 176046305, now seen corresponding path program 33 times [2018-07-25 08:50:46,099 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:46,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:46,339 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:46,339 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:46,339 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-07-25 08:50:46,340 INFO L451 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-07-25 08:50:46,340 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-07-25 08:50:46,341 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-07-25 08:50:46,341 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 36 states. [2018-07-25 08:50:46,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:46,503 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-07-25 08:50:46,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-07-25 08:50:46,503 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 35 [2018-07-25 08:50:46,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:46,504 INFO L225 Difference]: With dead ends: 38 [2018-07-25 08:50:46,504 INFO L226 Difference]: Without dead ends: 37 [2018-07-25 08:50:46,505 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-07-25 08:50:46,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-07-25 08:50:46,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-07-25 08:50:46,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-07-25 08:50:46,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-07-25 08:50:46,509 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-07-25 08:50:46,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:46,509 INFO L472 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-07-25 08:50:46,509 INFO L473 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-07-25 08:50:46,510 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-07-25 08:50:46,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-07-25 08:50:46,510 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:46,510 INFO L354 BasicCegarLoop]: trace histogram [34, 1, 1] [2018-07-25 08:50:46,510 INFO L415 AbstractCegarLoop]: === Iteration 35 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:46,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468103, now seen corresponding path program 34 times [2018-07-25 08:50:46,511 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:46,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:46,692 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:46,692 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:46,692 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-07-25 08:50:46,692 INFO L451 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-07-25 08:50:46,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-07-25 08:50:46,693 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 08:50:46,693 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 37 states. [2018-07-25 08:50:46,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:46,862 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-07-25 08:50:46,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-07-25 08:50:46,862 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 36 [2018-07-25 08:50:46,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:46,863 INFO L225 Difference]: With dead ends: 39 [2018-07-25 08:50:46,863 INFO L226 Difference]: Without dead ends: 38 [2018-07-25 08:50:46,864 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 08:50:46,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-07-25 08:50:46,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-07-25 08:50:46,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-07-25 08:50:46,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-07-25 08:50:46,867 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-07-25 08:50:46,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:46,867 INFO L472 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-07-25 08:50:46,868 INFO L473 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-07-25 08:50:46,868 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-07-25 08:50:46,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-07-25 08:50:46,868 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:46,868 INFO L354 BasicCegarLoop]: trace histogram [35, 1, 1] [2018-07-25 08:50:46,868 INFO L415 AbstractCegarLoop]: === Iteration 36 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:46,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772769, now seen corresponding path program 35 times [2018-07-25 08:50:46,869 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:46,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:47,039 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:47,039 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:47,039 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-07-25 08:50:47,040 INFO L451 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-07-25 08:50:47,040 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-07-25 08:50:47,041 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-07-25 08:50:47,041 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 38 states. [2018-07-25 08:50:47,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:47,212 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-07-25 08:50:47,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-07-25 08:50:47,212 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 37 [2018-07-25 08:50:47,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:47,212 INFO L225 Difference]: With dead ends: 40 [2018-07-25 08:50:47,213 INFO L226 Difference]: Without dead ends: 39 [2018-07-25 08:50:47,213 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-07-25 08:50:47,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-07-25 08:50:47,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-07-25 08:50:47,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-07-25 08:50:47,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-07-25 08:50:47,217 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-07-25 08:50:47,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:47,217 INFO L472 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-07-25 08:50:47,217 INFO L473 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-07-25 08:50:47,217 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-07-25 08:50:47,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-07-25 08:50:47,218 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:47,218 INFO L354 BasicCegarLoop]: trace histogram [36, 1, 1] [2018-07-25 08:50:47,218 INFO L415 AbstractCegarLoop]: === Iteration 37 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:47,218 INFO L82 PathProgramCache]: Analyzing trace with hash 440348231, now seen corresponding path program 36 times [2018-07-25 08:50:47,219 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:47,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:47,387 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:47,388 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:47,388 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-07-25 08:50:47,388 INFO L451 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-07-25 08:50:47,388 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-07-25 08:50:47,389 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-07-25 08:50:47,389 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 39 states. [2018-07-25 08:50:47,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:47,565 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-07-25 08:50:47,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-07-25 08:50:47,566 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 38 [2018-07-25 08:50:47,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:47,566 INFO L225 Difference]: With dead ends: 41 [2018-07-25 08:50:47,566 INFO L226 Difference]: Without dead ends: 40 [2018-07-25 08:50:47,567 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-07-25 08:50:47,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-07-25 08:50:47,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-07-25 08:50:47,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-07-25 08:50:47,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-07-25 08:50:47,571 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-07-25 08:50:47,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:47,571 INFO L472 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-07-25 08:50:47,571 INFO L473 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-07-25 08:50:47,571 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-07-25 08:50:47,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-07-25 08:50:47,572 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:47,572 INFO L354 BasicCegarLoop]: trace histogram [37, 1, 1] [2018-07-25 08:50:47,572 INFO L415 AbstractCegarLoop]: === Iteration 38 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:47,572 INFO L82 PathProgramCache]: Analyzing trace with hash 765893217, now seen corresponding path program 37 times [2018-07-25 08:50:47,573 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:47,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:47,743 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:47,743 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:47,743 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-07-25 08:50:47,743 INFO L451 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-07-25 08:50:47,744 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-07-25 08:50:47,744 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-07-25 08:50:47,745 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 40 states. [2018-07-25 08:50:47,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:47,968 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-07-25 08:50:47,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-07-25 08:50:47,968 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 39 [2018-07-25 08:50:47,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:47,969 INFO L225 Difference]: With dead ends: 42 [2018-07-25 08:50:47,969 INFO L226 Difference]: Without dead ends: 41 [2018-07-25 08:50:47,970 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-07-25 08:50:47,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-07-25 08:50:47,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-07-25 08:50:47,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-07-25 08:50:47,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-07-25 08:50:47,975 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-07-25 08:50:47,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:47,975 INFO L472 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-07-25 08:50:47,975 INFO L473 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-07-25 08:50:47,975 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-07-25 08:50:47,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-07-25 08:50:47,976 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:47,976 INFO L354 BasicCegarLoop]: trace histogram [38, 1, 1] [2018-07-25 08:50:47,976 INFO L415 AbstractCegarLoop]: === Iteration 39 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:47,976 INFO L82 PathProgramCache]: Analyzing trace with hash -2027114105, now seen corresponding path program 38 times [2018-07-25 08:50:47,977 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:47,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:48,172 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:48,172 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:48,172 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-07-25 08:50:48,173 INFO L451 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-07-25 08:50:48,173 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-07-25 08:50:48,174 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-07-25 08:50:48,174 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 41 states. [2018-07-25 08:50:48,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:48,361 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-07-25 08:50:48,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-07-25 08:50:48,361 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 40 [2018-07-25 08:50:48,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:48,362 INFO L225 Difference]: With dead ends: 43 [2018-07-25 08:50:48,362 INFO L226 Difference]: Without dead ends: 42 [2018-07-25 08:50:48,363 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-07-25 08:50:48,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-07-25 08:50:48,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-07-25 08:50:48,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-07-25 08:50:48,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-07-25 08:50:48,367 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-07-25 08:50:48,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:48,367 INFO L472 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-07-25 08:50:48,367 INFO L473 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-07-25 08:50:48,367 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-07-25 08:50:48,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-07-25 08:50:48,368 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:48,368 INFO L354 BasicCegarLoop]: trace histogram [39, 1, 1] [2018-07-25 08:50:48,368 INFO L415 AbstractCegarLoop]: === Iteration 40 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:48,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972129, now seen corresponding path program 39 times [2018-07-25 08:50:48,368 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:48,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:48,529 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:48,529 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:48,529 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-07-25 08:50:48,530 INFO L451 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-07-25 08:50:48,530 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-07-25 08:50:48,531 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-07-25 08:50:48,531 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 42 states. [2018-07-25 08:50:48,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:48,720 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-07-25 08:50:48,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-07-25 08:50:48,721 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 41 [2018-07-25 08:50:48,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:48,721 INFO L225 Difference]: With dead ends: 44 [2018-07-25 08:50:48,721 INFO L226 Difference]: Without dead ends: 43 [2018-07-25 08:50:48,723 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-07-25 08:50:48,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-07-25 08:50:48,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-07-25 08:50:48,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-07-25 08:50:48,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-07-25 08:50:48,727 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-07-25 08:50:48,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:48,727 INFO L472 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-07-25 08:50:48,727 INFO L473 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-07-25 08:50:48,727 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-07-25 08:50:48,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-07-25 08:50:48,728 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:48,728 INFO L354 BasicCegarLoop]: trace histogram [40, 1, 1] [2018-07-25 08:50:48,728 INFO L415 AbstractCegarLoop]: === Iteration 41 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:48,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495687, now seen corresponding path program 40 times [2018-07-25 08:50:48,729 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:48,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:48,942 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:48,942 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:48,943 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-07-25 08:50:48,943 INFO L451 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-07-25 08:50:48,943 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-07-25 08:50:48,944 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-07-25 08:50:48,945 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 43 states. [2018-07-25 08:50:49,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:49,161 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-07-25 08:50:49,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-07-25 08:50:49,161 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 42 [2018-07-25 08:50:49,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:49,162 INFO L225 Difference]: With dead ends: 45 [2018-07-25 08:50:49,162 INFO L226 Difference]: Without dead ends: 44 [2018-07-25 08:50:49,163 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-07-25 08:50:49,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-07-25 08:50:49,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-07-25 08:50:49,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-07-25 08:50:49,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-07-25 08:50:49,167 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-07-25 08:50:49,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:49,168 INFO L472 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-07-25 08:50:49,168 INFO L473 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-07-25 08:50:49,168 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-07-25 08:50:49,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-07-25 08:50:49,168 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:49,168 INFO L354 BasicCegarLoop]: trace histogram [41, 1, 1] [2018-07-25 08:50:49,169 INFO L415 AbstractCegarLoop]: === Iteration 42 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:49,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791393, now seen corresponding path program 41 times [2018-07-25 08:50:49,169 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:49,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:49,370 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:49,370 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:49,370 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-07-25 08:50:49,370 INFO L451 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-07-25 08:50:49,371 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-07-25 08:50:49,371 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-07-25 08:50:49,372 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 44 states. [2018-07-25 08:50:49,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:49,553 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-07-25 08:50:49,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-07-25 08:50:49,553 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 43 [2018-07-25 08:50:49,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:49,554 INFO L225 Difference]: With dead ends: 46 [2018-07-25 08:50:49,554 INFO L226 Difference]: Without dead ends: 45 [2018-07-25 08:50:49,555 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-07-25 08:50:49,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-07-25 08:50:49,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-07-25 08:50:49,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-07-25 08:50:49,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-07-25 08:50:49,559 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-07-25 08:50:49,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:49,559 INFO L472 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-07-25 08:50:49,559 INFO L473 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-07-25 08:50:49,559 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-07-25 08:50:49,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-07-25 08:50:49,560 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:49,560 INFO L354 BasicCegarLoop]: trace histogram [42, 1, 1] [2018-07-25 08:50:49,560 INFO L415 AbstractCegarLoop]: === Iteration 43 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:49,560 INFO L82 PathProgramCache]: Analyzing trace with hash -692041721, now seen corresponding path program 42 times [2018-07-25 08:50:49,560 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:49,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:49,720 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:49,721 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:49,721 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-07-25 08:50:49,721 INFO L451 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-07-25 08:50:49,721 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-07-25 08:50:49,722 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-07-25 08:50:49,722 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 45 states. [2018-07-25 08:50:49,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:49,910 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-07-25 08:50:49,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-07-25 08:50:49,910 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 44 [2018-07-25 08:50:49,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:49,911 INFO L225 Difference]: With dead ends: 47 [2018-07-25 08:50:49,911 INFO L226 Difference]: Without dead ends: 46 [2018-07-25 08:50:49,912 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-07-25 08:50:49,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-07-25 08:50:49,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-07-25 08:50:49,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-07-25 08:50:49,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-07-25 08:50:49,916 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-07-25 08:50:49,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:49,917 INFO L472 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-07-25 08:50:49,917 INFO L473 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-07-25 08:50:49,917 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-07-25 08:50:49,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-07-25 08:50:49,917 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:49,918 INFO L354 BasicCegarLoop]: trace histogram [43, 1, 1] [2018-07-25 08:50:49,918 INFO L415 AbstractCegarLoop]: === Iteration 44 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:49,918 INFO L82 PathProgramCache]: Analyzing trace with hash 21543073, now seen corresponding path program 43 times [2018-07-25 08:50:49,918 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:49,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:50,080 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:50,080 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:50,080 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-07-25 08:50:50,081 INFO L451 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-07-25 08:50:50,081 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-07-25 08:50:50,082 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-07-25 08:50:50,083 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 46 states. [2018-07-25 08:50:50,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:50,268 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-07-25 08:50:50,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-07-25 08:50:50,269 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 45 [2018-07-25 08:50:50,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:50,269 INFO L225 Difference]: With dead ends: 48 [2018-07-25 08:50:50,269 INFO L226 Difference]: Without dead ends: 47 [2018-07-25 08:50:50,270 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-07-25 08:50:50,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-07-25 08:50:50,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-07-25 08:50:50,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-07-25 08:50:50,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-07-25 08:50:50,274 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-07-25 08:50:50,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:50,275 INFO L472 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-07-25 08:50:50,275 INFO L473 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-07-25 08:50:50,275 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-07-25 08:50:50,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-07-25 08:50:50,275 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:50,275 INFO L354 BasicCegarLoop]: trace histogram [44, 1, 1] [2018-07-25 08:50:50,276 INFO L415 AbstractCegarLoop]: === Iteration 45 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:50,276 INFO L82 PathProgramCache]: Analyzing trace with hash 667835207, now seen corresponding path program 44 times [2018-07-25 08:50:50,276 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:50,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:50,433 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:50,433 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:50,434 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-07-25 08:50:50,434 INFO L451 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-07-25 08:50:50,434 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-07-25 08:50:50,435 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-07-25 08:50:50,435 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 47 states. [2018-07-25 08:50:50,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:50,621 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-07-25 08:50:50,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-07-25 08:50:50,621 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 46 [2018-07-25 08:50:50,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:50,622 INFO L225 Difference]: With dead ends: 49 [2018-07-25 08:50:50,622 INFO L226 Difference]: Without dead ends: 48 [2018-07-25 08:50:50,623 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-07-25 08:50:50,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-07-25 08:50:50,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-07-25 08:50:50,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-07-25 08:50:50,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-07-25 08:50:50,627 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-07-25 08:50:50,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:50,627 INFO L472 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-07-25 08:50:50,627 INFO L473 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-07-25 08:50:50,627 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-07-25 08:50:50,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-07-25 08:50:50,628 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:50,628 INFO L354 BasicCegarLoop]: trace histogram [45, 1, 1] [2018-07-25 08:50:50,628 INFO L415 AbstractCegarLoop]: === Iteration 46 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:50,628 INFO L82 PathProgramCache]: Analyzing trace with hash -771945119, now seen corresponding path program 45 times [2018-07-25 08:50:50,629 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:50,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:50,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:50,794 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:50,794 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-07-25 08:50:50,795 INFO L451 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-07-25 08:50:50,795 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-07-25 08:50:50,795 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-07-25 08:50:50,796 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 48 states. [2018-07-25 08:50:50,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:50,986 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-07-25 08:50:50,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-07-25 08:50:50,986 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 47 [2018-07-25 08:50:50,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:50,987 INFO L225 Difference]: With dead ends: 50 [2018-07-25 08:50:50,987 INFO L226 Difference]: Without dead ends: 49 [2018-07-25 08:50:50,988 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-07-25 08:50:50,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-07-25 08:50:50,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-07-25 08:50:50,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-07-25 08:50:50,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-07-25 08:50:50,992 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-07-25 08:50:50,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:50,992 INFO L472 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-07-25 08:50:50,992 INFO L473 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-07-25 08:50:50,992 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-07-25 08:50:50,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-07-25 08:50:50,993 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:50,993 INFO L354 BasicCegarLoop]: trace histogram [46, 1, 1] [2018-07-25 08:50:50,993 INFO L415 AbstractCegarLoop]: === Iteration 47 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:50,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1839505031, now seen corresponding path program 46 times [2018-07-25 08:50:50,994 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:50,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:51,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:51,166 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:51,166 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-07-25 08:50:51,166 INFO L451 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-07-25 08:50:51,166 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-07-25 08:50:51,167 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-07-25 08:50:51,167 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 49 states. [2018-07-25 08:50:51,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:51,370 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-07-25 08:50:51,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-07-25 08:50:51,371 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 48 [2018-07-25 08:50:51,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:51,371 INFO L225 Difference]: With dead ends: 51 [2018-07-25 08:50:51,372 INFO L226 Difference]: Without dead ends: 50 [2018-07-25 08:50:51,373 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-07-25 08:50:51,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-07-25 08:50:51,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-07-25 08:50:51,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-07-25 08:50:51,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-07-25 08:50:51,377 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-07-25 08:50:51,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:51,377 INFO L472 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-07-25 08:50:51,377 INFO L473 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-07-25 08:50:51,377 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-07-25 08:50:51,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-07-25 08:50:51,378 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:51,378 INFO L354 BasicCegarLoop]: trace histogram [47, 1, 1] [2018-07-25 08:50:51,378 INFO L415 AbstractCegarLoop]: === Iteration 48 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:51,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1190081057, now seen corresponding path program 47 times [2018-07-25 08:50:51,379 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:51,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:51,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:51,584 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:51,584 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-07-25 08:50:51,584 INFO L451 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-07-25 08:50:51,585 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-07-25 08:50:51,585 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-07-25 08:50:51,586 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 50 states. [2018-07-25 08:50:51,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:51,829 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-07-25 08:50:51,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-07-25 08:50:51,829 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 49 [2018-07-25 08:50:51,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:51,830 INFO L225 Difference]: With dead ends: 52 [2018-07-25 08:50:51,830 INFO L226 Difference]: Without dead ends: 51 [2018-07-25 08:50:51,831 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-07-25 08:50:51,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-07-25 08:50:51,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-07-25 08:50:51,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-07-25 08:50:51,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-07-25 08:50:51,836 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-07-25 08:50:51,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:51,836 INFO L472 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-07-25 08:50:51,836 INFO L473 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-07-25 08:50:51,836 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-07-25 08:50:51,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-07-25 08:50:51,837 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:51,837 INFO L354 BasicCegarLoop]: trace histogram [48, 1, 1] [2018-07-25 08:50:51,837 INFO L415 AbstractCegarLoop]: === Iteration 49 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:51,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1762192953, now seen corresponding path program 48 times [2018-07-25 08:50:51,838 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:51,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:52,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:52,064 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:52,065 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-07-25 08:50:52,065 INFO L451 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-07-25 08:50:52,065 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-07-25 08:50:52,065 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-07-25 08:50:52,066 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 51 states. [2018-07-25 08:50:52,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:52,211 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-07-25 08:50:52,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-07-25 08:50:52,211 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 50 [2018-07-25 08:50:52,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:52,212 INFO L225 Difference]: With dead ends: 53 [2018-07-25 08:50:52,212 INFO L226 Difference]: Without dead ends: 52 [2018-07-25 08:50:52,213 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-07-25 08:50:52,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-07-25 08:50:52,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-07-25 08:50:52,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-07-25 08:50:52,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-07-25 08:50:52,216 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-07-25 08:50:52,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:52,217 INFO L472 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-07-25 08:50:52,217 INFO L473 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-07-25 08:50:52,217 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-07-25 08:50:52,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-07-25 08:50:52,217 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:52,218 INFO L354 BasicCegarLoop]: trace histogram [49, 1, 1] [2018-07-25 08:50:52,218 INFO L415 AbstractCegarLoop]: === Iteration 50 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:52,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1206593249, now seen corresponding path program 49 times [2018-07-25 08:50:52,218 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:52,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:52,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:52,386 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:52,386 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-07-25 08:50:52,386 INFO L451 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-07-25 08:50:52,387 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-07-25 08:50:52,387 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-07-25 08:50:52,387 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 52 states. [2018-07-25 08:50:52,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:52,584 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-07-25 08:50:52,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-07-25 08:50:52,584 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 51 [2018-07-25 08:50:52,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:52,585 INFO L225 Difference]: With dead ends: 54 [2018-07-25 08:50:52,585 INFO L226 Difference]: Without dead ends: 53 [2018-07-25 08:50:52,586 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-07-25 08:50:52,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-07-25 08:50:52,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-07-25 08:50:52,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-07-25 08:50:52,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-07-25 08:50:52,590 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-07-25 08:50:52,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:52,590 INFO L472 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-07-25 08:50:52,590 INFO L473 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-07-25 08:50:52,590 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-07-25 08:50:52,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-07-25 08:50:52,591 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:52,591 INFO L354 BasicCegarLoop]: trace histogram [50, 1, 1] [2018-07-25 08:50:52,591 INFO L415 AbstractCegarLoop]: === Iteration 51 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:52,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1250315001, now seen corresponding path program 50 times [2018-07-25 08:50:52,591 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:52,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:52,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:52,779 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:52,779 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-07-25 08:50:52,779 INFO L451 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-07-25 08:50:52,780 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-07-25 08:50:52,780 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-07-25 08:50:52,780 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 53 states. [2018-07-25 08:50:52,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:52,977 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-07-25 08:50:52,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-07-25 08:50:52,977 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 52 [2018-07-25 08:50:52,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:52,978 INFO L225 Difference]: With dead ends: 55 [2018-07-25 08:50:52,978 INFO L226 Difference]: Without dead ends: 54 [2018-07-25 08:50:52,978 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-07-25 08:50:52,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-07-25 08:50:52,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-07-25 08:50:52,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-07-25 08:50:52,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-07-25 08:50:52,985 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-07-25 08:50:52,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:52,985 INFO L472 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-07-25 08:50:52,985 INFO L473 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-07-25 08:50:52,985 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-07-25 08:50:52,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-07-25 08:50:52,986 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:52,986 INFO L354 BasicCegarLoop]: trace histogram [51, 1, 1] [2018-07-25 08:50:52,986 INFO L415 AbstractCegarLoop]: === Iteration 52 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:52,986 INFO L82 PathProgramCache]: Analyzing trace with hash -105059423, now seen corresponding path program 51 times [2018-07-25 08:50:52,986 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:52,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:53,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:53,186 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:53,187 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-07-25 08:50:53,187 INFO L451 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-07-25 08:50:53,187 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-07-25 08:50:53,188 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-07-25 08:50:53,188 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 54 states. [2018-07-25 08:50:53,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:53,424 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-07-25 08:50:53,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-07-25 08:50:53,425 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 53 [2018-07-25 08:50:53,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:53,425 INFO L225 Difference]: With dead ends: 56 [2018-07-25 08:50:53,425 INFO L226 Difference]: Without dead ends: 55 [2018-07-25 08:50:53,426 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-07-25 08:50:53,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-07-25 08:50:53,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-07-25 08:50:53,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-07-25 08:50:53,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-07-25 08:50:53,429 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2018-07-25 08:50:53,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:53,430 INFO L472 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-07-25 08:50:53,430 INFO L473 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-07-25 08:50:53,430 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-07-25 08:50:53,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-07-25 08:50:53,430 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:53,431 INFO L354 BasicCegarLoop]: trace histogram [52, 1, 1] [2018-07-25 08:50:53,431 INFO L415 AbstractCegarLoop]: === Iteration 53 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:53,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1038125127, now seen corresponding path program 52 times [2018-07-25 08:50:53,431 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:53,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:53,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:53,632 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:53,632 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-07-25 08:50:53,632 INFO L451 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-07-25 08:50:53,632 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-07-25 08:50:53,633 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-07-25 08:50:53,633 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 55 states. [2018-07-25 08:50:53,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:53,872 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-07-25 08:50:53,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-07-25 08:50:53,873 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 54 [2018-07-25 08:50:53,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:53,873 INFO L225 Difference]: With dead ends: 57 [2018-07-25 08:50:53,873 INFO L226 Difference]: Without dead ends: 56 [2018-07-25 08:50:53,874 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-07-25 08:50:53,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-07-25 08:50:53,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-07-25 08:50:53,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-07-25 08:50:53,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-07-25 08:50:53,878 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2018-07-25 08:50:53,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:53,878 INFO L472 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-07-25 08:50:53,878 INFO L473 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-07-25 08:50:53,878 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-07-25 08:50:53,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-07-25 08:50:53,879 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:53,879 INFO L354 BasicCegarLoop]: trace histogram [53, 1, 1] [2018-07-25 08:50:53,879 INFO L415 AbstractCegarLoop]: === Iteration 54 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:53,879 INFO L82 PathProgramCache]: Analyzing trace with hash 2117107809, now seen corresponding path program 53 times [2018-07-25 08:50:53,879 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:53,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:54,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:54,101 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:54,101 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-07-25 08:50:54,101 INFO L451 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-07-25 08:50:54,101 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-07-25 08:50:54,102 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-07-25 08:50:54,102 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 56 states. [2018-07-25 08:50:54,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:54,373 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-07-25 08:50:54,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-07-25 08:50:54,374 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 55 [2018-07-25 08:50:54,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:54,374 INFO L225 Difference]: With dead ends: 58 [2018-07-25 08:50:54,374 INFO L226 Difference]: Without dead ends: 57 [2018-07-25 08:50:54,375 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-07-25 08:50:54,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-07-25 08:50:54,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-07-25 08:50:54,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-07-25 08:50:54,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-07-25 08:50:54,379 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2018-07-25 08:50:54,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:54,379 INFO L472 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-07-25 08:50:54,379 INFO L473 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-07-25 08:50:54,379 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-07-25 08:50:54,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-07-25 08:50:54,380 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:54,380 INFO L354 BasicCegarLoop]: trace histogram [54, 1, 1] [2018-07-25 08:50:54,380 INFO L415 AbstractCegarLoop]: === Iteration 55 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:54,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1205832583, now seen corresponding path program 54 times [2018-07-25 08:50:54,380 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:54,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:54,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:54,606 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:54,606 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-07-25 08:50:54,606 INFO L451 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-07-25 08:50:54,607 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-07-25 08:50:54,607 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-07-25 08:50:54,607 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 57 states. [2018-07-25 08:50:54,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:54,866 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-07-25 08:50:54,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-07-25 08:50:54,866 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 56 [2018-07-25 08:50:54,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:54,867 INFO L225 Difference]: With dead ends: 59 [2018-07-25 08:50:54,867 INFO L226 Difference]: Without dead ends: 58 [2018-07-25 08:50:54,868 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-07-25 08:50:54,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-07-25 08:50:54,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-07-25 08:50:54,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-07-25 08:50:54,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-07-25 08:50:54,872 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2018-07-25 08:50:54,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:54,872 INFO L472 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-07-25 08:50:54,872 INFO L473 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-07-25 08:50:54,872 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-07-25 08:50:54,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-07-25 08:50:54,873 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:54,873 INFO L354 BasicCegarLoop]: trace histogram [55, 1, 1] [2018-07-25 08:50:54,873 INFO L415 AbstractCegarLoop]: === Iteration 56 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:54,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1273895647, now seen corresponding path program 55 times [2018-07-25 08:50:54,874 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:54,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:55,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:55,102 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:55,102 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-07-25 08:50:55,103 INFO L451 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-07-25 08:50:55,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-07-25 08:50:55,103 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-07-25 08:50:55,104 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 58 states. [2018-07-25 08:50:55,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:55,361 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-07-25 08:50:55,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-07-25 08:50:55,361 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 57 [2018-07-25 08:50:55,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:55,362 INFO L225 Difference]: With dead ends: 60 [2018-07-25 08:50:55,362 INFO L226 Difference]: Without dead ends: 59 [2018-07-25 08:50:55,363 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-07-25 08:50:55,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-07-25 08:50:55,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-07-25 08:50:55,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-07-25 08:50:55,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-07-25 08:50:55,367 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2018-07-25 08:50:55,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:55,367 INFO L472 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-07-25 08:50:55,367 INFO L473 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-07-25 08:50:55,368 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-07-25 08:50:55,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-07-25 08:50:55,368 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:55,368 INFO L354 BasicCegarLoop]: trace histogram [56, 1, 1] [2018-07-25 08:50:55,370 INFO L415 AbstractCegarLoop]: === Iteration 57 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:55,371 INFO L82 PathProgramCache]: Analyzing trace with hash -836059449, now seen corresponding path program 56 times [2018-07-25 08:50:55,371 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:55,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:55,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:55,564 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:55,564 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-07-25 08:50:55,564 INFO L451 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-07-25 08:50:55,564 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-07-25 08:50:55,565 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-07-25 08:50:55,565 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 59 states. [2018-07-25 08:50:55,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:55,779 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-07-25 08:50:55,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-07-25 08:50:55,779 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 58 [2018-07-25 08:50:55,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:55,780 INFO L225 Difference]: With dead ends: 61 [2018-07-25 08:50:55,780 INFO L226 Difference]: Without dead ends: 60 [2018-07-25 08:50:55,781 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-07-25 08:50:55,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-07-25 08:50:55,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-07-25 08:50:55,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-07-25 08:50:55,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-07-25 08:50:55,784 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2018-07-25 08:50:55,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:55,785 INFO L472 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-07-25 08:50:55,785 INFO L473 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-07-25 08:50:55,785 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-07-25 08:50:55,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-07-25 08:50:55,785 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:55,785 INFO L354 BasicCegarLoop]: trace histogram [57, 1, 1] [2018-07-25 08:50:55,786 INFO L415 AbstractCegarLoop]: === Iteration 58 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:55,786 INFO L82 PathProgramCache]: Analyzing trace with hash -148039199, now seen corresponding path program 57 times [2018-07-25 08:50:55,786 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:55,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:55,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:55,995 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:55,995 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-07-25 08:50:55,995 INFO L451 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-07-25 08:50:55,996 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-07-25 08:50:55,996 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-07-25 08:50:55,997 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 60 states. [2018-07-25 08:50:56,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:56,185 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-07-25 08:50:56,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-07-25 08:50:56,185 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 59 [2018-07-25 08:50:56,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:56,186 INFO L225 Difference]: With dead ends: 62 [2018-07-25 08:50:56,186 INFO L226 Difference]: Without dead ends: 61 [2018-07-25 08:50:56,186 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-07-25 08:50:56,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-07-25 08:50:56,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-07-25 08:50:56,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-07-25 08:50:56,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-07-25 08:50:56,190 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2018-07-25 08:50:56,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:56,191 INFO L472 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-07-25 08:50:56,191 INFO L473 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-07-25 08:50:56,191 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-07-25 08:50:56,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-07-25 08:50:56,191 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:56,191 INFO L354 BasicCegarLoop]: trace histogram [58, 1, 1] [2018-07-25 08:50:56,192 INFO L415 AbstractCegarLoop]: === Iteration 59 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:56,192 INFO L82 PathProgramCache]: Analyzing trace with hash -294247929, now seen corresponding path program 58 times [2018-07-25 08:50:56,192 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:56,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:56,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:56,445 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:56,445 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-07-25 08:50:56,446 INFO L451 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-07-25 08:50:56,446 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-07-25 08:50:56,446 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-07-25 08:50:56,446 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 61 states. [2018-07-25 08:50:56,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:56,683 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-07-25 08:50:56,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-07-25 08:50:56,683 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 60 [2018-07-25 08:50:56,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:56,684 INFO L225 Difference]: With dead ends: 63 [2018-07-25 08:50:56,684 INFO L226 Difference]: Without dead ends: 62 [2018-07-25 08:50:56,685 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-07-25 08:50:56,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-07-25 08:50:56,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-07-25 08:50:56,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-07-25 08:50:56,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-07-25 08:50:56,690 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2018-07-25 08:50:56,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:56,690 INFO L472 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-07-25 08:50:56,690 INFO L473 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-07-25 08:50:56,690 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-07-25 08:50:56,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-07-25 08:50:56,691 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:56,691 INFO L354 BasicCegarLoop]: trace histogram [59, 1, 1] [2018-07-25 08:50:56,691 INFO L415 AbstractCegarLoop]: === Iteration 60 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:56,692 INFO L82 PathProgramCache]: Analyzing trace with hash -531751263, now seen corresponding path program 59 times [2018-07-25 08:50:56,692 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:56,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:56,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:56,998 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:56,998 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-07-25 08:50:56,998 INFO L451 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-07-25 08:50:56,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-07-25 08:50:56,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-07-25 08:50:56,999 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 62 states. [2018-07-25 08:50:57,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:57,188 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-07-25 08:50:57,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-07-25 08:50:57,188 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 61 [2018-07-25 08:50:57,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:57,189 INFO L225 Difference]: With dead ends: 64 [2018-07-25 08:50:57,189 INFO L226 Difference]: Without dead ends: 63 [2018-07-25 08:50:57,189 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-07-25 08:50:57,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-07-25 08:50:57,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-07-25 08:50:57,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-07-25 08:50:57,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-07-25 08:50:57,193 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2018-07-25 08:50:57,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:57,194 INFO L472 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-07-25 08:50:57,194 INFO L473 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-07-25 08:50:57,194 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-07-25 08:50:57,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-07-25 08:50:57,194 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:57,195 INFO L354 BasicCegarLoop]: trace histogram [60, 1, 1] [2018-07-25 08:50:57,195 INFO L415 AbstractCegarLoop]: === Iteration 61 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:57,195 INFO L82 PathProgramCache]: Analyzing trace with hash 695579975, now seen corresponding path program 60 times [2018-07-25 08:50:57,195 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:57,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:57,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:57,450 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:57,450 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-07-25 08:50:57,451 INFO L451 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-07-25 08:50:57,451 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-07-25 08:50:57,451 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-07-25 08:50:57,452 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 63 states. [2018-07-25 08:50:57,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:57,747 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-07-25 08:50:57,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-07-25 08:50:57,747 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 62 [2018-07-25 08:50:57,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:57,748 INFO L225 Difference]: With dead ends: 65 [2018-07-25 08:50:57,748 INFO L226 Difference]: Without dead ends: 64 [2018-07-25 08:50:57,749 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-07-25 08:50:57,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-07-25 08:50:57,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-07-25 08:50:57,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-07-25 08:50:57,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-07-25 08:50:57,753 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2018-07-25 08:50:57,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:57,753 INFO L472 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-07-25 08:50:57,753 INFO L473 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-07-25 08:50:57,754 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-07-25 08:50:57,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-07-25 08:50:57,754 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:57,754 INFO L354 BasicCegarLoop]: trace histogram [61, 1, 1] [2018-07-25 08:50:57,754 INFO L415 AbstractCegarLoop]: === Iteration 62 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:57,755 INFO L82 PathProgramCache]: Analyzing trace with hash 88142689, now seen corresponding path program 61 times [2018-07-25 08:50:57,755 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:57,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:58,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:58,053 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:58,054 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-07-25 08:50:58,054 INFO L451 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-07-25 08:50:58,054 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-07-25 08:50:58,055 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-07-25 08:50:58,055 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 64 states. [2018-07-25 08:50:58,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:58,280 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-07-25 08:50:58,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-07-25 08:50:58,281 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 63 [2018-07-25 08:50:58,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:58,281 INFO L225 Difference]: With dead ends: 66 [2018-07-25 08:50:58,281 INFO L226 Difference]: Without dead ends: 65 [2018-07-25 08:50:58,282 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-07-25 08:50:58,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-07-25 08:50:58,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-07-25 08:50:58,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-07-25 08:50:58,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-07-25 08:50:58,287 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2018-07-25 08:50:58,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:58,288 INFO L472 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-07-25 08:50:58,288 INFO L473 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-07-25 08:50:58,288 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-07-25 08:50:58,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-07-25 08:50:58,289 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:58,289 INFO L354 BasicCegarLoop]: trace histogram [62, 1, 1] [2018-07-25 08:50:58,289 INFO L415 AbstractCegarLoop]: === Iteration 63 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:58,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1562543993, now seen corresponding path program 62 times [2018-07-25 08:50:58,290 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:58,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:58,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:58,587 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:58,587 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-07-25 08:50:58,588 INFO L451 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-07-25 08:50:58,588 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-07-25 08:50:58,590 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-07-25 08:50:58,591 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 65 states. [2018-07-25 08:50:58,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:58,917 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-07-25 08:50:58,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-07-25 08:50:58,918 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 64 [2018-07-25 08:50:58,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:58,918 INFO L225 Difference]: With dead ends: 67 [2018-07-25 08:50:58,919 INFO L226 Difference]: Without dead ends: 66 [2018-07-25 08:50:58,919 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-07-25 08:50:58,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-07-25 08:50:58,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-07-25 08:50:58,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-07-25 08:50:58,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-07-25 08:50:58,924 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2018-07-25 08:50:58,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:58,924 INFO L472 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-07-25 08:50:58,924 INFO L473 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-07-25 08:50:58,924 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-07-25 08:50:58,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-07-25 08:50:58,925 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:58,925 INFO L354 BasicCegarLoop]: trace histogram [63, 1, 1] [2018-07-25 08:50:58,925 INFO L415 AbstractCegarLoop]: === Iteration 64 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:58,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1194223583, now seen corresponding path program 63 times [2018-07-25 08:50:58,926 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:58,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:59,157 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:59,158 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:59,158 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-07-25 08:50:59,158 INFO L451 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-07-25 08:50:59,158 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-07-25 08:50:59,159 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-07-25 08:50:59,159 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 66 states. [2018-07-25 08:50:59,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:59,421 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-07-25 08:50:59,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-07-25 08:50:59,421 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 65 [2018-07-25 08:50:59,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:59,422 INFO L225 Difference]: With dead ends: 68 [2018-07-25 08:50:59,422 INFO L226 Difference]: Without dead ends: 67 [2018-07-25 08:50:59,423 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-07-25 08:50:59,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-07-25 08:50:59,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-07-25 08:50:59,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-07-25 08:50:59,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-07-25 08:50:59,427 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2018-07-25 08:50:59,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:59,427 INFO L472 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-07-25 08:50:59,427 INFO L473 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-07-25 08:50:59,428 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-07-25 08:50:59,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-07-25 08:50:59,428 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:59,428 INFO L354 BasicCegarLoop]: trace histogram [64, 1, 1] [2018-07-25 08:50:59,429 INFO L415 AbstractCegarLoop]: === Iteration 65 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:59,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1633774535, now seen corresponding path program 64 times [2018-07-25 08:50:59,429 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:59,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:59,673 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:59,673 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:59,673 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-07-25 08:50:59,674 INFO L451 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-07-25 08:50:59,674 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-07-25 08:50:59,674 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-07-25 08:50:59,674 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 67 states. [2018-07-25 08:50:59,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:59,884 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-07-25 08:50:59,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-07-25 08:50:59,885 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 66 [2018-07-25 08:50:59,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:59,885 INFO L225 Difference]: With dead ends: 69 [2018-07-25 08:50:59,885 INFO L226 Difference]: Without dead ends: 68 [2018-07-25 08:50:59,886 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-07-25 08:50:59,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-07-25 08:50:59,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-07-25 08:50:59,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-07-25 08:50:59,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-07-25 08:50:59,889 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2018-07-25 08:50:59,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:59,890 INFO L472 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-07-25 08:50:59,890 INFO L473 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-07-25 08:50:59,890 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-07-25 08:50:59,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-07-25 08:50:59,891 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:59,891 INFO L354 BasicCegarLoop]: trace histogram [65, 1, 1] [2018-07-25 08:50:59,891 INFO L415 AbstractCegarLoop]: === Iteration 66 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:59,891 INFO L82 PathProgramCache]: Analyzing trace with hash -892597023, now seen corresponding path program 65 times [2018-07-25 08:50:59,891 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:59,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:00,102 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:00,102 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:00,103 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-07-25 08:51:00,103 INFO L451 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-07-25 08:51:00,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-07-25 08:51:00,103 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-07-25 08:51:00,104 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 68 states. [2018-07-25 08:51:00,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:00,325 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-07-25 08:51:00,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-07-25 08:51:00,325 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 67 [2018-07-25 08:51:00,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:00,326 INFO L225 Difference]: With dead ends: 70 [2018-07-25 08:51:00,326 INFO L226 Difference]: Without dead ends: 69 [2018-07-25 08:51:00,327 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-07-25 08:51:00,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-07-25 08:51:00,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-07-25 08:51:00,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-07-25 08:51:00,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-07-25 08:51:00,330 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2018-07-25 08:51:00,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:00,330 INFO L472 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-07-25 08:51:00,330 INFO L473 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-07-25 08:51:00,330 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-07-25 08:51:00,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-07-25 08:51:00,331 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:00,331 INFO L354 BasicCegarLoop]: trace histogram [66, 1, 1] [2018-07-25 08:51:00,331 INFO L415 AbstractCegarLoop]: === Iteration 67 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:00,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1900703993, now seen corresponding path program 66 times [2018-07-25 08:51:00,331 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:00,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:00,518 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:00,518 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:00,518 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-07-25 08:51:00,519 INFO L451 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-07-25 08:51:00,519 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-07-25 08:51:00,519 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-07-25 08:51:00,519 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 69 states. [2018-07-25 08:51:00,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:00,734 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-07-25 08:51:00,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-07-25 08:51:00,734 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 68 [2018-07-25 08:51:00,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:00,735 INFO L225 Difference]: With dead ends: 71 [2018-07-25 08:51:00,735 INFO L226 Difference]: Without dead ends: 70 [2018-07-25 08:51:00,736 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-07-25 08:51:00,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-07-25 08:51:00,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-07-25 08:51:00,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-07-25 08:51:00,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-07-25 08:51:00,740 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2018-07-25 08:51:00,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:00,740 INFO L472 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-07-25 08:51:00,740 INFO L473 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-07-25 08:51:00,740 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-07-25 08:51:00,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-07-25 08:51:00,741 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:00,741 INFO L354 BasicCegarLoop]: trace histogram [67, 1, 1] [2018-07-25 08:51:00,741 INFO L415 AbstractCegarLoop]: === Iteration 68 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:00,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1207718305, now seen corresponding path program 67 times [2018-07-25 08:51:00,741 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:00,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:00,955 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:00,955 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:00,955 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-07-25 08:51:00,956 INFO L451 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-07-25 08:51:00,956 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-07-25 08:51:00,956 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-07-25 08:51:00,956 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 70 states. [2018-07-25 08:51:01,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:01,194 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-07-25 08:51:01,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-07-25 08:51:01,194 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 69 [2018-07-25 08:51:01,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:01,195 INFO L225 Difference]: With dead ends: 72 [2018-07-25 08:51:01,195 INFO L226 Difference]: Without dead ends: 71 [2018-07-25 08:51:01,195 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-07-25 08:51:01,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-07-25 08:51:01,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-07-25 08:51:01,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-07-25 08:51:01,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-07-25 08:51:01,199 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2018-07-25 08:51:01,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:01,199 INFO L472 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-07-25 08:51:01,199 INFO L473 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-07-25 08:51:01,199 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-07-25 08:51:01,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-07-25 08:51:01,200 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:01,200 INFO L354 BasicCegarLoop]: trace histogram [68, 1, 1] [2018-07-25 08:51:01,200 INFO L415 AbstractCegarLoop]: === Iteration 69 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:01,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1215438265, now seen corresponding path program 68 times [2018-07-25 08:51:01,200 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:01,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:01,496 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:01,497 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:01,497 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-07-25 08:51:01,497 INFO L451 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-07-25 08:51:01,498 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-07-25 08:51:01,498 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-07-25 08:51:01,498 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 71 states. [2018-07-25 08:51:01,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:01,807 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-07-25 08:51:01,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-07-25 08:51:01,808 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 70 [2018-07-25 08:51:01,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:01,808 INFO L225 Difference]: With dead ends: 73 [2018-07-25 08:51:01,808 INFO L226 Difference]: Without dead ends: 72 [2018-07-25 08:51:01,808 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-07-25 08:51:01,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-07-25 08:51:01,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-07-25 08:51:01,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-07-25 08:51:01,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-07-25 08:51:01,812 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2018-07-25 08:51:01,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:01,812 INFO L472 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-07-25 08:51:01,812 INFO L473 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-07-25 08:51:01,812 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-07-25 08:51:01,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-07-25 08:51:01,813 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:01,813 INFO L354 BasicCegarLoop]: trace histogram [69, 1, 1] [2018-07-25 08:51:01,813 INFO L415 AbstractCegarLoop]: === Iteration 70 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:01,813 INFO L82 PathProgramCache]: Analyzing trace with hash 976119393, now seen corresponding path program 69 times [2018-07-25 08:51:01,814 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:01,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:02,033 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:02,033 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:02,033 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-07-25 08:51:02,034 INFO L451 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-07-25 08:51:02,034 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-07-25 08:51:02,034 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-07-25 08:51:02,034 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 72 states. [2018-07-25 08:51:02,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:02,287 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-07-25 08:51:02,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-07-25 08:51:02,287 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 71 [2018-07-25 08:51:02,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:02,287 INFO L225 Difference]: With dead ends: 74 [2018-07-25 08:51:02,287 INFO L226 Difference]: Without dead ends: 73 [2018-07-25 08:51:02,288 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-07-25 08:51:02,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-07-25 08:51:02,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-07-25 08:51:02,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-07-25 08:51:02,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-07-25 08:51:02,292 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2018-07-25 08:51:02,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:02,292 INFO L472 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-07-25 08:51:02,292 INFO L473 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-07-25 08:51:02,292 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-07-25 08:51:02,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-07-25 08:51:02,292 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:02,292 INFO L354 BasicCegarLoop]: trace histogram [70, 1, 1] [2018-07-25 08:51:02,293 INFO L415 AbstractCegarLoop]: === Iteration 71 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:02,293 INFO L82 PathProgramCache]: Analyzing trace with hash 194930055, now seen corresponding path program 70 times [2018-07-25 08:51:02,293 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:02,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:02,518 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:02,518 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:02,518 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-07-25 08:51:02,518 INFO L451 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-07-25 08:51:02,519 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-07-25 08:51:02,519 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-07-25 08:51:02,519 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 73 states. [2018-07-25 08:51:02,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:02,777 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-07-25 08:51:02,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-07-25 08:51:02,777 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 72 [2018-07-25 08:51:02,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:02,778 INFO L225 Difference]: With dead ends: 75 [2018-07-25 08:51:02,778 INFO L226 Difference]: Without dead ends: 74 [2018-07-25 08:51:02,779 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-07-25 08:51:02,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-07-25 08:51:02,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-07-25 08:51:02,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-07-25 08:51:02,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-07-25 08:51:02,783 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2018-07-25 08:51:02,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:02,784 INFO L472 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-07-25 08:51:02,784 INFO L473 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-07-25 08:51:02,784 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-07-25 08:51:02,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-07-25 08:51:02,784 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:02,784 INFO L354 BasicCegarLoop]: trace histogram [71, 1, 1] [2018-07-25 08:51:02,785 INFO L415 AbstractCegarLoop]: === Iteration 72 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:02,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1747864353, now seen corresponding path program 71 times [2018-07-25 08:51:02,785 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:02,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:03,017 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:03,017 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:03,017 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-07-25 08:51:03,018 INFO L451 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-07-25 08:51:03,018 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-07-25 08:51:03,018 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-07-25 08:51:03,018 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 74 states. [2018-07-25 08:51:03,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:03,283 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-07-25 08:51:03,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-07-25 08:51:03,283 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 73 [2018-07-25 08:51:03,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:03,283 INFO L225 Difference]: With dead ends: 76 [2018-07-25 08:51:03,284 INFO L226 Difference]: Without dead ends: 75 [2018-07-25 08:51:03,284 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-07-25 08:51:03,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-07-25 08:51:03,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-07-25 08:51:03,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-07-25 08:51:03,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-07-25 08:51:03,287 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2018-07-25 08:51:03,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:03,287 INFO L472 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-07-25 08:51:03,287 INFO L473 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-07-25 08:51:03,288 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-07-25 08:51:03,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-07-25 08:51:03,288 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:03,288 INFO L354 BasicCegarLoop]: trace histogram [72, 1, 1] [2018-07-25 08:51:03,288 INFO L415 AbstractCegarLoop]: === Iteration 73 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:03,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1650779961, now seen corresponding path program 72 times [2018-07-25 08:51:03,289 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:03,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:03,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:03,553 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:03,553 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-07-25 08:51:03,553 INFO L451 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-07-25 08:51:03,553 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-07-25 08:51:03,554 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-07-25 08:51:03,554 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 75 states. [2018-07-25 08:51:03,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:03,827 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-07-25 08:51:03,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-07-25 08:51:03,827 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 74 [2018-07-25 08:51:03,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:03,827 INFO L225 Difference]: With dead ends: 77 [2018-07-25 08:51:03,828 INFO L226 Difference]: Without dead ends: 76 [2018-07-25 08:51:03,828 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-07-25 08:51:03,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-07-25 08:51:03,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-07-25 08:51:03,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-07-25 08:51:03,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-07-25 08:51:03,831 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2018-07-25 08:51:03,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:03,832 INFO L472 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-07-25 08:51:03,832 INFO L473 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-07-25 08:51:03,832 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-07-25 08:51:03,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-07-25 08:51:03,832 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:03,832 INFO L354 BasicCegarLoop]: trace histogram [73, 1, 1] [2018-07-25 08:51:03,832 INFO L415 AbstractCegarLoop]: === Iteration 74 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:03,833 INFO L82 PathProgramCache]: Analyzing trace with hash 365428705, now seen corresponding path program 73 times [2018-07-25 08:51:03,833 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:03,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:04,102 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:04,103 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:04,103 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-07-25 08:51:04,103 INFO L451 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-07-25 08:51:04,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-07-25 08:51:04,104 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-07-25 08:51:04,104 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 76 states. [2018-07-25 08:51:04,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:04,378 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-07-25 08:51:04,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-07-25 08:51:04,379 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 75 [2018-07-25 08:51:04,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:04,379 INFO L225 Difference]: With dead ends: 78 [2018-07-25 08:51:04,379 INFO L226 Difference]: Without dead ends: 77 [2018-07-25 08:51:04,380 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-07-25 08:51:04,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-07-25 08:51:04,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-07-25 08:51:04,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-07-25 08:51:04,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-07-25 08:51:04,383 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2018-07-25 08:51:04,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:04,383 INFO L472 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-07-25 08:51:04,383 INFO L473 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-07-25 08:51:04,383 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-07-25 08:51:04,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-07-25 08:51:04,384 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:04,384 INFO L354 BasicCegarLoop]: trace histogram [74, 1, 1] [2018-07-25 08:51:04,384 INFO L415 AbstractCegarLoop]: === Iteration 75 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:04,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1556612089, now seen corresponding path program 74 times [2018-07-25 08:51:04,385 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:04,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:04,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:04,748 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:04,748 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-07-25 08:51:04,749 INFO L451 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-07-25 08:51:04,749 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-07-25 08:51:04,749 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-07-25 08:51:04,750 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 77 states. [2018-07-25 08:51:05,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:05,068 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-07-25 08:51:05,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-07-25 08:51:05,069 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 76 [2018-07-25 08:51:05,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:05,069 INFO L225 Difference]: With dead ends: 79 [2018-07-25 08:51:05,069 INFO L226 Difference]: Without dead ends: 78 [2018-07-25 08:51:05,070 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-07-25 08:51:05,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-07-25 08:51:05,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-07-25 08:51:05,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-07-25 08:51:05,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-07-25 08:51:05,074 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2018-07-25 08:51:05,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:05,074 INFO L472 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-07-25 08:51:05,074 INFO L473 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-07-25 08:51:05,074 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-07-25 08:51:05,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-07-25 08:51:05,075 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:05,075 INFO L354 BasicCegarLoop]: trace histogram [75, 1, 1] [2018-07-25 08:51:05,075 INFO L415 AbstractCegarLoop]: === Iteration 76 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:05,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1010334559, now seen corresponding path program 75 times [2018-07-25 08:51:05,076 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:05,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:05,350 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:05,351 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:05,351 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-07-25 08:51:05,351 INFO L451 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-07-25 08:51:05,352 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-07-25 08:51:05,352 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-07-25 08:51:05,352 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 78 states. [2018-07-25 08:51:05,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:05,665 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-07-25 08:51:05,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-07-25 08:51:05,665 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 77 [2018-07-25 08:51:05,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:05,666 INFO L225 Difference]: With dead ends: 80 [2018-07-25 08:51:05,666 INFO L226 Difference]: Without dead ends: 79 [2018-07-25 08:51:05,667 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-07-25 08:51:05,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-07-25 08:51:05,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-07-25 08:51:05,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-07-25 08:51:05,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-07-25 08:51:05,672 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2018-07-25 08:51:05,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:05,672 INFO L472 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-07-25 08:51:05,672 INFO L473 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-07-25 08:51:05,672 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-07-25 08:51:05,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-07-25 08:51:05,672 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:05,673 INFO L354 BasicCegarLoop]: trace histogram [76, 1, 1] [2018-07-25 08:51:05,673 INFO L415 AbstractCegarLoop]: === Iteration 77 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:05,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1255600313, now seen corresponding path program 76 times [2018-07-25 08:51:05,673 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:05,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:05,980 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:05,980 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:05,980 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-07-25 08:51:05,981 INFO L451 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-07-25 08:51:05,981 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-07-25 08:51:05,981 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-07-25 08:51:05,982 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 79 states. [2018-07-25 08:51:06,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:06,312 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-07-25 08:51:06,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-07-25 08:51:06,312 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 78 [2018-07-25 08:51:06,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:06,313 INFO L225 Difference]: With dead ends: 81 [2018-07-25 08:51:06,314 INFO L226 Difference]: Without dead ends: 80 [2018-07-25 08:51:06,314 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-07-25 08:51:06,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-07-25 08:51:06,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-07-25 08:51:06,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-07-25 08:51:06,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-07-25 08:51:06,320 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2018-07-25 08:51:06,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:06,320 INFO L472 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-07-25 08:51:06,320 INFO L473 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-07-25 08:51:06,322 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-07-25 08:51:06,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-07-25 08:51:06,322 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:06,322 INFO L354 BasicCegarLoop]: trace histogram [77, 1, 1] [2018-07-25 08:51:06,323 INFO L415 AbstractCegarLoop]: === Iteration 78 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:06,323 INFO L82 PathProgramCache]: Analyzing trace with hash -268904095, now seen corresponding path program 77 times [2018-07-25 08:51:06,323 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:06,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:06,671 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:06,671 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:06,671 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-07-25 08:51:06,671 INFO L451 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-07-25 08:51:06,672 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-07-25 08:51:06,672 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-07-25 08:51:06,672 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 80 states. [2018-07-25 08:51:06,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:06,984 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-07-25 08:51:06,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-07-25 08:51:06,984 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 79 [2018-07-25 08:51:06,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:06,985 INFO L225 Difference]: With dead ends: 82 [2018-07-25 08:51:06,985 INFO L226 Difference]: Without dead ends: 81 [2018-07-25 08:51:06,986 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-07-25 08:51:06,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-07-25 08:51:06,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-07-25 08:51:06,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-07-25 08:51:06,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-07-25 08:51:06,989 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2018-07-25 08:51:06,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:06,989 INFO L472 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-07-25 08:51:06,989 INFO L473 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-07-25 08:51:06,989 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-07-25 08:51:06,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-07-25 08:51:06,990 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:06,990 INFO L354 BasicCegarLoop]: trace histogram [78, 1, 1] [2018-07-25 08:51:06,990 INFO L415 AbstractCegarLoop]: === Iteration 79 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:06,991 INFO L82 PathProgramCache]: Analyzing trace with hash 253907591, now seen corresponding path program 78 times [2018-07-25 08:51:06,991 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:07,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:07,418 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:07,418 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:07,418 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-07-25 08:51:07,418 INFO L451 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-07-25 08:51:07,419 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-07-25 08:51:07,419 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-07-25 08:51:07,419 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 81 states. [2018-07-25 08:51:07,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:07,953 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-07-25 08:51:07,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-07-25 08:51:07,953 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 80 [2018-07-25 08:51:07,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:07,954 INFO L225 Difference]: With dead ends: 83 [2018-07-25 08:51:07,954 INFO L226 Difference]: Without dead ends: 82 [2018-07-25 08:51:07,955 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-07-25 08:51:07,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-07-25 08:51:07,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-07-25 08:51:07,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-07-25 08:51:07,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-07-25 08:51:07,960 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2018-07-25 08:51:07,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:07,960 INFO L472 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-07-25 08:51:07,960 INFO L473 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-07-25 08:51:07,960 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-07-25 08:51:07,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-07-25 08:51:07,961 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:07,961 INFO L354 BasicCegarLoop]: trace histogram [79, 1, 1] [2018-07-25 08:51:07,962 INFO L415 AbstractCegarLoop]: === Iteration 80 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:07,962 INFO L82 PathProgramCache]: Analyzing trace with hash -718799327, now seen corresponding path program 79 times [2018-07-25 08:51:07,962 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:07,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:08,266 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:08,267 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:08,267 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-07-25 08:51:08,267 INFO L451 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-07-25 08:51:08,267 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-07-25 08:51:08,268 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2018-07-25 08:51:08,268 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 82 states. [2018-07-25 08:51:08,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:08,666 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-07-25 08:51:08,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-07-25 08:51:08,666 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 81 [2018-07-25 08:51:08,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:08,667 INFO L225 Difference]: With dead ends: 84 [2018-07-25 08:51:08,667 INFO L226 Difference]: Without dead ends: 83 [2018-07-25 08:51:08,667 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2018-07-25 08:51:08,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-07-25 08:51:08,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-07-25 08:51:08,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-07-25 08:51:08,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-07-25 08:51:08,672 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2018-07-25 08:51:08,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:08,673 INFO L472 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-07-25 08:51:08,673 INFO L473 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-07-25 08:51:08,673 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-07-25 08:51:08,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-07-25 08:51:08,673 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:08,674 INFO L354 BasicCegarLoop]: trace histogram [80, 1, 1] [2018-07-25 08:51:08,674 INFO L415 AbstractCegarLoop]: === Iteration 81 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:08,674 INFO L82 PathProgramCache]: Analyzing trace with hash -807942713, now seen corresponding path program 80 times [2018-07-25 08:51:08,674 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:08,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:08,993 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:08,993 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:08,993 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-07-25 08:51:08,994 INFO L451 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-07-25 08:51:08,994 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-07-25 08:51:08,994 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-07-25 08:51:08,994 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 83 states. [2018-07-25 08:51:09,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:09,364 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-07-25 08:51:09,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-07-25 08:51:09,365 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 82 [2018-07-25 08:51:09,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:09,365 INFO L225 Difference]: With dead ends: 85 [2018-07-25 08:51:09,366 INFO L226 Difference]: Without dead ends: 84 [2018-07-25 08:51:09,366 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-07-25 08:51:09,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-07-25 08:51:09,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-07-25 08:51:09,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-07-25 08:51:09,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-07-25 08:51:09,371 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2018-07-25 08:51:09,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:09,371 INFO L472 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-07-25 08:51:09,371 INFO L473 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-07-25 08:51:09,371 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-07-25 08:51:09,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-07-25 08:51:09,372 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:09,372 INFO L354 BasicCegarLoop]: trace histogram [81, 1, 1] [2018-07-25 08:51:09,372 INFO L415 AbstractCegarLoop]: === Iteration 82 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:09,372 INFO L82 PathProgramCache]: Analyzing trace with hash 723579617, now seen corresponding path program 81 times [2018-07-25 08:51:09,372 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:09,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:09,757 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:09,757 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:09,757 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-07-25 08:51:09,757 INFO L451 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-07-25 08:51:09,757 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-07-25 08:51:09,758 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2018-07-25 08:51:09,758 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 84 states. [2018-07-25 08:51:10,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:10,134 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-07-25 08:51:10,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-07-25 08:51:10,134 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 83 [2018-07-25 08:51:10,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:10,135 INFO L225 Difference]: With dead ends: 86 [2018-07-25 08:51:10,135 INFO L226 Difference]: Without dead ends: 85 [2018-07-25 08:51:10,136 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2018-07-25 08:51:10,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-07-25 08:51:10,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-07-25 08:51:10,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-07-25 08:51:10,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-07-25 08:51:10,140 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2018-07-25 08:51:10,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:10,140 INFO L472 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-07-25 08:51:10,140 INFO L473 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-07-25 08:51:10,140 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-07-25 08:51:10,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-07-25 08:51:10,141 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:10,141 INFO L354 BasicCegarLoop]: trace histogram [82, 1, 1] [2018-07-25 08:51:10,141 INFO L415 AbstractCegarLoop]: === Iteration 83 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:10,141 INFO L82 PathProgramCache]: Analyzing trace with hash 956131591, now seen corresponding path program 82 times [2018-07-25 08:51:10,141 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:10,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:10,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:10,461 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:10,461 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-07-25 08:51:10,461 INFO L451 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-07-25 08:51:10,461 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-07-25 08:51:10,462 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2018-07-25 08:51:10,462 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 85 states. [2018-07-25 08:51:10,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:10,859 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-07-25 08:51:10,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-07-25 08:51:10,860 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 84 [2018-07-25 08:51:10,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:10,860 INFO L225 Difference]: With dead ends: 87 [2018-07-25 08:51:10,860 INFO L226 Difference]: Without dead ends: 86 [2018-07-25 08:51:10,861 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2018-07-25 08:51:10,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-07-25 08:51:10,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-07-25 08:51:10,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-07-25 08:51:10,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-07-25 08:51:10,865 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2018-07-25 08:51:10,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:10,865 INFO L472 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-07-25 08:51:10,865 INFO L473 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-07-25 08:51:10,865 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-07-25 08:51:10,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-07-25 08:51:10,866 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:10,866 INFO L354 BasicCegarLoop]: trace histogram [83, 1, 1] [2018-07-25 08:51:10,866 INFO L415 AbstractCegarLoop]: === Iteration 84 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:10,866 INFO L82 PathProgramCache]: Analyzing trace with hash -424691807, now seen corresponding path program 83 times [2018-07-25 08:51:10,866 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:10,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:11,203 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:11,204 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:11,204 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-07-25 08:51:11,204 INFO L451 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-07-25 08:51:11,205 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-07-25 08:51:11,205 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2018-07-25 08:51:11,205 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 86 states. [2018-07-25 08:51:11,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:11,654 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-07-25 08:51:11,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-07-25 08:51:11,655 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 85 [2018-07-25 08:51:11,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:11,655 INFO L225 Difference]: With dead ends: 88 [2018-07-25 08:51:11,655 INFO L226 Difference]: Without dead ends: 87 [2018-07-25 08:51:11,656 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2018-07-25 08:51:11,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-07-25 08:51:11,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-07-25 08:51:11,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-07-25 08:51:11,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-07-25 08:51:11,661 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2018-07-25 08:51:11,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:11,662 INFO L472 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-07-25 08:51:11,662 INFO L473 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-07-25 08:51:11,662 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-07-25 08:51:11,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-07-25 08:51:11,662 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:11,663 INFO L354 BasicCegarLoop]: trace histogram [84, 1, 1] [2018-07-25 08:51:11,663 INFO L415 AbstractCegarLoop]: === Iteration 85 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:11,663 INFO L82 PathProgramCache]: Analyzing trace with hash -280544185, now seen corresponding path program 84 times [2018-07-25 08:51:11,663 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:11,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:12,080 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:12,080 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:12,080 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-07-25 08:51:12,081 INFO L451 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-07-25 08:51:12,081 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-07-25 08:51:12,082 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2018-07-25 08:51:12,082 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 87 states. [2018-07-25 08:51:12,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:12,579 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-07-25 08:51:12,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-07-25 08:51:12,580 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 86 [2018-07-25 08:51:12,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:12,580 INFO L225 Difference]: With dead ends: 89 [2018-07-25 08:51:12,580 INFO L226 Difference]: Without dead ends: 88 [2018-07-25 08:51:12,581 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2018-07-25 08:51:12,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-07-25 08:51:12,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-07-25 08:51:12,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-07-25 08:51:12,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-07-25 08:51:12,585 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2018-07-25 08:51:12,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:12,586 INFO L472 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-07-25 08:51:12,586 INFO L473 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-07-25 08:51:12,586 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-07-25 08:51:12,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-07-25 08:51:12,587 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:12,587 INFO L354 BasicCegarLoop]: trace histogram [85, 1, 1] [2018-07-25 08:51:12,587 INFO L415 AbstractCegarLoop]: === Iteration 86 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:12,587 INFO L82 PathProgramCache]: Analyzing trace with hash -106935199, now seen corresponding path program 85 times [2018-07-25 08:51:12,587 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:12,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:12,942 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:12,942 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:12,942 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-07-25 08:51:12,943 INFO L451 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-07-25 08:51:12,943 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-07-25 08:51:12,943 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2018-07-25 08:51:12,944 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 88 states. [2018-07-25 08:51:13,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:13,393 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-07-25 08:51:13,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-07-25 08:51:13,393 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 87 [2018-07-25 08:51:13,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:13,394 INFO L225 Difference]: With dead ends: 90 [2018-07-25 08:51:13,394 INFO L226 Difference]: Without dead ends: 89 [2018-07-25 08:51:13,395 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2018-07-25 08:51:13,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-07-25 08:51:13,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-07-25 08:51:13,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-07-25 08:51:13,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-07-25 08:51:13,399 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2018-07-25 08:51:13,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:13,400 INFO L472 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-07-25 08:51:13,400 INFO L473 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-07-25 08:51:13,400 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-07-25 08:51:13,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-07-25 08:51:13,400 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:13,400 INFO L354 BasicCegarLoop]: trace histogram [86, 1, 1] [2018-07-25 08:51:13,401 INFO L415 AbstractCegarLoop]: === Iteration 87 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:13,401 INFO L82 PathProgramCache]: Analyzing trace with hash 979976071, now seen corresponding path program 86 times [2018-07-25 08:51:13,401 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:13,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:13,781 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:13,781 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:13,781 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-07-25 08:51:13,781 INFO L451 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-07-25 08:51:13,782 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-07-25 08:51:13,782 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2018-07-25 08:51:13,783 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 89 states. [2018-07-25 08:51:14,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:14,221 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-07-25 08:51:14,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-07-25 08:51:14,221 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 88 [2018-07-25 08:51:14,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:14,222 INFO L225 Difference]: With dead ends: 91 [2018-07-25 08:51:14,222 INFO L226 Difference]: Without dead ends: 90 [2018-07-25 08:51:14,223 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2018-07-25 08:51:14,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-07-25 08:51:14,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-07-25 08:51:14,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-07-25 08:51:14,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-07-25 08:51:14,228 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2018-07-25 08:51:14,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:14,229 INFO L472 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-07-25 08:51:14,229 INFO L473 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-07-25 08:51:14,229 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-07-25 08:51:14,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-07-25 08:51:14,229 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:14,229 INFO L354 BasicCegarLoop]: trace histogram [87, 1, 1] [2018-07-25 08:51:14,230 INFO L415 AbstractCegarLoop]: === Iteration 88 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:14,230 INFO L82 PathProgramCache]: Analyzing trace with hash 314487073, now seen corresponding path program 87 times [2018-07-25 08:51:14,230 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:14,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:14,596 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:14,596 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:14,596 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-07-25 08:51:14,597 INFO L451 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-07-25 08:51:14,597 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-07-25 08:51:14,598 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=7833, Unknown=0, NotChecked=0, Total=8010 [2018-07-25 08:51:14,598 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 90 states. [2018-07-25 08:51:15,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:15,036 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-07-25 08:51:15,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-07-25 08:51:15,036 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 89 [2018-07-25 08:51:15,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:15,037 INFO L225 Difference]: With dead ends: 92 [2018-07-25 08:51:15,037 INFO L226 Difference]: Without dead ends: 91 [2018-07-25 08:51:15,038 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=177, Invalid=7833, Unknown=0, NotChecked=0, Total=8010 [2018-07-25 08:51:15,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-07-25 08:51:15,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-07-25 08:51:15,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-07-25 08:51:15,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-07-25 08:51:15,043 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2018-07-25 08:51:15,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:15,043 INFO L472 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-07-25 08:51:15,043 INFO L473 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-07-25 08:51:15,043 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-07-25 08:51:15,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-07-25 08:51:15,044 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:15,044 INFO L354 BasicCegarLoop]: trace histogram [88, 1, 1] [2018-07-25 08:51:15,044 INFO L415 AbstractCegarLoop]: === Iteration 89 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:15,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1159164615, now seen corresponding path program 88 times [2018-07-25 08:51:15,045 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:15,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:15,431 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:15,431 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:15,431 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-07-25 08:51:15,432 INFO L451 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-07-25 08:51:15,432 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-07-25 08:51:15,432 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=8011, Unknown=0, NotChecked=0, Total=8190 [2018-07-25 08:51:15,433 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 91 states. [2018-07-25 08:51:15,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:15,857 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-07-25 08:51:15,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-07-25 08:51:15,857 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 90 [2018-07-25 08:51:15,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:15,858 INFO L225 Difference]: With dead ends: 93 [2018-07-25 08:51:15,858 INFO L226 Difference]: Without dead ends: 92 [2018-07-25 08:51:15,858 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=8011, Unknown=0, NotChecked=0, Total=8190 [2018-07-25 08:51:15,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-07-25 08:51:15,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-07-25 08:51:15,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-07-25 08:51:15,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-07-25 08:51:15,864 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2018-07-25 08:51:15,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:15,864 INFO L472 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-07-25 08:51:15,864 INFO L473 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-07-25 08:51:15,864 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-07-25 08:51:15,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-07-25 08:51:15,865 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:15,865 INFO L354 BasicCegarLoop]: trace histogram [89, 1, 1] [2018-07-25 08:51:15,865 INFO L415 AbstractCegarLoop]: === Iteration 90 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:15,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1574364641, now seen corresponding path program 89 times [2018-07-25 08:51:15,866 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:15,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:16,230 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:16,230 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:16,230 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-07-25 08:51:16,231 INFO L451 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-07-25 08:51:16,231 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-07-25 08:51:16,232 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=8191, Unknown=0, NotChecked=0, Total=8372 [2018-07-25 08:51:16,232 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 92 states. [2018-07-25 08:51:16,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:16,696 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-07-25 08:51:16,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-07-25 08:51:16,696 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 91 [2018-07-25 08:51:16,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:16,697 INFO L225 Difference]: With dead ends: 94 [2018-07-25 08:51:16,697 INFO L226 Difference]: Without dead ends: 93 [2018-07-25 08:51:16,698 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=8191, Unknown=0, NotChecked=0, Total=8372 [2018-07-25 08:51:16,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-07-25 08:51:16,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-07-25 08:51:16,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-07-25 08:51:16,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-07-25 08:51:16,702 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2018-07-25 08:51:16,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:16,702 INFO L472 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-07-25 08:51:16,702 INFO L473 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-07-25 08:51:16,702 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-07-25 08:51:16,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-07-25 08:51:16,703 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:16,703 INFO L354 BasicCegarLoop]: trace histogram [90, 1, 1] [2018-07-25 08:51:16,703 INFO L415 AbstractCegarLoop]: === Iteration 91 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:16,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1560663559, now seen corresponding path program 90 times [2018-07-25 08:51:16,704 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:16,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:17,119 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:17,120 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:17,120 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-07-25 08:51:17,120 INFO L451 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-07-25 08:51:17,120 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-07-25 08:51:17,121 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=8373, Unknown=0, NotChecked=0, Total=8556 [2018-07-25 08:51:17,121 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 93 states. [2018-07-25 08:51:17,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:17,595 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-07-25 08:51:17,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-07-25 08:51:17,596 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 92 [2018-07-25 08:51:17,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:17,596 INFO L225 Difference]: With dead ends: 95 [2018-07-25 08:51:17,596 INFO L226 Difference]: Without dead ends: 94 [2018-07-25 08:51:17,597 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=8373, Unknown=0, NotChecked=0, Total=8556 [2018-07-25 08:51:17,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-07-25 08:51:17,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-07-25 08:51:17,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-07-25 08:51:17,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-07-25 08:51:17,601 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2018-07-25 08:51:17,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:17,601 INFO L472 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-07-25 08:51:17,601 INFO L473 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-07-25 08:51:17,602 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-07-25 08:51:17,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-07-25 08:51:17,602 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:17,602 INFO L354 BasicCegarLoop]: trace histogram [91, 1, 1] [2018-07-25 08:51:17,602 INFO L415 AbstractCegarLoop]: === Iteration 92 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:17,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1135930017, now seen corresponding path program 91 times [2018-07-25 08:51:17,603 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:17,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:17,994 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:17,995 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:17,995 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-07-25 08:51:17,995 INFO L451 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-07-25 08:51:17,995 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-07-25 08:51:17,996 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=8557, Unknown=0, NotChecked=0, Total=8742 [2018-07-25 08:51:17,997 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 94 states. [2018-07-25 08:51:18,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:18,524 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-07-25 08:51:18,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-07-25 08:51:18,525 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 93 [2018-07-25 08:51:18,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:18,525 INFO L225 Difference]: With dead ends: 96 [2018-07-25 08:51:18,525 INFO L226 Difference]: Without dead ends: 95 [2018-07-25 08:51:18,526 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=185, Invalid=8557, Unknown=0, NotChecked=0, Total=8742 [2018-07-25 08:51:18,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-07-25 08:51:18,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-07-25 08:51:18,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-07-25 08:51:18,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-07-25 08:51:18,529 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2018-07-25 08:51:18,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:18,529 INFO L472 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-07-25 08:51:18,529 INFO L473 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-07-25 08:51:18,529 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-07-25 08:51:18,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-07-25 08:51:18,530 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:18,530 INFO L354 BasicCegarLoop]: trace histogram [92, 1, 1] [2018-07-25 08:51:18,530 INFO L415 AbstractCegarLoop]: === Iteration 93 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:18,530 INFO L82 PathProgramCache]: Analyzing trace with hash 854092103, now seen corresponding path program 92 times [2018-07-25 08:51:18,530 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:18,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:18,897 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:18,897 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:18,897 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-07-25 08:51:18,898 INFO L451 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-07-25 08:51:18,898 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-07-25 08:51:18,898 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=8743, Unknown=0, NotChecked=0, Total=8930 [2018-07-25 08:51:18,899 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 95 states. [2018-07-25 08:51:19,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:19,411 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-07-25 08:51:19,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-07-25 08:51:19,411 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 94 [2018-07-25 08:51:19,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:19,412 INFO L225 Difference]: With dead ends: 97 [2018-07-25 08:51:19,412 INFO L226 Difference]: Without dead ends: 96 [2018-07-25 08:51:19,413 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=187, Invalid=8743, Unknown=0, NotChecked=0, Total=8930 [2018-07-25 08:51:19,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-07-25 08:51:19,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-07-25 08:51:19,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-07-25 08:51:19,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-07-25 08:51:19,418 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2018-07-25 08:51:19,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:19,418 INFO L472 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-07-25 08:51:19,419 INFO L473 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-07-25 08:51:19,419 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-07-25 08:51:19,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-07-25 08:51:19,420 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:19,420 INFO L354 BasicCegarLoop]: trace histogram [93, 1, 1] [2018-07-25 08:51:19,421 INFO L415 AbstractCegarLoop]: === Iteration 94 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:19,421 INFO L82 PathProgramCache]: Analyzing trace with hash 707051361, now seen corresponding path program 93 times [2018-07-25 08:51:19,421 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:19,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:19,862 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:19,863 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:19,863 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-07-25 08:51:19,863 INFO L451 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-07-25 08:51:19,863 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-07-25 08:51:19,864 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=8931, Unknown=0, NotChecked=0, Total=9120 [2018-07-25 08:51:19,864 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 96 states. [2018-07-25 08:51:20,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:20,364 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-07-25 08:51:20,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-07-25 08:51:20,364 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 95 [2018-07-25 08:51:20,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:20,365 INFO L225 Difference]: With dead ends: 98 [2018-07-25 08:51:20,365 INFO L226 Difference]: Without dead ends: 97 [2018-07-25 08:51:20,365 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=189, Invalid=8931, Unknown=0, NotChecked=0, Total=9120 [2018-07-25 08:51:20,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-07-25 08:51:20,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-07-25 08:51:20,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-07-25 08:51:20,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-07-25 08:51:20,371 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2018-07-25 08:51:20,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:20,371 INFO L472 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-07-25 08:51:20,371 INFO L473 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-07-25 08:51:20,371 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-07-25 08:51:20,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-07-25 08:51:20,372 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:20,372 INFO L354 BasicCegarLoop]: trace histogram [94, 1, 1] [2018-07-25 08:51:20,372 INFO L415 AbstractCegarLoop]: === Iteration 95 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:20,372 INFO L82 PathProgramCache]: Analyzing trace with hash 443755655, now seen corresponding path program 94 times [2018-07-25 08:51:20,373 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:20,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:20,805 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:20,805 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:20,805 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-07-25 08:51:20,806 INFO L451 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-07-25 08:51:20,806 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-07-25 08:51:20,807 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=9121, Unknown=0, NotChecked=0, Total=9312 [2018-07-25 08:51:20,807 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 97 states. [2018-07-25 08:51:21,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:21,319 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-07-25 08:51:21,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-07-25 08:51:21,320 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 96 [2018-07-25 08:51:21,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:21,320 INFO L225 Difference]: With dead ends: 99 [2018-07-25 08:51:21,320 INFO L226 Difference]: Without dead ends: 98 [2018-07-25 08:51:21,321 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=191, Invalid=9121, Unknown=0, NotChecked=0, Total=9312 [2018-07-25 08:51:21,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-07-25 08:51:21,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-07-25 08:51:21,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-07-25 08:51:21,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-07-25 08:51:21,326 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2018-07-25 08:51:21,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:21,327 INFO L472 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-07-25 08:51:21,327 INFO L473 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-07-25 08:51:21,327 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-07-25 08:51:21,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-07-25 08:51:21,327 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:21,328 INFO L354 BasicCegarLoop]: trace histogram [95, 1, 1] [2018-07-25 08:51:21,328 INFO L415 AbstractCegarLoop]: === Iteration 96 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:21,328 INFO L82 PathProgramCache]: Analyzing trace with hash 871523361, now seen corresponding path program 95 times [2018-07-25 08:51:21,328 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:21,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:22,006 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:22,007 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:22,007 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-07-25 08:51:22,008 INFO L451 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-07-25 08:51:22,008 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-07-25 08:51:22,009 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=9313, Unknown=0, NotChecked=0, Total=9506 [2018-07-25 08:51:22,009 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 98 states. [2018-07-25 08:51:22,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:22,526 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-07-25 08:51:22,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-07-25 08:51:22,526 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 97 [2018-07-25 08:51:22,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:22,527 INFO L225 Difference]: With dead ends: 100 [2018-07-25 08:51:22,527 INFO L226 Difference]: Without dead ends: 99 [2018-07-25 08:51:22,528 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=193, Invalid=9313, Unknown=0, NotChecked=0, Total=9506 [2018-07-25 08:51:22,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-07-25 08:51:22,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-07-25 08:51:22,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-07-25 08:51:22,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-07-25 08:51:22,532 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2018-07-25 08:51:22,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:22,532 INFO L472 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-07-25 08:51:22,532 INFO L473 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-07-25 08:51:22,533 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-07-25 08:51:22,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-07-25 08:51:22,533 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:22,533 INFO L354 BasicCegarLoop]: trace histogram [96, 1, 1] [2018-07-25 08:51:22,534 INFO L415 AbstractCegarLoop]: === Iteration 97 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:22,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1247420359, now seen corresponding path program 96 times [2018-07-25 08:51:22,534 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:22,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:22,970 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:22,971 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:22,971 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-07-25 08:51:22,971 INFO L451 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-07-25 08:51:22,971 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-07-25 08:51:22,972 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=9507, Unknown=0, NotChecked=0, Total=9702 [2018-07-25 08:51:22,972 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 99 states. [2018-07-25 08:51:23,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:23,553 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-07-25 08:51:23,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-07-25 08:51:23,553 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 98 [2018-07-25 08:51:23,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:23,554 INFO L225 Difference]: With dead ends: 101 [2018-07-25 08:51:23,554 INFO L226 Difference]: Without dead ends: 100 [2018-07-25 08:51:23,555 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=195, Invalid=9507, Unknown=0, NotChecked=0, Total=9702 [2018-07-25 08:51:23,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-07-25 08:51:23,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-07-25 08:51:23,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-07-25 08:51:23,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-07-25 08:51:23,561 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2018-07-25 08:51:23,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:23,561 INFO L472 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-07-25 08:51:23,561 INFO L473 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-07-25 08:51:23,561 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-07-25 08:51:23,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-07-25 08:51:23,562 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:23,562 INFO L354 BasicCegarLoop]: trace histogram [97, 1, 1] [2018-07-25 08:51:23,562 INFO L415 AbstractCegarLoop]: === Iteration 98 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:23,563 INFO L82 PathProgramCache]: Analyzing trace with hash 15325409, now seen corresponding path program 97 times [2018-07-25 08:51:23,563 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:23,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:24,257 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:24,258 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:24,258 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-07-25 08:51:24,258 INFO L451 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-07-25 08:51:24,258 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-07-25 08:51:24,259 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=9703, Unknown=0, NotChecked=0, Total=9900 [2018-07-25 08:51:24,259 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 100 states. [2018-07-25 08:51:24,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:24,929 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-07-25 08:51:24,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-07-25 08:51:24,929 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 99 [2018-07-25 08:51:24,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:24,930 INFO L225 Difference]: With dead ends: 102 [2018-07-25 08:51:24,930 INFO L226 Difference]: Without dead ends: 101 [2018-07-25 08:51:24,931 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=197, Invalid=9703, Unknown=0, NotChecked=0, Total=9900 [2018-07-25 08:51:24,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-07-25 08:51:24,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-07-25 08:51:24,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-07-25 08:51:24,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-07-25 08:51:24,935 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2018-07-25 08:51:24,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:24,935 INFO L472 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-07-25 08:51:24,935 INFO L473 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-07-25 08:51:24,936 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-07-25 08:51:24,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-07-25 08:51:24,936 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:24,936 INFO L354 BasicCegarLoop]: trace histogram [98, 1, 1] [2018-07-25 08:51:24,936 INFO L415 AbstractCegarLoop]: === Iteration 99 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:24,936 INFO L82 PathProgramCache]: Analyzing trace with hash 475087623, now seen corresponding path program 98 times [2018-07-25 08:51:24,937 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:24,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:25,531 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:25,532 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:25,532 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-07-25 08:51:25,532 INFO L451 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-07-25 08:51:25,533 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-07-25 08:51:25,533 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=9901, Unknown=0, NotChecked=0, Total=10100 [2018-07-25 08:51:25,534 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 101 states. [2018-07-25 08:51:26,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:26,077 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-07-25 08:51:26,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-07-25 08:51:26,078 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 100 [2018-07-25 08:51:26,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:26,078 INFO L225 Difference]: With dead ends: 103 [2018-07-25 08:51:26,079 INFO L226 Difference]: Without dead ends: 102 [2018-07-25 08:51:26,079 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=199, Invalid=9901, Unknown=0, NotChecked=0, Total=10100 [2018-07-25 08:51:26,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-07-25 08:51:26,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-07-25 08:51:26,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-07-25 08:51:26,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-07-25 08:51:26,085 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2018-07-25 08:51:26,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:26,085 INFO L472 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-07-25 08:51:26,085 INFO L473 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-07-25 08:51:26,086 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-07-25 08:51:26,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-07-25 08:51:26,086 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:26,086 INFO L354 BasicCegarLoop]: trace histogram [99, 1, 1] [2018-07-25 08:51:26,087 INFO L415 AbstractCegarLoop]: === Iteration 100 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:26,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1842814369, now seen corresponding path program 99 times [2018-07-25 08:51:26,087 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:26,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:26,535 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:26,535 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:26,535 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-07-25 08:51:26,535 INFO L451 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-07-25 08:51:26,536 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-07-25 08:51:26,536 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=10101, Unknown=0, NotChecked=0, Total=10302 [2018-07-25 08:51:26,537 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 102 states. [2018-07-25 08:51:27,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:27,076 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-07-25 08:51:27,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-07-25 08:51:27,076 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 101 [2018-07-25 08:51:27,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:27,077 INFO L225 Difference]: With dead ends: 104 [2018-07-25 08:51:27,077 INFO L226 Difference]: Without dead ends: 103 [2018-07-25 08:51:27,078 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=201, Invalid=10101, Unknown=0, NotChecked=0, Total=10302 [2018-07-25 08:51:27,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-07-25 08:51:27,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-07-25 08:51:27,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-07-25 08:51:27,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-07-25 08:51:27,082 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2018-07-25 08:51:27,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:27,082 INFO L472 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-07-25 08:51:27,082 INFO L473 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-07-25 08:51:27,082 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-07-25 08:51:27,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-07-25 08:51:27,083 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:27,083 INFO L354 BasicCegarLoop]: trace histogram [100, 1, 1] [2018-07-25 08:51:27,083 INFO L415 AbstractCegarLoop]: === Iteration 101 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:27,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1292670535, now seen corresponding path program 100 times [2018-07-25 08:51:27,083 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:27,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:27,543 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:27,543 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:27,543 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-07-25 08:51:27,544 INFO L451 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-07-25 08:51:27,544 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-07-25 08:51:27,545 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2018-07-25 08:51:27,545 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 103 states. [2018-07-25 08:51:28,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:28,105 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-07-25 08:51:28,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-07-25 08:51:28,105 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 102 [2018-07-25 08:51:28,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:28,106 INFO L225 Difference]: With dead ends: 105 [2018-07-25 08:51:28,106 INFO L226 Difference]: Without dead ends: 104 [2018-07-25 08:51:28,107 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2018-07-25 08:51:28,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-07-25 08:51:28,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-07-25 08:51:28,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-07-25 08:51:28,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-07-25 08:51:28,111 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2018-07-25 08:51:28,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:28,111 INFO L472 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-07-25 08:51:28,111 INFO L473 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-07-25 08:51:28,111 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-07-25 08:51:28,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-07-25 08:51:28,111 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:28,111 INFO L354 BasicCegarLoop]: trace histogram [101, 1, 1] [2018-07-25 08:51:28,112 INFO L415 AbstractCegarLoop]: === Iteration 102 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:28,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1418080865, now seen corresponding path program 101 times [2018-07-25 08:51:28,112 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:28,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:28,646 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:28,646 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:28,646 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-07-25 08:51:28,646 INFO L451 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-07-25 08:51:28,647 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-07-25 08:51:28,647 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=10507, Unknown=0, NotChecked=0, Total=10712 [2018-07-25 08:51:28,648 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 104 states. [2018-07-25 08:51:29,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:29,224 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-07-25 08:51:29,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-07-25 08:51:29,224 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 103 [2018-07-25 08:51:29,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:29,225 INFO L225 Difference]: With dead ends: 106 [2018-07-25 08:51:29,225 INFO L226 Difference]: Without dead ends: 105 [2018-07-25 08:51:29,226 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=205, Invalid=10507, Unknown=0, NotChecked=0, Total=10712 [2018-07-25 08:51:29,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-07-25 08:51:29,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-07-25 08:51:29,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-07-25 08:51:29,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-07-25 08:51:29,231 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2018-07-25 08:51:29,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:29,231 INFO L472 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-07-25 08:51:29,231 INFO L473 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-07-25 08:51:29,231 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-07-25 08:51:29,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-07-25 08:51:29,232 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:29,232 INFO L354 BasicCegarLoop]: trace histogram [102, 1, 1] [2018-07-25 08:51:29,232 INFO L415 AbstractCegarLoop]: === Iteration 103 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:29,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1010833799, now seen corresponding path program 102 times [2018-07-25 08:51:29,233 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:29,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:29,700 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:29,700 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:29,700 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-07-25 08:51:29,700 INFO L451 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-07-25 08:51:29,701 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-07-25 08:51:29,701 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=10713, Unknown=0, NotChecked=0, Total=10920 [2018-07-25 08:51:29,701 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 105 states. [2018-07-25 08:51:30,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:30,277 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-07-25 08:51:30,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-07-25 08:51:30,277 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 104 [2018-07-25 08:51:30,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:30,278 INFO L225 Difference]: With dead ends: 107 [2018-07-25 08:51:30,278 INFO L226 Difference]: Without dead ends: 106 [2018-07-25 08:51:30,279 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=207, Invalid=10713, Unknown=0, NotChecked=0, Total=10920 [2018-07-25 08:51:30,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-07-25 08:51:30,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-07-25 08:51:30,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-07-25 08:51:30,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-07-25 08:51:30,285 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2018-07-25 08:51:30,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:30,285 INFO L472 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-07-25 08:51:30,285 INFO L473 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-07-25 08:51:30,285 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-07-25 08:51:30,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-07-25 08:51:30,286 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:30,286 INFO L354 BasicCegarLoop]: trace histogram [103, 1, 1] [2018-07-25 08:51:30,286 INFO L415 AbstractCegarLoop]: === Iteration 104 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:30,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1271076641, now seen corresponding path program 103 times [2018-07-25 08:51:30,287 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:30,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:30,791 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:30,791 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:30,791 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2018-07-25 08:51:30,792 INFO L451 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-07-25 08:51:30,792 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-07-25 08:51:30,793 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=10921, Unknown=0, NotChecked=0, Total=11130 [2018-07-25 08:51:30,793 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 106 states. [2018-07-25 08:51:31,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:31,393 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-07-25 08:51:31,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-07-25 08:51:31,393 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 105 [2018-07-25 08:51:31,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:31,394 INFO L225 Difference]: With dead ends: 108 [2018-07-25 08:51:31,394 INFO L226 Difference]: Without dead ends: 107 [2018-07-25 08:51:31,395 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=209, Invalid=10921, Unknown=0, NotChecked=0, Total=11130 [2018-07-25 08:51:31,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-07-25 08:51:31,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-07-25 08:51:31,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-07-25 08:51:31,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-07-25 08:51:31,399 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2018-07-25 08:51:31,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:31,400 INFO L472 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-07-25 08:51:31,400 INFO L473 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-07-25 08:51:31,400 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-07-25 08:51:31,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-07-25 08:51:31,400 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:31,400 INFO L354 BasicCegarLoop]: trace histogram [104, 1, 1] [2018-07-25 08:51:31,401 INFO L415 AbstractCegarLoop]: === Iteration 105 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:31,401 INFO L82 PathProgramCache]: Analyzing trace with hash 748670151, now seen corresponding path program 104 times [2018-07-25 08:51:31,401 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:31,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:31,860 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:31,860 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:31,860 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-07-25 08:51:31,861 INFO L451 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-07-25 08:51:31,861 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-07-25 08:51:31,861 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=11131, Unknown=0, NotChecked=0, Total=11342 [2018-07-25 08:51:31,861 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 107 states. [2018-07-25 08:51:32,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:32,471 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-07-25 08:51:32,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-07-25 08:51:32,471 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 106 [2018-07-25 08:51:32,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:32,472 INFO L225 Difference]: With dead ends: 109 [2018-07-25 08:51:32,472 INFO L226 Difference]: Without dead ends: 108 [2018-07-25 08:51:32,472 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=211, Invalid=11131, Unknown=0, NotChecked=0, Total=11342 [2018-07-25 08:51:32,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-07-25 08:51:32,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-07-25 08:51:32,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-07-25 08:51:32,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-07-25 08:51:32,477 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2018-07-25 08:51:32,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:32,478 INFO L472 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-07-25 08:51:32,478 INFO L473 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-07-25 08:51:32,478 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-07-25 08:51:32,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-07-25 08:51:32,479 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:32,479 INFO L354 BasicCegarLoop]: trace histogram [105, 1, 1] [2018-07-25 08:51:32,479 INFO L415 AbstractCegarLoop]: === Iteration 106 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:32,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1733938145, now seen corresponding path program 105 times [2018-07-25 08:51:32,479 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:32,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:33,167 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:33,167 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:33,167 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2018-07-25 08:51:33,168 INFO L451 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-07-25 08:51:33,168 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-07-25 08:51:33,168 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=11343, Unknown=0, NotChecked=0, Total=11556 [2018-07-25 08:51:33,169 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 108 states. [2018-07-25 08:51:33,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:33,704 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-07-25 08:51:33,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-07-25 08:51:33,704 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 107 [2018-07-25 08:51:33,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:33,705 INFO L225 Difference]: With dead ends: 110 [2018-07-25 08:51:33,705 INFO L226 Difference]: Without dead ends: 109 [2018-07-25 08:51:33,706 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=213, Invalid=11343, Unknown=0, NotChecked=0, Total=11556 [2018-07-25 08:51:33,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-07-25 08:51:33,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-07-25 08:51:33,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-07-25 08:51:33,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-07-25 08:51:33,709 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2018-07-25 08:51:33,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:33,709 INFO L472 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-07-25 08:51:33,709 INFO L473 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-07-25 08:51:33,709 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-07-25 08:51:33,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-07-25 08:51:33,710 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:33,710 INFO L354 BasicCegarLoop]: trace histogram [106, 1, 1] [2018-07-25 08:51:33,710 INFO L415 AbstractCegarLoop]: === Iteration 107 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:33,710 INFO L82 PathProgramCache]: Analyzing trace with hash -2082492409, now seen corresponding path program 106 times [2018-07-25 08:51:33,710 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:33,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:34,170 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:34,170 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:34,170 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-07-25 08:51:34,171 INFO L451 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-07-25 08:51:34,171 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-07-25 08:51:34,171 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=11557, Unknown=0, NotChecked=0, Total=11772 [2018-07-25 08:51:34,172 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 109 states. [2018-07-25 08:51:34,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:34,808 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-07-25 08:51:34,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-07-25 08:51:34,809 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 108 [2018-07-25 08:51:34,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:34,809 INFO L225 Difference]: With dead ends: 111 [2018-07-25 08:51:34,809 INFO L226 Difference]: Without dead ends: 110 [2018-07-25 08:51:34,810 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=215, Invalid=11557, Unknown=0, NotChecked=0, Total=11772 [2018-07-25 08:51:34,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-07-25 08:51:34,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-07-25 08:51:34,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-07-25 08:51:34,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-07-25 08:51:34,814 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2018-07-25 08:51:34,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:34,814 INFO L472 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-07-25 08:51:34,814 INFO L473 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-07-25 08:51:34,814 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-07-25 08:51:34,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-07-25 08:51:34,814 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:34,815 INFO L354 BasicCegarLoop]: trace histogram [107, 1, 1] [2018-07-25 08:51:34,815 INFO L415 AbstractCegarLoop]: === Iteration 108 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:34,815 INFO L82 PathProgramCache]: Analyzing trace with hash -132755295, now seen corresponding path program 107 times [2018-07-25 08:51:34,815 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:34,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:35,353 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:35,353 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:35,353 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-07-25 08:51:35,354 INFO L451 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-07-25 08:51:35,354 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-07-25 08:51:35,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=11773, Unknown=0, NotChecked=0, Total=11990 [2018-07-25 08:51:35,355 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 110 states. [2018-07-25 08:51:36,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:36,015 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2018-07-25 08:51:36,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-07-25 08:51:36,015 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 109 [2018-07-25 08:51:36,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:36,016 INFO L225 Difference]: With dead ends: 112 [2018-07-25 08:51:36,016 INFO L226 Difference]: Without dead ends: 111 [2018-07-25 08:51:36,017 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=217, Invalid=11773, Unknown=0, NotChecked=0, Total=11990 [2018-07-25 08:51:36,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-07-25 08:51:36,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-07-25 08:51:36,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-07-25 08:51:36,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-07-25 08:51:36,041 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2018-07-25 08:51:36,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:36,042 INFO L472 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-07-25 08:51:36,042 INFO L473 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-07-25 08:51:36,042 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-07-25 08:51:36,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-07-25 08:51:36,042 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:36,042 INFO L354 BasicCegarLoop]: trace histogram [108, 1, 1] [2018-07-25 08:51:36,043 INFO L415 AbstractCegarLoop]: === Iteration 109 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:36,043 INFO L82 PathProgramCache]: Analyzing trace with hash 179553095, now seen corresponding path program 108 times [2018-07-25 08:51:36,043 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:36,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:36,557 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:36,557 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:36,558 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-07-25 08:51:36,558 INFO L451 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-07-25 08:51:36,558 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-07-25 08:51:36,559 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=11991, Unknown=0, NotChecked=0, Total=12210 [2018-07-25 08:51:36,559 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 111 states. [2018-07-25 08:51:37,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:37,206 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-07-25 08:51:37,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-07-25 08:51:37,206 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 110 [2018-07-25 08:51:37,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:37,206 INFO L225 Difference]: With dead ends: 113 [2018-07-25 08:51:37,207 INFO L226 Difference]: Without dead ends: 112 [2018-07-25 08:51:37,207 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=219, Invalid=11991, Unknown=0, NotChecked=0, Total=12210 [2018-07-25 08:51:37,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-07-25 08:51:37,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-07-25 08:51:37,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-07-25 08:51:37,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-07-25 08:51:37,212 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2018-07-25 08:51:37,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:37,213 INFO L472 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-07-25 08:51:37,213 INFO L473 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-07-25 08:51:37,213 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-07-25 08:51:37,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-07-25 08:51:37,213 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:37,214 INFO L354 BasicCegarLoop]: trace histogram [109, 1, 1] [2018-07-25 08:51:37,214 INFO L415 AbstractCegarLoop]: === Iteration 110 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:37,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1271178593, now seen corresponding path program 109 times [2018-07-25 08:51:37,214 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:37,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:37,739 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:37,739 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:37,740 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2018-07-25 08:51:37,740 INFO L451 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-07-25 08:51:37,740 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-07-25 08:51:37,741 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=12211, Unknown=0, NotChecked=0, Total=12432 [2018-07-25 08:51:37,741 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 112 states. [2018-07-25 08:51:38,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:38,416 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-07-25 08:51:38,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-07-25 08:51:38,416 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 111 [2018-07-25 08:51:38,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:38,417 INFO L225 Difference]: With dead ends: 114 [2018-07-25 08:51:38,417 INFO L226 Difference]: Without dead ends: 113 [2018-07-25 08:51:38,418 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=221, Invalid=12211, Unknown=0, NotChecked=0, Total=12432 [2018-07-25 08:51:38,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-07-25 08:51:38,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-07-25 08:51:38,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-07-25 08:51:38,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-07-25 08:51:38,423 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2018-07-25 08:51:38,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:38,424 INFO L472 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-07-25 08:51:38,424 INFO L473 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-07-25 08:51:38,424 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-07-25 08:51:38,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-07-25 08:51:38,424 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:38,425 INFO L354 BasicCegarLoop]: trace histogram [110, 1, 1] [2018-07-25 08:51:38,425 INFO L415 AbstractCegarLoop]: === Iteration 111 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:38,425 INFO L82 PathProgramCache]: Analyzing trace with hash 751830663, now seen corresponding path program 110 times [2018-07-25 08:51:38,425 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:38,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:39,231 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:39,232 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:39,232 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-07-25 08:51:39,232 INFO L451 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-07-25 08:51:39,233 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-07-25 08:51:39,234 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=12433, Unknown=0, NotChecked=0, Total=12656 [2018-07-25 08:51:39,234 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 113 states. [2018-07-25 08:51:40,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:40,019 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-07-25 08:51:40,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-07-25 08:51:40,020 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 112 [2018-07-25 08:51:40,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:40,020 INFO L225 Difference]: With dead ends: 115 [2018-07-25 08:51:40,020 INFO L226 Difference]: Without dead ends: 114 [2018-07-25 08:51:40,021 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=223, Invalid=12433, Unknown=0, NotChecked=0, Total=12656 [2018-07-25 08:51:40,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-07-25 08:51:40,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-07-25 08:51:40,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-07-25 08:51:40,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2018-07-25 08:51:40,029 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2018-07-25 08:51:40,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:40,030 INFO L472 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2018-07-25 08:51:40,030 INFO L473 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-07-25 08:51:40,030 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-07-25 08:51:40,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-07-25 08:51:40,031 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:40,031 INFO L354 BasicCegarLoop]: trace histogram [111, 1, 1] [2018-07-25 08:51:40,031 INFO L415 AbstractCegarLoop]: === Iteration 112 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:40,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1831914017, now seen corresponding path program 111 times [2018-07-25 08:51:40,031 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:40,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:40,623 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:40,623 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:40,623 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2018-07-25 08:51:40,624 INFO L451 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-07-25 08:51:40,624 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-07-25 08:51:40,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=12657, Unknown=0, NotChecked=0, Total=12882 [2018-07-25 08:51:40,625 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 114 states. [2018-07-25 08:51:41,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:41,314 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-07-25 08:51:41,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-07-25 08:51:41,314 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 113 [2018-07-25 08:51:41,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:41,315 INFO L225 Difference]: With dead ends: 116 [2018-07-25 08:51:41,315 INFO L226 Difference]: Without dead ends: 115 [2018-07-25 08:51:41,316 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=225, Invalid=12657, Unknown=0, NotChecked=0, Total=12882 [2018-07-25 08:51:41,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-07-25 08:51:41,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-07-25 08:51:41,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-07-25 08:51:41,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-07-25 08:51:41,321 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 113 [2018-07-25 08:51:41,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:41,322 INFO L472 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-07-25 08:51:41,322 INFO L473 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-07-25 08:51:41,322 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-07-25 08:51:41,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-07-25 08:51:41,322 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:41,323 INFO L354 BasicCegarLoop]: trace histogram [112, 1, 1] [2018-07-25 08:51:41,323 INFO L415 AbstractCegarLoop]: === Iteration 113 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:41,323 INFO L82 PathProgramCache]: Analyzing trace with hash 954759623, now seen corresponding path program 112 times [2018-07-25 08:51:41,323 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:41,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:41,902 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:41,903 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:41,903 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-07-25 08:51:41,903 INFO L451 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-07-25 08:51:41,904 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-07-25 08:51:41,905 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=12883, Unknown=0, NotChecked=0, Total=13110 [2018-07-25 08:51:41,905 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 115 states. [2018-07-25 08:51:42,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:42,605 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-07-25 08:51:42,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-07-25 08:51:42,605 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 114 [2018-07-25 08:51:42,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:42,606 INFO L225 Difference]: With dead ends: 117 [2018-07-25 08:51:42,606 INFO L226 Difference]: Without dead ends: 116 [2018-07-25 08:51:42,607 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=227, Invalid=12883, Unknown=0, NotChecked=0, Total=13110 [2018-07-25 08:51:42,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-07-25 08:51:42,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-07-25 08:51:42,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-07-25 08:51:42,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-07-25 08:51:42,611 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 114 [2018-07-25 08:51:42,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:42,611 INFO L472 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-07-25 08:51:42,612 INFO L473 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-07-25 08:51:42,612 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-07-25 08:51:42,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-07-25 08:51:42,612 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:42,612 INFO L354 BasicCegarLoop]: trace histogram [113, 1, 1] [2018-07-25 08:51:42,612 INFO L415 AbstractCegarLoop]: === Iteration 114 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:42,612 INFO L82 PathProgramCache]: Analyzing trace with hash -467222815, now seen corresponding path program 113 times [2018-07-25 08:51:42,613 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:42,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:43,233 INFO L134 CoverageAnalysis]: Checked inductivity of 6441 backedges. 0 proven. 6441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:43,234 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:43,234 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2018-07-25 08:51:43,234 INFO L451 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-07-25 08:51:43,234 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-07-25 08:51:43,235 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=13111, Unknown=0, NotChecked=0, Total=13340 [2018-07-25 08:51:43,235 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 116 states. [2018-07-25 08:51:43,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:43,972 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2018-07-25 08:51:43,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-07-25 08:51:43,972 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 115 [2018-07-25 08:51:43,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:43,973 INFO L225 Difference]: With dead ends: 118 [2018-07-25 08:51:43,973 INFO L226 Difference]: Without dead ends: 117 [2018-07-25 08:51:43,973 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=229, Invalid=13111, Unknown=0, NotChecked=0, Total=13340 [2018-07-25 08:51:43,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-07-25 08:51:43,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-07-25 08:51:43,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-07-25 08:51:43,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-07-25 08:51:43,979 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 115 [2018-07-25 08:51:43,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:43,979 INFO L472 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-07-25 08:51:43,979 INFO L473 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-07-25 08:51:43,979 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-07-25 08:51:43,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-07-25 08:51:43,980 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:43,980 INFO L354 BasicCegarLoop]: trace histogram [114, 1, 1] [2018-07-25 08:51:43,980 INFO L415 AbstractCegarLoop]: === Iteration 115 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:43,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1599005433, now seen corresponding path program 114 times [2018-07-25 08:51:43,980 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:44,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:44,556 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:44,557 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:44,557 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-07-25 08:51:44,557 INFO L451 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-07-25 08:51:44,557 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-07-25 08:51:44,558 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=13341, Unknown=0, NotChecked=0, Total=13572 [2018-07-25 08:51:44,558 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 117 states. [2018-07-25 08:51:45,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:45,305 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-07-25 08:51:45,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-07-25 08:51:45,306 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 116 [2018-07-25 08:51:45,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:45,306 INFO L225 Difference]: With dead ends: 119 [2018-07-25 08:51:45,306 INFO L226 Difference]: Without dead ends: 118 [2018-07-25 08:51:45,307 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=231, Invalid=13341, Unknown=0, NotChecked=0, Total=13572 [2018-07-25 08:51:45,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-07-25 08:51:45,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-07-25 08:51:45,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-07-25 08:51:45,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2018-07-25 08:51:45,311 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 116 [2018-07-25 08:51:45,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:45,311 INFO L472 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2018-07-25 08:51:45,311 INFO L473 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-07-25 08:51:45,311 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2018-07-25 08:51:45,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-07-25 08:51:45,312 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:45,312 INFO L354 BasicCegarLoop]: trace histogram [115, 1, 1] [2018-07-25 08:51:45,312 INFO L415 AbstractCegarLoop]: === Iteration 116 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:45,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1970439073, now seen corresponding path program 115 times [2018-07-25 08:51:45,312 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:45,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:45,919 INFO L134 CoverageAnalysis]: Checked inductivity of 6670 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:45,920 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:45,920 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2018-07-25 08:51:45,920 INFO L451 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-07-25 08:51:45,920 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-07-25 08:51:45,921 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=13573, Unknown=0, NotChecked=0, Total=13806 [2018-07-25 08:51:45,921 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 118 states. [2018-07-25 08:51:46,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:46,693 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2018-07-25 08:51:46,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-07-25 08:51:46,693 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 117 [2018-07-25 08:51:46,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:46,694 INFO L225 Difference]: With dead ends: 120 [2018-07-25 08:51:46,694 INFO L226 Difference]: Without dead ends: 119 [2018-07-25 08:51:46,695 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=233, Invalid=13573, Unknown=0, NotChecked=0, Total=13806 [2018-07-25 08:51:46,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-07-25 08:51:46,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-07-25 08:51:46,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-07-25 08:51:46,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-07-25 08:51:46,700 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 117 [2018-07-25 08:51:46,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:46,700 INFO L472 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-07-25 08:51:46,701 INFO L473 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-07-25 08:51:46,701 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-07-25 08:51:46,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-07-25 08:51:46,701 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:46,701 INFO L354 BasicCegarLoop]: trace histogram [116, 1, 1] [2018-07-25 08:51:46,702 INFO L415 AbstractCegarLoop]: === Iteration 117 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:46,702 INFO L82 PathProgramCache]: Analyzing trace with hash 954069063, now seen corresponding path program 116 times [2018-07-25 08:51:46,702 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:46,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:47,351 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:47,351 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:47,351 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-07-25 08:51:47,352 INFO L451 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-07-25 08:51:47,352 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-07-25 08:51:47,353 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=13807, Unknown=0, NotChecked=0, Total=14042 [2018-07-25 08:51:47,353 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 119 states. [2018-07-25 08:51:48,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:48,202 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-07-25 08:51:48,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-07-25 08:51:48,202 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 118 [2018-07-25 08:51:48,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:48,203 INFO L225 Difference]: With dead ends: 121 [2018-07-25 08:51:48,203 INFO L226 Difference]: Without dead ends: 120 [2018-07-25 08:51:48,204 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=235, Invalid=13807, Unknown=0, NotChecked=0, Total=14042 [2018-07-25 08:51:48,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-07-25 08:51:48,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-07-25 08:51:48,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-07-25 08:51:48,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2018-07-25 08:51:48,209 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 118 [2018-07-25 08:51:48,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:48,209 INFO L472 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2018-07-25 08:51:48,209 INFO L473 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-07-25 08:51:48,210 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2018-07-25 08:51:48,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-07-25 08:51:48,210 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:48,210 INFO L354 BasicCegarLoop]: trace histogram [117, 1, 1] [2018-07-25 08:51:48,210 INFO L415 AbstractCegarLoop]: === Iteration 118 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:48,211 INFO L82 PathProgramCache]: Analyzing trace with hash -488630175, now seen corresponding path program 117 times [2018-07-25 08:51:48,211 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:48,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:48,824 INFO L134 CoverageAnalysis]: Checked inductivity of 6903 backedges. 0 proven. 6903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:48,825 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:48,825 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2018-07-25 08:51:48,825 INFO L451 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-07-25 08:51:48,825 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-07-25 08:51:48,826 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=14043, Unknown=0, NotChecked=0, Total=14280 [2018-07-25 08:51:48,827 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 120 states. [2018-07-25 08:51:49,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:49,626 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2018-07-25 08:51:49,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-07-25 08:51:49,627 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 119 [2018-07-25 08:51:49,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:49,627 INFO L225 Difference]: With dead ends: 122 [2018-07-25 08:51:49,627 INFO L226 Difference]: Without dead ends: 121 [2018-07-25 08:51:49,629 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=237, Invalid=14043, Unknown=0, NotChecked=0, Total=14280 [2018-07-25 08:51:49,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-07-25 08:51:49,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-07-25 08:51:49,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-07-25 08:51:49,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-07-25 08:51:49,634 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 119 [2018-07-25 08:51:49,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:49,635 INFO L472 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-07-25 08:51:49,635 INFO L473 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-07-25 08:51:49,635 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-07-25 08:51:49,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-07-25 08:51:49,635 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:49,636 INFO L354 BasicCegarLoop]: trace histogram [118, 1, 1] [2018-07-25 08:51:49,636 INFO L415 AbstractCegarLoop]: === Iteration 119 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:49,636 INFO L82 PathProgramCache]: Analyzing trace with hash 2032333703, now seen corresponding path program 118 times [2018-07-25 08:51:49,636 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:49,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:50,265 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:50,265 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:50,265 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-07-25 08:51:50,266 INFO L451 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-07-25 08:51:50,266 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-07-25 08:51:50,267 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=14281, Unknown=0, NotChecked=0, Total=14520 [2018-07-25 08:51:50,267 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 121 states. [2018-07-25 08:51:51,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:51,053 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-07-25 08:51:51,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-07-25 08:51:51,054 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 120 [2018-07-25 08:51:51,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:51,054 INFO L225 Difference]: With dead ends: 123 [2018-07-25 08:51:51,054 INFO L226 Difference]: Without dead ends: 122 [2018-07-25 08:51:51,055 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=239, Invalid=14281, Unknown=0, NotChecked=0, Total=14520 [2018-07-25 08:51:51,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-07-25 08:51:51,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-07-25 08:51:51,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-07-25 08:51:51,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2018-07-25 08:51:51,059 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 120 [2018-07-25 08:51:51,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:51,059 INFO L472 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2018-07-25 08:51:51,060 INFO L473 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-07-25 08:51:51,060 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2018-07-25 08:51:51,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-07-25 08:51:51,060 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:51,060 INFO L354 BasicCegarLoop]: trace histogram [119, 1, 1] [2018-07-25 08:51:51,061 INFO L415 AbstractCegarLoop]: === Iteration 120 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:51,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1422164703, now seen corresponding path program 119 times [2018-07-25 08:51:51,061 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:51,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:51,749 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:51,749 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:51,750 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [120] total 120 [2018-07-25 08:51:51,750 INFO L451 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-07-25 08:51:51,750 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-07-25 08:51:51,751 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=14521, Unknown=0, NotChecked=0, Total=14762 [2018-07-25 08:51:51,751 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 122 states. [2018-07-25 08:51:52,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:52,516 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2018-07-25 08:51:52,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-07-25 08:51:52,516 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 121 [2018-07-25 08:51:52,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:52,516 INFO L225 Difference]: With dead ends: 124 [2018-07-25 08:51:52,517 INFO L226 Difference]: Without dead ends: 123 [2018-07-25 08:51:52,517 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=241, Invalid=14521, Unknown=0, NotChecked=0, Total=14762 [2018-07-25 08:51:52,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-07-25 08:51:52,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-07-25 08:51:52,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-07-25 08:51:52,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-07-25 08:51:52,523 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 121 [2018-07-25 08:51:52,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:52,523 INFO L472 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-07-25 08:51:52,523 INFO L473 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-07-25 08:51:52,523 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-07-25 08:51:52,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-07-25 08:51:52,524 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:52,524 INFO L354 BasicCegarLoop]: trace histogram [120, 1, 1] [2018-07-25 08:51:52,524 INFO L415 AbstractCegarLoop]: === Iteration 121 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:52,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1137432889, now seen corresponding path program 120 times [2018-07-25 08:51:52,524 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:52,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:53,168 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:53,168 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:53,168 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-07-25 08:51:53,169 INFO L451 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-07-25 08:51:53,169 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-07-25 08:51:53,170 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=14763, Unknown=0, NotChecked=0, Total=15006 [2018-07-25 08:51:53,170 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 123 states. [2018-07-25 08:51:53,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:53,997 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-07-25 08:51:53,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-07-25 08:51:53,997 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 122 [2018-07-25 08:51:53,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:53,998 INFO L225 Difference]: With dead ends: 125 [2018-07-25 08:51:53,998 INFO L226 Difference]: Without dead ends: 124 [2018-07-25 08:51:53,999 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=243, Invalid=14763, Unknown=0, NotChecked=0, Total=15006 [2018-07-25 08:51:53,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-07-25 08:51:54,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-07-25 08:51:54,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-07-25 08:51:54,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2018-07-25 08:51:54,003 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 122 [2018-07-25 08:51:54,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:54,003 INFO L472 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2018-07-25 08:51:54,003 INFO L473 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-07-25 08:51:54,003 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2018-07-25 08:51:54,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-07-25 08:51:54,004 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:54,004 INFO L354 BasicCegarLoop]: trace histogram [121, 1, 1] [2018-07-25 08:51:54,004 INFO L415 AbstractCegarLoop]: === Iteration 122 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:54,004 INFO L82 PathProgramCache]: Analyzing trace with hash -900681247, now seen corresponding path program 121 times [2018-07-25 08:51:54,004 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:54,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:54,689 INFO L134 CoverageAnalysis]: Checked inductivity of 7381 backedges. 0 proven. 7381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:54,689 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:54,689 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [122] total 122 [2018-07-25 08:51:54,689 INFO L451 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-07-25 08:51:54,690 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-07-25 08:51:54,691 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=15007, Unknown=0, NotChecked=0, Total=15252 [2018-07-25 08:51:54,691 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 124 states. [2018-07-25 08:51:55,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:55,518 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2018-07-25 08:51:55,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-07-25 08:51:55,519 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 123 [2018-07-25 08:51:55,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:55,519 INFO L225 Difference]: With dead ends: 126 [2018-07-25 08:51:55,519 INFO L226 Difference]: Without dead ends: 125 [2018-07-25 08:51:55,520 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=245, Invalid=15007, Unknown=0, NotChecked=0, Total=15252 [2018-07-25 08:51:55,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-07-25 08:51:55,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-07-25 08:51:55,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-07-25 08:51:55,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-07-25 08:51:55,524 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 123 [2018-07-25 08:51:55,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:55,524 INFO L472 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-07-25 08:51:55,524 INFO L473 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-07-25 08:51:55,525 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-07-25 08:51:55,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-07-25 08:51:55,525 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:55,525 INFO L354 BasicCegarLoop]: trace histogram [122, 1, 1] [2018-07-25 08:51:55,525 INFO L415 AbstractCegarLoop]: === Iteration 123 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:55,526 INFO L82 PathProgramCache]: Analyzing trace with hash 2143652359, now seen corresponding path program 122 times [2018-07-25 08:51:55,526 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:55,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:56,248 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:56,248 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:56,249 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-07-25 08:51:56,249 INFO L451 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-07-25 08:51:56,249 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-07-25 08:51:56,249 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=15253, Unknown=0, NotChecked=0, Total=15500 [2018-07-25 08:51:56,250 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 125 states. [2018-07-25 08:51:56,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:56,995 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-07-25 08:51:56,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-07-25 08:51:56,996 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 124 [2018-07-25 08:51:56,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:56,996 INFO L225 Difference]: With dead ends: 127 [2018-07-25 08:51:56,996 INFO L226 Difference]: Without dead ends: 126 [2018-07-25 08:51:56,997 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=247, Invalid=15253, Unknown=0, NotChecked=0, Total=15500 [2018-07-25 08:51:56,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-07-25 08:51:57,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-07-25 08:51:57,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-07-25 08:51:57,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2018-07-25 08:51:57,000 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 124 [2018-07-25 08:51:57,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:57,001 INFO L472 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2018-07-25 08:51:57,001 INFO L473 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-07-25 08:51:57,001 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2018-07-25 08:51:57,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-07-25 08:51:57,001 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:57,001 INFO L354 BasicCegarLoop]: trace histogram [123, 1, 1] [2018-07-25 08:51:57,001 INFO L415 AbstractCegarLoop]: === Iteration 124 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:57,002 INFO L82 PathProgramCache]: Analyzing trace with hash 2028713633, now seen corresponding path program 123 times [2018-07-25 08:51:57,002 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:57,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:57,618 INFO L134 CoverageAnalysis]: Checked inductivity of 7626 backedges. 0 proven. 7626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:57,618 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:57,619 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [124] total 124 [2018-07-25 08:51:57,619 INFO L451 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-07-25 08:51:57,619 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-07-25 08:51:57,620 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=15501, Unknown=0, NotChecked=0, Total=15750 [2018-07-25 08:51:57,620 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 126 states. [2018-07-25 08:51:58,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:58,444 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2018-07-25 08:51:58,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-07-25 08:51:58,444 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 125 [2018-07-25 08:51:58,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:58,445 INFO L225 Difference]: With dead ends: 128 [2018-07-25 08:51:58,445 INFO L226 Difference]: Without dead ends: 127 [2018-07-25 08:51:58,446 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=249, Invalid=15501, Unknown=0, NotChecked=0, Total=15750 [2018-07-25 08:51:58,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-07-25 08:51:58,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-07-25 08:51:58,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-07-25 08:51:58,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-07-25 08:51:58,450 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 125 [2018-07-25 08:51:58,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:58,450 INFO L472 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-07-25 08:51:58,450 INFO L473 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-07-25 08:51:58,450 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-07-25 08:51:58,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-07-25 08:51:58,451 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:58,451 INFO L354 BasicCegarLoop]: trace histogram [124, 1, 1] [2018-07-25 08:51:58,451 INFO L415 AbstractCegarLoop]: === Iteration 125 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:58,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1534386873, now seen corresponding path program 124 times [2018-07-25 08:51:58,451 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:58,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:59,088 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:59,089 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:59,089 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-07-25 08:51:59,089 INFO L451 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-07-25 08:51:59,089 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-07-25 08:51:59,090 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=15751, Unknown=0, NotChecked=0, Total=16002 [2018-07-25 08:51:59,090 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 127 states. [2018-07-25 08:51:59,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:59,927 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-07-25 08:51:59,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-07-25 08:51:59,927 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 126 [2018-07-25 08:51:59,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:59,927 INFO L225 Difference]: With dead ends: 129 [2018-07-25 08:51:59,928 INFO L226 Difference]: Without dead ends: 128 [2018-07-25 08:51:59,928 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=251, Invalid=15751, Unknown=0, NotChecked=0, Total=16002 [2018-07-25 08:51:59,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-07-25 08:51:59,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-07-25 08:51:59,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-07-25 08:51:59,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2018-07-25 08:51:59,934 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 126 [2018-07-25 08:51:59,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:59,934 INFO L472 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2018-07-25 08:51:59,934 INFO L473 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-07-25 08:51:59,934 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2018-07-25 08:51:59,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-07-25 08:51:59,935 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:59,935 INFO L354 BasicCegarLoop]: trace histogram [125, 1, 1] [2018-07-25 08:51:59,935 INFO L415 AbstractCegarLoop]: === Iteration 126 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:59,936 INFO L82 PathProgramCache]: Analyzing trace with hash -321352863, now seen corresponding path program 125 times [2018-07-25 08:51:59,936 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:59,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:00,575 INFO L134 CoverageAnalysis]: Checked inductivity of 7875 backedges. 0 proven. 7875 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:00,575 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:00,575 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [126] total 126 [2018-07-25 08:52:00,575 INFO L451 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-07-25 08:52:00,576 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-07-25 08:52:00,577 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=16003, Unknown=0, NotChecked=0, Total=16256 [2018-07-25 08:52:00,577 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 128 states. [2018-07-25 08:52:01,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:01,362 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2018-07-25 08:52:01,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-07-25 08:52:01,363 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 127 [2018-07-25 08:52:01,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:01,363 INFO L225 Difference]: With dead ends: 130 [2018-07-25 08:52:01,363 INFO L226 Difference]: Without dead ends: 129 [2018-07-25 08:52:01,364 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=253, Invalid=16003, Unknown=0, NotChecked=0, Total=16256 [2018-07-25 08:52:01,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-07-25 08:52:01,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-07-25 08:52:01,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-07-25 08:52:01,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-07-25 08:52:01,370 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 127 [2018-07-25 08:52:01,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:01,371 INFO L472 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-07-25 08:52:01,371 INFO L473 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-07-25 08:52:01,371 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-07-25 08:52:01,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-07-25 08:52:01,371 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:01,371 INFO L354 BasicCegarLoop]: trace histogram [126, 1, 1] [2018-07-25 08:52:01,372 INFO L415 AbstractCegarLoop]: === Iteration 127 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:01,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1372004217, now seen corresponding path program 126 times [2018-07-25 08:52:01,372 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:01,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:02,039 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:02,040 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:02,040 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-07-25 08:52:02,040 INFO L451 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-07-25 08:52:02,040 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-07-25 08:52:02,042 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=16257, Unknown=0, NotChecked=0, Total=16512 [2018-07-25 08:52:02,042 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 129 states. [2018-07-25 08:52:02,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:02,858 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-07-25 08:52:02,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-07-25 08:52:02,859 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 128 [2018-07-25 08:52:02,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:02,859 INFO L225 Difference]: With dead ends: 131 [2018-07-25 08:52:02,859 INFO L226 Difference]: Without dead ends: 130 [2018-07-25 08:52:02,861 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=255, Invalid=16257, Unknown=0, NotChecked=0, Total=16512 [2018-07-25 08:52:02,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-07-25 08:52:02,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-07-25 08:52:02,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-07-25 08:52:02,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2018-07-25 08:52:02,864 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 128 [2018-07-25 08:52:02,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:02,865 INFO L472 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2018-07-25 08:52:02,865 INFO L473 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-07-25 08:52:02,865 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2018-07-25 08:52:02,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-07-25 08:52:02,865 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:02,866 INFO L354 BasicCegarLoop]: trace histogram [127, 1, 1] [2018-07-25 08:52:02,866 INFO L415 AbstractCegarLoop]: === Iteration 128 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:02,866 INFO L82 PathProgramCache]: Analyzing trace with hash 417542177, now seen corresponding path program 127 times [2018-07-25 08:52:02,866 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:02,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:03,691 INFO L134 CoverageAnalysis]: Checked inductivity of 8128 backedges. 0 proven. 8128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:03,692 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:03,692 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [128] total 128 [2018-07-25 08:52:03,692 INFO L451 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-07-25 08:52:03,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-07-25 08:52:03,693 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=16513, Unknown=0, NotChecked=0, Total=16770 [2018-07-25 08:52:03,694 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 130 states. [2018-07-25 08:52:04,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:04,489 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2018-07-25 08:52:04,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-07-25 08:52:04,490 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 129 [2018-07-25 08:52:04,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:04,490 INFO L225 Difference]: With dead ends: 132 [2018-07-25 08:52:04,490 INFO L226 Difference]: Without dead ends: 131 [2018-07-25 08:52:04,491 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=257, Invalid=16513, Unknown=0, NotChecked=0, Total=16770 [2018-07-25 08:52:04,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-07-25 08:52:04,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-07-25 08:52:04,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-07-25 08:52:04,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-07-25 08:52:04,496 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 129 [2018-07-25 08:52:04,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:04,497 INFO L472 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-07-25 08:52:04,497 INFO L473 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-07-25 08:52:04,497 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-07-25 08:52:04,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-07-25 08:52:04,497 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:04,497 INFO L354 BasicCegarLoop]: trace histogram [128, 1, 1] [2018-07-25 08:52:04,498 INFO L415 AbstractCegarLoop]: === Iteration 129 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:04,498 INFO L82 PathProgramCache]: Analyzing trace with hash 58905543, now seen corresponding path program 128 times [2018-07-25 08:52:04,498 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:04,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:05,154 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:05,154 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:05,154 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-07-25 08:52:05,155 INFO L451 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-07-25 08:52:05,155 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-07-25 08:52:05,156 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=16771, Unknown=0, NotChecked=0, Total=17030 [2018-07-25 08:52:05,156 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 131 states. [2018-07-25 08:52:05,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:05,973 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-07-25 08:52:05,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-07-25 08:52:05,973 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 130 [2018-07-25 08:52:05,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:05,974 INFO L225 Difference]: With dead ends: 133 [2018-07-25 08:52:05,974 INFO L226 Difference]: Without dead ends: 132 [2018-07-25 08:52:05,976 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=259, Invalid=16771, Unknown=0, NotChecked=0, Total=17030 [2018-07-25 08:52:05,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-07-25 08:52:05,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-07-25 08:52:05,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-07-25 08:52:05,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2018-07-25 08:52:05,981 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 130 [2018-07-25 08:52:05,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:05,981 INFO L472 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2018-07-25 08:52:05,981 INFO L473 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-07-25 08:52:05,982 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2018-07-25 08:52:05,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-07-25 08:52:05,982 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:05,982 INFO L354 BasicCegarLoop]: trace histogram [129, 1, 1] [2018-07-25 08:52:05,983 INFO L415 AbstractCegarLoop]: === Iteration 130 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:05,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1826071777, now seen corresponding path program 129 times [2018-07-25 08:52:05,983 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:06,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:06,647 INFO L134 CoverageAnalysis]: Checked inductivity of 8385 backedges. 0 proven. 8385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:06,647 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:06,648 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [130] total 130 [2018-07-25 08:52:06,648 INFO L451 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-07-25 08:52:06,648 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-07-25 08:52:06,649 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=17031, Unknown=0, NotChecked=0, Total=17292 [2018-07-25 08:52:06,649 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 132 states. [2018-07-25 08:52:07,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:07,623 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2018-07-25 08:52:07,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-07-25 08:52:07,623 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 131 [2018-07-25 08:52:07,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:07,624 INFO L225 Difference]: With dead ends: 134 [2018-07-25 08:52:07,624 INFO L226 Difference]: Without dead ends: 133 [2018-07-25 08:52:07,625 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=261, Invalid=17031, Unknown=0, NotChecked=0, Total=17292 [2018-07-25 08:52:07,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-07-25 08:52:07,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-07-25 08:52:07,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-07-25 08:52:07,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-07-25 08:52:07,629 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 131 [2018-07-25 08:52:07,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:07,630 INFO L472 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-07-25 08:52:07,630 INFO L473 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-07-25 08:52:07,630 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-07-25 08:52:07,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-07-25 08:52:07,630 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:07,630 INFO L354 BasicCegarLoop]: trace histogram [130, 1, 1] [2018-07-25 08:52:07,630 INFO L415 AbstractCegarLoop]: === Iteration 131 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:07,631 INFO L82 PathProgramCache]: Analyzing trace with hash 773650183, now seen corresponding path program 130 times [2018-07-25 08:52:07,631 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:07,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:08,381 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:08,381 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:08,381 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-07-25 08:52:08,381 INFO L451 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-07-25 08:52:08,382 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-07-25 08:52:08,383 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=17293, Unknown=0, NotChecked=0, Total=17556 [2018-07-25 08:52:08,383 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 133 states. [2018-07-25 08:52:09,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:09,316 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-07-25 08:52:09,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-07-25 08:52:09,317 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 132 [2018-07-25 08:52:09,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:09,317 INFO L225 Difference]: With dead ends: 135 [2018-07-25 08:52:09,317 INFO L226 Difference]: Without dead ends: 134 [2018-07-25 08:52:09,318 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=263, Invalid=17293, Unknown=0, NotChecked=0, Total=17556 [2018-07-25 08:52:09,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-07-25 08:52:09,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-07-25 08:52:09,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-07-25 08:52:09,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2018-07-25 08:52:09,322 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 132 [2018-07-25 08:52:09,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:09,323 INFO L472 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2018-07-25 08:52:09,323 INFO L473 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-07-25 08:52:09,323 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2018-07-25 08:52:09,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-07-25 08:52:09,323 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:09,323 INFO L354 BasicCegarLoop]: trace histogram [131, 1, 1] [2018-07-25 08:52:09,323 INFO L415 AbstractCegarLoop]: === Iteration 132 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:09,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1786648159, now seen corresponding path program 131 times [2018-07-25 08:52:09,324 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:09,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:10,075 INFO L134 CoverageAnalysis]: Checked inductivity of 8646 backedges. 0 proven. 8646 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:10,075 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:10,075 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [132] total 132 [2018-07-25 08:52:10,076 INFO L451 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-07-25 08:52:10,076 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-07-25 08:52:10,077 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=17557, Unknown=0, NotChecked=0, Total=17822 [2018-07-25 08:52:10,078 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 134 states. [2018-07-25 08:52:11,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:11,045 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2018-07-25 08:52:11,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-07-25 08:52:11,045 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 133 [2018-07-25 08:52:11,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:11,046 INFO L225 Difference]: With dead ends: 136 [2018-07-25 08:52:11,046 INFO L226 Difference]: Without dead ends: 135 [2018-07-25 08:52:11,047 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=265, Invalid=17557, Unknown=0, NotChecked=0, Total=17822 [2018-07-25 08:52:11,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-07-25 08:52:11,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-07-25 08:52:11,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-07-25 08:52:11,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-07-25 08:52:11,051 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 133 [2018-07-25 08:52:11,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:11,052 INFO L472 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-07-25 08:52:11,052 INFO L473 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-07-25 08:52:11,052 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-07-25 08:52:11,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-07-25 08:52:11,052 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:11,052 INFO L354 BasicCegarLoop]: trace histogram [132, 1, 1] [2018-07-25 08:52:11,053 INFO L415 AbstractCegarLoop]: === Iteration 133 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:11,053 INFO L82 PathProgramCache]: Analyzing trace with hash 448481863, now seen corresponding path program 132 times [2018-07-25 08:52:11,053 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:11,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:11,813 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:11,813 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:11,814 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-07-25 08:52:11,814 INFO L451 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-07-25 08:52:11,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-07-25 08:52:11,815 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=17823, Unknown=0, NotChecked=0, Total=18090 [2018-07-25 08:52:11,815 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 135 states. [2018-07-25 08:52:12,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:12,675 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-07-25 08:52:12,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-07-25 08:52:12,675 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 134 [2018-07-25 08:52:12,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:12,676 INFO L225 Difference]: With dead ends: 137 [2018-07-25 08:52:12,676 INFO L226 Difference]: Without dead ends: 136 [2018-07-25 08:52:12,677 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=267, Invalid=17823, Unknown=0, NotChecked=0, Total=18090 [2018-07-25 08:52:12,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-07-25 08:52:12,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-07-25 08:52:12,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-07-25 08:52:12,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2018-07-25 08:52:12,682 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 134 [2018-07-25 08:52:12,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:12,683 INFO L472 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2018-07-25 08:52:12,683 INFO L473 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-07-25 08:52:12,683 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2018-07-25 08:52:12,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-07-25 08:52:12,683 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:12,684 INFO L354 BasicCegarLoop]: trace histogram [133, 1, 1] [2018-07-25 08:52:12,684 INFO L415 AbstractCegarLoop]: === Iteration 134 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:12,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1018035809, now seen corresponding path program 133 times [2018-07-25 08:52:12,684 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:12,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:13,358 INFO L134 CoverageAnalysis]: Checked inductivity of 8911 backedges. 0 proven. 8911 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:13,358 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:13,358 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [134] total 134 [2018-07-25 08:52:13,359 INFO L451 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-07-25 08:52:13,359 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-07-25 08:52:13,361 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=18091, Unknown=0, NotChecked=0, Total=18360 [2018-07-25 08:52:13,361 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 136 states. [2018-07-25 08:52:14,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:14,290 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2018-07-25 08:52:14,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-07-25 08:52:14,290 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 135 [2018-07-25 08:52:14,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:14,291 INFO L225 Difference]: With dead ends: 138 [2018-07-25 08:52:14,291 INFO L226 Difference]: Without dead ends: 137 [2018-07-25 08:52:14,292 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=269, Invalid=18091, Unknown=0, NotChecked=0, Total=18360 [2018-07-25 08:52:14,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-07-25 08:52:14,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-07-25 08:52:14,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-07-25 08:52:14,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-07-25 08:52:14,296 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 135 [2018-07-25 08:52:14,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:14,296 INFO L472 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-07-25 08:52:14,297 INFO L473 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-07-25 08:52:14,297 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-07-25 08:52:14,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-07-25 08:52:14,297 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:14,297 INFO L354 BasicCegarLoop]: trace histogram [134, 1, 1] [2018-07-25 08:52:14,298 INFO L415 AbstractCegarLoop]: === Iteration 135 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:14,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1494338951, now seen corresponding path program 134 times [2018-07-25 08:52:14,298 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:14,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:15,147 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:15,147 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:15,147 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-07-25 08:52:15,147 INFO L451 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-07-25 08:52:15,148 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-07-25 08:52:15,149 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=18361, Unknown=0, NotChecked=0, Total=18632 [2018-07-25 08:52:15,149 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 137 states. [2018-07-25 08:52:16,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:16,152 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-07-25 08:52:16,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-07-25 08:52:16,152 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 136 [2018-07-25 08:52:16,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:16,152 INFO L225 Difference]: With dead ends: 139 [2018-07-25 08:52:16,152 INFO L226 Difference]: Without dead ends: 138 [2018-07-25 08:52:16,154 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=271, Invalid=18361, Unknown=0, NotChecked=0, Total=18632 [2018-07-25 08:52:16,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-07-25 08:52:16,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-07-25 08:52:16,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-07-25 08:52:16,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2018-07-25 08:52:16,158 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 136 [2018-07-25 08:52:16,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:16,158 INFO L472 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2018-07-25 08:52:16,159 INFO L473 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-07-25 08:52:16,159 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2018-07-25 08:52:16,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-07-25 08:52:16,159 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:16,160 INFO L354 BasicCegarLoop]: trace histogram [135, 1, 1] [2018-07-25 08:52:16,160 INFO L415 AbstractCegarLoop]: === Iteration 136 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:16,160 INFO L82 PathProgramCache]: Analyzing trace with hash -920132831, now seen corresponding path program 135 times [2018-07-25 08:52:16,160 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:16,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:17,081 INFO L134 CoverageAnalysis]: Checked inductivity of 9180 backedges. 0 proven. 9180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:17,082 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:17,082 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [136] total 136 [2018-07-25 08:52:17,082 INFO L451 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-07-25 08:52:17,082 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-07-25 08:52:17,083 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=18633, Unknown=0, NotChecked=0, Total=18906 [2018-07-25 08:52:17,083 INFO L87 Difference]: Start difference. First operand 138 states and 138 transitions. Second operand 138 states. [2018-07-25 08:52:17,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:17,954 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2018-07-25 08:52:17,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-07-25 08:52:17,954 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 137 [2018-07-25 08:52:17,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:17,954 INFO L225 Difference]: With dead ends: 140 [2018-07-25 08:52:17,954 INFO L226 Difference]: Without dead ends: 139 [2018-07-25 08:52:17,956 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=273, Invalid=18633, Unknown=0, NotChecked=0, Total=18906 [2018-07-25 08:52:17,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-07-25 08:52:17,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-07-25 08:52:17,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-07-25 08:52:17,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2018-07-25 08:52:17,960 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 137 [2018-07-25 08:52:17,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:17,960 INFO L472 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2018-07-25 08:52:17,960 INFO L473 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-07-25 08:52:17,960 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2018-07-25 08:52:17,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-07-25 08:52:17,961 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:17,961 INFO L354 BasicCegarLoop]: trace histogram [136, 1, 1] [2018-07-25 08:52:17,961 INFO L415 AbstractCegarLoop]: === Iteration 137 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:17,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1540653255, now seen corresponding path program 136 times [2018-07-25 08:52:17,961 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:17,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:18,703 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:18,703 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:18,703 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-07-25 08:52:18,704 INFO L451 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-07-25 08:52:18,704 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-07-25 08:52:18,705 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=18907, Unknown=0, NotChecked=0, Total=19182 [2018-07-25 08:52:18,705 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 139 states. [2018-07-25 08:52:19,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:19,606 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-07-25 08:52:19,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-07-25 08:52:19,606 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 138 [2018-07-25 08:52:19,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:19,606 INFO L225 Difference]: With dead ends: 141 [2018-07-25 08:52:19,606 INFO L226 Difference]: Without dead ends: 140 [2018-07-25 08:52:19,607 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=275, Invalid=18907, Unknown=0, NotChecked=0, Total=19182 [2018-07-25 08:52:19,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-07-25 08:52:19,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-07-25 08:52:19,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-07-25 08:52:19,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2018-07-25 08:52:19,611 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 138 [2018-07-25 08:52:19,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:19,611 INFO L472 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2018-07-25 08:52:19,611 INFO L473 AbstractCegarLoop]: Interpolant automaton has 139 states. [2018-07-25 08:52:19,611 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2018-07-25 08:52:19,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-07-25 08:52:19,612 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:19,612 INFO L354 BasicCegarLoop]: trace histogram [137, 1, 1] [2018-07-25 08:52:19,612 INFO L415 AbstractCegarLoop]: === Iteration 138 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:19,612 INFO L82 PathProgramCache]: Analyzing trace with hash 515610593, now seen corresponding path program 137 times [2018-07-25 08:52:19,612 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:19,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:20,395 INFO L134 CoverageAnalysis]: Checked inductivity of 9453 backedges. 0 proven. 9453 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:20,395 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:20,396 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [138] total 138 [2018-07-25 08:52:20,396 INFO L451 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-07-25 08:52:20,396 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-07-25 08:52:20,397 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=19183, Unknown=0, NotChecked=0, Total=19460 [2018-07-25 08:52:20,397 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 140 states. [2018-07-25 08:52:21,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:21,330 INFO L93 Difference]: Finished difference Result 142 states and 142 transitions. [2018-07-25 08:52:21,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2018-07-25 08:52:21,330 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 139 [2018-07-25 08:52:21,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:21,331 INFO L225 Difference]: With dead ends: 142 [2018-07-25 08:52:21,331 INFO L226 Difference]: Without dead ends: 141 [2018-07-25 08:52:21,332 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=277, Invalid=19183, Unknown=0, NotChecked=0, Total=19460 [2018-07-25 08:52:21,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-07-25 08:52:21,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-07-25 08:52:21,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-07-25 08:52:21,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-07-25 08:52:21,336 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 139 [2018-07-25 08:52:21,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:21,336 INFO L472 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-07-25 08:52:21,336 INFO L473 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-07-25 08:52:21,336 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-07-25 08:52:21,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-07-25 08:52:21,337 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:21,337 INFO L354 BasicCegarLoop]: trace histogram [138, 1, 1] [2018-07-25 08:52:21,337 INFO L415 AbstractCegarLoop]: === Iteration 139 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:21,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1195940857, now seen corresponding path program 138 times [2018-07-25 08:52:21,337 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:21,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:22,149 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:22,149 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:22,150 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-07-25 08:52:22,150 INFO L451 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-07-25 08:52:22,150 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-07-25 08:52:22,151 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=19461, Unknown=0, NotChecked=0, Total=19740 [2018-07-25 08:52:22,151 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 141 states. [2018-07-25 08:52:23,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:23,174 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-07-25 08:52:23,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-07-25 08:52:23,174 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 140 [2018-07-25 08:52:23,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:23,175 INFO L225 Difference]: With dead ends: 143 [2018-07-25 08:52:23,175 INFO L226 Difference]: Without dead ends: 142 [2018-07-25 08:52:23,176 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=279, Invalid=19461, Unknown=0, NotChecked=0, Total=19740 [2018-07-25 08:52:23,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-07-25 08:52:23,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-07-25 08:52:23,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-07-25 08:52:23,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2018-07-25 08:52:23,180 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 140 [2018-07-25 08:52:23,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:23,180 INFO L472 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2018-07-25 08:52:23,180 INFO L473 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-07-25 08:52:23,181 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2018-07-25 08:52:23,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-07-25 08:52:23,181 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:23,181 INFO L354 BasicCegarLoop]: trace histogram [139, 1, 1] [2018-07-25 08:52:23,181 INFO L415 AbstractCegarLoop]: === Iteration 140 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:23,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1580539041, now seen corresponding path program 139 times [2018-07-25 08:52:23,181 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:23,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:24,037 INFO L134 CoverageAnalysis]: Checked inductivity of 9730 backedges. 0 proven. 9730 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:24,038 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:24,038 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [140] total 140 [2018-07-25 08:52:24,038 INFO L451 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-07-25 08:52:24,038 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-07-25 08:52:24,039 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=19741, Unknown=0, NotChecked=0, Total=20022 [2018-07-25 08:52:24,040 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 142 states. [2018-07-25 08:52:25,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:25,071 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2018-07-25 08:52:25,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2018-07-25 08:52:25,072 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 141 [2018-07-25 08:52:25,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:25,072 INFO L225 Difference]: With dead ends: 144 [2018-07-25 08:52:25,072 INFO L226 Difference]: Without dead ends: 143 [2018-07-25 08:52:25,073 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=281, Invalid=19741, Unknown=0, NotChecked=0, Total=20022 [2018-07-25 08:52:25,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-07-25 08:52:25,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-07-25 08:52:25,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-07-25 08:52:25,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-07-25 08:52:25,079 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 141 [2018-07-25 08:52:25,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:25,079 INFO L472 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-07-25 08:52:25,079 INFO L473 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-07-25 08:52:25,079 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-07-25 08:52:25,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-07-25 08:52:25,080 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:25,080 INFO L354 BasicCegarLoop]: trace histogram [140, 1, 1] [2018-07-25 08:52:25,080 INFO L415 AbstractCegarLoop]: === Iteration 141 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:25,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1752069959, now seen corresponding path program 140 times [2018-07-25 08:52:25,080 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:25,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:25,926 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:25,926 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:25,926 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2018-07-25 08:52:25,926 INFO L451 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-07-25 08:52:25,927 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-07-25 08:52:25,928 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=20023, Unknown=0, NotChecked=0, Total=20306 [2018-07-25 08:52:25,928 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 143 states. [2018-07-25 08:52:26,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:26,974 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-07-25 08:52:26,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-07-25 08:52:26,974 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 142 [2018-07-25 08:52:26,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:26,974 INFO L225 Difference]: With dead ends: 145 [2018-07-25 08:52:26,975 INFO L226 Difference]: Without dead ends: 144 [2018-07-25 08:52:26,976 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=283, Invalid=20023, Unknown=0, NotChecked=0, Total=20306 [2018-07-25 08:52:26,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-07-25 08:52:26,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-07-25 08:52:26,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-07-25 08:52:26,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 144 transitions. [2018-07-25 08:52:26,980 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 144 transitions. Word has length 142 [2018-07-25 08:52:26,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:26,980 INFO L472 AbstractCegarLoop]: Abstraction has 144 states and 144 transitions. [2018-07-25 08:52:26,981 INFO L473 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-07-25 08:52:26,981 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 144 transitions. [2018-07-25 08:52:26,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-07-25 08:52:26,981 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:26,981 INFO L354 BasicCegarLoop]: trace histogram [141, 1, 1] [2018-07-25 08:52:26,982 INFO L415 AbstractCegarLoop]: === Iteration 142 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:26,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1520406175, now seen corresponding path program 141 times [2018-07-25 08:52:26,982 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:27,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:27,843 INFO L134 CoverageAnalysis]: Checked inductivity of 10011 backedges. 0 proven. 10011 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:27,843 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:27,843 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [142] total 142 [2018-07-25 08:52:27,843 INFO L451 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-07-25 08:52:27,843 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-07-25 08:52:27,844 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=20307, Unknown=0, NotChecked=0, Total=20592 [2018-07-25 08:52:27,845 INFO L87 Difference]: Start difference. First operand 144 states and 144 transitions. Second operand 144 states. [2018-07-25 08:52:28,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:28,937 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2018-07-25 08:52:28,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-07-25 08:52:28,938 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 143 [2018-07-25 08:52:28,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:28,938 INFO L225 Difference]: With dead ends: 146 [2018-07-25 08:52:28,938 INFO L226 Difference]: Without dead ends: 145 [2018-07-25 08:52:28,939 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=285, Invalid=20307, Unknown=0, NotChecked=0, Total=20592 [2018-07-25 08:52:28,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-07-25 08:52:28,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-07-25 08:52:28,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-07-25 08:52:28,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-07-25 08:52:28,943 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 143 [2018-07-25 08:52:28,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:28,943 INFO L472 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-07-25 08:52:28,943 INFO L473 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-07-25 08:52:28,943 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-07-25 08:52:28,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-07-25 08:52:28,944 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:28,944 INFO L354 BasicCegarLoop]: trace histogram [142, 1, 1] [2018-07-25 08:52:28,944 INFO L415 AbstractCegarLoop]: === Iteration 143 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:28,944 INFO L82 PathProgramCache]: Analyzing trace with hash 112048775, now seen corresponding path program 142 times [2018-07-25 08:52:28,944 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:28,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:29,900 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:29,900 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:29,900 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2018-07-25 08:52:29,900 INFO L451 AbstractCegarLoop]: Interpolant automaton has 145 states [2018-07-25 08:52:29,901 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2018-07-25 08:52:29,901 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=20593, Unknown=0, NotChecked=0, Total=20880 [2018-07-25 08:52:29,902 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 145 states. [2018-07-25 08:52:30,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:30,990 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-07-25 08:52:30,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2018-07-25 08:52:30,990 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 144 [2018-07-25 08:52:30,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:30,991 INFO L225 Difference]: With dead ends: 147 [2018-07-25 08:52:30,991 INFO L226 Difference]: Without dead ends: 146 [2018-07-25 08:52:30,992 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=287, Invalid=20593, Unknown=0, NotChecked=0, Total=20880 [2018-07-25 08:52:30,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-07-25 08:52:30,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-07-25 08:52:30,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-07-25 08:52:30,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2018-07-25 08:52:30,996 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 144 [2018-07-25 08:52:30,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:30,997 INFO L472 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2018-07-25 08:52:30,997 INFO L473 AbstractCegarLoop]: Interpolant automaton has 145 states. [2018-07-25 08:52:30,997 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2018-07-25 08:52:30,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-07-25 08:52:30,997 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:30,997 INFO L354 BasicCegarLoop]: trace histogram [143, 1, 1] [2018-07-25 08:52:30,997 INFO L415 AbstractCegarLoop]: === Iteration 144 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:30,998 INFO L82 PathProgramCache]: Analyzing trace with hash -821455327, now seen corresponding path program 143 times [2018-07-25 08:52:30,998 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:31,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:31,881 INFO L134 CoverageAnalysis]: Checked inductivity of 10296 backedges. 0 proven. 10296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:31,881 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:31,882 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [144] total 144 [2018-07-25 08:52:31,882 INFO L451 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-07-25 08:52:31,882 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-07-25 08:52:31,883 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=20881, Unknown=0, NotChecked=0, Total=21170 [2018-07-25 08:52:31,884 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 146 states. [2018-07-25 08:52:32,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:32,995 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2018-07-25 08:52:32,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-07-25 08:52:32,995 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 145 [2018-07-25 08:52:32,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:32,996 INFO L225 Difference]: With dead ends: 148 [2018-07-25 08:52:32,996 INFO L226 Difference]: Without dead ends: 147 [2018-07-25 08:52:32,997 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=289, Invalid=20881, Unknown=0, NotChecked=0, Total=21170 [2018-07-25 08:52:32,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-07-25 08:52:33,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-07-25 08:52:33,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-07-25 08:52:33,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-07-25 08:52:33,002 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 145 [2018-07-25 08:52:33,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:33,002 INFO L472 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-07-25 08:52:33,002 INFO L473 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-07-25 08:52:33,002 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-07-25 08:52:33,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-07-25 08:52:33,002 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:33,002 INFO L354 BasicCegarLoop]: trace histogram [144, 1, 1] [2018-07-25 08:52:33,003 INFO L415 AbstractCegarLoop]: === Iteration 145 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:33,003 INFO L82 PathProgramCache]: Analyzing trace with hash 304688583, now seen corresponding path program 144 times [2018-07-25 08:52:33,003 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:33,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:33,884 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:33,884 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:33,884 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2018-07-25 08:52:33,885 INFO L451 AbstractCegarLoop]: Interpolant automaton has 147 states [2018-07-25 08:52:33,885 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2018-07-25 08:52:33,886 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=21171, Unknown=0, NotChecked=0, Total=21462 [2018-07-25 08:52:33,886 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 147 states. [2018-07-25 08:52:34,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:34,972 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-07-25 08:52:34,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-07-25 08:52:34,972 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 146 [2018-07-25 08:52:34,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:34,973 INFO L225 Difference]: With dead ends: 149 [2018-07-25 08:52:34,973 INFO L226 Difference]: Without dead ends: 148 [2018-07-25 08:52:34,974 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=291, Invalid=21171, Unknown=0, NotChecked=0, Total=21462 [2018-07-25 08:52:34,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-07-25 08:52:34,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-07-25 08:52:34,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-07-25 08:52:34,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2018-07-25 08:52:34,978 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 146 [2018-07-25 08:52:34,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:34,979 INFO L472 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2018-07-25 08:52:34,979 INFO L473 AbstractCegarLoop]: Interpolant automaton has 147 states. [2018-07-25 08:52:34,979 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2018-07-25 08:52:34,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-07-25 08:52:34,979 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:34,979 INFO L354 BasicCegarLoop]: trace histogram [145, 1, 1] [2018-07-25 08:52:34,979 INFO L415 AbstractCegarLoop]: === Iteration 146 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:34,980 INFO L82 PathProgramCache]: Analyzing trace with hash 855411425, now seen corresponding path program 145 times [2018-07-25 08:52:34,980 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:35,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:35,801 INFO L134 CoverageAnalysis]: Checked inductivity of 10585 backedges. 0 proven. 10585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:35,802 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:35,802 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [146] total 146 [2018-07-25 08:52:35,802 INFO L451 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-07-25 08:52:35,802 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-07-25 08:52:35,803 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=21463, Unknown=0, NotChecked=0, Total=21756 [2018-07-25 08:52:35,803 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 148 states. [2018-07-25 08:52:36,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:36,920 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2018-07-25 08:52:36,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2018-07-25 08:52:36,920 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 147 [2018-07-25 08:52:36,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:36,921 INFO L225 Difference]: With dead ends: 150 [2018-07-25 08:52:36,921 INFO L226 Difference]: Without dead ends: 149 [2018-07-25 08:52:36,922 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=293, Invalid=21463, Unknown=0, NotChecked=0, Total=21756 [2018-07-25 08:52:36,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-07-25 08:52:36,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-07-25 08:52:36,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-07-25 08:52:36,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-07-25 08:52:36,927 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 147 [2018-07-25 08:52:36,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:36,927 INFO L472 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-07-25 08:52:36,927 INFO L473 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-07-25 08:52:36,927 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-07-25 08:52:36,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-07-25 08:52:36,927 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:36,927 INFO L354 BasicCegarLoop]: trace histogram [146, 1, 1] [2018-07-25 08:52:36,928 INFO L415 AbstractCegarLoop]: === Iteration 147 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:36,928 INFO L82 PathProgramCache]: Analyzing trace with hash 747950343, now seen corresponding path program 146 times [2018-07-25 08:52:36,928 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:36,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:37,933 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:37,933 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:37,934 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147] total 147 [2018-07-25 08:52:37,934 INFO L451 AbstractCegarLoop]: Interpolant automaton has 149 states [2018-07-25 08:52:37,934 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2018-07-25 08:52:37,935 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=21757, Unknown=0, NotChecked=0, Total=22052 [2018-07-25 08:52:37,935 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 149 states. [2018-07-25 08:52:38,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:38,971 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-07-25 08:52:38,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2018-07-25 08:52:38,971 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 148 [2018-07-25 08:52:38,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:38,971 INFO L225 Difference]: With dead ends: 151 [2018-07-25 08:52:38,971 INFO L226 Difference]: Without dead ends: 150 [2018-07-25 08:52:38,972 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=295, Invalid=21757, Unknown=0, NotChecked=0, Total=22052 [2018-07-25 08:52:38,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-07-25 08:52:38,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-07-25 08:52:38,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-07-25 08:52:38,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2018-07-25 08:52:38,979 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 148 [2018-07-25 08:52:38,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:38,979 INFO L472 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2018-07-25 08:52:38,979 INFO L473 AbstractCegarLoop]: Interpolant automaton has 149 states. [2018-07-25 08:52:38,979 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2018-07-25 08:52:38,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-07-25 08:52:38,980 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:38,980 INFO L354 BasicCegarLoop]: trace histogram [147, 1, 1] [2018-07-25 08:52:38,980 INFO L415 AbstractCegarLoop]: === Iteration 148 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:38,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1711624097, now seen corresponding path program 147 times [2018-07-25 08:52:38,980 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:39,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:39,799 INFO L134 CoverageAnalysis]: Checked inductivity of 10878 backedges. 0 proven. 10878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:39,800 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:39,800 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [148] total 148 [2018-07-25 08:52:39,800 INFO L451 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-07-25 08:52:39,800 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-07-25 08:52:39,802 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=22053, Unknown=0, NotChecked=0, Total=22350 [2018-07-25 08:52:39,802 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 150 states. [2018-07-25 08:52:40,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:40,971 INFO L93 Difference]: Finished difference Result 152 states and 152 transitions. [2018-07-25 08:52:40,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-07-25 08:52:40,971 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 149 [2018-07-25 08:52:40,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:40,972 INFO L225 Difference]: With dead ends: 152 [2018-07-25 08:52:40,972 INFO L226 Difference]: Without dead ends: 151 [2018-07-25 08:52:40,973 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=297, Invalid=22053, Unknown=0, NotChecked=0, Total=22350 [2018-07-25 08:52:40,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-07-25 08:52:40,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-07-25 08:52:40,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-07-25 08:52:40,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-07-25 08:52:40,977 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 149 [2018-07-25 08:52:40,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:40,977 INFO L472 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-07-25 08:52:40,978 INFO L473 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-07-25 08:52:40,978 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-07-25 08:52:40,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-07-25 08:52:40,978 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:40,978 INFO L354 BasicCegarLoop]: trace histogram [148, 1, 1] [2018-07-25 08:52:40,978 INFO L415 AbstractCegarLoop]: === Iteration 149 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:40,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1520739399, now seen corresponding path program 148 times [2018-07-25 08:52:40,979 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:41,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:41,844 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:41,844 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:41,844 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149] total 149 [2018-07-25 08:52:41,844 INFO L451 AbstractCegarLoop]: Interpolant automaton has 151 states [2018-07-25 08:52:41,845 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 151 interpolants. [2018-07-25 08:52:41,845 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=22351, Unknown=0, NotChecked=0, Total=22650 [2018-07-25 08:52:41,846 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 151 states. [2018-07-25 08:52:42,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:42,867 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-07-25 08:52:42,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2018-07-25 08:52:42,868 INFO L78 Accepts]: Start accepts. Automaton has 151 states. Word has length 150 [2018-07-25 08:52:42,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:42,868 INFO L225 Difference]: With dead ends: 153 [2018-07-25 08:52:42,868 INFO L226 Difference]: Without dead ends: 152 [2018-07-25 08:52:42,869 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=299, Invalid=22351, Unknown=0, NotChecked=0, Total=22650 [2018-07-25 08:52:42,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-07-25 08:52:42,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-07-25 08:52:42,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-07-25 08:52:42,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2018-07-25 08:52:42,873 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 150 [2018-07-25 08:52:42,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:42,873 INFO L472 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2018-07-25 08:52:42,873 INFO L473 AbstractCegarLoop]: Interpolant automaton has 151 states. [2018-07-25 08:52:42,873 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2018-07-25 08:52:42,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-07-25 08:52:42,874 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:42,874 INFO L354 BasicCegarLoop]: trace histogram [149, 1, 1] [2018-07-25 08:52:42,874 INFO L415 AbstractCegarLoop]: === Iteration 150 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:42,874 INFO L82 PathProgramCache]: Analyzing trace with hash -101718943, now seen corresponding path program 149 times [2018-07-25 08:52:42,874 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:42,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:43,720 INFO L134 CoverageAnalysis]: Checked inductivity of 11175 backedges. 0 proven. 11175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:43,721 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:43,721 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [150] total 150 [2018-07-25 08:52:43,721 INFO L451 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-07-25 08:52:43,721 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-07-25 08:52:43,722 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=22651, Unknown=0, NotChecked=0, Total=22952 [2018-07-25 08:52:43,722 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 152 states. [2018-07-25 08:52:44,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:44,793 INFO L93 Difference]: Finished difference Result 154 states and 154 transitions. [2018-07-25 08:52:44,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-07-25 08:52:44,794 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 151 [2018-07-25 08:52:44,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:44,794 INFO L225 Difference]: With dead ends: 154 [2018-07-25 08:52:44,794 INFO L226 Difference]: Without dead ends: 153 [2018-07-25 08:52:44,795 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=301, Invalid=22651, Unknown=0, NotChecked=0, Total=22952 [2018-07-25 08:52:44,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-07-25 08:52:44,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-07-25 08:52:44,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-07-25 08:52:44,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-07-25 08:52:44,800 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 151 [2018-07-25 08:52:44,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:44,800 INFO L472 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-07-25 08:52:44,800 INFO L473 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-07-25 08:52:44,800 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-07-25 08:52:44,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-07-25 08:52:44,800 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:44,801 INFO L354 BasicCegarLoop]: trace histogram [150, 1, 1] [2018-07-25 08:52:44,801 INFO L415 AbstractCegarLoop]: === Iteration 151 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:44,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1141680007, now seen corresponding path program 150 times [2018-07-25 08:52:44,801 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:44,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:45,641 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:45,641 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:45,641 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [151] total 151 [2018-07-25 08:52:45,641 INFO L451 AbstractCegarLoop]: Interpolant automaton has 153 states [2018-07-25 08:52:45,642 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2018-07-25 08:52:45,642 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=22953, Unknown=0, NotChecked=0, Total=23256 [2018-07-25 08:52:45,642 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 153 states. [2018-07-25 08:52:46,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:46,806 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-07-25 08:52:46,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-07-25 08:52:46,806 INFO L78 Accepts]: Start accepts. Automaton has 153 states. Word has length 152 [2018-07-25 08:52:46,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:46,807 INFO L225 Difference]: With dead ends: 155 [2018-07-25 08:52:46,807 INFO L226 Difference]: Without dead ends: 154 [2018-07-25 08:52:46,808 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=303, Invalid=22953, Unknown=0, NotChecked=0, Total=23256 [2018-07-25 08:52:46,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-07-25 08:52:46,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-07-25 08:52:46,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-07-25 08:52:46,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 154 transitions. [2018-07-25 08:52:46,812 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 154 transitions. Word has length 152 [2018-07-25 08:52:46,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:46,812 INFO L472 AbstractCegarLoop]: Abstraction has 154 states and 154 transitions. [2018-07-25 08:52:46,812 INFO L473 AbstractCegarLoop]: Interpolant automaton has 153 states. [2018-07-25 08:52:46,813 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 154 transitions. [2018-07-25 08:52:46,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-07-25 08:52:46,813 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:46,813 INFO L354 BasicCegarLoop]: trace histogram [151, 1, 1] [2018-07-25 08:52:46,813 INFO L415 AbstractCegarLoop]: === Iteration 152 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:46,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1032341793, now seen corresponding path program 151 times [2018-07-25 08:52:46,813 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:46,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:47,784 INFO L134 CoverageAnalysis]: Checked inductivity of 11476 backedges. 0 proven. 11476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:47,784 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:47,784 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [152] total 152 [2018-07-25 08:52:47,785 INFO L451 AbstractCegarLoop]: Interpolant automaton has 154 states [2018-07-25 08:52:47,785 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2018-07-25 08:52:47,786 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=23257, Unknown=0, NotChecked=0, Total=23562 [2018-07-25 08:52:47,786 INFO L87 Difference]: Start difference. First operand 154 states and 154 transitions. Second operand 154 states. [2018-07-25 08:52:49,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:49,012 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2018-07-25 08:52:49,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2018-07-25 08:52:49,012 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 153 [2018-07-25 08:52:49,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:49,013 INFO L225 Difference]: With dead ends: 156 [2018-07-25 08:52:49,013 INFO L226 Difference]: Without dead ends: 155 [2018-07-25 08:52:49,014 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=305, Invalid=23257, Unknown=0, NotChecked=0, Total=23562 [2018-07-25 08:52:49,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-07-25 08:52:49,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-07-25 08:52:49,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-07-25 08:52:49,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-07-25 08:52:49,019 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 153 [2018-07-25 08:52:49,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:49,019 INFO L472 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-07-25 08:52:49,019 INFO L473 AbstractCegarLoop]: Interpolant automaton has 154 states. [2018-07-25 08:52:49,019 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-07-25 08:52:49,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-07-25 08:52:49,019 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:49,020 INFO L354 BasicCegarLoop]: trace histogram [152, 1, 1] [2018-07-25 08:52:49,020 INFO L415 AbstractCegarLoop]: === Iteration 153 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:49,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1937824455, now seen corresponding path program 152 times [2018-07-25 08:52:49,020 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:49,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:49,996 INFO L134 CoverageAnalysis]: Checked inductivity of 11628 backedges. 0 proven. 11628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:49,997 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:49,997 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [153] total 153 [2018-07-25 08:52:49,997 INFO L451 AbstractCegarLoop]: Interpolant automaton has 155 states [2018-07-25 08:52:49,997 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2018-07-25 08:52:49,998 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=23563, Unknown=0, NotChecked=0, Total=23870 [2018-07-25 08:52:49,999 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 155 states. [2018-07-25 08:52:51,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:51,118 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2018-07-25 08:52:51,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2018-07-25 08:52:51,119 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 154 [2018-07-25 08:52:51,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:51,119 INFO L225 Difference]: With dead ends: 157 [2018-07-25 08:52:51,119 INFO L226 Difference]: Without dead ends: 156 [2018-07-25 08:52:51,121 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=307, Invalid=23563, Unknown=0, NotChecked=0, Total=23870 [2018-07-25 08:52:51,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-07-25 08:52:51,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-07-25 08:52:51,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-07-25 08:52:51,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2018-07-25 08:52:51,125 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 154 [2018-07-25 08:52:51,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:51,125 INFO L472 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2018-07-25 08:52:51,125 INFO L473 AbstractCegarLoop]: Interpolant automaton has 155 states. [2018-07-25 08:52:51,125 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2018-07-25 08:52:51,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-07-25 08:52:51,126 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:51,126 INFO L354 BasicCegarLoop]: trace histogram [153, 1, 1] [2018-07-25 08:52:51,126 INFO L415 AbstractCegarLoop]: === Iteration 154 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:51,126 INFO L82 PathProgramCache]: Analyzing trace with hash -56984095, now seen corresponding path program 153 times [2018-07-25 08:52:51,126 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:51,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:52,140 INFO L134 CoverageAnalysis]: Checked inductivity of 11781 backedges. 0 proven. 11781 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:52,140 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:52,140 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [154] total 154 [2018-07-25 08:52:52,141 INFO L451 AbstractCegarLoop]: Interpolant automaton has 156 states [2018-07-25 08:52:52,141 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2018-07-25 08:52:52,142 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=23871, Unknown=0, NotChecked=0, Total=24180 [2018-07-25 08:52:52,142 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 156 states. [2018-07-25 08:52:53,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:53,410 INFO L93 Difference]: Finished difference Result 158 states and 158 transitions. [2018-07-25 08:52:53,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-07-25 08:52:53,410 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 155 [2018-07-25 08:52:53,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:53,411 INFO L225 Difference]: With dead ends: 158 [2018-07-25 08:52:53,411 INFO L226 Difference]: Without dead ends: 157 [2018-07-25 08:52:53,412 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=309, Invalid=23871, Unknown=0, NotChecked=0, Total=24180 [2018-07-25 08:52:53,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-07-25 08:52:53,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-07-25 08:52:53,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-07-25 08:52:53,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-07-25 08:52:53,417 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 155 [2018-07-25 08:52:53,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:53,418 INFO L472 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-07-25 08:52:53,418 INFO L473 AbstractCegarLoop]: Interpolant automaton has 156 states. [2018-07-25 08:52:53,418 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-07-25 08:52:53,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-07-25 08:52:53,418 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:53,419 INFO L354 BasicCegarLoop]: trace histogram [154, 1, 1] [2018-07-25 08:52:53,419 INFO L415 AbstractCegarLoop]: === Iteration 155 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:53,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1766507001, now seen corresponding path program 154 times [2018-07-25 08:52:53,419 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:53,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:54,944 INFO L134 CoverageAnalysis]: Checked inductivity of 11935 backedges. 0 proven. 11935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:54,945 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:54,945 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [155] total 155 [2018-07-25 08:52:54,945 INFO L451 AbstractCegarLoop]: Interpolant automaton has 157 states [2018-07-25 08:52:54,945 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 157 interpolants. [2018-07-25 08:52:54,946 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=24181, Unknown=0, NotChecked=0, Total=24492 [2018-07-25 08:52:54,947 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 157 states. [2018-07-25 08:52:56,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:56,215 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-07-25 08:52:56,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2018-07-25 08:52:56,215 INFO L78 Accepts]: Start accepts. Automaton has 157 states. Word has length 156 [2018-07-25 08:52:56,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:56,216 INFO L225 Difference]: With dead ends: 159 [2018-07-25 08:52:56,216 INFO L226 Difference]: Without dead ends: 158 [2018-07-25 08:52:56,217 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=311, Invalid=24181, Unknown=0, NotChecked=0, Total=24492 [2018-07-25 08:52:56,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-07-25 08:52:56,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-07-25 08:52:56,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-07-25 08:52:56,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2018-07-25 08:52:56,222 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 156 [2018-07-25 08:52:56,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:56,222 INFO L472 AbstractCegarLoop]: Abstraction has 158 states and 158 transitions. [2018-07-25 08:52:56,222 INFO L473 AbstractCegarLoop]: Interpolant automaton has 157 states. [2018-07-25 08:52:56,222 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2018-07-25 08:52:56,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-07-25 08:52:56,222 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:56,223 INFO L354 BasicCegarLoop]: trace histogram [155, 1, 1] [2018-07-25 08:52:56,223 INFO L415 AbstractCegarLoop]: === Iteration 156 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:56,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1072857761, now seen corresponding path program 155 times [2018-07-25 08:52:56,223 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:56,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:57,288 INFO L134 CoverageAnalysis]: Checked inductivity of 12090 backedges. 0 proven. 12090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:57,288 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:57,289 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [156] total 156 [2018-07-25 08:52:57,289 INFO L451 AbstractCegarLoop]: Interpolant automaton has 158 states [2018-07-25 08:52:57,289 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2018-07-25 08:52:57,289 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=24493, Unknown=0, NotChecked=0, Total=24806 [2018-07-25 08:52:57,290 INFO L87 Difference]: Start difference. First operand 158 states and 158 transitions. Second operand 158 states. [2018-07-25 08:52:58,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:58,530 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2018-07-25 08:52:58,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2018-07-25 08:52:58,530 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 157 [2018-07-25 08:52:58,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:58,531 INFO L225 Difference]: With dead ends: 160 [2018-07-25 08:52:58,531 INFO L226 Difference]: Without dead ends: 159 [2018-07-25 08:52:58,532 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=313, Invalid=24493, Unknown=0, NotChecked=0, Total=24806 [2018-07-25 08:52:58,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-07-25 08:52:58,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-07-25 08:52:58,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-07-25 08:52:58,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2018-07-25 08:52:58,536 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 157 [2018-07-25 08:52:58,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:58,536 INFO L472 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2018-07-25 08:52:58,536 INFO L473 AbstractCegarLoop]: Interpolant automaton has 158 states. [2018-07-25 08:52:58,536 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2018-07-25 08:52:58,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-07-25 08:52:58,537 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:58,537 INFO L354 BasicCegarLoop]: trace histogram [156, 1, 1] [2018-07-25 08:52:58,537 INFO L415 AbstractCegarLoop]: === Iteration 157 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:58,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1101147833, now seen corresponding path program 156 times [2018-07-25 08:52:58,537 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:58,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:59,571 INFO L134 CoverageAnalysis]: Checked inductivity of 12246 backedges. 0 proven. 12246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:59,572 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:59,572 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [157] total 157 [2018-07-25 08:52:59,572 INFO L451 AbstractCegarLoop]: Interpolant automaton has 159 states [2018-07-25 08:52:59,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 159 interpolants. [2018-07-25 08:52:59,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=24807, Unknown=0, NotChecked=0, Total=25122 [2018-07-25 08:52:59,574 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 159 states. [2018-07-25 08:53:00,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:00,885 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-07-25 08:53:00,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2018-07-25 08:53:00,885 INFO L78 Accepts]: Start accepts. Automaton has 159 states. Word has length 158 [2018-07-25 08:53:00,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:00,886 INFO L225 Difference]: With dead ends: 161 [2018-07-25 08:53:00,886 INFO L226 Difference]: Without dead ends: 160 [2018-07-25 08:53:00,887 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=315, Invalid=24807, Unknown=0, NotChecked=0, Total=25122 [2018-07-25 08:53:00,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-07-25 08:53:00,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-07-25 08:53:00,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-07-25 08:53:00,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 160 transitions. [2018-07-25 08:53:00,892 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 160 transitions. Word has length 158 [2018-07-25 08:53:00,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:00,892 INFO L472 AbstractCegarLoop]: Abstraction has 160 states and 160 transitions. [2018-07-25 08:53:00,892 INFO L473 AbstractCegarLoop]: Interpolant automaton has 159 states. [2018-07-25 08:53:00,892 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 160 transitions. [2018-07-25 08:53:00,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-07-25 08:53:00,893 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:00,893 INFO L354 BasicCegarLoop]: trace histogram [157, 1, 1] [2018-07-25 08:53:00,893 INFO L415 AbstractCegarLoop]: === Iteration 158 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:00,893 INFO L82 PathProgramCache]: Analyzing trace with hash 224155489, now seen corresponding path program 157 times [2018-07-25 08:53:00,893 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:00,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:01,955 INFO L134 CoverageAnalysis]: Checked inductivity of 12403 backedges. 0 proven. 12403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:01,955 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:01,955 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [158] total 158 [2018-07-25 08:53:01,955 INFO L451 AbstractCegarLoop]: Interpolant automaton has 160 states [2018-07-25 08:53:01,956 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2018-07-25 08:53:01,957 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=25123, Unknown=0, NotChecked=0, Total=25440 [2018-07-25 08:53:01,957 INFO L87 Difference]: Start difference. First operand 160 states and 160 transitions. Second operand 160 states. [2018-07-25 08:53:03,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:03,242 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2018-07-25 08:53:03,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2018-07-25 08:53:03,242 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 159 [2018-07-25 08:53:03,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:03,243 INFO L225 Difference]: With dead ends: 162 [2018-07-25 08:53:03,243 INFO L226 Difference]: Without dead ends: 161 [2018-07-25 08:53:03,244 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=317, Invalid=25123, Unknown=0, NotChecked=0, Total=25440 [2018-07-25 08:53:03,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-07-25 08:53:03,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-07-25 08:53:03,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-07-25 08:53:03,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-07-25 08:53:03,249 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 159 [2018-07-25 08:53:03,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:03,249 INFO L472 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-07-25 08:53:03,249 INFO L473 AbstractCegarLoop]: Interpolant automaton has 160 states. [2018-07-25 08:53:03,249 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-07-25 08:53:03,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-07-25 08:53:03,250 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:03,250 INFO L354 BasicCegarLoop]: trace histogram [158, 1, 1] [2018-07-25 08:53:03,250 INFO L415 AbstractCegarLoop]: === Iteration 159 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:03,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1641114489, now seen corresponding path program 158 times [2018-07-25 08:53:03,250 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:03,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:04,329 INFO L134 CoverageAnalysis]: Checked inductivity of 12561 backedges. 0 proven. 12561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:04,329 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:04,329 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [159] total 159 [2018-07-25 08:53:04,330 INFO L451 AbstractCegarLoop]: Interpolant automaton has 161 states [2018-07-25 08:53:04,330 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 161 interpolants. [2018-07-25 08:53:04,331 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=319, Invalid=25441, Unknown=0, NotChecked=0, Total=25760 [2018-07-25 08:53:04,331 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 161 states. [2018-07-25 08:53:05,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:05,642 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-07-25 08:53:05,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2018-07-25 08:53:05,642 INFO L78 Accepts]: Start accepts. Automaton has 161 states. Word has length 160 [2018-07-25 08:53:05,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:05,643 INFO L225 Difference]: With dead ends: 163 [2018-07-25 08:53:05,643 INFO L226 Difference]: Without dead ends: 162 [2018-07-25 08:53:05,644 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=319, Invalid=25441, Unknown=0, NotChecked=0, Total=25760 [2018-07-25 08:53:05,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-07-25 08:53:05,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-07-25 08:53:05,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-07-25 08:53:05,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2018-07-25 08:53:05,648 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 160 [2018-07-25 08:53:05,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:05,648 INFO L472 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2018-07-25 08:53:05,648 INFO L473 AbstractCegarLoop]: Interpolant automaton has 161 states. [2018-07-25 08:53:05,648 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2018-07-25 08:53:05,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-07-25 08:53:05,649 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:05,649 INFO L354 BasicCegarLoop]: trace histogram [159, 1, 1] [2018-07-25 08:53:05,649 INFO L415 AbstractCegarLoop]: === Iteration 160 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:05,649 INFO L82 PathProgramCache]: Analyzing trace with hash 665058337, now seen corresponding path program 159 times [2018-07-25 08:53:05,650 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:05,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:06,716 INFO L134 CoverageAnalysis]: Checked inductivity of 12720 backedges. 0 proven. 12720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:06,716 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:06,716 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [160] total 160 [2018-07-25 08:53:06,716 INFO L451 AbstractCegarLoop]: Interpolant automaton has 162 states [2018-07-25 08:53:06,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2018-07-25 08:53:06,718 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=25761, Unknown=0, NotChecked=0, Total=26082 [2018-07-25 08:53:06,718 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 162 states. [2018-07-25 08:53:08,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:08,082 INFO L93 Difference]: Finished difference Result 164 states and 164 transitions. [2018-07-25 08:53:08,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2018-07-25 08:53:08,082 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 161 [2018-07-25 08:53:08,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:08,083 INFO L225 Difference]: With dead ends: 164 [2018-07-25 08:53:08,083 INFO L226 Difference]: Without dead ends: 163 [2018-07-25 08:53:08,084 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=321, Invalid=25761, Unknown=0, NotChecked=0, Total=26082 [2018-07-25 08:53:08,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-07-25 08:53:08,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-07-25 08:53:08,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-07-25 08:53:08,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-07-25 08:53:08,089 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 161 [2018-07-25 08:53:08,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:08,090 INFO L472 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-07-25 08:53:08,090 INFO L473 AbstractCegarLoop]: Interpolant automaton has 162 states. [2018-07-25 08:53:08,090 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-07-25 08:53:08,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-07-25 08:53:08,090 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:08,091 INFO L354 BasicCegarLoop]: trace histogram [160, 1, 1] [2018-07-25 08:53:08,091 INFO L415 AbstractCegarLoop]: === Iteration 161 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:08,091 INFO L82 PathProgramCache]: Analyzing trace with hash -858028089, now seen corresponding path program 160 times [2018-07-25 08:53:08,091 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:08,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:09,069 INFO L134 CoverageAnalysis]: Checked inductivity of 12880 backedges. 0 proven. 12880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:09,070 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:09,070 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [161] total 161 [2018-07-25 08:53:09,070 INFO L451 AbstractCegarLoop]: Interpolant automaton has 163 states [2018-07-25 08:53:09,070 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 163 interpolants. [2018-07-25 08:53:09,071 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=26083, Unknown=0, NotChecked=0, Total=26406 [2018-07-25 08:53:09,071 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 163 states. [2018-07-25 08:53:10,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:10,371 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-07-25 08:53:10,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2018-07-25 08:53:10,372 INFO L78 Accepts]: Start accepts. Automaton has 163 states. Word has length 162 [2018-07-25 08:53:10,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:10,372 INFO L225 Difference]: With dead ends: 165 [2018-07-25 08:53:10,372 INFO L226 Difference]: Without dead ends: 164 [2018-07-25 08:53:10,374 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=323, Invalid=26083, Unknown=0, NotChecked=0, Total=26406 [2018-07-25 08:53:10,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-07-25 08:53:10,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2018-07-25 08:53:10,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-07-25 08:53:10,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2018-07-25 08:53:10,378 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 162 [2018-07-25 08:53:10,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:10,379 INFO L472 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2018-07-25 08:53:10,379 INFO L473 AbstractCegarLoop]: Interpolant automaton has 163 states. [2018-07-25 08:53:10,379 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2018-07-25 08:53:10,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-07-25 08:53:10,379 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:10,379 INFO L354 BasicCegarLoop]: trace histogram [161, 1, 1] [2018-07-25 08:53:10,379 INFO L415 AbstractCegarLoop]: === Iteration 162 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:10,379 INFO L82 PathProgramCache]: Analyzing trace with hash -829067039, now seen corresponding path program 161 times [2018-07-25 08:53:10,380 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:10,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:11,427 INFO L134 CoverageAnalysis]: Checked inductivity of 13041 backedges. 0 proven. 13041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:11,428 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:11,428 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [162] total 162 [2018-07-25 08:53:11,428 INFO L451 AbstractCegarLoop]: Interpolant automaton has 164 states [2018-07-25 08:53:11,428 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2018-07-25 08:53:11,429 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=26407, Unknown=0, NotChecked=0, Total=26732 [2018-07-25 08:53:11,429 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand 164 states. [2018-07-25 08:53:12,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:12,681 INFO L93 Difference]: Finished difference Result 166 states and 166 transitions. [2018-07-25 08:53:12,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2018-07-25 08:53:12,681 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 163 [2018-07-25 08:53:12,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:12,681 INFO L225 Difference]: With dead ends: 166 [2018-07-25 08:53:12,681 INFO L226 Difference]: Without dead ends: 165 [2018-07-25 08:53:12,682 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=325, Invalid=26407, Unknown=0, NotChecked=0, Total=26732 [2018-07-25 08:53:12,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-07-25 08:53:12,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-07-25 08:53:12,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-07-25 08:53:12,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-07-25 08:53:12,687 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 163 [2018-07-25 08:53:12,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:12,687 INFO L472 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-07-25 08:53:12,687 INFO L473 AbstractCegarLoop]: Interpolant automaton has 164 states. [2018-07-25 08:53:12,687 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-07-25 08:53:12,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-07-25 08:53:12,687 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:12,688 INFO L354 BasicCegarLoop]: trace histogram [162, 1, 1] [2018-07-25 08:53:12,688 INFO L415 AbstractCegarLoop]: === Iteration 163 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:12,688 INFO L82 PathProgramCache]: Analyzing trace with hash 68725511, now seen corresponding path program 162 times [2018-07-25 08:53:12,688 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:12,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:13,811 INFO L134 CoverageAnalysis]: Checked inductivity of 13203 backedges. 0 proven. 13203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:13,812 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:13,812 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [163] total 163 [2018-07-25 08:53:13,812 INFO L451 AbstractCegarLoop]: Interpolant automaton has 165 states [2018-07-25 08:53:13,812 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 165 interpolants. [2018-07-25 08:53:13,814 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=26733, Unknown=0, NotChecked=0, Total=27060 [2018-07-25 08:53:13,814 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 165 states. [2018-07-25 08:53:15,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:15,241 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-07-25 08:53:15,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2018-07-25 08:53:15,242 INFO L78 Accepts]: Start accepts. Automaton has 165 states. Word has length 164 [2018-07-25 08:53:15,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:15,242 INFO L225 Difference]: With dead ends: 167 [2018-07-25 08:53:15,242 INFO L226 Difference]: Without dead ends: 166 [2018-07-25 08:53:15,243 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=327, Invalid=26733, Unknown=0, NotChecked=0, Total=27060 [2018-07-25 08:53:15,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-07-25 08:53:15,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-07-25 08:53:15,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-07-25 08:53:15,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2018-07-25 08:53:15,250 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 164 [2018-07-25 08:53:15,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:15,250 INFO L472 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2018-07-25 08:53:15,250 INFO L473 AbstractCegarLoop]: Interpolant automaton has 165 states. [2018-07-25 08:53:15,251 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2018-07-25 08:53:15,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-07-25 08:53:15,251 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:15,251 INFO L354 BasicCegarLoop]: trace histogram [163, 1, 1] [2018-07-25 08:53:15,252 INFO L415 AbstractCegarLoop]: === Iteration 164 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:15,252 INFO L82 PathProgramCache]: Analyzing trace with hash 2130490785, now seen corresponding path program 163 times [2018-07-25 08:53:15,252 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:15,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:16,496 INFO L134 CoverageAnalysis]: Checked inductivity of 13366 backedges. 0 proven. 13366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:16,497 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:16,497 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [164] total 164 [2018-07-25 08:53:16,497 INFO L451 AbstractCegarLoop]: Interpolant automaton has 166 states [2018-07-25 08:53:16,497 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2018-07-25 08:53:16,499 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=27061, Unknown=0, NotChecked=0, Total=27390 [2018-07-25 08:53:16,499 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 166 states. [2018-07-25 08:53:17,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:17,927 INFO L93 Difference]: Finished difference Result 168 states and 168 transitions. [2018-07-25 08:53:17,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2018-07-25 08:53:17,927 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 165 [2018-07-25 08:53:17,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:17,928 INFO L225 Difference]: With dead ends: 168 [2018-07-25 08:53:17,928 INFO L226 Difference]: Without dead ends: 167 [2018-07-25 08:53:17,930 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=329, Invalid=27061, Unknown=0, NotChecked=0, Total=27390 [2018-07-25 08:53:17,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-07-25 08:53:17,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-07-25 08:53:17,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-07-25 08:53:17,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2018-07-25 08:53:17,934 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 165 [2018-07-25 08:53:17,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:17,935 INFO L472 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2018-07-25 08:53:17,935 INFO L473 AbstractCegarLoop]: Interpolant automaton has 166 states. [2018-07-25 08:53:17,935 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2018-07-25 08:53:17,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-07-25 08:53:17,935 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:17,935 INFO L354 BasicCegarLoop]: trace histogram [164, 1, 1] [2018-07-25 08:53:17,936 INFO L415 AbstractCegarLoop]: === Iteration 165 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:17,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1620704839, now seen corresponding path program 164 times [2018-07-25 08:53:17,936 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:17,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:19,104 INFO L134 CoverageAnalysis]: Checked inductivity of 13530 backedges. 0 proven. 13530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:19,105 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:19,105 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [165] total 165 [2018-07-25 08:53:19,105 INFO L451 AbstractCegarLoop]: Interpolant automaton has 167 states [2018-07-25 08:53:19,105 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 167 interpolants. [2018-07-25 08:53:19,106 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=27391, Unknown=0, NotChecked=0, Total=27722 [2018-07-25 08:53:19,107 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 167 states. [2018-07-25 08:53:20,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:20,487 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2018-07-25 08:53:20,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2018-07-25 08:53:20,488 INFO L78 Accepts]: Start accepts. Automaton has 167 states. Word has length 166 [2018-07-25 08:53:20,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:20,488 INFO L225 Difference]: With dead ends: 169 [2018-07-25 08:53:20,488 INFO L226 Difference]: Without dead ends: 168 [2018-07-25 08:53:20,490 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=331, Invalid=27391, Unknown=0, NotChecked=0, Total=27722 [2018-07-25 08:53:20,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-07-25 08:53:20,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-07-25 08:53:20,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-07-25 08:53:20,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 168 transitions. [2018-07-25 08:53:20,495 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 168 transitions. Word has length 166 [2018-07-25 08:53:20,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:20,495 INFO L472 AbstractCegarLoop]: Abstraction has 168 states and 168 transitions. [2018-07-25 08:53:20,495 INFO L473 AbstractCegarLoop]: Interpolant automaton has 167 states. [2018-07-25 08:53:20,495 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 168 transitions. [2018-07-25 08:53:20,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-07-25 08:53:20,496 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:20,496 INFO L354 BasicCegarLoop]: trace histogram [165, 1, 1] [2018-07-25 08:53:20,496 INFO L415 AbstractCegarLoop]: === Iteration 166 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:20,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1297757599, now seen corresponding path program 165 times [2018-07-25 08:53:20,496 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:20,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:21,665 INFO L134 CoverageAnalysis]: Checked inductivity of 13695 backedges. 0 proven. 13695 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:21,666 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:21,666 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [166] total 166 [2018-07-25 08:53:21,666 INFO L451 AbstractCegarLoop]: Interpolant automaton has 168 states [2018-07-25 08:53:21,667 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2018-07-25 08:53:21,668 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=333, Invalid=27723, Unknown=0, NotChecked=0, Total=28056 [2018-07-25 08:53:21,669 INFO L87 Difference]: Start difference. First operand 168 states and 168 transitions. Second operand 168 states. [2018-07-25 08:53:23,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:23,119 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2018-07-25 08:53:23,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2018-07-25 08:53:23,119 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 167 [2018-07-25 08:53:23,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:23,120 INFO L225 Difference]: With dead ends: 170 [2018-07-25 08:53:23,120 INFO L226 Difference]: Without dead ends: 169 [2018-07-25 08:53:23,121 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=333, Invalid=27723, Unknown=0, NotChecked=0, Total=28056 [2018-07-25 08:53:23,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-07-25 08:53:23,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-07-25 08:53:23,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-07-25 08:53:23,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2018-07-25 08:53:23,125 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 167 [2018-07-25 08:53:23,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:23,125 INFO L472 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2018-07-25 08:53:23,125 INFO L473 AbstractCegarLoop]: Interpolant automaton has 168 states. [2018-07-25 08:53:23,125 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2018-07-25 08:53:23,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-07-25 08:53:23,126 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:23,126 INFO L354 BasicCegarLoop]: trace histogram [166, 1, 1] [2018-07-25 08:53:23,126 INFO L415 AbstractCegarLoop]: === Iteration 167 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:23,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1575779961, now seen corresponding path program 166 times [2018-07-25 08:53:23,126 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:23,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:24,283 INFO L134 CoverageAnalysis]: Checked inductivity of 13861 backedges. 0 proven. 13861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:24,283 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:24,283 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [167] total 167 [2018-07-25 08:53:24,283 INFO L451 AbstractCegarLoop]: Interpolant automaton has 169 states [2018-07-25 08:53:24,284 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 169 interpolants. [2018-07-25 08:53:24,285 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=28057, Unknown=0, NotChecked=0, Total=28392 [2018-07-25 08:53:24,286 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 169 states. [2018-07-25 08:53:25,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:25,773 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-07-25 08:53:25,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2018-07-25 08:53:25,773 INFO L78 Accepts]: Start accepts. Automaton has 169 states. Word has length 168 [2018-07-25 08:53:25,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:25,774 INFO L225 Difference]: With dead ends: 171 [2018-07-25 08:53:25,774 INFO L226 Difference]: Without dead ends: 170 [2018-07-25 08:53:25,776 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=335, Invalid=28057, Unknown=0, NotChecked=0, Total=28392 [2018-07-25 08:53:25,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-07-25 08:53:25,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2018-07-25 08:53:25,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-07-25 08:53:25,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 170 transitions. [2018-07-25 08:53:25,781 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 170 transitions. Word has length 168 [2018-07-25 08:53:25,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:25,781 INFO L472 AbstractCegarLoop]: Abstraction has 170 states and 170 transitions. [2018-07-25 08:53:25,781 INFO L473 AbstractCegarLoop]: Interpolant automaton has 169 states. [2018-07-25 08:53:25,781 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 170 transitions. [2018-07-25 08:53:25,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-07-25 08:53:25,782 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:25,782 INFO L354 BasicCegarLoop]: trace histogram [167, 1, 1] [2018-07-25 08:53:25,782 INFO L415 AbstractCegarLoop]: === Iteration 168 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:25,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1604538591, now seen corresponding path program 167 times [2018-07-25 08:53:25,782 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:25,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:26,921 INFO L134 CoverageAnalysis]: Checked inductivity of 14028 backedges. 0 proven. 14028 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:26,921 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:26,921 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [168] total 168 [2018-07-25 08:53:26,921 INFO L451 AbstractCegarLoop]: Interpolant automaton has 170 states [2018-07-25 08:53:26,922 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2018-07-25 08:53:26,923 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=28393, Unknown=0, NotChecked=0, Total=28730 [2018-07-25 08:53:26,923 INFO L87 Difference]: Start difference. First operand 170 states and 170 transitions. Second operand 170 states. [2018-07-25 08:53:28,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:28,239 INFO L93 Difference]: Finished difference Result 172 states and 172 transitions. [2018-07-25 08:53:28,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2018-07-25 08:53:28,240 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 169 [2018-07-25 08:53:28,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:28,240 INFO L225 Difference]: With dead ends: 172 [2018-07-25 08:53:28,240 INFO L226 Difference]: Without dead ends: 171 [2018-07-25 08:53:28,242 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=337, Invalid=28393, Unknown=0, NotChecked=0, Total=28730 [2018-07-25 08:53:28,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-07-25 08:53:28,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-07-25 08:53:28,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-07-25 08:53:28,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-07-25 08:53:28,247 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 169 [2018-07-25 08:53:28,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:28,248 INFO L472 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-07-25 08:53:28,248 INFO L473 AbstractCegarLoop]: Interpolant automaton has 170 states. [2018-07-25 08:53:28,248 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-07-25 08:53:28,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-07-25 08:53:28,248 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:28,248 INFO L354 BasicCegarLoop]: trace histogram [168, 1, 1] [2018-07-25 08:53:28,249 INFO L415 AbstractCegarLoop]: === Iteration 169 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:28,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1798911175, now seen corresponding path program 168 times [2018-07-25 08:53:28,249 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:28,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:29,334 INFO L134 CoverageAnalysis]: Checked inductivity of 14196 backedges. 0 proven. 14196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:29,334 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:29,334 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [169] total 169 [2018-07-25 08:53:29,334 INFO L451 AbstractCegarLoop]: Interpolant automaton has 171 states [2018-07-25 08:53:29,334 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 171 interpolants. [2018-07-25 08:53:29,335 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=28731, Unknown=0, NotChecked=0, Total=29070 [2018-07-25 08:53:29,336 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 171 states. [2018-07-25 08:53:30,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:30,814 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2018-07-25 08:53:30,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2018-07-25 08:53:30,814 INFO L78 Accepts]: Start accepts. Automaton has 171 states. Word has length 170 [2018-07-25 08:53:30,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:30,815 INFO L225 Difference]: With dead ends: 173 [2018-07-25 08:53:30,815 INFO L226 Difference]: Without dead ends: 172 [2018-07-25 08:53:30,816 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=339, Invalid=28731, Unknown=0, NotChecked=0, Total=29070 [2018-07-25 08:53:30,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-07-25 08:53:30,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2018-07-25 08:53:30,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-07-25 08:53:30,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2018-07-25 08:53:30,821 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 170 [2018-07-25 08:53:30,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:30,821 INFO L472 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2018-07-25 08:53:30,821 INFO L473 AbstractCegarLoop]: Interpolant automaton has 171 states. [2018-07-25 08:53:30,821 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2018-07-25 08:53:30,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-07-25 08:53:30,822 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:30,822 INFO L354 BasicCegarLoop]: trace histogram [169, 1, 1] [2018-07-25 08:53:30,822 INFO L415 AbstractCegarLoop]: === Iteration 170 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:30,822 INFO L82 PathProgramCache]: Analyzing trace with hash -68328479, now seen corresponding path program 169 times [2018-07-25 08:53:30,822 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:30,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:31,904 INFO L134 CoverageAnalysis]: Checked inductivity of 14365 backedges. 0 proven. 14365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:31,904 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:31,904 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [170] total 170 [2018-07-25 08:53:31,905 INFO L451 AbstractCegarLoop]: Interpolant automaton has 172 states [2018-07-25 08:53:31,905 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2018-07-25 08:53:31,906 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=29071, Unknown=0, NotChecked=0, Total=29412 [2018-07-25 08:53:31,906 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 172 states. [2018-07-25 08:53:33,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:33,301 INFO L93 Difference]: Finished difference Result 174 states and 174 transitions. [2018-07-25 08:53:33,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2018-07-25 08:53:33,301 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 171 [2018-07-25 08:53:33,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:33,301 INFO L225 Difference]: With dead ends: 174 [2018-07-25 08:53:33,301 INFO L226 Difference]: Without dead ends: 173 [2018-07-25 08:53:33,303 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=341, Invalid=29071, Unknown=0, NotChecked=0, Total=29412 [2018-07-25 08:53:33,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-07-25 08:53:33,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-07-25 08:53:33,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-07-25 08:53:33,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-07-25 08:53:33,307 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 171 [2018-07-25 08:53:33,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:33,307 INFO L472 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-07-25 08:53:33,308 INFO L473 AbstractCegarLoop]: Interpolant automaton has 172 states. [2018-07-25 08:53:33,308 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-07-25 08:53:33,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-07-25 08:53:33,308 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:33,308 INFO L354 BasicCegarLoop]: trace histogram [170, 1, 1] [2018-07-25 08:53:33,308 INFO L415 AbstractCegarLoop]: === Iteration 171 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:33,308 INFO L82 PathProgramCache]: Analyzing trace with hash -2118182905, now seen corresponding path program 170 times [2018-07-25 08:53:33,308 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:33,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:34,403 INFO L134 CoverageAnalysis]: Checked inductivity of 14535 backedges. 0 proven. 14535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:34,403 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:34,404 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [171] total 171 [2018-07-25 08:53:34,404 INFO L451 AbstractCegarLoop]: Interpolant automaton has 173 states [2018-07-25 08:53:34,404 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 173 interpolants. [2018-07-25 08:53:34,406 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=29413, Unknown=0, NotChecked=0, Total=29756 [2018-07-25 08:53:34,406 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 173 states. [2018-07-25 08:53:35,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:35,929 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-07-25 08:53:35,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2018-07-25 08:53:35,929 INFO L78 Accepts]: Start accepts. Automaton has 173 states. Word has length 172 [2018-07-25 08:53:35,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:35,930 INFO L225 Difference]: With dead ends: 175 [2018-07-25 08:53:35,930 INFO L226 Difference]: Without dead ends: 174 [2018-07-25 08:53:35,931 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=343, Invalid=29413, Unknown=0, NotChecked=0, Total=29756 [2018-07-25 08:53:35,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-07-25 08:53:35,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2018-07-25 08:53:35,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-07-25 08:53:35,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 174 transitions. [2018-07-25 08:53:35,936 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 174 transitions. Word has length 172 [2018-07-25 08:53:35,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:35,936 INFO L472 AbstractCegarLoop]: Abstraction has 174 states and 174 transitions. [2018-07-25 08:53:35,936 INFO L473 AbstractCegarLoop]: Interpolant automaton has 173 states. [2018-07-25 08:53:35,936 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 174 transitions. [2018-07-25 08:53:35,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-07-25 08:53:35,937 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:35,937 INFO L354 BasicCegarLoop]: trace histogram [171, 1, 1] [2018-07-25 08:53:35,937 INFO L415 AbstractCegarLoop]: === Iteration 172 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:35,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1239160671, now seen corresponding path program 171 times [2018-07-25 08:53:35,937 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:35,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:37,186 INFO L134 CoverageAnalysis]: Checked inductivity of 14706 backedges. 0 proven. 14706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:37,186 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:37,186 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [172] total 172 [2018-07-25 08:53:37,187 INFO L451 AbstractCegarLoop]: Interpolant automaton has 174 states [2018-07-25 08:53:37,187 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2018-07-25 08:53:37,188 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=345, Invalid=29757, Unknown=0, NotChecked=0, Total=30102 [2018-07-25 08:53:37,189 INFO L87 Difference]: Start difference. First operand 174 states and 174 transitions. Second operand 174 states. [2018-07-25 08:53:38,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:38,749 INFO L93 Difference]: Finished difference Result 176 states and 176 transitions. [2018-07-25 08:53:38,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2018-07-25 08:53:38,749 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 173 [2018-07-25 08:53:38,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:38,749 INFO L225 Difference]: With dead ends: 176 [2018-07-25 08:53:38,749 INFO L226 Difference]: Without dead ends: 175 [2018-07-25 08:53:38,750 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=345, Invalid=29757, Unknown=0, NotChecked=0, Total=30102 [2018-07-25 08:53:38,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-07-25 08:53:38,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-07-25 08:53:38,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-07-25 08:53:38,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2018-07-25 08:53:38,756 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 173 [2018-07-25 08:53:38,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:38,756 INFO L472 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2018-07-25 08:53:38,756 INFO L473 AbstractCegarLoop]: Interpolant automaton has 174 states. [2018-07-25 08:53:38,756 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2018-07-25 08:53:38,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-07-25 08:53:38,756 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:38,757 INFO L354 BasicCegarLoop]: trace histogram [172, 1, 1] [2018-07-25 08:53:38,757 INFO L415 AbstractCegarLoop]: === Iteration 173 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:38,757 INFO L82 PathProgramCache]: Analyzing trace with hash 240724807, now seen corresponding path program 172 times [2018-07-25 08:53:38,757 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:38,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:39,997 INFO L134 CoverageAnalysis]: Checked inductivity of 14878 backedges. 0 proven. 14878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:39,997 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:39,998 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [173] total 173 [2018-07-25 08:53:39,998 INFO L451 AbstractCegarLoop]: Interpolant automaton has 175 states [2018-07-25 08:53:39,998 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 175 interpolants. [2018-07-25 08:53:39,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=30103, Unknown=0, NotChecked=0, Total=30450 [2018-07-25 08:53:40,000 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 175 states. [2018-07-25 08:53:41,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:41,591 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2018-07-25 08:53:41,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2018-07-25 08:53:41,591 INFO L78 Accepts]: Start accepts. Automaton has 175 states. Word has length 174 [2018-07-25 08:53:41,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:41,592 INFO L225 Difference]: With dead ends: 177 [2018-07-25 08:53:41,592 INFO L226 Difference]: Without dead ends: 176 [2018-07-25 08:53:41,595 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=347, Invalid=30103, Unknown=0, NotChecked=0, Total=30450 [2018-07-25 08:53:41,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-07-25 08:53:41,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2018-07-25 08:53:41,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-07-25 08:53:41,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2018-07-25 08:53:41,600 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 174 [2018-07-25 08:53:41,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:41,600 INFO L472 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2018-07-25 08:53:41,600 INFO L473 AbstractCegarLoop]: Interpolant automaton has 175 states. [2018-07-25 08:53:41,600 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2018-07-25 08:53:41,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-07-25 08:53:41,601 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:41,601 INFO L354 BasicCegarLoop]: trace histogram [173, 1, 1] [2018-07-25 08:53:41,601 INFO L415 AbstractCegarLoop]: === Iteration 174 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:41,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1127465631, now seen corresponding path program 173 times [2018-07-25 08:53:41,601 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:41,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:42,904 INFO L134 CoverageAnalysis]: Checked inductivity of 15051 backedges. 0 proven. 15051 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:42,904 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:42,904 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [174] total 174 [2018-07-25 08:53:42,904 INFO L451 AbstractCegarLoop]: Interpolant automaton has 176 states [2018-07-25 08:53:42,905 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2018-07-25 08:53:42,906 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=30451, Unknown=0, NotChecked=0, Total=30800 [2018-07-25 08:53:42,906 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 176 states. [2018-07-25 08:53:44,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:44,360 INFO L93 Difference]: Finished difference Result 178 states and 178 transitions. [2018-07-25 08:53:44,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2018-07-25 08:53:44,361 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 175 [2018-07-25 08:53:44,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:44,361 INFO L225 Difference]: With dead ends: 178 [2018-07-25 08:53:44,361 INFO L226 Difference]: Without dead ends: 177 [2018-07-25 08:53:44,363 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=349, Invalid=30451, Unknown=0, NotChecked=0, Total=30800 [2018-07-25 08:53:44,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-07-25 08:53:44,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-07-25 08:53:44,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-07-25 08:53:44,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-07-25 08:53:44,368 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 175 [2018-07-25 08:53:44,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:44,368 INFO L472 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-07-25 08:53:44,368 INFO L473 AbstractCegarLoop]: Interpolant automaton has 176 states. [2018-07-25 08:53:44,368 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-07-25 08:53:44,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-07-25 08:53:44,368 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:44,369 INFO L354 BasicCegarLoop]: trace histogram [174, 1, 1] [2018-07-25 08:53:44,369 INFO L415 AbstractCegarLoop]: === Iteration 175 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:44,369 INFO L82 PathProgramCache]: Analyzing trace with hash -591696249, now seen corresponding path program 174 times [2018-07-25 08:53:44,369 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:44,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:45,653 INFO L134 CoverageAnalysis]: Checked inductivity of 15225 backedges. 0 proven. 15225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:45,653 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:45,653 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [175] total 175 [2018-07-25 08:53:45,653 INFO L451 AbstractCegarLoop]: Interpolant automaton has 177 states [2018-07-25 08:53:45,654 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 177 interpolants. [2018-07-25 08:53:45,655 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=30801, Unknown=0, NotChecked=0, Total=31152 [2018-07-25 08:53:45,656 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 177 states. [2018-07-25 08:53:47,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:47,250 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-07-25 08:53:47,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2018-07-25 08:53:47,250 INFO L78 Accepts]: Start accepts. Automaton has 177 states. Word has length 176 [2018-07-25 08:53:47,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:47,251 INFO L225 Difference]: With dead ends: 179 [2018-07-25 08:53:47,251 INFO L226 Difference]: Without dead ends: 178 [2018-07-25 08:53:47,252 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=351, Invalid=30801, Unknown=0, NotChecked=0, Total=31152 [2018-07-25 08:53:47,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-07-25 08:53:47,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2018-07-25 08:53:47,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-07-25 08:53:47,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2018-07-25 08:53:47,257 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 176 [2018-07-25 08:53:47,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:47,257 INFO L472 AbstractCegarLoop]: Abstraction has 178 states and 178 transitions. [2018-07-25 08:53:47,257 INFO L473 AbstractCegarLoop]: Interpolant automaton has 177 states. [2018-07-25 08:53:47,257 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2018-07-25 08:53:47,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-07-25 08:53:47,258 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:47,258 INFO L354 BasicCegarLoop]: trace histogram [175, 1, 1] [2018-07-25 08:53:47,258 INFO L415 AbstractCegarLoop]: === Iteration 176 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:47,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1162714591, now seen corresponding path program 175 times [2018-07-25 08:53:47,258 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:47,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:48,572 INFO L134 CoverageAnalysis]: Checked inductivity of 15400 backedges. 0 proven. 15400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:48,572 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:48,572 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [176] total 176 [2018-07-25 08:53:48,573 INFO L451 AbstractCegarLoop]: Interpolant automaton has 178 states [2018-07-25 08:53:48,573 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2018-07-25 08:53:48,574 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=31153, Unknown=0, NotChecked=0, Total=31506 [2018-07-25 08:53:48,575 INFO L87 Difference]: Start difference. First operand 178 states and 178 transitions. Second operand 178 states. [2018-07-25 08:53:50,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:50,198 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2018-07-25 08:53:50,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2018-07-25 08:53:50,198 INFO L78 Accepts]: Start accepts. Automaton has 178 states. Word has length 177 [2018-07-25 08:53:50,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:50,199 INFO L225 Difference]: With dead ends: 180 [2018-07-25 08:53:50,199 INFO L226 Difference]: Without dead ends: 179 [2018-07-25 08:53:50,201 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=353, Invalid=31153, Unknown=0, NotChecked=0, Total=31506 [2018-07-25 08:53:50,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-07-25 08:53:50,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-07-25 08:53:50,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-07-25 08:53:50,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2018-07-25 08:53:50,206 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 177 [2018-07-25 08:53:50,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:50,206 INFO L472 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2018-07-25 08:53:50,206 INFO L473 AbstractCegarLoop]: Interpolant automaton has 178 states. [2018-07-25 08:53:50,206 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2018-07-25 08:53:50,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-07-25 08:53:50,207 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:50,207 INFO L354 BasicCegarLoop]: trace histogram [176, 1, 1] [2018-07-25 08:53:50,207 INFO L415 AbstractCegarLoop]: === Iteration 177 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:50,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1684414009, now seen corresponding path program 176 times [2018-07-25 08:53:50,207 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:50,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:51,583 INFO L134 CoverageAnalysis]: Checked inductivity of 15576 backedges. 0 proven. 15576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:51,583 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:51,584 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [177] total 177 [2018-07-25 08:53:51,584 INFO L451 AbstractCegarLoop]: Interpolant automaton has 179 states [2018-07-25 08:53:51,584 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 179 interpolants. [2018-07-25 08:53:51,586 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=31507, Unknown=0, NotChecked=0, Total=31862 [2018-07-25 08:53:51,586 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 179 states. [2018-07-25 08:53:53,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:53,250 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2018-07-25 08:53:53,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2018-07-25 08:53:53,250 INFO L78 Accepts]: Start accepts. Automaton has 179 states. Word has length 178 [2018-07-25 08:53:53,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:53,251 INFO L225 Difference]: With dead ends: 181 [2018-07-25 08:53:53,251 INFO L226 Difference]: Without dead ends: 180 [2018-07-25 08:53:53,253 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=355, Invalid=31507, Unknown=0, NotChecked=0, Total=31862 [2018-07-25 08:53:53,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-07-25 08:53:53,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2018-07-25 08:53:53,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-07-25 08:53:53,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 180 transitions. [2018-07-25 08:53:53,258 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 180 transitions. Word has length 178 [2018-07-25 08:53:53,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:53,258 INFO L472 AbstractCegarLoop]: Abstraction has 180 states and 180 transitions. [2018-07-25 08:53:53,258 INFO L473 AbstractCegarLoop]: Interpolant automaton has 179 states. [2018-07-25 08:53:53,258 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 180 transitions. [2018-07-25 08:53:53,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-07-25 08:53:53,258 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:53,258 INFO L354 BasicCegarLoop]: trace histogram [177, 1, 1] [2018-07-25 08:53:53,259 INFO L415 AbstractCegarLoop]: === Iteration 178 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:53,259 INFO L82 PathProgramCache]: Analyzing trace with hash -677226783, now seen corresponding path program 177 times [2018-07-25 08:53:53,259 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:53,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:54,646 INFO L134 CoverageAnalysis]: Checked inductivity of 15753 backedges. 0 proven. 15753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:54,647 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:54,647 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [178] total 178 [2018-07-25 08:53:54,647 INFO L451 AbstractCegarLoop]: Interpolant automaton has 180 states [2018-07-25 08:53:54,647 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 180 interpolants. [2018-07-25 08:53:54,648 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=31863, Unknown=0, NotChecked=0, Total=32220 [2018-07-25 08:53:54,648 INFO L87 Difference]: Start difference. First operand 180 states and 180 transitions. Second operand 180 states. [2018-07-25 08:53:56,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:56,192 INFO L93 Difference]: Finished difference Result 182 states and 182 transitions. [2018-07-25 08:53:56,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2018-07-25 08:53:56,192 INFO L78 Accepts]: Start accepts. Automaton has 180 states. Word has length 179 [2018-07-25 08:53:56,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:56,193 INFO L225 Difference]: With dead ends: 182 [2018-07-25 08:53:56,193 INFO L226 Difference]: Without dead ends: 181 [2018-07-25 08:53:56,194 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=357, Invalid=31863, Unknown=0, NotChecked=0, Total=32220 [2018-07-25 08:53:56,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-07-25 08:53:56,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-07-25 08:53:56,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-07-25 08:53:56,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-07-25 08:53:56,199 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 179 [2018-07-25 08:53:56,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:56,199 INFO L472 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-07-25 08:53:56,199 INFO L473 AbstractCegarLoop]: Interpolant automaton has 180 states. [2018-07-25 08:53:56,199 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-07-25 08:53:56,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-07-25 08:53:56,200 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:56,200 INFO L354 BasicCegarLoop]: trace histogram [178, 1, 1] [2018-07-25 08:53:56,200 INFO L415 AbstractCegarLoop]: === Iteration 179 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:56,200 INFO L82 PathProgramCache]: Analyzing trace with hash 480806151, now seen corresponding path program 178 times [2018-07-25 08:53:56,200 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:56,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:57,531 INFO L134 CoverageAnalysis]: Checked inductivity of 15931 backedges. 0 proven. 15931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:57,531 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:57,531 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [179] total 179 [2018-07-25 08:53:57,532 INFO L451 AbstractCegarLoop]: Interpolant automaton has 181 states [2018-07-25 08:53:57,532 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 181 interpolants. [2018-07-25 08:53:57,533 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=359, Invalid=32221, Unknown=0, NotChecked=0, Total=32580 [2018-07-25 08:53:57,534 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 181 states. [2018-07-25 08:53:59,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:59,148 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-07-25 08:53:59,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2018-07-25 08:53:59,148 INFO L78 Accepts]: Start accepts. Automaton has 181 states. Word has length 180 [2018-07-25 08:53:59,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:59,149 INFO L225 Difference]: With dead ends: 183 [2018-07-25 08:53:59,149 INFO L226 Difference]: Without dead ends: 182 [2018-07-25 08:53:59,150 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=359, Invalid=32221, Unknown=0, NotChecked=0, Total=32580 [2018-07-25 08:53:59,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-07-25 08:53:59,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-07-25 08:53:59,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-07-25 08:53:59,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2018-07-25 08:53:59,155 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 180 [2018-07-25 08:53:59,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:59,155 INFO L472 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2018-07-25 08:53:59,155 INFO L473 AbstractCegarLoop]: Interpolant automaton has 181 states. [2018-07-25 08:53:59,155 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2018-07-25 08:53:59,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-07-25 08:53:59,155 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:59,155 INFO L354 BasicCegarLoop]: trace histogram [179, 1, 1] [2018-07-25 08:53:59,156 INFO L415 AbstractCegarLoop]: === Iteration 180 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:59,156 INFO L82 PathProgramCache]: Analyzing trace with hash 2020088737, now seen corresponding path program 179 times [2018-07-25 08:53:59,156 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:59,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:00,382 INFO L134 CoverageAnalysis]: Checked inductivity of 16110 backedges. 0 proven. 16110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:00,383 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:00,383 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [180] total 180 [2018-07-25 08:54:00,383 INFO L451 AbstractCegarLoop]: Interpolant automaton has 182 states [2018-07-25 08:54:00,383 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 182 interpolants. [2018-07-25 08:54:00,385 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=32581, Unknown=0, NotChecked=0, Total=32942 [2018-07-25 08:54:00,385 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 182 states. [2018-07-25 08:54:01,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:01,987 INFO L93 Difference]: Finished difference Result 184 states and 184 transitions. [2018-07-25 08:54:01,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2018-07-25 08:54:01,987 INFO L78 Accepts]: Start accepts. Automaton has 182 states. Word has length 181 [2018-07-25 08:54:01,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:01,988 INFO L225 Difference]: With dead ends: 184 [2018-07-25 08:54:01,988 INFO L226 Difference]: Without dead ends: 183 [2018-07-25 08:54:01,991 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=361, Invalid=32581, Unknown=0, NotChecked=0, Total=32942 [2018-07-25 08:54:01,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-07-25 08:54:01,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-07-25 08:54:01,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-07-25 08:54:01,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-07-25 08:54:01,996 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 181 [2018-07-25 08:54:01,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:01,996 INFO L472 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-07-25 08:54:01,996 INFO L473 AbstractCegarLoop]: Interpolant automaton has 182 states. [2018-07-25 08:54:01,996 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-07-25 08:54:01,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-07-25 08:54:01,997 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:01,997 INFO L354 BasicCegarLoop]: trace histogram [180, 1, 1] [2018-07-25 08:54:01,997 INFO L415 AbstractCegarLoop]: === Iteration 181 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:01,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1801758649, now seen corresponding path program 180 times [2018-07-25 08:54:01,997 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:02,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:03,380 INFO L134 CoverageAnalysis]: Checked inductivity of 16290 backedges. 0 proven. 16290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:03,380 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:03,380 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [181] total 181 [2018-07-25 08:54:03,381 INFO L451 AbstractCegarLoop]: Interpolant automaton has 183 states [2018-07-25 08:54:03,381 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 183 interpolants. [2018-07-25 08:54:03,382 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=363, Invalid=32943, Unknown=0, NotChecked=0, Total=33306 [2018-07-25 08:54:03,382 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 183 states. [2018-07-25 08:54:05,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:05,087 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2018-07-25 08:54:05,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2018-07-25 08:54:05,087 INFO L78 Accepts]: Start accepts. Automaton has 183 states. Word has length 182 [2018-07-25 08:54:05,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:05,088 INFO L225 Difference]: With dead ends: 185 [2018-07-25 08:54:05,088 INFO L226 Difference]: Without dead ends: 184 [2018-07-25 08:54:05,090 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=363, Invalid=32943, Unknown=0, NotChecked=0, Total=33306 [2018-07-25 08:54:05,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-07-25 08:54:05,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2018-07-25 08:54:05,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-07-25 08:54:05,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 184 transitions. [2018-07-25 08:54:05,095 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 184 transitions. Word has length 182 [2018-07-25 08:54:05,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:05,095 INFO L472 AbstractCegarLoop]: Abstraction has 184 states and 184 transitions. [2018-07-25 08:54:05,096 INFO L473 AbstractCegarLoop]: Interpolant automaton has 183 states. [2018-07-25 08:54:05,096 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 184 transitions. [2018-07-25 08:54:05,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-07-25 08:54:05,096 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:05,096 INFO L354 BasicCegarLoop]: trace histogram [181, 1, 1] [2018-07-25 08:54:05,096 INFO L415 AbstractCegarLoop]: === Iteration 182 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:05,097 INFO L82 PathProgramCache]: Analyzing trace with hash -19943327, now seen corresponding path program 181 times [2018-07-25 08:54:05,097 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:05,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:06,397 INFO L134 CoverageAnalysis]: Checked inductivity of 16471 backedges. 0 proven. 16471 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:06,397 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:06,398 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [182] total 182 [2018-07-25 08:54:06,398 INFO L451 AbstractCegarLoop]: Interpolant automaton has 184 states [2018-07-25 08:54:06,398 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 184 interpolants. [2018-07-25 08:54:06,399 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=365, Invalid=33307, Unknown=0, NotChecked=0, Total=33672 [2018-07-25 08:54:06,399 INFO L87 Difference]: Start difference. First operand 184 states and 184 transitions. Second operand 184 states. [2018-07-25 08:54:08,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:08,060 INFO L93 Difference]: Finished difference Result 186 states and 186 transitions. [2018-07-25 08:54:08,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2018-07-25 08:54:08,060 INFO L78 Accepts]: Start accepts. Automaton has 184 states. Word has length 183 [2018-07-25 08:54:08,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:08,061 INFO L225 Difference]: With dead ends: 186 [2018-07-25 08:54:08,061 INFO L226 Difference]: Without dead ends: 185 [2018-07-25 08:54:08,062 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=365, Invalid=33307, Unknown=0, NotChecked=0, Total=33672 [2018-07-25 08:54:08,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-07-25 08:54:08,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-07-25 08:54:08,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-07-25 08:54:08,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-07-25 08:54:08,070 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 183 [2018-07-25 08:54:08,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:08,071 INFO L472 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-07-25 08:54:08,071 INFO L473 AbstractCegarLoop]: Interpolant automaton has 184 states. [2018-07-25 08:54:08,071 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-07-25 08:54:08,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-07-25 08:54:08,072 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:08,072 INFO L354 BasicCegarLoop]: trace histogram [182, 1, 1] [2018-07-25 08:54:08,072 INFO L415 AbstractCegarLoop]: === Iteration 183 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:08,072 INFO L82 PathProgramCache]: Analyzing trace with hash -618243193, now seen corresponding path program 182 times [2018-07-25 08:54:08,072 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:08,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:09,513 INFO L134 CoverageAnalysis]: Checked inductivity of 16653 backedges. 0 proven. 16653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:09,513 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:09,514 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [183] total 183 [2018-07-25 08:54:09,514 INFO L451 AbstractCegarLoop]: Interpolant automaton has 185 states [2018-07-25 08:54:09,514 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 185 interpolants. [2018-07-25 08:54:09,515 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=33673, Unknown=0, NotChecked=0, Total=34040 [2018-07-25 08:54:09,516 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 185 states. [2018-07-25 08:54:11,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:11,315 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2018-07-25 08:54:11,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2018-07-25 08:54:11,315 INFO L78 Accepts]: Start accepts. Automaton has 185 states. Word has length 184 [2018-07-25 08:54:11,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:11,316 INFO L225 Difference]: With dead ends: 187 [2018-07-25 08:54:11,316 INFO L226 Difference]: Without dead ends: 186 [2018-07-25 08:54:11,317 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=367, Invalid=33673, Unknown=0, NotChecked=0, Total=34040 [2018-07-25 08:54:11,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-07-25 08:54:11,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2018-07-25 08:54:11,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-07-25 08:54:11,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2018-07-25 08:54:11,322 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 184 [2018-07-25 08:54:11,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:11,322 INFO L472 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2018-07-25 08:54:11,322 INFO L473 AbstractCegarLoop]: Interpolant automaton has 185 states. [2018-07-25 08:54:11,322 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2018-07-25 08:54:11,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-07-25 08:54:11,323 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:11,323 INFO L354 BasicCegarLoop]: trace histogram [183, 1, 1] [2018-07-25 08:54:11,323 INFO L415 AbstractCegarLoop]: === Iteration 184 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:11,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1985669855, now seen corresponding path program 183 times [2018-07-25 08:54:11,323 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:11,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:12,721 INFO L134 CoverageAnalysis]: Checked inductivity of 16836 backedges. 0 proven. 16836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:12,721 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:12,722 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [184] total 184 [2018-07-25 08:54:12,722 INFO L451 AbstractCegarLoop]: Interpolant automaton has 186 states [2018-07-25 08:54:12,722 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 186 interpolants. [2018-07-25 08:54:12,724 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=369, Invalid=34041, Unknown=0, NotChecked=0, Total=34410 [2018-07-25 08:54:12,725 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 186 states. [2018-07-25 08:54:14,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:14,556 INFO L93 Difference]: Finished difference Result 188 states and 188 transitions. [2018-07-25 08:54:14,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2018-07-25 08:54:14,556 INFO L78 Accepts]: Start accepts. Automaton has 186 states. Word has length 185 [2018-07-25 08:54:14,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:14,557 INFO L225 Difference]: With dead ends: 188 [2018-07-25 08:54:14,557 INFO L226 Difference]: Without dead ends: 187 [2018-07-25 08:54:14,559 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=369, Invalid=34041, Unknown=0, NotChecked=0, Total=34410 [2018-07-25 08:54:14,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-07-25 08:54:14,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-07-25 08:54:14,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-07-25 08:54:14,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2018-07-25 08:54:14,564 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 185 [2018-07-25 08:54:14,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:14,564 INFO L472 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2018-07-25 08:54:14,564 INFO L473 AbstractCegarLoop]: Interpolant automaton has 186 states. [2018-07-25 08:54:14,564 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2018-07-25 08:54:14,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-07-25 08:54:14,565 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:14,565 INFO L354 BasicCegarLoop]: trace histogram [184, 1, 1] [2018-07-25 08:54:14,565 INFO L415 AbstractCegarLoop]: === Iteration 185 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:14,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1426223417, now seen corresponding path program 184 times [2018-07-25 08:54:14,565 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:14,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:16,004 INFO L134 CoverageAnalysis]: Checked inductivity of 17020 backedges. 0 proven. 17020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:16,004 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:16,004 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [185] total 185 [2018-07-25 08:54:16,005 INFO L451 AbstractCegarLoop]: Interpolant automaton has 187 states [2018-07-25 08:54:16,005 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 187 interpolants. [2018-07-25 08:54:16,007 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=371, Invalid=34411, Unknown=0, NotChecked=0, Total=34782 [2018-07-25 08:54:16,007 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 187 states. [2018-07-25 08:54:17,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:17,824 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2018-07-25 08:54:17,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2018-07-25 08:54:17,824 INFO L78 Accepts]: Start accepts. Automaton has 187 states. Word has length 186 [2018-07-25 08:54:17,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:17,824 INFO L225 Difference]: With dead ends: 189 [2018-07-25 08:54:17,825 INFO L226 Difference]: Without dead ends: 188 [2018-07-25 08:54:17,827 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=371, Invalid=34411, Unknown=0, NotChecked=0, Total=34782 [2018-07-25 08:54:17,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-07-25 08:54:17,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2018-07-25 08:54:17,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-07-25 08:54:17,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 188 transitions. [2018-07-25 08:54:17,832 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 188 transitions. Word has length 186 [2018-07-25 08:54:17,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:17,832 INFO L472 AbstractCegarLoop]: Abstraction has 188 states and 188 transitions. [2018-07-25 08:54:17,832 INFO L473 AbstractCegarLoop]: Interpolant automaton has 187 states. [2018-07-25 08:54:17,832 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 188 transitions. [2018-07-25 08:54:17,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-07-25 08:54:17,832 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:17,832 INFO L354 BasicCegarLoop]: trace histogram [185, 1, 1] [2018-07-25 08:54:17,833 INFO L415 AbstractCegarLoop]: === Iteration 186 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:17,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1263253023, now seen corresponding path program 185 times [2018-07-25 08:54:17,833 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:17,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:19,302 INFO L134 CoverageAnalysis]: Checked inductivity of 17205 backedges. 0 proven. 17205 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:19,302 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:19,303 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [186] total 186 [2018-07-25 08:54:19,303 INFO L451 AbstractCegarLoop]: Interpolant automaton has 188 states [2018-07-25 08:54:19,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 188 interpolants. [2018-07-25 08:54:19,305 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=373, Invalid=34783, Unknown=0, NotChecked=0, Total=35156 [2018-07-25 08:54:19,305 INFO L87 Difference]: Start difference. First operand 188 states and 188 transitions. Second operand 188 states. [2018-07-25 08:54:21,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:21,140 INFO L93 Difference]: Finished difference Result 190 states and 190 transitions. [2018-07-25 08:54:21,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 188 states. [2018-07-25 08:54:21,140 INFO L78 Accepts]: Start accepts. Automaton has 188 states. Word has length 187 [2018-07-25 08:54:21,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:21,141 INFO L225 Difference]: With dead ends: 190 [2018-07-25 08:54:21,141 INFO L226 Difference]: Without dead ends: 189 [2018-07-25 08:54:21,142 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=373, Invalid=34783, Unknown=0, NotChecked=0, Total=35156 [2018-07-25 08:54:21,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-07-25 08:54:21,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-07-25 08:54:21,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-07-25 08:54:21,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2018-07-25 08:54:21,147 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 187 [2018-07-25 08:54:21,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:21,148 INFO L472 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2018-07-25 08:54:21,148 INFO L473 AbstractCegarLoop]: Interpolant automaton has 188 states. [2018-07-25 08:54:21,148 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2018-07-25 08:54:21,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-07-25 08:54:21,148 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:21,148 INFO L354 BasicCegarLoop]: trace histogram [186, 1, 1] [2018-07-25 08:54:21,148 INFO L415 AbstractCegarLoop]: === Iteration 187 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:21,149 INFO L82 PathProgramCache]: Analyzing trace with hash -506138105, now seen corresponding path program 186 times [2018-07-25 08:54:21,149 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:21,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:22,664 INFO L134 CoverageAnalysis]: Checked inductivity of 17391 backedges. 0 proven. 17391 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:22,664 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:22,664 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [187] total 187 [2018-07-25 08:54:22,664 INFO L451 AbstractCegarLoop]: Interpolant automaton has 189 states [2018-07-25 08:54:22,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 189 interpolants. [2018-07-25 08:54:22,665 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=375, Invalid=35157, Unknown=0, NotChecked=0, Total=35532 [2018-07-25 08:54:22,666 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 189 states. [2018-07-25 08:54:24,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:24,494 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-07-25 08:54:24,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2018-07-25 08:54:24,494 INFO L78 Accepts]: Start accepts. Automaton has 189 states. Word has length 188 [2018-07-25 08:54:24,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:24,494 INFO L225 Difference]: With dead ends: 191 [2018-07-25 08:54:24,495 INFO L226 Difference]: Without dead ends: 190 [2018-07-25 08:54:24,496 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=375, Invalid=35157, Unknown=0, NotChecked=0, Total=35532 [2018-07-25 08:54:24,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-07-25 08:54:24,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2018-07-25 08:54:24,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-07-25 08:54:24,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 190 transitions. [2018-07-25 08:54:24,501 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 190 transitions. Word has length 188 [2018-07-25 08:54:24,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:24,501 INFO L472 AbstractCegarLoop]: Abstraction has 190 states and 190 transitions. [2018-07-25 08:54:24,501 INFO L473 AbstractCegarLoop]: Interpolant automaton has 189 states. [2018-07-25 08:54:24,501 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 190 transitions. [2018-07-25 08:54:24,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-07-25 08:54:24,501 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:24,502 INFO L354 BasicCegarLoop]: trace histogram [187, 1, 1] [2018-07-25 08:54:24,502 INFO L415 AbstractCegarLoop]: === Iteration 188 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:24,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1489587873, now seen corresponding path program 187 times [2018-07-25 08:54:24,502 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:24,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:26,039 INFO L134 CoverageAnalysis]: Checked inductivity of 17578 backedges. 0 proven. 17578 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:26,039 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:26,039 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [188] total 188 [2018-07-25 08:54:26,039 INFO L451 AbstractCegarLoop]: Interpolant automaton has 190 states [2018-07-25 08:54:26,040 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 190 interpolants. [2018-07-25 08:54:26,041 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=377, Invalid=35533, Unknown=0, NotChecked=0, Total=35910 [2018-07-25 08:54:26,041 INFO L87 Difference]: Start difference. First operand 190 states and 190 transitions. Second operand 190 states. [2018-07-25 08:54:27,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:27,858 INFO L93 Difference]: Finished difference Result 192 states and 192 transitions. [2018-07-25 08:54:27,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2018-07-25 08:54:27,858 INFO L78 Accepts]: Start accepts. Automaton has 190 states. Word has length 189 [2018-07-25 08:54:27,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:27,859 INFO L225 Difference]: With dead ends: 192 [2018-07-25 08:54:27,859 INFO L226 Difference]: Without dead ends: 191 [2018-07-25 08:54:27,860 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=377, Invalid=35533, Unknown=0, NotChecked=0, Total=35910 [2018-07-25 08:54:27,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-07-25 08:54:27,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-07-25 08:54:27,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-07-25 08:54:27,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-07-25 08:54:27,865 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 189 [2018-07-25 08:54:27,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:27,865 INFO L472 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2018-07-25 08:54:27,866 INFO L473 AbstractCegarLoop]: Interpolant automaton has 190 states. [2018-07-25 08:54:27,866 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-07-25 08:54:27,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-07-25 08:54:27,866 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:27,866 INFO L354 BasicCegarLoop]: trace histogram [188, 1, 1] [2018-07-25 08:54:27,866 INFO L415 AbstractCegarLoop]: === Iteration 189 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:27,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1067416249, now seen corresponding path program 188 times [2018-07-25 08:54:27,867 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:27,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:29,377 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:29,377 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:29,377 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [189] total 189 [2018-07-25 08:54:29,377 INFO L451 AbstractCegarLoop]: Interpolant automaton has 191 states [2018-07-25 08:54:29,378 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 191 interpolants. [2018-07-25 08:54:29,378 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=35911, Unknown=0, NotChecked=0, Total=36290 [2018-07-25 08:54:29,378 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 191 states. [2018-07-25 08:54:31,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:31,200 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2018-07-25 08:54:31,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 191 states. [2018-07-25 08:54:31,200 INFO L78 Accepts]: Start accepts. Automaton has 191 states. Word has length 190 [2018-07-25 08:54:31,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:31,201 INFO L225 Difference]: With dead ends: 193 [2018-07-25 08:54:31,201 INFO L226 Difference]: Without dead ends: 192 [2018-07-25 08:54:31,202 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=379, Invalid=35911, Unknown=0, NotChecked=0, Total=36290 [2018-07-25 08:54:31,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-07-25 08:54:31,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2018-07-25 08:54:31,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-07-25 08:54:31,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 192 transitions. [2018-07-25 08:54:31,207 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 192 transitions. Word has length 190 [2018-07-25 08:54:31,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:31,207 INFO L472 AbstractCegarLoop]: Abstraction has 192 states and 192 transitions. [2018-07-25 08:54:31,207 INFO L473 AbstractCegarLoop]: Interpolant automaton has 191 states. [2018-07-25 08:54:31,207 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 192 transitions. [2018-07-25 08:54:31,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-07-25 08:54:31,208 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:31,208 INFO L354 BasicCegarLoop]: trace histogram [189, 1, 1] [2018-07-25 08:54:31,208 INFO L415 AbstractCegarLoop]: === Iteration 190 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:31,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1269834593, now seen corresponding path program 189 times [2018-07-25 08:54:31,208 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:31,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:32,751 INFO L134 CoverageAnalysis]: Checked inductivity of 17955 backedges. 0 proven. 17955 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:32,752 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:32,752 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [190] total 190 [2018-07-25 08:54:32,752 INFO L451 AbstractCegarLoop]: Interpolant automaton has 192 states [2018-07-25 08:54:32,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2018-07-25 08:54:32,753 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=381, Invalid=36291, Unknown=0, NotChecked=0, Total=36672 [2018-07-25 08:54:32,753 INFO L87 Difference]: Start difference. First operand 192 states and 192 transitions. Second operand 192 states. [2018-07-25 08:54:34,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:34,638 INFO L93 Difference]: Finished difference Result 194 states and 194 transitions. [2018-07-25 08:54:34,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2018-07-25 08:54:34,638 INFO L78 Accepts]: Start accepts. Automaton has 192 states. Word has length 191 [2018-07-25 08:54:34,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:34,639 INFO L225 Difference]: With dead ends: 194 [2018-07-25 08:54:34,639 INFO L226 Difference]: Without dead ends: 193 [2018-07-25 08:54:34,640 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=381, Invalid=36291, Unknown=0, NotChecked=0, Total=36672 [2018-07-25 08:54:34,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-07-25 08:54:34,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-07-25 08:54:34,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-07-25 08:54:34,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-07-25 08:54:34,648 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 191 [2018-07-25 08:54:34,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:34,649 INFO L472 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-07-25 08:54:34,649 INFO L473 AbstractCegarLoop]: Interpolant automaton has 192 states. [2018-07-25 08:54:34,649 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-07-25 08:54:34,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-07-25 08:54:34,650 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:34,650 INFO L354 BasicCegarLoop]: trace histogram [190, 1, 1] [2018-07-25 08:54:34,650 INFO L415 AbstractCegarLoop]: === Iteration 191 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:34,650 INFO L82 PathProgramCache]: Analyzing trace with hash 710166663, now seen corresponding path program 190 times [2018-07-25 08:54:34,650 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:34,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:36,238 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:36,238 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:36,239 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [191] total 191 [2018-07-25 08:54:36,239 INFO L451 AbstractCegarLoop]: Interpolant automaton has 193 states [2018-07-25 08:54:36,239 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 193 interpolants. [2018-07-25 08:54:36,240 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=36673, Unknown=0, NotChecked=0, Total=37056 [2018-07-25 08:54:36,240 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 193 states. [2018-07-25 08:54:38,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:38,146 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-07-25 08:54:38,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 193 states. [2018-07-25 08:54:38,146 INFO L78 Accepts]: Start accepts. Automaton has 193 states. Word has length 192 [2018-07-25 08:54:38,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:38,147 INFO L225 Difference]: With dead ends: 195 [2018-07-25 08:54:38,147 INFO L226 Difference]: Without dead ends: 194 [2018-07-25 08:54:38,148 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=383, Invalid=36673, Unknown=0, NotChecked=0, Total=37056 [2018-07-25 08:54:38,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-07-25 08:54:38,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2018-07-25 08:54:38,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-07-25 08:54:38,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 194 transitions. [2018-07-25 08:54:38,153 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 194 transitions. Word has length 192 [2018-07-25 08:54:38,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:38,153 INFO L472 AbstractCegarLoop]: Abstraction has 194 states and 194 transitions. [2018-07-25 08:54:38,153 INFO L473 AbstractCegarLoop]: Interpolant automaton has 193 states. [2018-07-25 08:54:38,154 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 194 transitions. [2018-07-25 08:54:38,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-07-25 08:54:38,154 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:38,154 INFO L354 BasicCegarLoop]: trace histogram [191, 1, 1] [2018-07-25 08:54:38,154 INFO L415 AbstractCegarLoop]: === Iteration 192 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:38,155 INFO L82 PathProgramCache]: Analyzing trace with hash 540330017, now seen corresponding path program 191 times [2018-07-25 08:54:38,155 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:38,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:39,764 INFO L134 CoverageAnalysis]: Checked inductivity of 18336 backedges. 0 proven. 18336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:39,764 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:39,764 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [192] total 192 [2018-07-25 08:54:39,765 INFO L451 AbstractCegarLoop]: Interpolant automaton has 194 states [2018-07-25 08:54:39,765 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 194 interpolants. [2018-07-25 08:54:39,767 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=385, Invalid=37057, Unknown=0, NotChecked=0, Total=37442 [2018-07-25 08:54:39,767 INFO L87 Difference]: Start difference. First operand 194 states and 194 transitions. Second operand 194 states. [2018-07-25 08:54:41,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:41,700 INFO L93 Difference]: Finished difference Result 196 states and 196 transitions. [2018-07-25 08:54:41,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 194 states. [2018-07-25 08:54:41,700 INFO L78 Accepts]: Start accepts. Automaton has 194 states. Word has length 193 [2018-07-25 08:54:41,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:41,701 INFO L225 Difference]: With dead ends: 196 [2018-07-25 08:54:41,701 INFO L226 Difference]: Without dead ends: 195 [2018-07-25 08:54:41,703 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=385, Invalid=37057, Unknown=0, NotChecked=0, Total=37442 [2018-07-25 08:54:41,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-07-25 08:54:41,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2018-07-25 08:54:41,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-07-25 08:54:41,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2018-07-25 08:54:41,711 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 193 [2018-07-25 08:54:41,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:41,711 INFO L472 AbstractCegarLoop]: Abstraction has 195 states and 195 transitions. [2018-07-25 08:54:41,711 INFO L473 AbstractCegarLoop]: Interpolant automaton has 194 states. [2018-07-25 08:54:41,712 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2018-07-25 08:54:41,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-07-25 08:54:41,712 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:41,712 INFO L354 BasicCegarLoop]: trace histogram [192, 1, 1] [2018-07-25 08:54:41,713 INFO L415 AbstractCegarLoop]: === Iteration 193 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:41,713 INFO L82 PathProgramCache]: Analyzing trace with hash -429638713, now seen corresponding path program 192 times [2018-07-25 08:54:41,713 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:41,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:43,191 INFO L134 CoverageAnalysis]: Checked inductivity of 18528 backedges. 0 proven. 18528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:43,191 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:43,192 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [193] total 193 [2018-07-25 08:54:43,192 INFO L451 AbstractCegarLoop]: Interpolant automaton has 195 states [2018-07-25 08:54:43,192 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 195 interpolants. [2018-07-25 08:54:43,193 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=387, Invalid=37443, Unknown=0, NotChecked=0, Total=37830 [2018-07-25 08:54:43,194 INFO L87 Difference]: Start difference. First operand 195 states and 195 transitions. Second operand 195 states. [2018-07-25 08:54:45,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:45,191 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2018-07-25 08:54:45,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2018-07-25 08:54:45,191 INFO L78 Accepts]: Start accepts. Automaton has 195 states. Word has length 194 [2018-07-25 08:54:45,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:45,192 INFO L225 Difference]: With dead ends: 197 [2018-07-25 08:54:45,192 INFO L226 Difference]: Without dead ends: 196 [2018-07-25 08:54:45,194 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=387, Invalid=37443, Unknown=0, NotChecked=0, Total=37830 [2018-07-25 08:54:45,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-07-25 08:54:45,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2018-07-25 08:54:45,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-07-25 08:54:45,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2018-07-25 08:54:45,202 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 194 [2018-07-25 08:54:45,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:45,202 INFO L472 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2018-07-25 08:54:45,202 INFO L473 AbstractCegarLoop]: Interpolant automaton has 195 states. [2018-07-25 08:54:45,203 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2018-07-25 08:54:45,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-07-25 08:54:45,203 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:45,203 INFO L354 BasicCegarLoop]: trace histogram [193, 1, 1] [2018-07-25 08:54:45,204 INFO L415 AbstractCegarLoop]: === Iteration 194 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:45,204 INFO L82 PathProgramCache]: Analyzing trace with hash -433898271, now seen corresponding path program 193 times [2018-07-25 08:54:45,204 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:45,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:46,816 INFO L134 CoverageAnalysis]: Checked inductivity of 18721 backedges. 0 proven. 18721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:46,816 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:46,817 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [194] total 194 [2018-07-25 08:54:46,817 INFO L451 AbstractCegarLoop]: Interpolant automaton has 196 states [2018-07-25 08:54:46,817 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 196 interpolants. [2018-07-25 08:54:46,819 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=389, Invalid=37831, Unknown=0, NotChecked=0, Total=38220 [2018-07-25 08:54:46,819 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 196 states. [2018-07-25 08:54:48,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:48,830 INFO L93 Difference]: Finished difference Result 198 states and 198 transitions. [2018-07-25 08:54:48,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 196 states. [2018-07-25 08:54:48,830 INFO L78 Accepts]: Start accepts. Automaton has 196 states. Word has length 195 [2018-07-25 08:54:48,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:48,830 INFO L225 Difference]: With dead ends: 198 [2018-07-25 08:54:48,830 INFO L226 Difference]: Without dead ends: 197 [2018-07-25 08:54:48,831 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=389, Invalid=37831, Unknown=0, NotChecked=0, Total=38220 [2018-07-25 08:54:48,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-07-25 08:54:48,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-07-25 08:54:48,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-07-25 08:54:48,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2018-07-25 08:54:48,837 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 195 [2018-07-25 08:54:48,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:48,837 INFO L472 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2018-07-25 08:54:48,837 INFO L473 AbstractCegarLoop]: Interpolant automaton has 196 states. [2018-07-25 08:54:48,837 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2018-07-25 08:54:48,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-07-25 08:54:48,837 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:48,838 INFO L354 BasicCegarLoop]: trace histogram [194, 1, 1] [2018-07-25 08:54:48,838 INFO L415 AbstractCegarLoop]: === Iteration 195 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:48,838 INFO L82 PathProgramCache]: Analyzing trace with hash -565944569, now seen corresponding path program 194 times [2018-07-25 08:54:48,838 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:48,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:50,480 INFO L134 CoverageAnalysis]: Checked inductivity of 18915 backedges. 0 proven. 18915 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:50,481 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:50,481 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [195] total 195 [2018-07-25 08:54:50,481 INFO L451 AbstractCegarLoop]: Interpolant automaton has 197 states [2018-07-25 08:54:50,481 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 197 interpolants. [2018-07-25 08:54:50,484 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=391, Invalid=38221, Unknown=0, NotChecked=0, Total=38612 [2018-07-25 08:54:50,484 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 197 states. [2018-07-25 08:54:52,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:52,580 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2018-07-25 08:54:52,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 197 states. [2018-07-25 08:54:52,580 INFO L78 Accepts]: Start accepts. Automaton has 197 states. Word has length 196 [2018-07-25 08:54:52,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:52,580 INFO L225 Difference]: With dead ends: 199 [2018-07-25 08:54:52,580 INFO L226 Difference]: Without dead ends: 198 [2018-07-25 08:54:52,581 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=391, Invalid=38221, Unknown=0, NotChecked=0, Total=38612 [2018-07-25 08:54:52,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-07-25 08:54:52,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2018-07-25 08:54:52,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-07-25 08:54:52,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 198 transitions. [2018-07-25 08:54:52,586 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 198 transitions. Word has length 196 [2018-07-25 08:54:52,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:52,587 INFO L472 AbstractCegarLoop]: Abstraction has 198 states and 198 transitions. [2018-07-25 08:54:52,587 INFO L473 AbstractCegarLoop]: Interpolant automaton has 197 states. [2018-07-25 08:54:52,587 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 198 transitions. [2018-07-25 08:54:52,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-07-25 08:54:52,587 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:52,587 INFO L354 BasicCegarLoop]: trace histogram [195, 1, 1] [2018-07-25 08:54:52,588 INFO L415 AbstractCegarLoop]: === Iteration 196 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:52,588 INFO L82 PathProgramCache]: Analyzing trace with hash -364412511, now seen corresponding path program 195 times [2018-07-25 08:54:52,588 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:52,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:54,279 INFO L134 CoverageAnalysis]: Checked inductivity of 19110 backedges. 0 proven. 19110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:54,279 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:54,279 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [196] total 196 [2018-07-25 08:54:54,280 INFO L451 AbstractCegarLoop]: Interpolant automaton has 198 states [2018-07-25 08:54:54,280 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 198 interpolants. [2018-07-25 08:54:54,282 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=393, Invalid=38613, Unknown=0, NotChecked=0, Total=39006 [2018-07-25 08:54:54,282 INFO L87 Difference]: Start difference. First operand 198 states and 198 transitions. Second operand 198 states. [2018-07-25 08:54:56,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:56,366 INFO L93 Difference]: Finished difference Result 200 states and 200 transitions. [2018-07-25 08:54:56,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2018-07-25 08:54:56,366 INFO L78 Accepts]: Start accepts. Automaton has 198 states. Word has length 197 [2018-07-25 08:54:56,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:56,366 INFO L225 Difference]: With dead ends: 200 [2018-07-25 08:54:56,366 INFO L226 Difference]: Without dead ends: 199 [2018-07-25 08:54:56,367 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=393, Invalid=38613, Unknown=0, NotChecked=0, Total=39006 [2018-07-25 08:54:56,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-07-25 08:54:56,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-07-25 08:54:56,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-07-25 08:54:56,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2018-07-25 08:54:56,372 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 197 [2018-07-25 08:54:56,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:56,373 INFO L472 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2018-07-25 08:54:56,373 INFO L473 AbstractCegarLoop]: Interpolant automaton has 198 states. [2018-07-25 08:54:56,373 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2018-07-25 08:54:56,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-07-25 08:54:56,373 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:56,373 INFO L354 BasicCegarLoop]: trace histogram [196, 1, 1] [2018-07-25 08:54:56,374 INFO L415 AbstractCegarLoop]: === Iteration 197 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:56,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1588113991, now seen corresponding path program 196 times [2018-07-25 08:54:56,374 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:56,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:58,072 INFO L134 CoverageAnalysis]: Checked inductivity of 19306 backedges. 0 proven. 19306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:58,073 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:58,073 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [197] total 197 [2018-07-25 08:54:58,073 INFO L451 AbstractCegarLoop]: Interpolant automaton has 199 states [2018-07-25 08:54:58,073 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 199 interpolants. [2018-07-25 08:54:58,075 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=39007, Unknown=0, NotChecked=0, Total=39402 [2018-07-25 08:54:58,076 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand 199 states. Received shutdown request... [2018-07-25 08:54:59,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2018-07-25 08:54:59,791 WARN L541 AbstractCegarLoop]: Verification canceled [2018-07-25 08:54:59,798 WARN L202 ceAbstractionStarter]: Timeout [2018-07-25 08:54:59,799 INFO L202 PluginConnector]: Adding new model DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.07 08:54:59 BoogieIcfgContainer [2018-07-25 08:54:59,799 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-25 08:54:59,800 INFO L168 Benchmark]: Toolchain (without parser) took 260982.69 ms. Allocated memory was 1.5 GB in the beginning and 3.4 GB in the end (delta: 1.9 GB). Free memory was 1.4 GB in the beginning and 3.0 GB in the end (delta: -1.6 GB). Peak memory consumption was 270.5 MB. Max. memory is 7.1 GB. [2018-07-25 08:54:59,802 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 08:54:59,802 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 08:54:59,803 INFO L168 Benchmark]: Boogie Preprocessor took 26.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 08:54:59,803 INFO L168 Benchmark]: RCFGBuilder took 187.52 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-25 08:54:59,803 INFO L168 Benchmark]: TraceAbstraction took 260716.97 ms. Allocated memory was 1.5 GB in the beginning and 3.4 GB in the end (delta: 1.9 GB). Free memory was 1.4 GB in the beginning and 3.0 GB in the end (delta: -1.6 GB). Peak memory consumption was 259.9 MB. Max. memory is 7.1 GB. [2018-07-25 08:54:59,805 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 47.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 187.52 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 260716.97 ms. Allocated memory was 1.5 GB in the beginning and 3.4 GB in the end (delta: 1.9 GB). Free memory was 1.4 GB in the beginning and 3.0 GB in the end (delta: -1.6 GB). Peak memory consumption was 259.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 21). Cancelled while BasicCegarLoop was constructing difference of abstraction (199states) and interpolant automaton (currently 158 states, 199 states before enhancement), while ReachableStatesComputation was computing reachable states (156 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 260.6s OverallTime, 197 OverallIterations, 196 TraceHistogramMax, 140.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 393 SDtfs, 1 SDslu, 0 SDs, 0 SdLazy, 2598398 SolverSat, 0 SolverUnsat, 33 SolverUnknown, 0 SolverNotchecked, 92.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 19503 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19503 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 102.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=199occurred in iteration=196, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 196 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 5.5s SatisfiabilityAnalysisTime, 108.8s InterpolantComputationTime, 19700 NumberOfCodeBlocks, 19700 NumberOfCodeBlocksAsserted, 197 NumberOfCheckSat, 19503 ConstructedInterpolants, 0 QuantifiedInterpolants, 17975265 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 197 InterpolantComputations, 1 PerfectInterpolantSequences, 0/1274196 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/DivisibilityInterpolantRequired01-BackwardSuccess.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-07-25_08-54-59-823.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/DivisibilityInterpolantRequired01-BackwardSuccess.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-25_08-54-59-823.csv Completed graceful shutdown