java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-56c9370 [2018-07-23 15:34:05,549 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-23 15:34:05,551 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-23 15:34:05,563 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-23 15:34:05,564 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-23 15:34:05,565 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-23 15:34:05,566 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-23 15:34:05,568 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-23 15:34:05,570 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-23 15:34:05,570 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-23 15:34:05,571 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-23 15:34:05,572 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-23 15:34:05,573 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-23 15:34:05,574 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-23 15:34:05,575 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-23 15:34:05,576 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-23 15:34:05,577 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-23 15:34:05,578 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-23 15:34:05,586 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-23 15:34:05,591 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-23 15:34:05,592 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-23 15:34:05,593 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-23 15:34:05,597 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-23 15:34:05,598 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-23 15:34:05,599 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-23 15:34:05,601 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-23 15:34:05,603 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-23 15:34:05,603 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-23 15:34:05,604 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-23 15:34:05,608 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-23 15:34:05,608 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-23 15:34:05,609 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-23 15:34:05,609 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-23 15:34:05,609 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-23 15:34:05,612 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-23 15:34:05,613 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-23 15:34:05,614 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf [2018-07-23 15:34:05,641 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-23 15:34:05,641 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-23 15:34:05,643 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-23 15:34:05,643 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-23 15:34:05,644 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-23 15:34:05,644 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-23 15:34:05,644 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-23 15:34:05,644 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-23 15:34:05,689 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-23 15:34:05,702 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-23 15:34:05,706 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-23 15:34:05,707 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-23 15:34:05,708 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-23 15:34:05,709 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement.bpl [2018-07-23 15:34:05,709 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement.bpl' [2018-07-23 15:34:05,792 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-23 15:34:05,794 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-07-23 15:34:05,794 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-23 15:34:05,795 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-23 15:34:05,795 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-23 15:34:05,819 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:34:05" (1/1) ... [2018-07-23 15:34:05,820 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:34:05" (1/1) ... [2018-07-23 15:34:05,837 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:34:05" (1/1) ... [2018-07-23 15:34:05,837 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:34:05" (1/1) ... [2018-07-23 15:34:05,847 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:34:05" (1/1) ... [2018-07-23 15:34:05,857 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:34:05" (1/1) ... [2018-07-23 15:34:05,858 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:34:05" (1/1) ... [2018-07-23 15:34:05,861 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-23 15:34:05,868 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-23 15:34:05,869 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-23 15:34:05,869 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-23 15:34:05,870 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:34:05" (1/1) ... [2018-07-23 15:34:05,957 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-07-23 15:34:05,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-07-23 15:34:05,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-23 15:34:05,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-07-23 15:34:05,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-07-23 15:34:05,958 INFO L130 BoogieDeclarations]: Found specification of procedure ~free [2018-07-23 15:34:05,959 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2018-07-23 15:34:05,959 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-07-23 15:34:05,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-07-23 15:34:05,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-23 15:34:06,209 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-23 15:34:06,210 INFO L202 PluginConnector]: Adding new model PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 03:34:06 BoogieIcfgContainer [2018-07-23 15:34:06,211 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-23 15:34:06,212 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-23 15:34:06,212 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-23 15:34:06,215 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-23 15:34:06,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:34:05" (1/2) ... [2018-07-23 15:34:06,217 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19131b29 and model type PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 03:34:06, skipping insertion in model container [2018-07-23 15:34:06,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 03:34:06" (2/2) ... [2018-07-23 15:34:06,220 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement.bpl [2018-07-23 15:34:06,230 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-23 15:34:06,239 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-07-23 15:34:06,284 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-23 15:34:06,285 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-23 15:34:06,285 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-23 15:34:06,285 INFO L375 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-23 15:34:06,285 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-23 15:34:06,286 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-23 15:34:06,286 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-23 15:34:06,286 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-23 15:34:06,286 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-23 15:34:06,302 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2018-07-23 15:34:06,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 15:34:06,314 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:06,315 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:06,315 INFO L414 AbstractCegarLoop]: === Iteration 1 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:06,321 INFO L82 PathProgramCache]: Analyzing trace with hash 993181201, now seen corresponding path program 1 times [2018-07-23 15:34:06,327 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:06,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:06,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:06,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:34:06,466 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 15:34:06,466 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-23 15:34:06,471 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 15:34:06,483 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 15:34:06,484 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-07-23 15:34:06,487 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 5 states. [2018-07-23 15:34:06,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:06,589 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-07-23 15:34:06,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 15:34:06,591 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-07-23 15:34:06,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:06,606 INFO L225 Difference]: With dead ends: 27 [2018-07-23 15:34:06,606 INFO L226 Difference]: Without dead ends: 16 [2018-07-23 15:34:06,610 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-07-23 15:34:06,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-07-23 15:34:06,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2018-07-23 15:34:06,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-07-23 15:34:06,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2018-07-23 15:34:06,654 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 8 [2018-07-23 15:34:06,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:06,654 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-07-23 15:34:06,655 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 15:34:06,655 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2018-07-23 15:34:06,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 15:34:06,655 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:06,656 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:06,656 INFO L414 AbstractCegarLoop]: === Iteration 2 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:06,656 INFO L82 PathProgramCache]: Analyzing trace with hash 993181200, now seen corresponding path program 1 times [2018-07-23 15:34:06,656 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:06,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:06,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:06,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:34:06,694 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 15:34:06,695 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 15:34:06,696 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 15:34:06,697 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 15:34:06,697 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 15:34:06,698 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. Second operand 4 states. [2018-07-23 15:34:06,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:06,732 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2018-07-23 15:34:06,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 15:34:06,733 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-07-23 15:34:06,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:06,735 INFO L225 Difference]: With dead ends: 14 [2018-07-23 15:34:06,736 INFO L226 Difference]: Without dead ends: 13 [2018-07-23 15:34:06,737 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 15:34:06,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-07-23 15:34:06,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-07-23 15:34:06,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-23 15:34:06,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2018-07-23 15:34:06,745 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 8 [2018-07-23 15:34:06,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:06,745 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-07-23 15:34:06,745 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 15:34:06,746 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2018-07-23 15:34:06,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-23 15:34:06,746 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:06,746 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:06,747 INFO L414 AbstractCegarLoop]: === Iteration 3 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:06,747 INFO L82 PathProgramCache]: Analyzing trace with hash -162723879, now seen corresponding path program 1 times [2018-07-23 15:34:06,747 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:06,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:06,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:06,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:34:06,784 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 15:34:06,785 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-23 15:34:06,785 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 15:34:06,787 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 15:34:06,787 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 15:34:06,788 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 4 states. [2018-07-23 15:34:06,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:06,845 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2018-07-23 15:34:06,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 15:34:06,846 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-07-23 15:34:06,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:06,850 INFO L225 Difference]: With dead ends: 19 [2018-07-23 15:34:06,850 INFO L226 Difference]: Without dead ends: 13 [2018-07-23 15:34:06,851 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 15:34:06,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-07-23 15:34:06,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-07-23 15:34:06,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-23 15:34:06,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-07-23 15:34:06,861 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-07-23 15:34:06,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:06,861 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-07-23 15:34:06,861 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 15:34:06,861 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-07-23 15:34:06,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-23 15:34:06,862 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:06,863 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:06,863 INFO L414 AbstractCegarLoop]: === Iteration 4 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:06,863 INFO L82 PathProgramCache]: Analyzing trace with hash -911568744, now seen corresponding path program 1 times [2018-07-23 15:34:06,864 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:06,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:06,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:06,985 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-23 15:34:06,989 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:06,989 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-23 15:34:06,990 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 15:34:06,990 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 15:34:06,990 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-07-23 15:34:06,991 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 6 states. [2018-07-23 15:34:07,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:07,049 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-07-23 15:34:07,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-23 15:34:07,049 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-07-23 15:34:07,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:07,053 INFO L225 Difference]: With dead ends: 19 [2018-07-23 15:34:07,053 INFO L226 Difference]: Without dead ends: 18 [2018-07-23 15:34:07,054 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-07-23 15:34:07,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-07-23 15:34:07,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-07-23 15:34:07,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-07-23 15:34:07,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-07-23 15:34:07,065 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 12 [2018-07-23 15:34:07,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:07,066 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-07-23 15:34:07,066 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 15:34:07,066 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-07-23 15:34:07,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-23 15:34:07,067 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:07,068 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:07,068 INFO L414 AbstractCegarLoop]: === Iteration 5 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:07,069 INFO L82 PathProgramCache]: Analyzing trace with hash -615004257, now seen corresponding path program 2 times [2018-07-23 15:34:07,069 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:07,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:07,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:07,161 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-23 15:34:07,162 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:07,162 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 15:34:07,162 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 15:34:07,163 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 15:34:07,163 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-07-23 15:34:07,164 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 7 states. [2018-07-23 15:34:07,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:07,222 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-07-23 15:34:07,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-23 15:34:07,222 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-07-23 15:34:07,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:07,223 INFO L225 Difference]: With dead ends: 23 [2018-07-23 15:34:07,224 INFO L226 Difference]: Without dead ends: 22 [2018-07-23 15:34:07,224 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-07-23 15:34:07,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-07-23 15:34:07,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-07-23 15:34:07,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-07-23 15:34:07,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-07-23 15:34:07,232 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 16 [2018-07-23 15:34:07,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:07,233 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-07-23 15:34:07,233 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 15:34:07,233 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-07-23 15:34:07,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 15:34:07,234 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:07,234 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:07,234 INFO L414 AbstractCegarLoop]: === Iteration 6 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:07,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1442063142, now seen corresponding path program 3 times [2018-07-23 15:34:07,235 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:07,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:07,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:07,375 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-23 15:34:07,376 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:07,376 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 15:34:07,380 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 15:34:07,380 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 15:34:07,381 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-07-23 15:34:07,381 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 8 states. [2018-07-23 15:34:07,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:07,433 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-07-23 15:34:07,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-23 15:34:07,433 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-07-23 15:34:07,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:07,434 INFO L225 Difference]: With dead ends: 27 [2018-07-23 15:34:07,435 INFO L226 Difference]: Without dead ends: 26 [2018-07-23 15:34:07,435 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-07-23 15:34:07,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-07-23 15:34:07,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-07-23 15:34:07,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-07-23 15:34:07,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-07-23 15:34:07,445 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 20 [2018-07-23 15:34:07,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:07,446 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-07-23 15:34:07,446 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 15:34:07,446 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-07-23 15:34:07,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-07-23 15:34:07,447 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:07,447 INFO L353 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:07,447 INFO L414 AbstractCegarLoop]: === Iteration 7 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:07,448 INFO L82 PathProgramCache]: Analyzing trace with hash 744055597, now seen corresponding path program 4 times [2018-07-23 15:34:07,448 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:07,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:07,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:07,574 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-23 15:34:07,574 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:07,574 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 15:34:07,575 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 15:34:07,575 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 15:34:07,576 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-07-23 15:34:07,576 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 9 states. [2018-07-23 15:34:07,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:07,645 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-07-23 15:34:07,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-23 15:34:07,646 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-07-23 15:34:07,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:07,648 INFO L225 Difference]: With dead ends: 31 [2018-07-23 15:34:07,649 INFO L226 Difference]: Without dead ends: 30 [2018-07-23 15:34:07,652 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-07-23 15:34:07,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-07-23 15:34:07,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-07-23 15:34:07,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-07-23 15:34:07,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-07-23 15:34:07,681 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 24 [2018-07-23 15:34:07,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:07,687 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-07-23 15:34:07,687 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 15:34:07,688 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-07-23 15:34:07,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-07-23 15:34:07,689 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:07,691 INFO L353 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:07,692 INFO L414 AbstractCegarLoop]: === Iteration 8 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:07,692 INFO L82 PathProgramCache]: Analyzing trace with hash -830388300, now seen corresponding path program 5 times [2018-07-23 15:34:07,692 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:07,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:07,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:07,847 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-23 15:34:07,847 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:07,848 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 15:34:07,849 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 15:34:07,849 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 15:34:07,849 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-07-23 15:34:07,850 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 10 states. [2018-07-23 15:34:07,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:07,933 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-07-23 15:34:07,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-23 15:34:07,933 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2018-07-23 15:34:07,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:07,937 INFO L225 Difference]: With dead ends: 35 [2018-07-23 15:34:07,937 INFO L226 Difference]: Without dead ends: 34 [2018-07-23 15:34:07,938 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-07-23 15:34:07,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-07-23 15:34:07,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-07-23 15:34:07,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-07-23 15:34:07,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-07-23 15:34:07,951 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 28 [2018-07-23 15:34:07,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:07,951 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-07-23 15:34:07,952 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 15:34:07,952 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-07-23 15:34:07,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-07-23 15:34:07,953 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:07,953 INFO L353 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:07,953 INFO L414 AbstractCegarLoop]: === Iteration 9 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:07,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1719299909, now seen corresponding path program 6 times [2018-07-23 15:34:07,954 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:07,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:08,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:08,066 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-23 15:34:08,066 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:08,067 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 15:34:08,067 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 15:34:08,068 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 15:34:08,068 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-07-23 15:34:08,069 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 11 states. [2018-07-23 15:34:08,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:08,123 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-07-23 15:34:08,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 15:34:08,124 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-07-23 15:34:08,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:08,125 INFO L225 Difference]: With dead ends: 39 [2018-07-23 15:34:08,125 INFO L226 Difference]: Without dead ends: 38 [2018-07-23 15:34:08,126 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-07-23 15:34:08,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-07-23 15:34:08,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-07-23 15:34:08,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-07-23 15:34:08,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-07-23 15:34:08,138 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 32 [2018-07-23 15:34:08,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:08,138 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-07-23 15:34:08,138 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 15:34:08,139 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-07-23 15:34:08,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-07-23 15:34:08,140 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:08,140 INFO L353 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:08,140 INFO L414 AbstractCegarLoop]: === Iteration 10 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:08,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1201667650, now seen corresponding path program 7 times [2018-07-23 15:34:08,141 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:08,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:08,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:08,248 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-23 15:34:08,248 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:08,249 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 15:34:08,249 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 15:34:08,249 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 15:34:08,250 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2018-07-23 15:34:08,250 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 12 states. [2018-07-23 15:34:08,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:08,318 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-07-23 15:34:08,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 15:34:08,319 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 36 [2018-07-23 15:34:08,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:08,320 INFO L225 Difference]: With dead ends: 43 [2018-07-23 15:34:08,320 INFO L226 Difference]: Without dead ends: 42 [2018-07-23 15:34:08,323 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2018-07-23 15:34:08,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-07-23 15:34:08,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-07-23 15:34:08,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-07-23 15:34:08,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-07-23 15:34:08,339 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 36 [2018-07-23 15:34:08,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:08,340 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-07-23 15:34:08,340 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 15:34:08,340 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-07-23 15:34:08,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-07-23 15:34:08,343 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:08,343 INFO L353 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:08,343 INFO L414 AbstractCegarLoop]: === Iteration 11 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:08,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1613385801, now seen corresponding path program 8 times [2018-07-23 15:34:08,344 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:08,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:08,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:08,495 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-23 15:34:08,496 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:08,496 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-23 15:34:08,497 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 15:34:08,498 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 15:34:08,498 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-07-23 15:34:08,498 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 13 states. [2018-07-23 15:34:08,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:08,566 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-07-23 15:34:08,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 15:34:08,567 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2018-07-23 15:34:08,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:08,568 INFO L225 Difference]: With dead ends: 47 [2018-07-23 15:34:08,568 INFO L226 Difference]: Without dead ends: 46 [2018-07-23 15:34:08,570 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-07-23 15:34:08,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-07-23 15:34:08,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-07-23 15:34:08,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-07-23 15:34:08,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-07-23 15:34:08,587 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 40 [2018-07-23 15:34:08,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:08,587 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-07-23 15:34:08,588 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 15:34:08,588 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-07-23 15:34:08,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-07-23 15:34:08,590 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:08,590 INFO L353 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:08,590 INFO L414 AbstractCegarLoop]: === Iteration 12 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:08,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1482799408, now seen corresponding path program 9 times [2018-07-23 15:34:08,592 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:08,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:08,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:08,741 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-23 15:34:08,742 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:08,742 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-23 15:34:08,743 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-23 15:34:08,743 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-23 15:34:08,745 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2018-07-23 15:34:08,745 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 14 states. [2018-07-23 15:34:08,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:08,823 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-07-23 15:34:08,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 15:34:08,824 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2018-07-23 15:34:08,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:08,825 INFO L225 Difference]: With dead ends: 51 [2018-07-23 15:34:08,825 INFO L226 Difference]: Without dead ends: 50 [2018-07-23 15:34:08,827 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2018-07-23 15:34:08,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-07-23 15:34:08,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-07-23 15:34:08,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-07-23 15:34:08,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-07-23 15:34:08,845 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 44 [2018-07-23 15:34:08,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:08,846 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-07-23 15:34:08,846 INFO L472 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-23 15:34:08,846 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-07-23 15:34:08,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-07-23 15:34:08,851 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:08,851 INFO L353 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:08,852 INFO L414 AbstractCegarLoop]: === Iteration 13 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:08,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1886019113, now seen corresponding path program 10 times [2018-07-23 15:34:08,852 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:08,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:08,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:09,013 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:34:09,013 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:09,014 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-23 15:34:09,014 INFO L450 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-23 15:34:09,015 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-23 15:34:09,015 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-07-23 15:34:09,016 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 15 states. [2018-07-23 15:34:09,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:09,089 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-07-23 15:34:09,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 15:34:09,090 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 48 [2018-07-23 15:34:09,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:09,091 INFO L225 Difference]: With dead ends: 55 [2018-07-23 15:34:09,091 INFO L226 Difference]: Without dead ends: 54 [2018-07-23 15:34:09,092 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-07-23 15:34:09,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-07-23 15:34:09,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-07-23 15:34:09,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-07-23 15:34:09,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-07-23 15:34:09,109 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 48 [2018-07-23 15:34:09,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:09,110 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-07-23 15:34:09,110 INFO L472 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-23 15:34:09,110 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-07-23 15:34:09,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-07-23 15:34:09,111 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:09,111 INFO L353 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:09,111 INFO L414 AbstractCegarLoop]: === Iteration 14 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:09,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1496702626, now seen corresponding path program 11 times [2018-07-23 15:34:09,112 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:09,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:09,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:09,305 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-23 15:34:09,306 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:09,306 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-23 15:34:09,307 INFO L450 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-23 15:34:09,307 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-23 15:34:09,308 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2018-07-23 15:34:09,308 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 16 states. [2018-07-23 15:34:09,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:09,388 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-07-23 15:34:09,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 15:34:09,388 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 52 [2018-07-23 15:34:09,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:09,390 INFO L225 Difference]: With dead ends: 59 [2018-07-23 15:34:09,390 INFO L226 Difference]: Without dead ends: 58 [2018-07-23 15:34:09,391 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2018-07-23 15:34:09,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-07-23 15:34:09,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-07-23 15:34:09,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-07-23 15:34:09,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-07-23 15:34:09,415 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 52 [2018-07-23 15:34:09,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:09,415 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-07-23 15:34:09,415 INFO L472 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-23 15:34:09,415 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-07-23 15:34:09,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-07-23 15:34:09,417 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:09,417 INFO L353 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:09,417 INFO L414 AbstractCegarLoop]: === Iteration 15 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:09,418 INFO L82 PathProgramCache]: Analyzing trace with hash 152405349, now seen corresponding path program 12 times [2018-07-23 15:34:09,418 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:09,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:09,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:09,629 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-23 15:34:09,630 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:09,630 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-07-23 15:34:09,630 INFO L450 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-23 15:34:09,631 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-23 15:34:09,631 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2018-07-23 15:34:09,631 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 17 states. [2018-07-23 15:34:09,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:09,716 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-07-23 15:34:09,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-23 15:34:09,716 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2018-07-23 15:34:09,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:09,717 INFO L225 Difference]: With dead ends: 63 [2018-07-23 15:34:09,717 INFO L226 Difference]: Without dead ends: 62 [2018-07-23 15:34:09,718 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2018-07-23 15:34:09,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-07-23 15:34:09,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-07-23 15:34:09,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-07-23 15:34:09,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-07-23 15:34:09,742 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 56 [2018-07-23 15:34:09,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:09,743 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-07-23 15:34:09,743 INFO L472 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-23 15:34:09,743 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-07-23 15:34:09,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-07-23 15:34:09,744 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:09,748 INFO L353 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:09,748 INFO L414 AbstractCegarLoop]: === Iteration 16 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:09,748 INFO L82 PathProgramCache]: Analyzing trace with hash -814641684, now seen corresponding path program 13 times [2018-07-23 15:34:09,748 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:09,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:09,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:09,950 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-23 15:34:09,950 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:09,951 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-07-23 15:34:09,951 INFO L450 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-23 15:34:09,954 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-23 15:34:09,955 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2018-07-23 15:34:09,955 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 18 states. [2018-07-23 15:34:10,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:10,026 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-07-23 15:34:10,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-23 15:34:10,026 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 60 [2018-07-23 15:34:10,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:10,028 INFO L225 Difference]: With dead ends: 67 [2018-07-23 15:34:10,028 INFO L226 Difference]: Without dead ends: 66 [2018-07-23 15:34:10,028 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2018-07-23 15:34:10,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-07-23 15:34:10,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2018-07-23 15:34:10,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-07-23 15:34:10,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-07-23 15:34:10,058 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 60 [2018-07-23 15:34:10,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:10,059 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-07-23 15:34:10,059 INFO L472 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-23 15:34:10,062 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-07-23 15:34:10,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-07-23 15:34:10,063 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:10,063 INFO L353 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:10,064 INFO L414 AbstractCegarLoop]: === Iteration 17 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:10,064 INFO L82 PathProgramCache]: Analyzing trace with hash 2146958067, now seen corresponding path program 14 times [2018-07-23 15:34:10,064 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:10,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:10,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:10,265 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-23 15:34:10,265 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:10,265 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-07-23 15:34:10,266 INFO L450 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-07-23 15:34:10,266 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-07-23 15:34:10,267 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2018-07-23 15:34:10,267 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 19 states. [2018-07-23 15:34:10,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:10,351 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-07-23 15:34:10,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-23 15:34:10,351 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 64 [2018-07-23 15:34:10,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:10,352 INFO L225 Difference]: With dead ends: 71 [2018-07-23 15:34:10,352 INFO L226 Difference]: Without dead ends: 70 [2018-07-23 15:34:10,353 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2018-07-23 15:34:10,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-07-23 15:34:10,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-07-23 15:34:10,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-07-23 15:34:10,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-07-23 15:34:10,374 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 64 [2018-07-23 15:34:10,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:10,374 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-07-23 15:34:10,375 INFO L472 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-07-23 15:34:10,375 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-07-23 15:34:10,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-07-23 15:34:10,376 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:10,376 INFO L353 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:10,376 INFO L414 AbstractCegarLoop]: === Iteration 18 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:10,377 INFO L82 PathProgramCache]: Analyzing trace with hash 2111999098, now seen corresponding path program 15 times [2018-07-23 15:34:10,377 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:10,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:10,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:10,645 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-23 15:34:10,645 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:10,645 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-07-23 15:34:10,646 INFO L450 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-07-23 15:34:10,646 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-07-23 15:34:10,646 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=207, Unknown=0, NotChecked=0, Total=380 [2018-07-23 15:34:10,647 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 20 states. [2018-07-23 15:34:10,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:10,737 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-07-23 15:34:10,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-23 15:34:10,738 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 68 [2018-07-23 15:34:10,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:10,738 INFO L225 Difference]: With dead ends: 75 [2018-07-23 15:34:10,739 INFO L226 Difference]: Without dead ends: 74 [2018-07-23 15:34:10,739 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=173, Invalid=207, Unknown=0, NotChecked=0, Total=380 [2018-07-23 15:34:10,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-07-23 15:34:10,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-07-23 15:34:10,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-07-23 15:34:10,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-07-23 15:34:10,760 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 68 [2018-07-23 15:34:10,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:10,761 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-07-23 15:34:10,761 INFO L472 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-07-23 15:34:10,761 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-07-23 15:34:10,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-07-23 15:34:10,762 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:10,762 INFO L353 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:10,762 INFO L414 AbstractCegarLoop]: === Iteration 19 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:10,763 INFO L82 PathProgramCache]: Analyzing trace with hash 2039153281, now seen corresponding path program 16 times [2018-07-23 15:34:10,763 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:10,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:10,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:10,981 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-23 15:34:10,982 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:10,982 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-07-23 15:34:10,982 INFO L450 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-07-23 15:34:10,982 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-07-23 15:34:10,983 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=228, Unknown=0, NotChecked=0, Total=420 [2018-07-23 15:34:10,983 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 21 states. [2018-07-23 15:34:11,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:11,068 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-07-23 15:34:11,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-23 15:34:11,068 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 72 [2018-07-23 15:34:11,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:11,069 INFO L225 Difference]: With dead ends: 79 [2018-07-23 15:34:11,069 INFO L226 Difference]: Without dead ends: 78 [2018-07-23 15:34:11,070 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=192, Invalid=228, Unknown=0, NotChecked=0, Total=420 [2018-07-23 15:34:11,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-07-23 15:34:11,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-07-23 15:34:11,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-07-23 15:34:11,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-07-23 15:34:11,095 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 72 [2018-07-23 15:34:11,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:11,095 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-07-23 15:34:11,095 INFO L472 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-07-23 15:34:11,096 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-07-23 15:34:11,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-07-23 15:34:11,096 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:11,096 INFO L353 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:11,097 INFO L414 AbstractCegarLoop]: === Iteration 20 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:11,097 INFO L82 PathProgramCache]: Analyzing trace with hash -529851128, now seen corresponding path program 17 times [2018-07-23 15:34:11,097 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:11,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:11,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:11,315 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-23 15:34:11,315 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:11,316 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-07-23 15:34:11,316 INFO L450 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-07-23 15:34:11,316 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-07-23 15:34:11,317 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=250, Unknown=0, NotChecked=0, Total=462 [2018-07-23 15:34:11,317 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 22 states. [2018-07-23 15:34:11,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:11,411 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-07-23 15:34:11,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-23 15:34:11,412 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 76 [2018-07-23 15:34:11,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:11,413 INFO L225 Difference]: With dead ends: 83 [2018-07-23 15:34:11,413 INFO L226 Difference]: Without dead ends: 82 [2018-07-23 15:34:11,414 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=212, Invalid=250, Unknown=0, NotChecked=0, Total=462 [2018-07-23 15:34:11,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-07-23 15:34:11,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-07-23 15:34:11,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-07-23 15:34:11,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-07-23 15:34:11,438 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 76 [2018-07-23 15:34:11,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:11,439 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-07-23 15:34:11,439 INFO L472 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-07-23 15:34:11,439 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-07-23 15:34:11,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-07-23 15:34:11,440 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:11,440 INFO L353 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:11,440 INFO L414 AbstractCegarLoop]: === Iteration 21 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:11,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1293720591, now seen corresponding path program 18 times [2018-07-23 15:34:11,441 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:11,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:11,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:11,674 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-23 15:34:11,675 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:11,675 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-07-23 15:34:11,675 INFO L450 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-07-23 15:34:11,676 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-07-23 15:34:11,676 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=273, Unknown=0, NotChecked=0, Total=506 [2018-07-23 15:34:11,676 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 23 states. [2018-07-23 15:34:11,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:11,780 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-07-23 15:34:11,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-23 15:34:11,780 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 80 [2018-07-23 15:34:11,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:11,781 INFO L225 Difference]: With dead ends: 87 [2018-07-23 15:34:11,781 INFO L226 Difference]: Without dead ends: 86 [2018-07-23 15:34:11,782 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=233, Invalid=273, Unknown=0, NotChecked=0, Total=506 [2018-07-23 15:34:11,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-07-23 15:34:11,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2018-07-23 15:34:11,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-07-23 15:34:11,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-07-23 15:34:11,808 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 80 [2018-07-23 15:34:11,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:11,809 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-07-23 15:34:11,809 INFO L472 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-07-23 15:34:11,809 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-07-23 15:34:11,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-07-23 15:34:11,810 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:11,810 INFO L353 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:11,810 INFO L414 AbstractCegarLoop]: === Iteration 22 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:11,811 INFO L82 PathProgramCache]: Analyzing trace with hash -145145962, now seen corresponding path program 19 times [2018-07-23 15:34:11,811 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:11,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:12,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:12,060 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-23 15:34:12,061 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:12,061 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-07-23 15:34:12,061 INFO L450 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-07-23 15:34:12,061 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-07-23 15:34:12,062 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=297, Unknown=0, NotChecked=0, Total=552 [2018-07-23 15:34:12,062 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 24 states. [2018-07-23 15:34:12,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:12,158 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-07-23 15:34:12,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-23 15:34:12,158 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 84 [2018-07-23 15:34:12,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:12,159 INFO L225 Difference]: With dead ends: 91 [2018-07-23 15:34:12,159 INFO L226 Difference]: Without dead ends: 90 [2018-07-23 15:34:12,161 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=255, Invalid=297, Unknown=0, NotChecked=0, Total=552 [2018-07-23 15:34:12,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-07-23 15:34:12,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-07-23 15:34:12,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-07-23 15:34:12,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-07-23 15:34:12,189 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 84 [2018-07-23 15:34:12,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:12,189 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-07-23 15:34:12,189 INFO L472 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-07-23 15:34:12,190 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-07-23 15:34:12,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-07-23 15:34:12,190 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:12,190 INFO L353 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:12,191 INFO L414 AbstractCegarLoop]: === Iteration 23 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:12,191 INFO L82 PathProgramCache]: Analyzing trace with hash 603637661, now seen corresponding path program 20 times [2018-07-23 15:34:12,191 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:12,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:12,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:12,458 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-23 15:34:12,459 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:12,459 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-07-23 15:34:12,459 INFO L450 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-07-23 15:34:12,459 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-07-23 15:34:12,460 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=322, Unknown=0, NotChecked=0, Total=600 [2018-07-23 15:34:12,460 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 25 states. [2018-07-23 15:34:12,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:12,559 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-07-23 15:34:12,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-23 15:34:12,560 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 88 [2018-07-23 15:34:12,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:12,560 INFO L225 Difference]: With dead ends: 95 [2018-07-23 15:34:12,561 INFO L226 Difference]: Without dead ends: 94 [2018-07-23 15:34:12,561 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=278, Invalid=322, Unknown=0, NotChecked=0, Total=600 [2018-07-23 15:34:12,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-07-23 15:34:12,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2018-07-23 15:34:12,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-07-23 15:34:12,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-07-23 15:34:12,590 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 88 [2018-07-23 15:34:12,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:12,590 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-07-23 15:34:12,590 INFO L472 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-07-23 15:34:12,590 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-07-23 15:34:12,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-07-23 15:34:12,591 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:12,591 INFO L353 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:12,592 INFO L414 AbstractCegarLoop]: === Iteration 24 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:12,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1795492828, now seen corresponding path program 21 times [2018-07-23 15:34:12,592 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:12,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:12,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:12,860 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-23 15:34:12,860 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:12,860 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-07-23 15:34:12,861 INFO L450 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-07-23 15:34:12,861 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-07-23 15:34:12,862 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=348, Unknown=0, NotChecked=0, Total=650 [2018-07-23 15:34:12,862 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 26 states. [2018-07-23 15:34:12,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:12,973 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-07-23 15:34:12,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-23 15:34:12,974 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 92 [2018-07-23 15:34:12,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:12,975 INFO L225 Difference]: With dead ends: 99 [2018-07-23 15:34:12,975 INFO L226 Difference]: Without dead ends: 98 [2018-07-23 15:34:12,976 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=302, Invalid=348, Unknown=0, NotChecked=0, Total=650 [2018-07-23 15:34:12,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-07-23 15:34:13,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2018-07-23 15:34:13,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-07-23 15:34:13,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-07-23 15:34:13,013 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 92 [2018-07-23 15:34:13,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:13,013 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-07-23 15:34:13,014 INFO L472 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-07-23 15:34:13,014 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-07-23 15:34:13,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-07-23 15:34:13,015 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:13,016 INFO L353 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:13,016 INFO L414 AbstractCegarLoop]: === Iteration 25 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:13,016 INFO L82 PathProgramCache]: Analyzing trace with hash -109869781, now seen corresponding path program 22 times [2018-07-23 15:34:13,017 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:13,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:13,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:13,349 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-23 15:34:13,350 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:13,350 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-07-23 15:34:13,351 INFO L450 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-07-23 15:34:13,351 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-07-23 15:34:13,351 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=375, Unknown=0, NotChecked=0, Total=702 [2018-07-23 15:34:13,352 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 27 states. [2018-07-23 15:34:13,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:13,502 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-07-23 15:34:13,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-23 15:34:13,503 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 96 [2018-07-23 15:34:13,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:13,504 INFO L225 Difference]: With dead ends: 103 [2018-07-23 15:34:13,504 INFO L226 Difference]: Without dead ends: 102 [2018-07-23 15:34:13,505 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=327, Invalid=375, Unknown=0, NotChecked=0, Total=702 [2018-07-23 15:34:13,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-07-23 15:34:13,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2018-07-23 15:34:13,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-07-23 15:34:13,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-07-23 15:34:13,535 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 96 [2018-07-23 15:34:13,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:13,535 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-07-23 15:34:13,536 INFO L472 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-07-23 15:34:13,536 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-07-23 15:34:13,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-07-23 15:34:13,537 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:13,537 INFO L353 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:13,537 INFO L414 AbstractCegarLoop]: === Iteration 26 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:13,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1570650802, now seen corresponding path program 23 times [2018-07-23 15:34:13,537 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:13,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:13,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:13,796 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-23 15:34:13,797 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:13,797 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-07-23 15:34:13,797 INFO L450 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-07-23 15:34:13,798 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-07-23 15:34:13,798 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=403, Unknown=0, NotChecked=0, Total=756 [2018-07-23 15:34:13,798 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 28 states. [2018-07-23 15:34:13,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:13,898 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-07-23 15:34:13,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-23 15:34:13,898 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 100 [2018-07-23 15:34:13,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:13,899 INFO L225 Difference]: With dead ends: 107 [2018-07-23 15:34:13,899 INFO L226 Difference]: Without dead ends: 106 [2018-07-23 15:34:13,900 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=353, Invalid=403, Unknown=0, NotChecked=0, Total=756 [2018-07-23 15:34:13,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-07-23 15:34:13,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2018-07-23 15:34:13,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-07-23 15:34:13,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-07-23 15:34:13,934 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 100 [2018-07-23 15:34:13,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:13,935 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-07-23 15:34:13,935 INFO L472 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-07-23 15:34:13,935 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-07-23 15:34:13,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-07-23 15:34:13,936 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:13,936 INFO L353 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:13,936 INFO L414 AbstractCegarLoop]: === Iteration 27 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:13,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1697327943, now seen corresponding path program 24 times [2018-07-23 15:34:13,937 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:13,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:14,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:14,231 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-23 15:34:14,232 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:14,232 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-07-23 15:34:14,232 INFO L450 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-07-23 15:34:14,233 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-07-23 15:34:14,233 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=432, Unknown=0, NotChecked=0, Total=812 [2018-07-23 15:34:14,233 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 29 states. [2018-07-23 15:34:14,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:14,344 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-07-23 15:34:14,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-23 15:34:14,344 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 104 [2018-07-23 15:34:14,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:14,345 INFO L225 Difference]: With dead ends: 111 [2018-07-23 15:34:14,345 INFO L226 Difference]: Without dead ends: 110 [2018-07-23 15:34:14,346 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=380, Invalid=432, Unknown=0, NotChecked=0, Total=812 [2018-07-23 15:34:14,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-07-23 15:34:14,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2018-07-23 15:34:14,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-07-23 15:34:14,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-07-23 15:34:14,382 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 104 [2018-07-23 15:34:14,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:14,383 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-07-23 15:34:14,383 INFO L472 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-07-23 15:34:14,383 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-07-23 15:34:14,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-07-23 15:34:14,384 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:14,384 INFO L353 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:14,384 INFO L414 AbstractCegarLoop]: === Iteration 28 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:14,385 INFO L82 PathProgramCache]: Analyzing trace with hash -946793664, now seen corresponding path program 25 times [2018-07-23 15:34:14,385 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:14,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:14,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:14,684 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-23 15:34:14,684 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:14,684 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-07-23 15:34:14,685 INFO L450 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-07-23 15:34:14,685 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-07-23 15:34:14,686 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=462, Unknown=0, NotChecked=0, Total=870 [2018-07-23 15:34:14,686 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 30 states. [2018-07-23 15:34:14,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:14,814 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-07-23 15:34:14,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-23 15:34:14,814 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 108 [2018-07-23 15:34:14,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:14,815 INFO L225 Difference]: With dead ends: 115 [2018-07-23 15:34:14,815 INFO L226 Difference]: Without dead ends: 114 [2018-07-23 15:34:14,816 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=408, Invalid=462, Unknown=0, NotChecked=0, Total=870 [2018-07-23 15:34:14,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-07-23 15:34:14,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2018-07-23 15:34:14,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-07-23 15:34:14,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-07-23 15:34:14,852 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 108 [2018-07-23 15:34:14,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:14,852 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-07-23 15:34:14,852 INFO L472 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-07-23 15:34:14,852 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-07-23 15:34:14,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-07-23 15:34:14,853 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:14,853 INFO L353 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:14,854 INFO L414 AbstractCegarLoop]: === Iteration 29 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:14,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1486047673, now seen corresponding path program 26 times [2018-07-23 15:34:14,854 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:14,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:15,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:15,166 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-23 15:34:15,166 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:15,166 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-07-23 15:34:15,167 INFO L450 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-07-23 15:34:15,167 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-07-23 15:34:15,168 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=437, Invalid=493, Unknown=0, NotChecked=0, Total=930 [2018-07-23 15:34:15,168 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 31 states. [2018-07-23 15:34:15,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:15,277 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-07-23 15:34:15,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-23 15:34:15,278 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 112 [2018-07-23 15:34:15,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:15,279 INFO L225 Difference]: With dead ends: 119 [2018-07-23 15:34:15,279 INFO L226 Difference]: Without dead ends: 118 [2018-07-23 15:34:15,280 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=437, Invalid=493, Unknown=0, NotChecked=0, Total=930 [2018-07-23 15:34:15,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-07-23 15:34:15,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2018-07-23 15:34:15,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-07-23 15:34:15,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-07-23 15:34:15,320 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 112 [2018-07-23 15:34:15,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:15,321 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-07-23 15:34:15,321 INFO L472 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-07-23 15:34:15,321 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-07-23 15:34:15,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-07-23 15:34:15,323 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:15,323 INFO L353 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:15,323 INFO L414 AbstractCegarLoop]: === Iteration 30 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:15,323 INFO L82 PathProgramCache]: Analyzing trace with hash 455179726, now seen corresponding path program 27 times [2018-07-23 15:34:15,323 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:15,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:15,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:15,652 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-23 15:34:15,652 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:15,652 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-07-23 15:34:15,653 INFO L450 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-07-23 15:34:15,653 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-07-23 15:34:15,654 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=467, Invalid=525, Unknown=0, NotChecked=0, Total=992 [2018-07-23 15:34:15,654 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 32 states. [2018-07-23 15:34:15,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:15,769 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-07-23 15:34:15,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-23 15:34:15,769 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 116 [2018-07-23 15:34:15,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:15,771 INFO L225 Difference]: With dead ends: 123 [2018-07-23 15:34:15,771 INFO L226 Difference]: Without dead ends: 122 [2018-07-23 15:34:15,772 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=467, Invalid=525, Unknown=0, NotChecked=0, Total=992 [2018-07-23 15:34:15,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-07-23 15:34:15,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2018-07-23 15:34:15,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-07-23 15:34:15,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-07-23 15:34:15,820 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 116 [2018-07-23 15:34:15,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:15,821 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-07-23 15:34:15,821 INFO L472 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-07-23 15:34:15,821 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-07-23 15:34:15,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-07-23 15:34:15,822 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:15,823 INFO L353 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:15,823 INFO L414 AbstractCegarLoop]: === Iteration 31 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:15,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1870059051, now seen corresponding path program 28 times [2018-07-23 15:34:15,823 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:15,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:16,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:16,260 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-23 15:34:16,260 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:16,261 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-07-23 15:34:16,261 INFO L450 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-07-23 15:34:16,262 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-07-23 15:34:16,262 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=498, Invalid=558, Unknown=0, NotChecked=0, Total=1056 [2018-07-23 15:34:16,262 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 33 states. [2018-07-23 15:34:16,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:16,404 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-07-23 15:34:16,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-07-23 15:34:16,404 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 120 [2018-07-23 15:34:16,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:16,406 INFO L225 Difference]: With dead ends: 127 [2018-07-23 15:34:16,406 INFO L226 Difference]: Without dead ends: 126 [2018-07-23 15:34:16,407 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=498, Invalid=558, Unknown=0, NotChecked=0, Total=1056 [2018-07-23 15:34:16,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-07-23 15:34:16,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2018-07-23 15:34:16,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-07-23 15:34:16,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-07-23 15:34:16,453 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 120 [2018-07-23 15:34:16,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:16,454 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-07-23 15:34:16,454 INFO L472 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-07-23 15:34:16,454 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-07-23 15:34:16,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-07-23 15:34:16,456 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:16,456 INFO L353 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:16,456 INFO L414 AbstractCegarLoop]: === Iteration 32 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:16,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1922923100, now seen corresponding path program 29 times [2018-07-23 15:34:16,457 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:16,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:16,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:16,827 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-23 15:34:16,827 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:16,828 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-07-23 15:34:16,828 INFO L450 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-07-23 15:34:16,828 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-07-23 15:34:16,829 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=530, Invalid=592, Unknown=0, NotChecked=0, Total=1122 [2018-07-23 15:34:16,830 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 34 states. [2018-07-23 15:34:16,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:16,984 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-07-23 15:34:16,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-23 15:34:16,985 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 124 [2018-07-23 15:34:16,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:16,986 INFO L225 Difference]: With dead ends: 131 [2018-07-23 15:34:16,986 INFO L226 Difference]: Without dead ends: 130 [2018-07-23 15:34:16,987 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=530, Invalid=592, Unknown=0, NotChecked=0, Total=1122 [2018-07-23 15:34:16,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-07-23 15:34:17,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2018-07-23 15:34:17,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-07-23 15:34:17,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-07-23 15:34:17,034 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 124 [2018-07-23 15:34:17,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:17,034 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-07-23 15:34:17,034 INFO L472 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-07-23 15:34:17,035 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-07-23 15:34:17,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-07-23 15:34:17,036 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:17,036 INFO L353 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:17,036 INFO L414 AbstractCegarLoop]: === Iteration 33 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:17,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1720176797, now seen corresponding path program 30 times [2018-07-23 15:34:17,037 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:17,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:17,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:17,396 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-23 15:34:17,396 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:17,397 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-07-23 15:34:17,397 INFO L450 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-07-23 15:34:17,397 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-07-23 15:34:17,398 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=563, Invalid=627, Unknown=0, NotChecked=0, Total=1190 [2018-07-23 15:34:17,402 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 35 states. [2018-07-23 15:34:17,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:17,552 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-07-23 15:34:17,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-23 15:34:17,552 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 128 [2018-07-23 15:34:17,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:17,553 INFO L225 Difference]: With dead ends: 135 [2018-07-23 15:34:17,553 INFO L226 Difference]: Without dead ends: 134 [2018-07-23 15:34:17,555 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=563, Invalid=627, Unknown=0, NotChecked=0, Total=1190 [2018-07-23 15:34:17,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-07-23 15:34:17,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2018-07-23 15:34:17,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-07-23 15:34:17,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-07-23 15:34:17,600 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 128 [2018-07-23 15:34:17,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:17,600 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-07-23 15:34:17,600 INFO L472 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-07-23 15:34:17,601 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-07-23 15:34:17,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-07-23 15:34:17,602 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:17,602 INFO L353 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:17,602 INFO L414 AbstractCegarLoop]: === Iteration 34 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:17,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1168963350, now seen corresponding path program 31 times [2018-07-23 15:34:17,603 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:17,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:17,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:17,960 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-23 15:34:17,961 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:17,961 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-07-23 15:34:17,961 INFO L450 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-07-23 15:34:17,962 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-07-23 15:34:17,962 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=597, Invalid=663, Unknown=0, NotChecked=0, Total=1260 [2018-07-23 15:34:17,963 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 36 states. [2018-07-23 15:34:18,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:18,095 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-07-23 15:34:18,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-23 15:34:18,095 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 132 [2018-07-23 15:34:18,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:18,096 INFO L225 Difference]: With dead ends: 139 [2018-07-23 15:34:18,097 INFO L226 Difference]: Without dead ends: 138 [2018-07-23 15:34:18,098 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=597, Invalid=663, Unknown=0, NotChecked=0, Total=1260 [2018-07-23 15:34:18,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-07-23 15:34:18,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2018-07-23 15:34:18,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-07-23 15:34:18,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-07-23 15:34:18,145 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 132 [2018-07-23 15:34:18,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:18,146 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-07-23 15:34:18,146 INFO L472 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-07-23 15:34:18,146 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-07-23 15:34:18,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-07-23 15:34:18,147 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:18,147 INFO L353 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:18,148 INFO L414 AbstractCegarLoop]: === Iteration 35 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:18,148 INFO L82 PathProgramCache]: Analyzing trace with hash -678967567, now seen corresponding path program 32 times [2018-07-23 15:34:18,148 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:18,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:18,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:18,554 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-23 15:34:18,555 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:18,555 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-07-23 15:34:18,555 INFO L450 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-07-23 15:34:18,556 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-07-23 15:34:18,556 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=632, Invalid=700, Unknown=0, NotChecked=0, Total=1332 [2018-07-23 15:34:18,557 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 37 states. [2018-07-23 15:34:18,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:18,710 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-07-23 15:34:18,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-07-23 15:34:18,710 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 136 [2018-07-23 15:34:18,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:18,712 INFO L225 Difference]: With dead ends: 143 [2018-07-23 15:34:18,712 INFO L226 Difference]: Without dead ends: 142 [2018-07-23 15:34:18,713 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=632, Invalid=700, Unknown=0, NotChecked=0, Total=1332 [2018-07-23 15:34:18,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-07-23 15:34:18,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2018-07-23 15:34:18,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-07-23 15:34:18,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-07-23 15:34:18,762 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 136 [2018-07-23 15:34:18,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:18,763 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-07-23 15:34:18,763 INFO L472 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-07-23 15:34:18,763 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-07-23 15:34:18,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-07-23 15:34:18,765 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:18,765 INFO L353 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:18,765 INFO L414 AbstractCegarLoop]: === Iteration 36 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:18,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1332729480, now seen corresponding path program 33 times [2018-07-23 15:34:18,765 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:18,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:19,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:19,169 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-23 15:34:19,169 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:19,169 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-07-23 15:34:19,170 INFO L450 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-07-23 15:34:19,170 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-07-23 15:34:19,171 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=668, Invalid=738, Unknown=0, NotChecked=0, Total=1406 [2018-07-23 15:34:19,171 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 38 states. [2018-07-23 15:34:19,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:19,327 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-07-23 15:34:19,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-07-23 15:34:19,328 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 140 [2018-07-23 15:34:19,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:19,329 INFO L225 Difference]: With dead ends: 147 [2018-07-23 15:34:19,329 INFO L226 Difference]: Without dead ends: 146 [2018-07-23 15:34:19,331 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=668, Invalid=738, Unknown=0, NotChecked=0, Total=1406 [2018-07-23 15:34:19,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-07-23 15:34:19,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2018-07-23 15:34:19,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-07-23 15:34:19,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-07-23 15:34:19,391 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 140 [2018-07-23 15:34:19,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:19,392 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-07-23 15:34:19,392 INFO L472 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-07-23 15:34:19,392 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-07-23 15:34:19,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-07-23 15:34:19,394 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:19,394 INFO L353 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:19,395 INFO L414 AbstractCegarLoop]: === Iteration 37 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:19,395 INFO L82 PathProgramCache]: Analyzing trace with hash 839250047, now seen corresponding path program 34 times [2018-07-23 15:34:19,395 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:19,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:19,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:19,885 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-23 15:34:19,885 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:19,885 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-07-23 15:34:19,886 INFO L450 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-07-23 15:34:19,887 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-07-23 15:34:19,888 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=705, Invalid=777, Unknown=0, NotChecked=0, Total=1482 [2018-07-23 15:34:19,888 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 39 states. [2018-07-23 15:34:20,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:20,056 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-07-23 15:34:20,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-07-23 15:34:20,057 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 144 [2018-07-23 15:34:20,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:20,058 INFO L225 Difference]: With dead ends: 151 [2018-07-23 15:34:20,058 INFO L226 Difference]: Without dead ends: 150 [2018-07-23 15:34:20,059 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=705, Invalid=777, Unknown=0, NotChecked=0, Total=1482 [2018-07-23 15:34:20,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-07-23 15:34:20,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2018-07-23 15:34:20,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-07-23 15:34:20,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-07-23 15:34:20,110 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 144 [2018-07-23 15:34:20,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:20,111 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-07-23 15:34:20,111 INFO L472 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-07-23 15:34:20,111 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-07-23 15:34:20,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-07-23 15:34:20,113 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:20,113 INFO L353 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:20,113 INFO L414 AbstractCegarLoop]: === Iteration 38 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:20,114 INFO L82 PathProgramCache]: Analyzing trace with hash -442311674, now seen corresponding path program 35 times [2018-07-23 15:34:20,115 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:20,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:20,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:20,524 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-23 15:34:20,525 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:20,525 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-07-23 15:34:20,525 INFO L450 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-07-23 15:34:20,526 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-07-23 15:34:20,527 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=743, Invalid=817, Unknown=0, NotChecked=0, Total=1560 [2018-07-23 15:34:20,527 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 40 states. [2018-07-23 15:34:20,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:20,695 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-07-23 15:34:20,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-07-23 15:34:20,695 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 148 [2018-07-23 15:34:20,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:20,697 INFO L225 Difference]: With dead ends: 155 [2018-07-23 15:34:20,697 INFO L226 Difference]: Without dead ends: 154 [2018-07-23 15:34:20,698 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=743, Invalid=817, Unknown=0, NotChecked=0, Total=1560 [2018-07-23 15:34:20,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-07-23 15:34:20,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2018-07-23 15:34:20,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-07-23 15:34:20,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-07-23 15:34:20,751 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 148 [2018-07-23 15:34:20,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:20,752 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-07-23 15:34:20,752 INFO L472 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-07-23 15:34:20,752 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-07-23 15:34:20,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-07-23 15:34:20,754 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:20,754 INFO L353 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:20,754 INFO L414 AbstractCegarLoop]: === Iteration 39 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:20,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1648405517, now seen corresponding path program 36 times [2018-07-23 15:34:20,755 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:20,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:21,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:21,198 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-23 15:34:21,199 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:21,199 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-07-23 15:34:21,199 INFO L450 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-07-23 15:34:21,200 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-07-23 15:34:21,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=782, Invalid=858, Unknown=0, NotChecked=0, Total=1640 [2018-07-23 15:34:21,201 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 41 states. [2018-07-23 15:34:21,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:21,356 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-07-23 15:34:21,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-07-23 15:34:21,357 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 152 [2018-07-23 15:34:21,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:21,358 INFO L225 Difference]: With dead ends: 159 [2018-07-23 15:34:21,358 INFO L226 Difference]: Without dead ends: 158 [2018-07-23 15:34:21,359 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=782, Invalid=858, Unknown=0, NotChecked=0, Total=1640 [2018-07-23 15:34:21,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-07-23 15:34:21,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2018-07-23 15:34:21,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-07-23 15:34:21,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-07-23 15:34:21,416 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 152 [2018-07-23 15:34:21,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:21,417 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-07-23 15:34:21,417 INFO L472 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-07-23 15:34:21,417 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-07-23 15:34:21,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-07-23 15:34:21,418 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:21,418 INFO L353 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:21,419 INFO L414 AbstractCegarLoop]: === Iteration 40 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:21,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1143398252, now seen corresponding path program 37 times [2018-07-23 15:34:21,419 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:21,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:21,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:21,851 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-23 15:34:21,852 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:21,852 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-07-23 15:34:21,853 INFO L450 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-07-23 15:34:21,853 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-07-23 15:34:21,854 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=822, Invalid=900, Unknown=0, NotChecked=0, Total=1722 [2018-07-23 15:34:21,854 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 42 states. [2018-07-23 15:34:22,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:22,026 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-07-23 15:34:22,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-07-23 15:34:22,026 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 156 [2018-07-23 15:34:22,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:22,028 INFO L225 Difference]: With dead ends: 163 [2018-07-23 15:34:22,028 INFO L226 Difference]: Without dead ends: 162 [2018-07-23 15:34:22,029 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=822, Invalid=900, Unknown=0, NotChecked=0, Total=1722 [2018-07-23 15:34:22,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-07-23 15:34:22,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2018-07-23 15:34:22,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-07-23 15:34:22,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-07-23 15:34:22,088 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 156 [2018-07-23 15:34:22,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:22,089 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-07-23 15:34:22,089 INFO L472 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-07-23 15:34:22,089 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-07-23 15:34:22,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-07-23 15:34:22,091 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:22,091 INFO L353 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:22,091 INFO L414 AbstractCegarLoop]: === Iteration 41 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:22,091 INFO L82 PathProgramCache]: Analyzing trace with hash -209323621, now seen corresponding path program 38 times [2018-07-23 15:34:22,091 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:22,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:22,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:22,571 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-23 15:34:22,571 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:22,571 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-07-23 15:34:22,572 INFO L450 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-07-23 15:34:22,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-07-23 15:34:22,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=863, Invalid=943, Unknown=0, NotChecked=0, Total=1806 [2018-07-23 15:34:22,573 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 43 states. [2018-07-23 15:34:22,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:22,760 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-07-23 15:34:22,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-07-23 15:34:22,761 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 160 [2018-07-23 15:34:22,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:22,762 INFO L225 Difference]: With dead ends: 167 [2018-07-23 15:34:22,762 INFO L226 Difference]: Without dead ends: 166 [2018-07-23 15:34:22,764 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=863, Invalid=943, Unknown=0, NotChecked=0, Total=1806 [2018-07-23 15:34:22,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-07-23 15:34:22,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2018-07-23 15:34:22,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-07-23 15:34:22,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-07-23 15:34:22,829 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 160 [2018-07-23 15:34:22,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:22,830 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-07-23 15:34:22,830 INFO L472 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-07-23 15:34:22,830 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-07-23 15:34:22,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-07-23 15:34:22,832 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:22,832 INFO L353 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:22,832 INFO L414 AbstractCegarLoop]: === Iteration 42 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:22,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1736505122, now seen corresponding path program 39 times [2018-07-23 15:34:22,833 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:22,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:23,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:23,273 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-23 15:34:23,274 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:23,274 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-07-23 15:34:23,274 INFO L450 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-07-23 15:34:23,275 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-07-23 15:34:23,276 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=905, Invalid=987, Unknown=0, NotChecked=0, Total=1892 [2018-07-23 15:34:23,276 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 44 states. [2018-07-23 15:34:23,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:23,466 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-07-23 15:34:23,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-07-23 15:34:23,467 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 164 [2018-07-23 15:34:23,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:23,468 INFO L225 Difference]: With dead ends: 171 [2018-07-23 15:34:23,468 INFO L226 Difference]: Without dead ends: 170 [2018-07-23 15:34:23,469 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=905, Invalid=987, Unknown=0, NotChecked=0, Total=1892 [2018-07-23 15:34:23,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-07-23 15:34:23,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2018-07-23 15:34:23,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-07-23 15:34:23,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2018-07-23 15:34:23,528 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 164 [2018-07-23 15:34:23,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:23,529 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2018-07-23 15:34:23,529 INFO L472 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-07-23 15:34:23,529 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2018-07-23 15:34:23,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-07-23 15:34:23,531 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:23,531 INFO L353 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:23,531 INFO L414 AbstractCegarLoop]: === Iteration 43 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:23,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1126422825, now seen corresponding path program 40 times [2018-07-23 15:34:23,532 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:23,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:23,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:24,016 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-23 15:34:24,016 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:24,017 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-07-23 15:34:24,017 INFO L450 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-07-23 15:34:24,018 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-07-23 15:34:24,018 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=948, Invalid=1032, Unknown=0, NotChecked=0, Total=1980 [2018-07-23 15:34:24,019 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 45 states. [2018-07-23 15:34:24,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:24,228 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-07-23 15:34:24,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-07-23 15:34:24,228 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 168 [2018-07-23 15:34:24,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:24,230 INFO L225 Difference]: With dead ends: 175 [2018-07-23 15:34:24,230 INFO L226 Difference]: Without dead ends: 174 [2018-07-23 15:34:24,232 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=948, Invalid=1032, Unknown=0, NotChecked=0, Total=1980 [2018-07-23 15:34:24,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-07-23 15:34:24,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2018-07-23 15:34:24,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-07-23 15:34:24,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-07-23 15:34:24,296 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 168 [2018-07-23 15:34:24,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:24,297 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-07-23 15:34:24,297 INFO L472 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-07-23 15:34:24,297 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-07-23 15:34:24,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-07-23 15:34:24,299 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:24,299 INFO L353 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:24,299 INFO L414 AbstractCegarLoop]: === Iteration 44 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:24,300 INFO L82 PathProgramCache]: Analyzing trace with hash -286761040, now seen corresponding path program 41 times [2018-07-23 15:34:24,300 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:24,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:24,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:24,800 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-23 15:34:24,800 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:24,801 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-07-23 15:34:24,801 INFO L450 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-07-23 15:34:24,802 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-07-23 15:34:24,803 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=992, Invalid=1078, Unknown=0, NotChecked=0, Total=2070 [2018-07-23 15:34:24,803 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 46 states. [2018-07-23 15:34:25,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:25,022 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-07-23 15:34:25,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-07-23 15:34:25,022 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 172 [2018-07-23 15:34:25,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:25,024 INFO L225 Difference]: With dead ends: 179 [2018-07-23 15:34:25,024 INFO L226 Difference]: Without dead ends: 178 [2018-07-23 15:34:25,025 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=992, Invalid=1078, Unknown=0, NotChecked=0, Total=2070 [2018-07-23 15:34:25,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-07-23 15:34:25,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2018-07-23 15:34:25,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-07-23 15:34:25,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-07-23 15:34:25,095 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 172 [2018-07-23 15:34:25,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:25,096 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-07-23 15:34:25,096 INFO L472 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-07-23 15:34:25,096 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-07-23 15:34:25,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-07-23 15:34:25,098 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:25,098 INFO L353 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:25,099 INFO L414 AbstractCegarLoop]: === Iteration 45 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:25,099 INFO L82 PathProgramCache]: Analyzing trace with hash -2140648777, now seen corresponding path program 42 times [2018-07-23 15:34:25,099 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:25,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:25,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:25,784 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-23 15:34:25,784 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:25,785 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-07-23 15:34:25,785 INFO L450 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-07-23 15:34:25,785 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-07-23 15:34:25,786 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1037, Invalid=1125, Unknown=0, NotChecked=0, Total=2162 [2018-07-23 15:34:25,786 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 47 states. [2018-07-23 15:34:25,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:25,998 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-07-23 15:34:25,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-07-23 15:34:25,998 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 176 [2018-07-23 15:34:25,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:26,000 INFO L225 Difference]: With dead ends: 183 [2018-07-23 15:34:26,000 INFO L226 Difference]: Without dead ends: 182 [2018-07-23 15:34:26,001 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1037, Invalid=1125, Unknown=0, NotChecked=0, Total=2162 [2018-07-23 15:34:26,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-07-23 15:34:26,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2018-07-23 15:34:26,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-07-23 15:34:26,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-07-23 15:34:26,079 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 176 [2018-07-23 15:34:26,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:26,079 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-07-23 15:34:26,079 INFO L472 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-07-23 15:34:26,079 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-07-23 15:34:26,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-07-23 15:34:26,082 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:26,082 INFO L353 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:26,082 INFO L414 AbstractCegarLoop]: === Iteration 46 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:26,082 INFO L82 PathProgramCache]: Analyzing trace with hash 710761022, now seen corresponding path program 43 times [2018-07-23 15:34:26,082 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:26,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:26,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:26,601 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-23 15:34:26,601 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:26,601 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-07-23 15:34:26,602 INFO L450 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-07-23 15:34:26,602 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-07-23 15:34:26,602 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1083, Invalid=1173, Unknown=0, NotChecked=0, Total=2256 [2018-07-23 15:34:26,603 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 48 states. [2018-07-23 15:34:26,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:26,804 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2018-07-23 15:34:26,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-07-23 15:34:26,804 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 180 [2018-07-23 15:34:26,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:26,806 INFO L225 Difference]: With dead ends: 187 [2018-07-23 15:34:26,806 INFO L226 Difference]: Without dead ends: 186 [2018-07-23 15:34:26,807 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1083, Invalid=1173, Unknown=0, NotChecked=0, Total=2256 [2018-07-23 15:34:26,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-07-23 15:34:26,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2018-07-23 15:34:26,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-07-23 15:34:26,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-07-23 15:34:26,872 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 180 [2018-07-23 15:34:26,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:26,872 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-07-23 15:34:26,873 INFO L472 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-07-23 15:34:26,873 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-07-23 15:34:26,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-07-23 15:34:26,874 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:26,875 INFO L353 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:26,875 INFO L414 AbstractCegarLoop]: === Iteration 47 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:26,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1398714811, now seen corresponding path program 44 times [2018-07-23 15:34:26,875 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:26,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:27,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:27,436 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-23 15:34:27,436 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:27,439 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-07-23 15:34:27,440 INFO L450 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-07-23 15:34:27,440 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-07-23 15:34:27,441 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1130, Invalid=1222, Unknown=0, NotChecked=0, Total=2352 [2018-07-23 15:34:27,441 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 49 states. [2018-07-23 15:34:27,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:27,650 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-07-23 15:34:27,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-07-23 15:34:27,650 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 184 [2018-07-23 15:34:27,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:27,652 INFO L225 Difference]: With dead ends: 191 [2018-07-23 15:34:27,652 INFO L226 Difference]: Without dead ends: 190 [2018-07-23 15:34:27,655 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1130, Invalid=1222, Unknown=0, NotChecked=0, Total=2352 [2018-07-23 15:34:27,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-07-23 15:34:27,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2018-07-23 15:34:27,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-07-23 15:34:27,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2018-07-23 15:34:27,737 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 184 [2018-07-23 15:34:27,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:27,738 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2018-07-23 15:34:27,738 INFO L472 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-07-23 15:34:27,738 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2018-07-23 15:34:27,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-07-23 15:34:27,740 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:27,740 INFO L353 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:27,741 INFO L414 AbstractCegarLoop]: === Iteration 48 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:27,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1003624756, now seen corresponding path program 45 times [2018-07-23 15:34:27,741 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:27,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:28,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:28,337 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-23 15:34:28,338 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:28,338 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-07-23 15:34:28,338 INFO L450 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-07-23 15:34:28,339 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-07-23 15:34:28,339 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1178, Invalid=1272, Unknown=0, NotChecked=0, Total=2450 [2018-07-23 15:34:28,340 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 50 states. [2018-07-23 15:34:28,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:28,587 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-07-23 15:34:28,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-07-23 15:34:28,587 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 188 [2018-07-23 15:34:28,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:28,589 INFO L225 Difference]: With dead ends: 195 [2018-07-23 15:34:28,589 INFO L226 Difference]: Without dead ends: 194 [2018-07-23 15:34:28,592 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1178, Invalid=1272, Unknown=0, NotChecked=0, Total=2450 [2018-07-23 15:34:28,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-07-23 15:34:28,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2018-07-23 15:34:28,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-07-23 15:34:28,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-07-23 15:34:28,672 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 188 [2018-07-23 15:34:28,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:28,673 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-07-23 15:34:28,673 INFO L472 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-07-23 15:34:28,673 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-07-23 15:34:28,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-07-23 15:34:28,675 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:28,675 INFO L353 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:28,675 INFO L414 AbstractCegarLoop]: === Iteration 49 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:28,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1692605485, now seen corresponding path program 46 times [2018-07-23 15:34:28,676 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:28,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:29,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:29,332 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-23 15:34:29,333 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:29,333 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-07-23 15:34:29,333 INFO L450 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-07-23 15:34:29,334 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-07-23 15:34:29,334 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1227, Invalid=1323, Unknown=0, NotChecked=0, Total=2550 [2018-07-23 15:34:29,335 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 51 states. [2018-07-23 15:34:29,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:29,587 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2018-07-23 15:34:29,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-07-23 15:34:29,587 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 192 [2018-07-23 15:34:29,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:29,589 INFO L225 Difference]: With dead ends: 199 [2018-07-23 15:34:29,589 INFO L226 Difference]: Without dead ends: 198 [2018-07-23 15:34:29,590 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1227, Invalid=1323, Unknown=0, NotChecked=0, Total=2550 [2018-07-23 15:34:29,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-07-23 15:34:29,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2018-07-23 15:34:29,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-07-23 15:34:29,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2018-07-23 15:34:29,682 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 192 [2018-07-23 15:34:29,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:29,683 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2018-07-23 15:34:29,683 INFO L472 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-07-23 15:34:29,683 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2018-07-23 15:34:29,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-07-23 15:34:29,686 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:29,686 INFO L353 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:29,686 INFO L414 AbstractCegarLoop]: === Iteration 50 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:29,686 INFO L82 PathProgramCache]: Analyzing trace with hash 950535514, now seen corresponding path program 47 times [2018-07-23 15:34:29,687 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:29,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:30,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:30,288 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-23 15:34:30,288 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:30,288 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-07-23 15:34:30,289 INFO L450 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-07-23 15:34:30,289 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-07-23 15:34:30,290 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1277, Invalid=1375, Unknown=0, NotChecked=0, Total=2652 [2018-07-23 15:34:30,290 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 52 states. [2018-07-23 15:34:30,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:30,533 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2018-07-23 15:34:30,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-07-23 15:34:30,533 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 196 [2018-07-23 15:34:30,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:30,535 INFO L225 Difference]: With dead ends: 203 [2018-07-23 15:34:30,535 INFO L226 Difference]: Without dead ends: 202 [2018-07-23 15:34:30,536 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1277, Invalid=1375, Unknown=0, NotChecked=0, Total=2652 [2018-07-23 15:34:30,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-07-23 15:34:30,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2018-07-23 15:34:30,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-07-23 15:34:30,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-07-23 15:34:30,626 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 196 [2018-07-23 15:34:30,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:30,627 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-07-23 15:34:30,627 INFO L472 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-07-23 15:34:30,627 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-07-23 15:34:30,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-07-23 15:34:30,631 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:30,632 INFO L353 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:30,632 INFO L414 AbstractCegarLoop]: === Iteration 51 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:30,632 INFO L82 PathProgramCache]: Analyzing trace with hash -248968351, now seen corresponding path program 48 times [2018-07-23 15:34:30,632 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:30,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:31,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:31,224 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-23 15:34:31,224 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:31,224 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-07-23 15:34:31,225 INFO L450 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-07-23 15:34:31,225 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-07-23 15:34:31,226 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1328, Invalid=1428, Unknown=0, NotChecked=0, Total=2756 [2018-07-23 15:34:31,226 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 53 states. [2018-07-23 15:34:31,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:31,431 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2018-07-23 15:34:31,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-07-23 15:34:31,431 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 200 [2018-07-23 15:34:31,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:31,433 INFO L225 Difference]: With dead ends: 207 [2018-07-23 15:34:31,433 INFO L226 Difference]: Without dead ends: 206 [2018-07-23 15:34:31,433 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1328, Invalid=1428, Unknown=0, NotChecked=0, Total=2756 [2018-07-23 15:34:31,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-07-23 15:34:31,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2018-07-23 15:34:31,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-07-23 15:34:31,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2018-07-23 15:34:31,514 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 200 [2018-07-23 15:34:31,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:31,514 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2018-07-23 15:34:31,514 INFO L472 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-07-23 15:34:31,514 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2018-07-23 15:34:31,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-07-23 15:34:31,517 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:31,517 INFO L353 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:31,517 INFO L414 AbstractCegarLoop]: === Iteration 52 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:31,517 INFO L82 PathProgramCache]: Analyzing trace with hash -702958104, now seen corresponding path program 49 times [2018-07-23 15:34:31,517 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:31,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:31,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:32,139 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-23 15:34:32,139 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:32,140 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-07-23 15:34:32,140 INFO L450 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-07-23 15:34:32,141 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-07-23 15:34:32,141 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1380, Invalid=1482, Unknown=0, NotChecked=0, Total=2862 [2018-07-23 15:34:32,142 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 54 states. [2018-07-23 15:34:32,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:32,405 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2018-07-23 15:34:32,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-07-23 15:34:32,405 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 204 [2018-07-23 15:34:32,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:32,407 INFO L225 Difference]: With dead ends: 211 [2018-07-23 15:34:32,407 INFO L226 Difference]: Without dead ends: 210 [2018-07-23 15:34:32,408 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1380, Invalid=1482, Unknown=0, NotChecked=0, Total=2862 [2018-07-23 15:34:32,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-07-23 15:34:32,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2018-07-23 15:34:32,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-07-23 15:34:32,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2018-07-23 15:34:32,509 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 204 [2018-07-23 15:34:32,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:32,509 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2018-07-23 15:34:32,509 INFO L472 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-07-23 15:34:32,509 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2018-07-23 15:34:32,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-07-23 15:34:32,512 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:32,512 INFO L353 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:32,512 INFO L414 AbstractCegarLoop]: === Iteration 53 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:32,513 INFO L82 PathProgramCache]: Analyzing trace with hash 638829807, now seen corresponding path program 50 times [2018-07-23 15:34:32,513 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:32,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:33,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:33,141 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-23 15:34:33,141 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:33,141 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-07-23 15:34:33,142 INFO L450 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-07-23 15:34:33,142 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-07-23 15:34:33,143 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1433, Invalid=1537, Unknown=0, NotChecked=0, Total=2970 [2018-07-23 15:34:33,143 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 55 states. [2018-07-23 15:34:33,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:33,346 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2018-07-23 15:34:33,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-07-23 15:34:33,347 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 208 [2018-07-23 15:34:33,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:33,350 INFO L225 Difference]: With dead ends: 215 [2018-07-23 15:34:33,350 INFO L226 Difference]: Without dead ends: 214 [2018-07-23 15:34:33,351 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1433, Invalid=1537, Unknown=0, NotChecked=0, Total=2970 [2018-07-23 15:34:33,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-07-23 15:34:33,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 213. [2018-07-23 15:34:33,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-07-23 15:34:33,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2018-07-23 15:34:33,440 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 208 [2018-07-23 15:34:33,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:33,440 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2018-07-23 15:34:33,440 INFO L472 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-07-23 15:34:33,440 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2018-07-23 15:34:33,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-07-23 15:34:33,442 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:33,442 INFO L353 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:33,442 INFO L414 AbstractCegarLoop]: === Iteration 54 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:33,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1127155594, now seen corresponding path program 51 times [2018-07-23 15:34:33,443 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:33,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:33,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:34,070 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-23 15:34:34,071 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:34,071 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-07-23 15:34:34,071 INFO L450 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-07-23 15:34:34,072 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-07-23 15:34:34,072 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1487, Invalid=1593, Unknown=0, NotChecked=0, Total=3080 [2018-07-23 15:34:34,072 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 56 states. [2018-07-23 15:34:34,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:34,292 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2018-07-23 15:34:34,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-07-23 15:34:34,292 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 212 [2018-07-23 15:34:34,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:34,294 INFO L225 Difference]: With dead ends: 219 [2018-07-23 15:34:34,294 INFO L226 Difference]: Without dead ends: 218 [2018-07-23 15:34:34,295 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1487, Invalid=1593, Unknown=0, NotChecked=0, Total=3080 [2018-07-23 15:34:34,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-07-23 15:34:34,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2018-07-23 15:34:34,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-07-23 15:34:34,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2018-07-23 15:34:34,374 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 212 [2018-07-23 15:34:34,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:34,375 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2018-07-23 15:34:34,375 INFO L472 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-07-23 15:34:34,375 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2018-07-23 15:34:34,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-07-23 15:34:34,376 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:34,376 INFO L353 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:34,376 INFO L414 AbstractCegarLoop]: === Iteration 55 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:34,377 INFO L82 PathProgramCache]: Analyzing trace with hash -2094329731, now seen corresponding path program 52 times [2018-07-23 15:34:34,377 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:34,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:34,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:34,980 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-23 15:34:34,980 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:34,980 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-07-23 15:34:34,981 INFO L450 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-07-23 15:34:34,981 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-07-23 15:34:34,982 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1542, Invalid=1650, Unknown=0, NotChecked=0, Total=3192 [2018-07-23 15:34:34,982 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 57 states. [2018-07-23 15:34:35,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:35,252 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2018-07-23 15:34:35,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-07-23 15:34:35,253 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 216 [2018-07-23 15:34:35,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:35,254 INFO L225 Difference]: With dead ends: 223 [2018-07-23 15:34:35,255 INFO L226 Difference]: Without dead ends: 222 [2018-07-23 15:34:35,255 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1542, Invalid=1650, Unknown=0, NotChecked=0, Total=3192 [2018-07-23 15:34:35,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-07-23 15:34:35,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 221. [2018-07-23 15:34:35,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-07-23 15:34:35,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2018-07-23 15:34:35,363 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 216 [2018-07-23 15:34:35,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:35,363 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2018-07-23 15:34:35,363 INFO L472 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-07-23 15:34:35,363 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2018-07-23 15:34:35,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-07-23 15:34:35,368 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:35,368 INFO L353 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:35,368 INFO L414 AbstractCegarLoop]: === Iteration 56 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:35,368 INFO L82 PathProgramCache]: Analyzing trace with hash -551826172, now seen corresponding path program 53 times [2018-07-23 15:34:35,368 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:35,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:35,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:36,087 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-23 15:34:36,087 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:36,087 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-07-23 15:34:36,088 INFO L450 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-07-23 15:34:36,088 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-07-23 15:34:36,089 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1598, Invalid=1708, Unknown=0, NotChecked=0, Total=3306 [2018-07-23 15:34:36,089 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 58 states. [2018-07-23 15:34:36,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:36,345 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2018-07-23 15:34:36,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-07-23 15:34:36,345 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 220 [2018-07-23 15:34:36,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:36,347 INFO L225 Difference]: With dead ends: 227 [2018-07-23 15:34:36,347 INFO L226 Difference]: Without dead ends: 226 [2018-07-23 15:34:36,348 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1598, Invalid=1708, Unknown=0, NotChecked=0, Total=3306 [2018-07-23 15:34:36,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-07-23 15:34:36,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2018-07-23 15:34:36,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-07-23 15:34:36,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2018-07-23 15:34:36,426 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 220 [2018-07-23 15:34:36,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:36,426 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2018-07-23 15:34:36,426 INFO L472 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-07-23 15:34:36,426 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2018-07-23 15:34:36,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-07-23 15:34:36,428 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:36,428 INFO L353 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:36,428 INFO L414 AbstractCegarLoop]: === Iteration 57 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:36,428 INFO L82 PathProgramCache]: Analyzing trace with hash 599584267, now seen corresponding path program 54 times [2018-07-23 15:34:36,428 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:36,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:36,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:36,884 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-23 15:34:36,885 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:36,885 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-07-23 15:34:36,885 INFO L450 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-07-23 15:34:36,885 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-07-23 15:34:36,886 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1655, Invalid=1767, Unknown=0, NotChecked=0, Total=3422 [2018-07-23 15:34:36,886 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 59 states. [2018-07-23 15:34:37,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:37,147 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2018-07-23 15:34:37,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-07-23 15:34:37,147 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 224 [2018-07-23 15:34:37,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:37,149 INFO L225 Difference]: With dead ends: 231 [2018-07-23 15:34:37,149 INFO L226 Difference]: Without dead ends: 230 [2018-07-23 15:34:37,150 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1655, Invalid=1767, Unknown=0, NotChecked=0, Total=3422 [2018-07-23 15:34:37,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-07-23 15:34:37,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2018-07-23 15:34:37,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-07-23 15:34:37,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2018-07-23 15:34:37,225 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 224 [2018-07-23 15:34:37,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:37,225 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2018-07-23 15:34:37,226 INFO L472 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-07-23 15:34:37,226 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2018-07-23 15:34:37,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-07-23 15:34:37,227 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:37,227 INFO L353 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:37,228 INFO L414 AbstractCegarLoop]: === Iteration 58 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:37,228 INFO L82 PathProgramCache]: Analyzing trace with hash 21509010, now seen corresponding path program 55 times [2018-07-23 15:34:37,228 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:37,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:37,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:37,710 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-23 15:34:37,710 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:37,710 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-07-23 15:34:37,711 INFO L450 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-07-23 15:34:37,711 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-07-23 15:34:37,712 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1713, Invalid=1827, Unknown=0, NotChecked=0, Total=3540 [2018-07-23 15:34:37,712 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 60 states. [2018-07-23 15:34:37,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:37,909 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2018-07-23 15:34:37,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-07-23 15:34:37,909 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 228 [2018-07-23 15:34:37,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:37,911 INFO L225 Difference]: With dead ends: 235 [2018-07-23 15:34:37,911 INFO L226 Difference]: Without dead ends: 234 [2018-07-23 15:34:37,912 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1713, Invalid=1827, Unknown=0, NotChecked=0, Total=3540 [2018-07-23 15:34:37,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-07-23 15:34:38,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2018-07-23 15:34:38,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-07-23 15:34:38,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2018-07-23 15:34:38,014 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 228 [2018-07-23 15:34:38,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:38,015 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2018-07-23 15:34:38,015 INFO L472 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-07-23 15:34:38,015 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2018-07-23 15:34:38,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-07-23 15:34:38,016 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:38,017 INFO L353 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:38,017 INFO L414 AbstractCegarLoop]: === Iteration 59 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:38,017 INFO L82 PathProgramCache]: Analyzing trace with hash -183018087, now seen corresponding path program 56 times [2018-07-23 15:34:38,017 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:38,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:38,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:38,625 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-23 15:34:38,625 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:38,625 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-07-23 15:34:38,626 INFO L450 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-07-23 15:34:38,627 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-07-23 15:34:38,627 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1772, Invalid=1888, Unknown=0, NotChecked=0, Total=3660 [2018-07-23 15:34:38,627 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 61 states. [2018-07-23 15:34:38,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:38,892 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2018-07-23 15:34:38,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-07-23 15:34:38,892 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 232 [2018-07-23 15:34:38,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:38,894 INFO L225 Difference]: With dead ends: 239 [2018-07-23 15:34:38,894 INFO L226 Difference]: Without dead ends: 238 [2018-07-23 15:34:38,894 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1772, Invalid=1888, Unknown=0, NotChecked=0, Total=3660 [2018-07-23 15:34:38,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-07-23 15:34:38,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 237. [2018-07-23 15:34:38,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-07-23 15:34:38,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2018-07-23 15:34:38,960 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 232 [2018-07-23 15:34:38,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:38,961 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2018-07-23 15:34:38,961 INFO L472 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-07-23 15:34:38,961 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2018-07-23 15:34:38,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-07-23 15:34:38,962 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:38,963 INFO L353 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:38,963 INFO L414 AbstractCegarLoop]: === Iteration 60 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:38,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1180423136, now seen corresponding path program 57 times [2018-07-23 15:34:38,963 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:39,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:39,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:39,482 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-23 15:34:39,483 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:39,483 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-07-23 15:34:39,483 INFO L450 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-07-23 15:34:39,484 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-07-23 15:34:39,484 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1832, Invalid=1950, Unknown=0, NotChecked=0, Total=3782 [2018-07-23 15:34:39,485 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 62 states. [2018-07-23 15:34:39,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:39,776 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2018-07-23 15:34:39,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-07-23 15:34:39,776 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 236 [2018-07-23 15:34:39,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:39,778 INFO L225 Difference]: With dead ends: 243 [2018-07-23 15:34:39,778 INFO L226 Difference]: Without dead ends: 242 [2018-07-23 15:34:39,778 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1832, Invalid=1950, Unknown=0, NotChecked=0, Total=3782 [2018-07-23 15:34:39,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-07-23 15:34:39,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2018-07-23 15:34:39,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-07-23 15:34:39,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2018-07-23 15:34:39,847 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 236 [2018-07-23 15:34:39,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:39,848 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2018-07-23 15:34:39,848 INFO L472 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-07-23 15:34:39,848 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2018-07-23 15:34:39,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-07-23 15:34:39,849 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:39,850 INFO L353 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:39,850 INFO L414 AbstractCegarLoop]: === Iteration 61 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:39,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1232576729, now seen corresponding path program 58 times [2018-07-23 15:34:39,850 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:39,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:40,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:40,402 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-23 15:34:40,402 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:40,402 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-07-23 15:34:40,403 INFO L450 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-07-23 15:34:40,403 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-07-23 15:34:40,403 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1893, Invalid=2013, Unknown=0, NotChecked=0, Total=3906 [2018-07-23 15:34:40,403 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 63 states. [2018-07-23 15:34:40,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:40,652 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2018-07-23 15:34:40,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-07-23 15:34:40,653 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 240 [2018-07-23 15:34:40,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:40,654 INFO L225 Difference]: With dead ends: 247 [2018-07-23 15:34:40,655 INFO L226 Difference]: Without dead ends: 246 [2018-07-23 15:34:40,655 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1893, Invalid=2013, Unknown=0, NotChecked=0, Total=3906 [2018-07-23 15:34:40,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-07-23 15:34:40,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 245. [2018-07-23 15:34:40,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-07-23 15:34:40,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2018-07-23 15:34:40,739 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 240 [2018-07-23 15:34:40,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:40,739 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2018-07-23 15:34:40,739 INFO L472 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-07-23 15:34:40,740 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2018-07-23 15:34:40,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-07-23 15:34:40,741 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:40,741 INFO L353 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:40,742 INFO L414 AbstractCegarLoop]: === Iteration 62 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:40,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1887286958, now seen corresponding path program 59 times [2018-07-23 15:34:40,742 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:40,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:41,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:41,318 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-23 15:34:41,318 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:41,318 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-07-23 15:34:41,319 INFO L450 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-07-23 15:34:41,319 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-07-23 15:34:41,320 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1955, Invalid=2077, Unknown=0, NotChecked=0, Total=4032 [2018-07-23 15:34:41,320 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 64 states. [2018-07-23 15:34:41,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:41,595 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2018-07-23 15:34:41,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-07-23 15:34:41,595 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 244 [2018-07-23 15:34:41,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:41,597 INFO L225 Difference]: With dead ends: 251 [2018-07-23 15:34:41,597 INFO L226 Difference]: Without dead ends: 250 [2018-07-23 15:34:41,598 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1955, Invalid=2077, Unknown=0, NotChecked=0, Total=4032 [2018-07-23 15:34:41,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-07-23 15:34:41,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2018-07-23 15:34:41,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-07-23 15:34:41,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2018-07-23 15:34:41,735 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 244 [2018-07-23 15:34:41,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:41,736 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2018-07-23 15:34:41,736 INFO L472 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-07-23 15:34:41,736 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2018-07-23 15:34:41,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-07-23 15:34:41,737 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:41,738 INFO L353 BasicCegarLoop]: trace histogram [61, 61, 60, 60, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:41,738 INFO L414 AbstractCegarLoop]: === Iteration 63 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:41,738 INFO L82 PathProgramCache]: Analyzing trace with hash -111283531, now seen corresponding path program 60 times [2018-07-23 15:34:41,738 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:41,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:42,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:42,643 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-23 15:34:42,643 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:42,644 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-07-23 15:34:42,644 INFO L450 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-07-23 15:34:42,645 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-07-23 15:34:42,645 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2018, Invalid=2142, Unknown=0, NotChecked=0, Total=4160 [2018-07-23 15:34:42,646 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 65 states. [2018-07-23 15:34:42,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:42,924 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2018-07-23 15:34:42,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-07-23 15:34:42,924 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 248 [2018-07-23 15:34:42,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:42,926 INFO L225 Difference]: With dead ends: 255 [2018-07-23 15:34:42,926 INFO L226 Difference]: Without dead ends: 254 [2018-07-23 15:34:42,927 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=2018, Invalid=2142, Unknown=0, NotChecked=0, Total=4160 [2018-07-23 15:34:42,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-07-23 15:34:43,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 253. [2018-07-23 15:34:43,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-07-23 15:34:43,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2018-07-23 15:34:43,037 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 248 [2018-07-23 15:34:43,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:43,038 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2018-07-23 15:34:43,038 INFO L472 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-07-23 15:34:43,038 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2018-07-23 15:34:43,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-07-23 15:34:43,040 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:43,040 INFO L353 BasicCegarLoop]: trace histogram [62, 62, 61, 61, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:43,040 INFO L414 AbstractCegarLoop]: === Iteration 64 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:43,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1612895036, now seen corresponding path program 61 times [2018-07-23 15:34:43,040 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:43,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:43,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:43,620 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-23 15:34:43,621 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:43,621 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-07-23 15:34:43,621 INFO L450 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-07-23 15:34:43,622 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-07-23 15:34:43,622 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2082, Invalid=2208, Unknown=0, NotChecked=0, Total=4290 [2018-07-23 15:34:43,623 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 66 states. [2018-07-23 15:34:43,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:43,897 INFO L93 Difference]: Finished difference Result 259 states and 259 transitions. [2018-07-23 15:34:43,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-07-23 15:34:43,897 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 252 [2018-07-23 15:34:43,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:43,899 INFO L225 Difference]: With dead ends: 259 [2018-07-23 15:34:43,899 INFO L226 Difference]: Without dead ends: 258 [2018-07-23 15:34:43,900 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2082, Invalid=2208, Unknown=0, NotChecked=0, Total=4290 [2018-07-23 15:34:43,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-07-23 15:34:44,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2018-07-23 15:34:44,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-07-23 15:34:44,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2018-07-23 15:34:44,026 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 252 [2018-07-23 15:34:44,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:44,027 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2018-07-23 15:34:44,027 INFO L472 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-07-23 15:34:44,027 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2018-07-23 15:34:44,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-07-23 15:34:44,029 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:44,029 INFO L353 BasicCegarLoop]: trace histogram [63, 63, 62, 62, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:44,029 INFO L414 AbstractCegarLoop]: === Iteration 65 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:44,029 INFO L82 PathProgramCache]: Analyzing trace with hash 551950403, now seen corresponding path program 62 times [2018-07-23 15:34:44,029 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:44,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:44,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:44,663 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-23 15:34:44,663 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:44,663 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-07-23 15:34:44,664 INFO L450 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-07-23 15:34:44,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-07-23 15:34:44,665 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2147, Invalid=2275, Unknown=0, NotChecked=0, Total=4422 [2018-07-23 15:34:44,665 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 67 states. [2018-07-23 15:34:44,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:44,969 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions. [2018-07-23 15:34:44,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-07-23 15:34:44,969 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 256 [2018-07-23 15:34:44,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:44,971 INFO L225 Difference]: With dead ends: 263 [2018-07-23 15:34:44,971 INFO L226 Difference]: Without dead ends: 262 [2018-07-23 15:34:44,972 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=2147, Invalid=2275, Unknown=0, NotChecked=0, Total=4422 [2018-07-23 15:34:44,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-07-23 15:34:45,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 261. [2018-07-23 15:34:45,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-07-23 15:34:45,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2018-07-23 15:34:45,090 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 256 [2018-07-23 15:34:45,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:45,091 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2018-07-23 15:34:45,091 INFO L472 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-07-23 15:34:45,091 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2018-07-23 15:34:45,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-07-23 15:34:45,093 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:45,093 INFO L353 BasicCegarLoop]: trace histogram [64, 64, 63, 63, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:45,094 INFO L414 AbstractCegarLoop]: === Iteration 66 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:45,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1797160502, now seen corresponding path program 63 times [2018-07-23 15:34:45,094 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:45,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:45,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:45,840 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-23 15:34:45,840 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:45,840 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-07-23 15:34:45,841 INFO L450 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-07-23 15:34:45,841 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-07-23 15:34:45,842 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2213, Invalid=2343, Unknown=0, NotChecked=0, Total=4556 [2018-07-23 15:34:45,842 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 68 states. [2018-07-23 15:34:46,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:46,059 INFO L93 Difference]: Finished difference Result 267 states and 267 transitions. [2018-07-23 15:34:46,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-07-23 15:34:46,060 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 260 [2018-07-23 15:34:46,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:46,061 INFO L225 Difference]: With dead ends: 267 [2018-07-23 15:34:46,061 INFO L226 Difference]: Without dead ends: 266 [2018-07-23 15:34:46,062 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=2213, Invalid=2343, Unknown=0, NotChecked=0, Total=4556 [2018-07-23 15:34:46,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-07-23 15:34:46,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2018-07-23 15:34:46,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-07-23 15:34:46,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2018-07-23 15:34:46,157 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 260 [2018-07-23 15:34:46,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:46,158 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2018-07-23 15:34:46,158 INFO L472 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-07-23 15:34:46,158 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2018-07-23 15:34:46,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-07-23 15:34:46,159 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:46,159 INFO L353 BasicCegarLoop]: trace histogram [65, 65, 64, 64, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:46,159 INFO L414 AbstractCegarLoop]: === Iteration 67 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:46,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1651429329, now seen corresponding path program 64 times [2018-07-23 15:34:46,159 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:46,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:46,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:46,853 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-23 15:34:46,854 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:46,854 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-07-23 15:34:46,854 INFO L450 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-07-23 15:34:46,854 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-07-23 15:34:46,855 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2280, Invalid=2412, Unknown=0, NotChecked=0, Total=4692 [2018-07-23 15:34:46,855 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 69 states. [2018-07-23 15:34:47,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:47,065 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions. [2018-07-23 15:34:47,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-07-23 15:34:47,065 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 264 [2018-07-23 15:34:47,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:47,067 INFO L225 Difference]: With dead ends: 271 [2018-07-23 15:34:47,067 INFO L226 Difference]: Without dead ends: 270 [2018-07-23 15:34:47,067 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=2280, Invalid=2412, Unknown=0, NotChecked=0, Total=4692 [2018-07-23 15:34:47,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-07-23 15:34:47,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 269. [2018-07-23 15:34:47,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-07-23 15:34:47,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 269 transitions. [2018-07-23 15:34:47,181 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 269 transitions. Word has length 264 [2018-07-23 15:34:47,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:47,181 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 269 transitions. [2018-07-23 15:34:47,181 INFO L472 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-07-23 15:34:47,181 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 269 transitions. [2018-07-23 15:34:47,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-07-23 15:34:47,182 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:47,182 INFO L353 BasicCegarLoop]: trace histogram [66, 66, 65, 65, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:47,183 INFO L414 AbstractCegarLoop]: === Iteration 68 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:47,183 INFO L82 PathProgramCache]: Analyzing trace with hash -318258600, now seen corresponding path program 65 times [2018-07-23 15:34:47,183 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:47,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:47,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:47,940 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-23 15:34:47,940 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:47,940 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-07-23 15:34:47,941 INFO L450 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-07-23 15:34:47,941 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-07-23 15:34:47,941 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2348, Invalid=2482, Unknown=0, NotChecked=0, Total=4830 [2018-07-23 15:34:47,942 INFO L87 Difference]: Start difference. First operand 269 states and 269 transitions. Second operand 70 states. [2018-07-23 15:34:48,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:48,205 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2018-07-23 15:34:48,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-07-23 15:34:48,205 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 268 [2018-07-23 15:34:48,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:48,206 INFO L225 Difference]: With dead ends: 275 [2018-07-23 15:34:48,206 INFO L226 Difference]: Without dead ends: 274 [2018-07-23 15:34:48,207 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=2348, Invalid=2482, Unknown=0, NotChecked=0, Total=4830 [2018-07-23 15:34:48,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-07-23 15:34:48,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 273. [2018-07-23 15:34:48,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-07-23 15:34:48,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2018-07-23 15:34:48,361 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 268 [2018-07-23 15:34:48,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:48,362 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2018-07-23 15:34:48,362 INFO L472 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-07-23 15:34:48,362 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2018-07-23 15:34:48,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-07-23 15:34:48,364 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:48,364 INFO L353 BasicCegarLoop]: trace histogram [67, 67, 66, 66, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:48,364 INFO L414 AbstractCegarLoop]: === Iteration 69 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:48,365 INFO L82 PathProgramCache]: Analyzing trace with hash -985261729, now seen corresponding path program 66 times [2018-07-23 15:34:48,365 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:48,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:49,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:49,329 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-23 15:34:49,329 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:49,329 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-07-23 15:34:49,330 INFO L450 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-07-23 15:34:49,330 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-07-23 15:34:49,330 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2417, Invalid=2553, Unknown=0, NotChecked=0, Total=4970 [2018-07-23 15:34:49,331 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 71 states. [2018-07-23 15:34:49,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:49,658 INFO L93 Difference]: Finished difference Result 279 states and 279 transitions. [2018-07-23 15:34:49,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-07-23 15:34:49,659 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 272 [2018-07-23 15:34:49,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:49,660 INFO L225 Difference]: With dead ends: 279 [2018-07-23 15:34:49,660 INFO L226 Difference]: Without dead ends: 278 [2018-07-23 15:34:49,661 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=2417, Invalid=2553, Unknown=0, NotChecked=0, Total=4970 [2018-07-23 15:34:49,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-07-23 15:34:49,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 277. [2018-07-23 15:34:49,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-07-23 15:34:49,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2018-07-23 15:34:49,758 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 272 [2018-07-23 15:34:49,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:49,759 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2018-07-23 15:34:49,759 INFO L472 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-07-23 15:34:49,759 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2018-07-23 15:34:49,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-07-23 15:34:49,761 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:49,761 INFO L353 BasicCegarLoop]: trace histogram [68, 68, 67, 67, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:49,761 INFO L414 AbstractCegarLoop]: === Iteration 70 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:49,761 INFO L82 PathProgramCache]: Analyzing trace with hash 417567974, now seen corresponding path program 67 times [2018-07-23 15:34:49,762 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:49,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:50,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:50,608 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-23 15:34:50,609 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:50,609 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-07-23 15:34:50,609 INFO L450 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-07-23 15:34:50,610 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-07-23 15:34:50,610 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2487, Invalid=2625, Unknown=0, NotChecked=0, Total=5112 [2018-07-23 15:34:50,610 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 72 states. [2018-07-23 15:34:50,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:50,907 INFO L93 Difference]: Finished difference Result 283 states and 283 transitions. [2018-07-23 15:34:50,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-07-23 15:34:50,908 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 276 [2018-07-23 15:34:50,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:50,909 INFO L225 Difference]: With dead ends: 283 [2018-07-23 15:34:50,909 INFO L226 Difference]: Without dead ends: 282 [2018-07-23 15:34:50,910 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=2487, Invalid=2625, Unknown=0, NotChecked=0, Total=5112 [2018-07-23 15:34:50,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-07-23 15:34:51,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 281. [2018-07-23 15:34:51,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-07-23 15:34:51,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2018-07-23 15:34:51,007 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 276 [2018-07-23 15:34:51,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:51,007 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2018-07-23 15:34:51,007 INFO L472 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-07-23 15:34:51,007 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2018-07-23 15:34:51,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-07-23 15:34:51,009 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:51,009 INFO L353 BasicCegarLoop]: trace histogram [69, 69, 68, 68, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:51,009 INFO L414 AbstractCegarLoop]: === Iteration 71 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:51,009 INFO L82 PathProgramCache]: Analyzing trace with hash 582612205, now seen corresponding path program 68 times [2018-07-23 15:34:51,010 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:51,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:51,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:51,804 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-23 15:34:51,804 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:51,805 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-07-23 15:34:51,805 INFO L450 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-07-23 15:34:51,806 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-07-23 15:34:51,806 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2558, Invalid=2698, Unknown=0, NotChecked=0, Total=5256 [2018-07-23 15:34:51,806 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 73 states. [2018-07-23 15:34:52,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:52,168 INFO L93 Difference]: Finished difference Result 287 states and 287 transitions. [2018-07-23 15:34:52,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-07-23 15:34:52,168 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 280 [2018-07-23 15:34:52,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:52,169 INFO L225 Difference]: With dead ends: 287 [2018-07-23 15:34:52,170 INFO L226 Difference]: Without dead ends: 286 [2018-07-23 15:34:52,170 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=2558, Invalid=2698, Unknown=0, NotChecked=0, Total=5256 [2018-07-23 15:34:52,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-07-23 15:34:52,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 285. [2018-07-23 15:34:52,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-07-23 15:34:52,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 285 transitions. [2018-07-23 15:34:52,288 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 285 transitions. Word has length 280 [2018-07-23 15:34:52,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:52,288 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 285 transitions. [2018-07-23 15:34:52,288 INFO L472 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-07-23 15:34:52,289 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 285 transitions. [2018-07-23 15:34:52,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-07-23 15:34:52,290 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:52,290 INFO L353 BasicCegarLoop]: trace histogram [70, 70, 69, 69, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:52,290 INFO L414 AbstractCegarLoop]: === Iteration 72 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:52,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1698498188, now seen corresponding path program 69 times [2018-07-23 15:34:52,290 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:52,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:52,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:52,974 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-23 15:34:52,974 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:52,974 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-07-23 15:34:52,975 INFO L450 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-07-23 15:34:52,975 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-07-23 15:34:52,976 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2630, Invalid=2772, Unknown=0, NotChecked=0, Total=5402 [2018-07-23 15:34:52,976 INFO L87 Difference]: Start difference. First operand 285 states and 285 transitions. Second operand 74 states. [2018-07-23 15:34:53,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:53,247 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2018-07-23 15:34:53,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-07-23 15:34:53,248 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 284 [2018-07-23 15:34:53,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:53,249 INFO L225 Difference]: With dead ends: 291 [2018-07-23 15:34:53,249 INFO L226 Difference]: Without dead ends: 290 [2018-07-23 15:34:53,250 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=2630, Invalid=2772, Unknown=0, NotChecked=0, Total=5402 [2018-07-23 15:34:53,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-07-23 15:34:53,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 289. [2018-07-23 15:34:53,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-07-23 15:34:53,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 289 transitions. [2018-07-23 15:34:53,357 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 289 transitions. Word has length 284 [2018-07-23 15:34:53,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:53,358 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 289 transitions. [2018-07-23 15:34:53,358 INFO L472 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-07-23 15:34:53,358 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 289 transitions. [2018-07-23 15:34:53,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-07-23 15:34:53,360 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:53,360 INFO L353 BasicCegarLoop]: trace histogram [71, 71, 70, 70, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:53,360 INFO L414 AbstractCegarLoop]: === Iteration 73 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:53,360 INFO L82 PathProgramCache]: Analyzing trace with hash 639132283, now seen corresponding path program 70 times [2018-07-23 15:34:53,360 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:53,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:53,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:54,146 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-23 15:34:54,146 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:54,146 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-07-23 15:34:54,147 INFO L450 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-07-23 15:34:54,147 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-07-23 15:34:54,147 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2703, Invalid=2847, Unknown=0, NotChecked=0, Total=5550 [2018-07-23 15:34:54,148 INFO L87 Difference]: Start difference. First operand 289 states and 289 transitions. Second operand 75 states. [2018-07-23 15:34:54,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:54,401 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2018-07-23 15:34:54,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-07-23 15:34:54,402 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 288 [2018-07-23 15:34:54,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:54,403 INFO L225 Difference]: With dead ends: 295 [2018-07-23 15:34:54,404 INFO L226 Difference]: Without dead ends: 294 [2018-07-23 15:34:54,405 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=2703, Invalid=2847, Unknown=0, NotChecked=0, Total=5550 [2018-07-23 15:34:54,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-07-23 15:34:54,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 293. [2018-07-23 15:34:54,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-07-23 15:34:54,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2018-07-23 15:34:54,507 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 288 [2018-07-23 15:34:54,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:54,508 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2018-07-23 15:34:54,508 INFO L472 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-07-23 15:34:54,508 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2018-07-23 15:34:54,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-07-23 15:34:54,509 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:54,509 INFO L353 BasicCegarLoop]: trace histogram [72, 72, 71, 71, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:54,509 INFO L414 AbstractCegarLoop]: === Iteration 74 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:54,509 INFO L82 PathProgramCache]: Analyzing trace with hash -957091838, now seen corresponding path program 71 times [2018-07-23 15:34:54,509 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:54,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:55,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:55,338 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-23 15:34:55,338 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:55,338 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-07-23 15:34:55,338 INFO L450 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-07-23 15:34:55,339 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-07-23 15:34:55,339 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2777, Invalid=2923, Unknown=0, NotChecked=0, Total=5700 [2018-07-23 15:34:55,339 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 76 states. [2018-07-23 15:34:55,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:55,632 INFO L93 Difference]: Finished difference Result 299 states and 299 transitions. [2018-07-23 15:34:55,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-07-23 15:34:55,632 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 292 [2018-07-23 15:34:55,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:55,633 INFO L225 Difference]: With dead ends: 299 [2018-07-23 15:34:55,633 INFO L226 Difference]: Without dead ends: 298 [2018-07-23 15:34:55,634 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=2777, Invalid=2923, Unknown=0, NotChecked=0, Total=5700 [2018-07-23 15:34:55,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-07-23 15:34:55,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 297. [2018-07-23 15:34:55,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-07-23 15:34:55,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2018-07-23 15:34:55,742 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 292 [2018-07-23 15:34:55,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:55,742 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions. [2018-07-23 15:34:55,742 INFO L472 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-07-23 15:34:55,743 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions. [2018-07-23 15:34:55,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-07-23 15:34:55,744 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:55,744 INFO L353 BasicCegarLoop]: trace histogram [73, 73, 72, 72, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:55,744 INFO L414 AbstractCegarLoop]: === Iteration 75 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:55,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1286562313, now seen corresponding path program 72 times [2018-07-23 15:34:55,744 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:55,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:56,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:56,489 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-23 15:34:56,490 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:56,490 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-07-23 15:34:56,490 INFO L450 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-07-23 15:34:56,491 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-07-23 15:34:56,491 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2852, Invalid=3000, Unknown=0, NotChecked=0, Total=5852 [2018-07-23 15:34:56,491 INFO L87 Difference]: Start difference. First operand 297 states and 297 transitions. Second operand 77 states. [2018-07-23 15:34:56,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:56,771 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2018-07-23 15:34:56,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-07-23 15:34:56,771 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 296 [2018-07-23 15:34:56,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:56,773 INFO L225 Difference]: With dead ends: 303 [2018-07-23 15:34:56,773 INFO L226 Difference]: Without dead ends: 302 [2018-07-23 15:34:56,774 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=2852, Invalid=3000, Unknown=0, NotChecked=0, Total=5852 [2018-07-23 15:34:56,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-07-23 15:34:56,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 301. [2018-07-23 15:34:56,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-07-23 15:34:56,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2018-07-23 15:34:56,932 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 296 [2018-07-23 15:34:56,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:56,933 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2018-07-23 15:34:56,933 INFO L472 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-07-23 15:34:56,933 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2018-07-23 15:34:56,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-07-23 15:34:56,935 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:56,935 INFO L353 BasicCegarLoop]: trace histogram [74, 74, 73, 73, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:56,935 INFO L414 AbstractCegarLoop]: === Iteration 76 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:56,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1010534256, now seen corresponding path program 73 times [2018-07-23 15:34:56,935 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:57,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:57,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:57,788 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-23 15:34:57,789 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:57,789 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-07-23 15:34:57,789 INFO L450 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-07-23 15:34:57,790 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-07-23 15:34:57,790 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2928, Invalid=3078, Unknown=0, NotChecked=0, Total=6006 [2018-07-23 15:34:57,791 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 78 states. [2018-07-23 15:34:58,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:58,110 INFO L93 Difference]: Finished difference Result 307 states and 307 transitions. [2018-07-23 15:34:58,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-07-23 15:34:58,110 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 300 [2018-07-23 15:34:58,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:58,112 INFO L225 Difference]: With dead ends: 307 [2018-07-23 15:34:58,112 INFO L226 Difference]: Without dead ends: 306 [2018-07-23 15:34:58,112 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=2928, Invalid=3078, Unknown=0, NotChecked=0, Total=6006 [2018-07-23 15:34:58,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-07-23 15:34:58,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 305. [2018-07-23 15:34:58,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-07-23 15:34:58,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 305 transitions. [2018-07-23 15:34:58,238 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 305 transitions. Word has length 300 [2018-07-23 15:34:58,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:58,238 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 305 transitions. [2018-07-23 15:34:58,238 INFO L472 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-07-23 15:34:58,239 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 305 transitions. [2018-07-23 15:34:58,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-07-23 15:34:58,240 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:58,240 INFO L353 BasicCegarLoop]: trace histogram [75, 75, 74, 74, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:58,241 INFO L414 AbstractCegarLoop]: === Iteration 77 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:58,241 INFO L82 PathProgramCache]: Analyzing trace with hash -439553129, now seen corresponding path program 74 times [2018-07-23 15:34:58,241 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:58,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:58,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:59,174 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-23 15:34:59,175 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:59,175 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-07-23 15:34:59,175 INFO L450 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-07-23 15:34:59,176 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-07-23 15:34:59,176 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3005, Invalid=3157, Unknown=0, NotChecked=0, Total=6162 [2018-07-23 15:34:59,176 INFO L87 Difference]: Start difference. First operand 305 states and 305 transitions. Second operand 79 states. [2018-07-23 15:34:59,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:59,425 INFO L93 Difference]: Finished difference Result 311 states and 311 transitions. [2018-07-23 15:34:59,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-07-23 15:34:59,426 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 304 [2018-07-23 15:34:59,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:59,427 INFO L225 Difference]: With dead ends: 311 [2018-07-23 15:34:59,427 INFO L226 Difference]: Without dead ends: 310 [2018-07-23 15:34:59,427 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=3005, Invalid=3157, Unknown=0, NotChecked=0, Total=6162 [2018-07-23 15:34:59,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-07-23 15:34:59,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 309. [2018-07-23 15:34:59,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-07-23 15:34:59,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 309 transitions. [2018-07-23 15:34:59,537 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 309 transitions. Word has length 304 [2018-07-23 15:34:59,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:59,537 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 309 transitions. [2018-07-23 15:34:59,537 INFO L472 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-07-23 15:34:59,537 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 309 transitions. [2018-07-23 15:34:59,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-07-23 15:34:59,538 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:59,538 INFO L353 BasicCegarLoop]: trace histogram [76, 76, 75, 75, 1, 1, 1, 1, 1, 1] [2018-07-23 15:34:59,538 INFO L414 AbstractCegarLoop]: === Iteration 78 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:59,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1987931362, now seen corresponding path program 75 times [2018-07-23 15:34:59,539 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:59,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:35:00,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:35:00,350 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-23 15:35:00,350 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:35:00,350 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-07-23 15:35:00,350 INFO L450 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-07-23 15:35:00,351 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-07-23 15:35:00,351 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3083, Invalid=3237, Unknown=0, NotChecked=0, Total=6320 [2018-07-23 15:35:00,351 INFO L87 Difference]: Start difference. First operand 309 states and 309 transitions. Second operand 80 states. [2018-07-23 15:35:00,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:35:00,646 INFO L93 Difference]: Finished difference Result 315 states and 315 transitions. [2018-07-23 15:35:00,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-07-23 15:35:00,647 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 308 [2018-07-23 15:35:00,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:35:00,648 INFO L225 Difference]: With dead ends: 315 [2018-07-23 15:35:00,648 INFO L226 Difference]: Without dead ends: 314 [2018-07-23 15:35:00,649 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=3083, Invalid=3237, Unknown=0, NotChecked=0, Total=6320 [2018-07-23 15:35:00,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-07-23 15:35:00,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 313. [2018-07-23 15:35:00,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-07-23 15:35:00,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 313 transitions. [2018-07-23 15:35:00,783 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 313 transitions. Word has length 308 [2018-07-23 15:35:00,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:35:00,783 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 313 transitions. [2018-07-23 15:35:00,783 INFO L472 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-07-23 15:35:00,783 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 313 transitions. [2018-07-23 15:35:00,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-07-23 15:35:00,785 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:35:00,785 INFO L353 BasicCegarLoop]: trace histogram [77, 77, 76, 76, 1, 1, 1, 1, 1, 1] [2018-07-23 15:35:00,785 INFO L414 AbstractCegarLoop]: === Iteration 79 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:35:00,785 INFO L82 PathProgramCache]: Analyzing trace with hash 314513189, now seen corresponding path program 76 times [2018-07-23 15:35:00,786 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:35:00,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:35:01,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:35:01,592 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-23 15:35:01,593 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:35:01,593 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-07-23 15:35:01,593 INFO L450 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-07-23 15:35:01,594 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-07-23 15:35:01,594 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3162, Invalid=3318, Unknown=0, NotChecked=0, Total=6480 [2018-07-23 15:35:01,594 INFO L87 Difference]: Start difference. First operand 313 states and 313 transitions. Second operand 81 states. [2018-07-23 15:35:01,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:35:01,909 INFO L93 Difference]: Finished difference Result 319 states and 319 transitions. [2018-07-23 15:35:01,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-07-23 15:35:01,909 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 312 [2018-07-23 15:35:01,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:35:01,910 INFO L225 Difference]: With dead ends: 319 [2018-07-23 15:35:01,910 INFO L226 Difference]: Without dead ends: 318 [2018-07-23 15:35:01,911 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=3162, Invalid=3318, Unknown=0, NotChecked=0, Total=6480 [2018-07-23 15:35:01,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-07-23 15:35:02,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 317. [2018-07-23 15:35:02,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-07-23 15:35:02,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 317 transitions. [2018-07-23 15:35:02,057 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 317 transitions. Word has length 312 [2018-07-23 15:35:02,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:35:02,057 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 317 transitions. [2018-07-23 15:35:02,057 INFO L472 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-07-23 15:35:02,057 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 317 transitions. [2018-07-23 15:35:02,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2018-07-23 15:35:02,059 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:35:02,059 INFO L353 BasicCegarLoop]: trace histogram [78, 78, 77, 77, 1, 1, 1, 1, 1, 1] [2018-07-23 15:35:02,059 INFO L414 AbstractCegarLoop]: === Iteration 80 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:35:02,060 INFO L82 PathProgramCache]: Analyzing trace with hash -495173716, now seen corresponding path program 77 times [2018-07-23 15:35:02,060 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:35:02,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:35:02,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:35:02,897 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-23 15:35:02,898 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:35:02,898 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-07-23 15:35:02,898 INFO L450 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-07-23 15:35:02,899 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-07-23 15:35:02,899 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3242, Invalid=3400, Unknown=0, NotChecked=0, Total=6642 [2018-07-23 15:35:02,899 INFO L87 Difference]: Start difference. First operand 317 states and 317 transitions. Second operand 82 states. [2018-07-23 15:35:03,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:35:03,203 INFO L93 Difference]: Finished difference Result 323 states and 323 transitions. [2018-07-23 15:35:03,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-07-23 15:35:03,203 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 316 [2018-07-23 15:35:03,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:35:03,205 INFO L225 Difference]: With dead ends: 323 [2018-07-23 15:35:03,205 INFO L226 Difference]: Without dead ends: 322 [2018-07-23 15:35:03,205 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=3242, Invalid=3400, Unknown=0, NotChecked=0, Total=6642 [2018-07-23 15:35:03,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-07-23 15:35:03,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 321. [2018-07-23 15:35:03,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-07-23 15:35:03,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 321 transitions. [2018-07-23 15:35:03,346 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 321 transitions. Word has length 316 [2018-07-23 15:35:03,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:35:03,346 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 321 transitions. [2018-07-23 15:35:03,346 INFO L472 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-07-23 15:35:03,347 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 321 transitions. [2018-07-23 15:35:03,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2018-07-23 15:35:03,348 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:35:03,348 INFO L353 BasicCegarLoop]: trace histogram [79, 79, 78, 78, 1, 1, 1, 1, 1, 1] [2018-07-23 15:35:03,349 INFO L414 AbstractCegarLoop]: === Iteration 81 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:35:03,349 INFO L82 PathProgramCache]: Analyzing trace with hash -959198029, now seen corresponding path program 78 times [2018-07-23 15:35:03,349 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:35:03,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:35:03,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:35:04,199 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-23 15:35:04,199 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:35:04,199 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-07-23 15:35:04,199 INFO L450 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-07-23 15:35:04,200 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-07-23 15:35:04,200 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3323, Invalid=3483, Unknown=0, NotChecked=0, Total=6806 [2018-07-23 15:35:04,200 INFO L87 Difference]: Start difference. First operand 321 states and 321 transitions. Second operand 83 states. [2018-07-23 15:35:04,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:35:04,461 INFO L93 Difference]: Finished difference Result 327 states and 327 transitions. [2018-07-23 15:35:04,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-07-23 15:35:04,461 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 320 [2018-07-23 15:35:04,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:35:04,463 INFO L225 Difference]: With dead ends: 327 [2018-07-23 15:35:04,463 INFO L226 Difference]: Without dead ends: 326 [2018-07-23 15:35:04,463 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=3323, Invalid=3483, Unknown=0, NotChecked=0, Total=6806 [2018-07-23 15:35:04,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-07-23 15:35:04,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 325. [2018-07-23 15:35:04,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-07-23 15:35:04,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 325 transitions. [2018-07-23 15:35:04,608 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 325 transitions. Word has length 320 [2018-07-23 15:35:04,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:35:04,609 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 325 transitions. [2018-07-23 15:35:04,609 INFO L472 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-07-23 15:35:04,609 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 325 transitions. [2018-07-23 15:35:04,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-07-23 15:35:04,610 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:35:04,610 INFO L353 BasicCegarLoop]: trace histogram [80, 80, 79, 79, 1, 1, 1, 1, 1, 1] [2018-07-23 15:35:04,611 INFO L414 AbstractCegarLoop]: === Iteration 82 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:35:04,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1795128890, now seen corresponding path program 79 times [2018-07-23 15:35:04,611 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:35:04,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:35:05,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:35:05,551 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-23 15:35:05,551 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:35:05,551 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-07-23 15:35:05,551 INFO L450 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-07-23 15:35:05,552 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-07-23 15:35:05,552 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3405, Invalid=3567, Unknown=0, NotChecked=0, Total=6972 [2018-07-23 15:35:05,552 INFO L87 Difference]: Start difference. First operand 325 states and 325 transitions. Second operand 84 states. [2018-07-23 15:35:05,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:35:05,836 INFO L93 Difference]: Finished difference Result 331 states and 331 transitions. [2018-07-23 15:35:05,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-07-23 15:35:05,836 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 324 [2018-07-23 15:35:05,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:35:05,837 INFO L225 Difference]: With dead ends: 331 [2018-07-23 15:35:05,837 INFO L226 Difference]: Without dead ends: 330 [2018-07-23 15:35:05,838 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=3405, Invalid=3567, Unknown=0, NotChecked=0, Total=6972 [2018-07-23 15:35:05,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-07-23 15:35:05,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 329. [2018-07-23 15:35:05,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-07-23 15:35:05,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 329 transitions. [2018-07-23 15:35:05,968 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 329 transitions. Word has length 324 [2018-07-23 15:35:05,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:35:05,969 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 329 transitions. [2018-07-23 15:35:05,969 INFO L472 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-07-23 15:35:05,969 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 329 transitions. [2018-07-23 15:35:05,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-07-23 15:35:05,970 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:35:05,971 INFO L353 BasicCegarLoop]: trace histogram [81, 81, 80, 80, 1, 1, 1, 1, 1, 1] [2018-07-23 15:35:05,971 INFO L414 AbstractCegarLoop]: === Iteration 83 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:35:05,971 INFO L82 PathProgramCache]: Analyzing trace with hash -950463423, now seen corresponding path program 80 times [2018-07-23 15:35:05,971 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:35:06,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:35:06,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:35:06,824 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-23 15:35:06,824 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:35:06,824 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-07-23 15:35:06,824 INFO L450 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-07-23 15:35:06,825 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-07-23 15:35:06,826 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3488, Invalid=3652, Unknown=0, NotChecked=0, Total=7140 [2018-07-23 15:35:06,826 INFO L87 Difference]: Start difference. First operand 329 states and 329 transitions. Second operand 85 states. [2018-07-23 15:35:07,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:35:07,151 INFO L93 Difference]: Finished difference Result 335 states and 335 transitions. [2018-07-23 15:35:07,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-07-23 15:35:07,151 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 328 [2018-07-23 15:35:07,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:35:07,152 INFO L225 Difference]: With dead ends: 335 [2018-07-23 15:35:07,152 INFO L226 Difference]: Without dead ends: 334 [2018-07-23 15:35:07,153 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=3488, Invalid=3652, Unknown=0, NotChecked=0, Total=7140 [2018-07-23 15:35:07,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-07-23 15:35:07,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 333. [2018-07-23 15:35:07,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-07-23 15:35:07,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 333 transitions. [2018-07-23 15:35:07,279 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 333 transitions. Word has length 328 [2018-07-23 15:35:07,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:35:07,280 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 333 transitions. [2018-07-23 15:35:07,280 INFO L472 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-07-23 15:35:07,280 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 333 transitions. [2018-07-23 15:35:07,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-07-23 15:35:07,282 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:35:07,282 INFO L353 BasicCegarLoop]: trace histogram [82, 82, 81, 81, 1, 1, 1, 1, 1, 1] [2018-07-23 15:35:07,282 INFO L414 AbstractCegarLoop]: === Iteration 84 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:35:07,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1856352568, now seen corresponding path program 81 times [2018-07-23 15:35:07,282 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:35:07,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:35:07,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:35:08,205 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-23 15:35:08,206 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:35:08,206 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-07-23 15:35:08,206 INFO L450 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-07-23 15:35:08,207 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-07-23 15:35:08,207 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3572, Invalid=3738, Unknown=0, NotChecked=0, Total=7310 [2018-07-23 15:35:08,207 INFO L87 Difference]: Start difference. First operand 333 states and 333 transitions. Second operand 86 states. [2018-07-23 15:35:08,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:35:08,514 INFO L93 Difference]: Finished difference Result 339 states and 339 transitions. [2018-07-23 15:35:08,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-07-23 15:35:08,514 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 332 [2018-07-23 15:35:08,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:35:08,515 INFO L225 Difference]: With dead ends: 339 [2018-07-23 15:35:08,516 INFO L226 Difference]: Without dead ends: 338 [2018-07-23 15:35:08,516 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=3572, Invalid=3738, Unknown=0, NotChecked=0, Total=7310 [2018-07-23 15:35:08,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-07-23 15:35:08,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 337. [2018-07-23 15:35:08,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-07-23 15:35:08,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 337 transitions. [2018-07-23 15:35:08,679 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 337 transitions. Word has length 332 [2018-07-23 15:35:08,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:35:08,679 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 337 transitions. [2018-07-23 15:35:08,679 INFO L472 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-07-23 15:35:08,679 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 337 transitions. [2018-07-23 15:35:08,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-07-23 15:35:08,681 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:35:08,681 INFO L353 BasicCegarLoop]: trace histogram [83, 83, 82, 82, 1, 1, 1, 1, 1, 1] [2018-07-23 15:35:08,681 INFO L414 AbstractCegarLoop]: === Iteration 85 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:35:08,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1415778865, now seen corresponding path program 82 times [2018-07-23 15:35:08,681 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:35:08,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:35:09,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:35:09,610 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-23 15:35:09,611 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:35:09,611 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-07-23 15:35:09,611 INFO L450 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-07-23 15:35:09,612 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-07-23 15:35:09,612 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3657, Invalid=3825, Unknown=0, NotChecked=0, Total=7482 [2018-07-23 15:35:09,613 INFO L87 Difference]: Start difference. First operand 337 states and 337 transitions. Second operand 87 states. [2018-07-23 15:35:09,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:35:09,936 INFO L93 Difference]: Finished difference Result 343 states and 343 transitions. [2018-07-23 15:35:09,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-07-23 15:35:09,936 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 336 [2018-07-23 15:35:09,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:35:09,937 INFO L225 Difference]: With dead ends: 343 [2018-07-23 15:35:09,937 INFO L226 Difference]: Without dead ends: 342 [2018-07-23 15:35:09,938 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=3657, Invalid=3825, Unknown=0, NotChecked=0, Total=7482 [2018-07-23 15:35:09,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-07-23 15:35:10,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 341. [2018-07-23 15:35:10,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-07-23 15:35:10,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 341 transitions. [2018-07-23 15:35:10,074 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 341 transitions. Word has length 336 [2018-07-23 15:35:10,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:35:10,075 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 341 transitions. [2018-07-23 15:35:10,075 INFO L472 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-07-23 15:35:10,075 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 341 transitions. [2018-07-23 15:35:10,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2018-07-23 15:35:10,077 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:35:10,077 INFO L353 BasicCegarLoop]: trace histogram [84, 84, 83, 83, 1, 1, 1, 1, 1, 1] [2018-07-23 15:35:10,078 INFO L414 AbstractCegarLoop]: === Iteration 86 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:35:10,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1780829866, now seen corresponding path program 83 times [2018-07-23 15:35:10,078 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:35:10,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:35:10,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:35:11,022 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-23 15:35:11,022 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:35:11,023 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-07-23 15:35:11,023 INFO L450 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-07-23 15:35:11,024 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-07-23 15:35:11,025 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3743, Invalid=3913, Unknown=0, NotChecked=0, Total=7656 [2018-07-23 15:35:11,025 INFO L87 Difference]: Start difference. First operand 341 states and 341 transitions. Second operand 88 states. [2018-07-23 15:35:11,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:35:11,462 INFO L93 Difference]: Finished difference Result 347 states and 347 transitions. [2018-07-23 15:35:11,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-07-23 15:35:11,463 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 340 [2018-07-23 15:35:11,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:35:11,464 INFO L225 Difference]: With dead ends: 347 [2018-07-23 15:35:11,464 INFO L226 Difference]: Without dead ends: 346 [2018-07-23 15:35:11,465 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=3743, Invalid=3913, Unknown=0, NotChecked=0, Total=7656 [2018-07-23 15:35:11,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-07-23 15:35:11,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 345. [2018-07-23 15:35:11,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-07-23 15:35:11,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 345 transitions. [2018-07-23 15:35:11,603 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 345 transitions. Word has length 340 [2018-07-23 15:35:11,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:35:11,604 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 345 transitions. [2018-07-23 15:35:11,604 INFO L472 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-07-23 15:35:11,604 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 345 transitions. [2018-07-23 15:35:11,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2018-07-23 15:35:11,606 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:35:11,606 INFO L353 BasicCegarLoop]: trace histogram [85, 85, 84, 84, 1, 1, 1, 1, 1, 1] [2018-07-23 15:35:11,606 INFO L414 AbstractCegarLoop]: === Iteration 87 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:35:11,607 INFO L82 PathProgramCache]: Analyzing trace with hash -588424867, now seen corresponding path program 84 times [2018-07-23 15:35:11,607 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:35:11,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:35:12,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:35:12,678 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-23 15:35:12,678 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:35:12,678 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-07-23 15:35:12,679 INFO L450 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-07-23 15:35:12,679 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-07-23 15:35:12,680 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3830, Invalid=4002, Unknown=0, NotChecked=0, Total=7832 [2018-07-23 15:35:12,680 INFO L87 Difference]: Start difference. First operand 345 states and 345 transitions. Second operand 89 states. [2018-07-23 15:35:12,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:35:12,970 INFO L93 Difference]: Finished difference Result 351 states and 351 transitions. [2018-07-23 15:35:12,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-07-23 15:35:12,971 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 344 [2018-07-23 15:35:12,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:35:12,972 INFO L225 Difference]: With dead ends: 351 [2018-07-23 15:35:12,972 INFO L226 Difference]: Without dead ends: 350 [2018-07-23 15:35:12,973 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=3830, Invalid=4002, Unknown=0, NotChecked=0, Total=7832 [2018-07-23 15:35:12,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-07-23 15:35:13,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 349. [2018-07-23 15:35:13,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-07-23 15:35:13,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 349 transitions. [2018-07-23 15:35:13,116 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 349 transitions. Word has length 344 [2018-07-23 15:35:13,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:35:13,116 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 349 transitions. [2018-07-23 15:35:13,116 INFO L472 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-07-23 15:35:13,116 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 349 transitions. [2018-07-23 15:35:13,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-07-23 15:35:13,117 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:35:13,118 INFO L353 BasicCegarLoop]: trace histogram [86, 86, 85, 85, 1, 1, 1, 1, 1, 1] [2018-07-23 15:35:13,118 INFO L414 AbstractCegarLoop]: === Iteration 88 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:35:13,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1966168604, now seen corresponding path program 85 times [2018-07-23 15:35:13,118 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:35:13,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:35:13,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:35:14,174 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-23 15:35:14,175 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:35:14,175 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-07-23 15:35:14,176 INFO L450 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-07-23 15:35:14,176 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-07-23 15:35:14,177 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3918, Invalid=4092, Unknown=0, NotChecked=0, Total=8010 [2018-07-23 15:35:14,177 INFO L87 Difference]: Start difference. First operand 349 states and 349 transitions. Second operand 90 states. [2018-07-23 15:35:14,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:35:14,560 INFO L93 Difference]: Finished difference Result 355 states and 355 transitions. [2018-07-23 15:35:14,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-07-23 15:35:14,560 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 348 [2018-07-23 15:35:14,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:35:14,562 INFO L225 Difference]: With dead ends: 355 [2018-07-23 15:35:14,562 INFO L226 Difference]: Without dead ends: 354 [2018-07-23 15:35:14,563 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=3918, Invalid=4092, Unknown=0, NotChecked=0, Total=8010 [2018-07-23 15:35:14,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-07-23 15:35:14,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 353. [2018-07-23 15:35:14,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-07-23 15:35:14,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 353 transitions. [2018-07-23 15:35:14,707 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 353 transitions. Word has length 348 [2018-07-23 15:35:14,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:35:14,708 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 353 transitions. [2018-07-23 15:35:14,708 INFO L472 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-07-23 15:35:14,708 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 353 transitions. [2018-07-23 15:35:14,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-07-23 15:35:14,710 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:35:14,710 INFO L353 BasicCegarLoop]: trace histogram [87, 87, 86, 86, 1, 1, 1, 1, 1, 1] [2018-07-23 15:35:14,710 INFO L414 AbstractCegarLoop]: === Iteration 89 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:35:14,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1768401173, now seen corresponding path program 86 times [2018-07-23 15:35:14,710 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:35:14,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:35:15,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:35:15,837 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-23 15:35:15,838 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:35:15,838 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-07-23 15:35:15,838 INFO L450 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-07-23 15:35:15,839 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-07-23 15:35:15,839 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4007, Invalid=4183, Unknown=0, NotChecked=0, Total=8190 [2018-07-23 15:35:15,840 INFO L87 Difference]: Start difference. First operand 353 states and 353 transitions. Second operand 91 states. [2018-07-23 15:35:16,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:35:16,316 INFO L93 Difference]: Finished difference Result 359 states and 359 transitions. [2018-07-23 15:35:16,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-07-23 15:35:16,317 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 352 [2018-07-23 15:35:16,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:35:16,318 INFO L225 Difference]: With dead ends: 359 [2018-07-23 15:35:16,318 INFO L226 Difference]: Without dead ends: 358 [2018-07-23 15:35:16,319 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=4007, Invalid=4183, Unknown=0, NotChecked=0, Total=8190 [2018-07-23 15:35:16,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-07-23 15:35:16,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 357. [2018-07-23 15:35:16,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2018-07-23 15:35:16,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 357 transitions. [2018-07-23 15:35:16,521 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 357 transitions. Word has length 352 [2018-07-23 15:35:16,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:35:16,522 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 357 transitions. [2018-07-23 15:35:16,522 INFO L472 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-07-23 15:35:16,522 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 357 transitions. [2018-07-23 15:35:16,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2018-07-23 15:35:16,523 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:35:16,523 INFO L353 BasicCegarLoop]: trace histogram [88, 88, 87, 87, 1, 1, 1, 1, 1, 1] [2018-07-23 15:35:16,523 INFO L414 AbstractCegarLoop]: === Iteration 90 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:35:16,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1417948274, now seen corresponding path program 87 times [2018-07-23 15:35:16,523 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:35:16,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:35:17,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:35:17,618 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-23 15:35:17,619 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:35:17,619 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-07-23 15:35:17,619 INFO L450 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-07-23 15:35:17,620 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-07-23 15:35:17,620 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4097, Invalid=4275, Unknown=0, NotChecked=0, Total=8372 [2018-07-23 15:35:17,620 INFO L87 Difference]: Start difference. First operand 357 states and 357 transitions. Second operand 92 states. [2018-07-23 15:35:18,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:35:18,051 INFO L93 Difference]: Finished difference Result 363 states and 363 transitions. [2018-07-23 15:35:18,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-07-23 15:35:18,051 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 356 [2018-07-23 15:35:18,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:35:18,053 INFO L225 Difference]: With dead ends: 363 [2018-07-23 15:35:18,053 INFO L226 Difference]: Without dead ends: 362 [2018-07-23 15:35:18,053 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=4097, Invalid=4275, Unknown=0, NotChecked=0, Total=8372 [2018-07-23 15:35:18,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2018-07-23 15:35:18,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 361. [2018-07-23 15:35:18,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-07-23 15:35:18,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 361 transitions. [2018-07-23 15:35:18,206 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 361 transitions. Word has length 356 [2018-07-23 15:35:18,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:35:18,206 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 361 transitions. [2018-07-23 15:35:18,206 INFO L472 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-07-23 15:35:18,206 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 361 transitions. [2018-07-23 15:35:18,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2018-07-23 15:35:18,207 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:35:18,207 INFO L353 BasicCegarLoop]: trace histogram [89, 89, 88, 88, 1, 1, 1, 1, 1, 1] [2018-07-23 15:35:18,207 INFO L414 AbstractCegarLoop]: === Iteration 91 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:35:18,208 INFO L82 PathProgramCache]: Analyzing trace with hash -437524871, now seen corresponding path program 88 times [2018-07-23 15:35:18,208 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:35:18,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:35:18,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:35:19,252 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-23 15:35:19,252 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:35:19,253 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-07-23 15:35:19,253 INFO L450 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-07-23 15:35:19,254 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-07-23 15:35:19,254 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4188, Invalid=4368, Unknown=0, NotChecked=0, Total=8556 [2018-07-23 15:35:19,254 INFO L87 Difference]: Start difference. First operand 361 states and 361 transitions. Second operand 93 states. [2018-07-23 15:35:19,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:35:19,705 INFO L93 Difference]: Finished difference Result 367 states and 367 transitions. [2018-07-23 15:35:19,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-07-23 15:35:19,706 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 360 [2018-07-23 15:35:19,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:35:19,707 INFO L225 Difference]: With dead ends: 367 [2018-07-23 15:35:19,707 INFO L226 Difference]: Without dead ends: 366 [2018-07-23 15:35:19,708 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=4188, Invalid=4368, Unknown=0, NotChecked=0, Total=8556 [2018-07-23 15:35:19,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-07-23 15:35:19,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 365. [2018-07-23 15:35:19,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-07-23 15:35:19,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 365 transitions. [2018-07-23 15:35:19,863 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 365 transitions. Word has length 360 [2018-07-23 15:35:19,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:35:19,864 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 365 transitions. [2018-07-23 15:35:19,864 INFO L472 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-07-23 15:35:19,864 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 365 transitions. [2018-07-23 15:35:19,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2018-07-23 15:35:19,866 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:35:19,866 INFO L353 BasicCegarLoop]: trace histogram [90, 90, 89, 89, 1, 1, 1, 1, 1, 1] [2018-07-23 15:35:19,866 INFO L414 AbstractCegarLoop]: === Iteration 92 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:35:19,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1454816000, now seen corresponding path program 89 times [2018-07-23 15:35:19,867 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:35:20,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:35:20,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:35:20,984 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-23 15:35:20,984 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:35:20,984 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-07-23 15:35:20,985 INFO L450 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-07-23 15:35:20,985 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-07-23 15:35:20,986 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4280, Invalid=4462, Unknown=0, NotChecked=0, Total=8742 [2018-07-23 15:35:20,986 INFO L87 Difference]: Start difference. First operand 365 states and 365 transitions. Second operand 94 states. [2018-07-23 15:35:21,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:35:21,440 INFO L93 Difference]: Finished difference Result 371 states and 371 transitions. [2018-07-23 15:35:21,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-07-23 15:35:21,440 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 364 [2018-07-23 15:35:21,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:35:21,442 INFO L225 Difference]: With dead ends: 371 [2018-07-23 15:35:21,442 INFO L226 Difference]: Without dead ends: 370 [2018-07-23 15:35:21,442 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=4280, Invalid=4462, Unknown=0, NotChecked=0, Total=8742 [2018-07-23 15:35:21,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2018-07-23 15:35:21,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 369. [2018-07-23 15:35:21,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-07-23 15:35:21,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 369 transitions. [2018-07-23 15:35:21,601 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 369 transitions. Word has length 364 [2018-07-23 15:35:21,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:35:21,601 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 369 transitions. [2018-07-23 15:35:21,601 INFO L472 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-07-23 15:35:21,601 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 369 transitions. [2018-07-23 15:35:21,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2018-07-23 15:35:21,602 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:35:21,602 INFO L353 BasicCegarLoop]: trace histogram [91, 91, 90, 90, 1, 1, 1, 1, 1, 1] [2018-07-23 15:35:21,603 INFO L414 AbstractCegarLoop]: === Iteration 93 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:35:21,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1439299577, now seen corresponding path program 90 times [2018-07-23 15:35:21,603 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:35:21,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:35:22,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:35:22,723 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-23 15:35:22,723 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:35:22,723 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-07-23 15:35:22,724 INFO L450 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-07-23 15:35:22,724 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-07-23 15:35:22,725 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4373, Invalid=4557, Unknown=0, NotChecked=0, Total=8930 [2018-07-23 15:35:22,725 INFO L87 Difference]: Start difference. First operand 369 states and 369 transitions. Second operand 95 states. [2018-07-23 15:35:23,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:35:23,048 INFO L93 Difference]: Finished difference Result 375 states and 375 transitions. [2018-07-23 15:35:23,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-07-23 15:35:23,048 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 368 [2018-07-23 15:35:23,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:35:23,049 INFO L225 Difference]: With dead ends: 375 [2018-07-23 15:35:23,049 INFO L226 Difference]: Without dead ends: 374 [2018-07-23 15:35:23,050 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=4373, Invalid=4557, Unknown=0, NotChecked=0, Total=8930 [2018-07-23 15:35:23,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2018-07-23 15:35:23,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 373. [2018-07-23 15:35:23,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-07-23 15:35:23,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 373 transitions. [2018-07-23 15:35:23,213 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 373 transitions. Word has length 368 [2018-07-23 15:35:23,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:35:23,214 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 373 transitions. [2018-07-23 15:35:23,214 INFO L472 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-07-23 15:35:23,214 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 373 transitions. [2018-07-23 15:35:23,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2018-07-23 15:35:23,215 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:35:23,216 INFO L353 BasicCegarLoop]: trace histogram [92, 92, 91, 91, 1, 1, 1, 1, 1, 1] [2018-07-23 15:35:23,216 INFO L414 AbstractCegarLoop]: === Iteration 94 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:35:23,216 INFO L82 PathProgramCache]: Analyzing trace with hash 292286350, now seen corresponding path program 91 times [2018-07-23 15:35:23,216 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:35:23,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:35:24,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:35:24,382 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-23 15:35:24,383 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:35:24,383 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-07-23 15:35:24,383 INFO L450 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-07-23 15:35:24,384 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-07-23 15:35:24,384 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4467, Invalid=4653, Unknown=0, NotChecked=0, Total=9120 [2018-07-23 15:35:24,385 INFO L87 Difference]: Start difference. First operand 373 states and 373 transitions. Second operand 96 states. [2018-07-23 15:35:24,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:35:24,869 INFO L93 Difference]: Finished difference Result 379 states and 379 transitions. [2018-07-23 15:35:24,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-07-23 15:35:24,870 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 372 [2018-07-23 15:35:24,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:35:24,871 INFO L225 Difference]: With dead ends: 379 [2018-07-23 15:35:24,871 INFO L226 Difference]: Without dead ends: 378 [2018-07-23 15:35:24,872 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=4467, Invalid=4653, Unknown=0, NotChecked=0, Total=9120 [2018-07-23 15:35:24,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2018-07-23 15:35:25,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 377. [2018-07-23 15:35:25,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2018-07-23 15:35:25,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 377 transitions. [2018-07-23 15:35:25,040 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 377 transitions. Word has length 372 [2018-07-23 15:35:25,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:35:25,040 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 377 transitions. [2018-07-23 15:35:25,040 INFO L472 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-07-23 15:35:25,040 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 377 transitions. [2018-07-23 15:35:25,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2018-07-23 15:35:25,042 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:35:25,042 INFO L353 BasicCegarLoop]: trace histogram [93, 93, 92, 92, 1, 1, 1, 1, 1, 1] [2018-07-23 15:35:25,042 INFO L414 AbstractCegarLoop]: === Iteration 95 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:35:25,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1799046251, now seen corresponding path program 92 times [2018-07-23 15:35:25,042 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:35:25,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:35:25,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:35:26,176 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-23 15:35:26,176 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:35:26,176 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-07-23 15:35:26,177 INFO L450 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-07-23 15:35:26,177 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-07-23 15:35:26,178 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4562, Invalid=4750, Unknown=0, NotChecked=0, Total=9312 [2018-07-23 15:35:26,178 INFO L87 Difference]: Start difference. First operand 377 states and 377 transitions. Second operand 97 states. [2018-07-23 15:35:26,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:35:26,536 INFO L93 Difference]: Finished difference Result 383 states and 383 transitions. [2018-07-23 15:35:26,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-07-23 15:35:26,536 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 376 [2018-07-23 15:35:26,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:35:26,537 INFO L225 Difference]: With dead ends: 383 [2018-07-23 15:35:26,537 INFO L226 Difference]: Without dead ends: 382 [2018-07-23 15:35:26,538 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=4562, Invalid=4750, Unknown=0, NotChecked=0, Total=9312 [2018-07-23 15:35:26,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-07-23 15:35:26,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 381. [2018-07-23 15:35:26,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-07-23 15:35:26,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 381 transitions. [2018-07-23 15:35:26,717 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 381 transitions. Word has length 376 [2018-07-23 15:35:26,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:35:26,717 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 381 transitions. [2018-07-23 15:35:26,717 INFO L472 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-07-23 15:35:26,717 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 381 transitions. [2018-07-23 15:35:26,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2018-07-23 15:35:26,718 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:35:26,718 INFO L353 BasicCegarLoop]: trace histogram [94, 94, 93, 93, 1, 1, 1, 1, 1, 1] [2018-07-23 15:35:26,719 INFO L414 AbstractCegarLoop]: === Iteration 96 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:35:26,719 INFO L82 PathProgramCache]: Analyzing trace with hash -415618020, now seen corresponding path program 93 times [2018-07-23 15:35:26,719 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:35:26,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:35:27,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:35:27,915 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-23 15:35:27,916 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:35:27,916 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-07-23 15:35:27,916 INFO L450 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-07-23 15:35:27,917 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-07-23 15:35:27,917 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4658, Invalid=4848, Unknown=0, NotChecked=0, Total=9506 [2018-07-23 15:35:27,917 INFO L87 Difference]: Start difference. First operand 381 states and 381 transitions. Second operand 98 states. [2018-07-23 15:35:28,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:35:28,342 INFO L93 Difference]: Finished difference Result 387 states and 387 transitions. [2018-07-23 15:35:28,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-07-23 15:35:28,342 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 380 [2018-07-23 15:35:28,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:35:28,344 INFO L225 Difference]: With dead ends: 387 [2018-07-23 15:35:28,344 INFO L226 Difference]: Without dead ends: 386 [2018-07-23 15:35:28,345 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=4658, Invalid=4848, Unknown=0, NotChecked=0, Total=9506 [2018-07-23 15:35:28,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-07-23 15:35:28,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 385. [2018-07-23 15:35:28,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-07-23 15:35:28,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 385 transitions. [2018-07-23 15:35:28,520 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 385 transitions. Word has length 380 [2018-07-23 15:35:28,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:35:28,520 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 385 transitions. [2018-07-23 15:35:28,520 INFO L472 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-07-23 15:35:28,520 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 385 transitions. [2018-07-23 15:35:28,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2018-07-23 15:35:28,522 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:35:28,522 INFO L353 BasicCegarLoop]: trace histogram [95, 95, 94, 94, 1, 1, 1, 1, 1, 1] [2018-07-23 15:35:28,522 INFO L414 AbstractCegarLoop]: === Iteration 97 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:35:28,522 INFO L82 PathProgramCache]: Analyzing trace with hash 686162211, now seen corresponding path program 94 times [2018-07-23 15:35:28,522 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:35:28,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:35:29,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:35:29,687 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-23 15:35:29,688 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:35:29,688 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-07-23 15:35:29,688 INFO L450 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-07-23 15:35:29,689 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-07-23 15:35:29,689 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4755, Invalid=4947, Unknown=0, NotChecked=0, Total=9702 [2018-07-23 15:35:29,689 INFO L87 Difference]: Start difference. First operand 385 states and 385 transitions. Second operand 99 states. [2018-07-23 15:35:30,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:35:30,208 INFO L93 Difference]: Finished difference Result 391 states and 391 transitions. [2018-07-23 15:35:30,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-07-23 15:35:30,208 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 384 [2018-07-23 15:35:30,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:35:30,210 INFO L225 Difference]: With dead ends: 391 [2018-07-23 15:35:30,210 INFO L226 Difference]: Without dead ends: 390 [2018-07-23 15:35:30,210 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=4755, Invalid=4947, Unknown=0, NotChecked=0, Total=9702 [2018-07-23 15:35:30,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2018-07-23 15:35:30,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 389. [2018-07-23 15:35:30,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2018-07-23 15:35:30,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 389 transitions. [2018-07-23 15:35:30,390 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 389 transitions. Word has length 384 [2018-07-23 15:35:30,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:35:30,390 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 389 transitions. [2018-07-23 15:35:30,390 INFO L472 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-07-23 15:35:30,390 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 389 transitions. [2018-07-23 15:35:30,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2018-07-23 15:35:30,391 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:35:30,391 INFO L353 BasicCegarLoop]: trace histogram [96, 96, 95, 95, 1, 1, 1, 1, 1, 1] [2018-07-23 15:35:30,392 INFO L414 AbstractCegarLoop]: === Iteration 98 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:35:30,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1459747498, now seen corresponding path program 95 times [2018-07-23 15:35:30,392 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:35:30,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:35:31,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:35:31,893 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-23 15:35:31,893 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:35:31,893 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-07-23 15:35:31,894 INFO L450 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-07-23 15:35:31,894 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-07-23 15:35:31,895 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4853, Invalid=5047, Unknown=0, NotChecked=0, Total=9900 [2018-07-23 15:35:31,895 INFO L87 Difference]: Start difference. First operand 389 states and 389 transitions. Second operand 100 states. [2018-07-23 15:35:32,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:35:32,426 INFO L93 Difference]: Finished difference Result 395 states and 395 transitions. [2018-07-23 15:35:32,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-07-23 15:35:32,426 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 388 [2018-07-23 15:35:32,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:35:32,427 INFO L225 Difference]: With dead ends: 395 [2018-07-23 15:35:32,427 INFO L226 Difference]: Without dead ends: 394 [2018-07-23 15:35:32,428 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=4853, Invalid=5047, Unknown=0, NotChecked=0, Total=9900 [2018-07-23 15:35:32,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-07-23 15:35:32,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 393. [2018-07-23 15:35:32,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-07-23 15:35:32,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 393 transitions. [2018-07-23 15:35:32,613 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 393 transitions. Word has length 388 [2018-07-23 15:35:32,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:35:32,614 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 393 transitions. [2018-07-23 15:35:32,614 INFO L472 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-07-23 15:35:32,614 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 393 transitions. [2018-07-23 15:35:32,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2018-07-23 15:35:32,616 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:35:32,616 INFO L353 BasicCegarLoop]: trace histogram [97, 97, 96, 96, 1, 1, 1, 1, 1, 1] [2018-07-23 15:35:32,616 INFO L414 AbstractCegarLoop]: === Iteration 99 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:35:32,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1142433615, now seen corresponding path program 96 times [2018-07-23 15:35:32,617 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:35:32,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:35:33,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:35:33,928 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-23 15:35:33,928 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:35:33,928 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-07-23 15:35:33,929 INFO L450 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-07-23 15:35:33,930 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-07-23 15:35:33,930 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4952, Invalid=5148, Unknown=0, NotChecked=0, Total=10100 [2018-07-23 15:35:33,931 INFO L87 Difference]: Start difference. First operand 393 states and 393 transitions. Second operand 101 states. [2018-07-23 15:35:34,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:35:34,524 INFO L93 Difference]: Finished difference Result 399 states and 399 transitions. [2018-07-23 15:35:34,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-07-23 15:35:34,524 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 392 [2018-07-23 15:35:34,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:35:34,526 INFO L225 Difference]: With dead ends: 399 [2018-07-23 15:35:34,526 INFO L226 Difference]: Without dead ends: 398 [2018-07-23 15:35:34,527 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=4952, Invalid=5148, Unknown=0, NotChecked=0, Total=10100 [2018-07-23 15:35:34,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-07-23 15:35:34,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 397. [2018-07-23 15:35:34,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-07-23 15:35:34,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 397 transitions. [2018-07-23 15:35:34,738 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 397 transitions. Word has length 392 [2018-07-23 15:35:34,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:35:34,738 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 397 transitions. [2018-07-23 15:35:34,738 INFO L472 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-07-23 15:35:34,738 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 397 transitions. [2018-07-23 15:35:34,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2018-07-23 15:35:34,739 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:35:34,740 INFO L353 BasicCegarLoop]: trace histogram [98, 98, 97, 97, 1, 1, 1, 1, 1, 1] [2018-07-23 15:35:34,740 INFO L414 AbstractCegarLoop]: === Iteration 100 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:35:34,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1594972984, now seen corresponding path program 97 times [2018-07-23 15:35:34,740 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:35:34,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:35:35,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:35:36,123 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-23 15:35:36,123 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:35:36,123 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-07-23 15:35:36,124 INFO L450 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-07-23 15:35:36,125 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-07-23 15:35:36,126 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5052, Invalid=5250, Unknown=0, NotChecked=0, Total=10302 [2018-07-23 15:35:36,126 INFO L87 Difference]: Start difference. First operand 397 states and 397 transitions. Second operand 102 states. [2018-07-23 15:35:36,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:35:36,554 INFO L93 Difference]: Finished difference Result 403 states and 403 transitions. [2018-07-23 15:35:36,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-07-23 15:35:36,554 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 396 [2018-07-23 15:35:36,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:35:36,556 INFO L225 Difference]: With dead ends: 403 [2018-07-23 15:35:36,556 INFO L226 Difference]: Without dead ends: 402 [2018-07-23 15:35:36,557 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=5052, Invalid=5250, Unknown=0, NotChecked=0, Total=10302 [2018-07-23 15:35:36,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-07-23 15:35:36,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 401. [2018-07-23 15:35:36,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-07-23 15:35:36,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 401 transitions. [2018-07-23 15:35:36,750 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 401 transitions. Word has length 396 [2018-07-23 15:35:36,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:35:36,750 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 401 transitions. [2018-07-23 15:35:36,750 INFO L472 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-07-23 15:35:36,750 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 401 transitions. [2018-07-23 15:35:36,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2018-07-23 15:35:36,752 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:35:36,752 INFO L353 BasicCegarLoop]: trace histogram [99, 99, 98, 98, 1, 1, 1, 1, 1, 1] [2018-07-23 15:35:36,752 INFO L414 AbstractCegarLoop]: === Iteration 101 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:35:36,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1964524095, now seen corresponding path program 98 times [2018-07-23 15:35:36,752 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:35:36,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:35:37,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:35:38,126 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-23 15:35:38,127 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:35:38,127 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-07-23 15:35:38,127 INFO L450 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-07-23 15:35:38,128 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-07-23 15:35:38,129 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5153, Invalid=5353, Unknown=0, NotChecked=0, Total=10506 [2018-07-23 15:35:38,129 INFO L87 Difference]: Start difference. First operand 401 states and 401 transitions. Second operand 103 states. [2018-07-23 15:35:38,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:35:38,726 INFO L93 Difference]: Finished difference Result 407 states and 407 transitions. [2018-07-23 15:35:38,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-07-23 15:35:38,726 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 400 [2018-07-23 15:35:38,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:35:38,728 INFO L225 Difference]: With dead ends: 407 [2018-07-23 15:35:38,728 INFO L226 Difference]: Without dead ends: 406 [2018-07-23 15:35:38,729 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=5153, Invalid=5353, Unknown=0, NotChecked=0, Total=10506 [2018-07-23 15:35:38,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-07-23 15:35:38,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 405. [2018-07-23 15:35:38,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-07-23 15:35:38,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 405 transitions. [2018-07-23 15:35:38,955 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 405 transitions. Word has length 400 [2018-07-23 15:35:38,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:35:38,956 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 405 transitions. [2018-07-23 15:35:38,956 INFO L472 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-07-23 15:35:38,956 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 405 transitions. [2018-07-23 15:35:38,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2018-07-23 15:35:38,958 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:35:38,958 INFO L353 BasicCegarLoop]: trace histogram [100, 100, 99, 99, 1, 1, 1, 1, 1, 1] [2018-07-23 15:35:38,958 INFO L414 AbstractCegarLoop]: === Iteration 102 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:35:38,959 INFO L82 PathProgramCache]: Analyzing trace with hash -810136122, now seen corresponding path program 99 times [2018-07-23 15:35:38,959 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:35:39,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:35:39,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:35:40,350 INFO L134 CoverageAnalysis]: Checked inductivity of 19701 backedges. 0 proven. 19701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:35:40,350 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:35:40,350 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-07-23 15:35:40,351 INFO L450 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-07-23 15:35:40,352 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-07-23 15:35:40,353 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5255, Invalid=5457, Unknown=0, NotChecked=0, Total=10712 [2018-07-23 15:35:40,353 INFO L87 Difference]: Start difference. First operand 405 states and 405 transitions. Second operand 104 states. [2018-07-23 15:35:40,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:35:40,848 INFO L93 Difference]: Finished difference Result 411 states and 411 transitions. [2018-07-23 15:35:40,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-07-23 15:35:40,848 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 404 [2018-07-23 15:35:40,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:35:40,850 INFO L225 Difference]: With dead ends: 411 [2018-07-23 15:35:40,850 INFO L226 Difference]: Without dead ends: 410 [2018-07-23 15:35:40,851 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=5255, Invalid=5457, Unknown=0, NotChecked=0, Total=10712 [2018-07-23 15:35:40,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-07-23 15:35:41,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 409. [2018-07-23 15:35:41,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-07-23 15:35:41,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 409 transitions. [2018-07-23 15:35:41,056 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 409 transitions. Word has length 404 [2018-07-23 15:35:41,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:35:41,056 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 409 transitions. [2018-07-23 15:35:41,056 INFO L472 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-07-23 15:35:41,056 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 409 transitions. [2018-07-23 15:35:41,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2018-07-23 15:35:41,057 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:35:41,058 INFO L353 BasicCegarLoop]: trace histogram [101, 101, 100, 100, 1, 1, 1, 1, 1, 1] [2018-07-23 15:35:41,058 INFO L414 AbstractCegarLoop]: === Iteration 103 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:35:41,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1304772045, now seen corresponding path program 100 times [2018-07-23 15:35:41,058 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:35:41,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:35:41,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:35:42,083 INFO L134 CoverageAnalysis]: Checked inductivity of 20100 backedges. 19603 proven. 497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:35:42,084 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:35:42,084 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-07-23 15:35:42,085 INFO L450 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-07-23 15:35:42,086 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-07-23 15:35:42,086 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5157, Invalid=5763, Unknown=0, NotChecked=0, Total=10920 [2018-07-23 15:35:42,086 INFO L87 Difference]: Start difference. First operand 409 states and 409 transitions. Second operand 105 states. [2018-07-23 15:35:42,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:35:42,618 INFO L93 Difference]: Finished difference Result 412 states and 412 transitions. [2018-07-23 15:35:42,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-07-23 15:35:42,619 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 408 [2018-07-23 15:35:42,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:35:42,619 INFO L225 Difference]: With dead ends: 412 [2018-07-23 15:35:42,619 INFO L226 Difference]: Without dead ends: 0 [2018-07-23 15:35:42,623 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=5260, Invalid=5870, Unknown=0, NotChecked=0, Total=11130 [2018-07-23 15:35:42,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-23 15:35:42,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-23 15:35:42,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-23 15:35:42,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-23 15:35:42,623 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 408 [2018-07-23 15:35:42,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:35:42,624 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-23 15:35:42,624 INFO L472 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-07-23 15:35:42,624 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-23 15:35:42,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-23 15:35:42,628 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-23 15:35:42,773 WARN L169 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 611 [2018-07-23 15:35:55,267 WARN L169 SmtUtils]: Spent 12.34 s on a formula simplification. DAG size of input: 811 DAG size of output: 615 [2018-07-23 15:35:56,047 WARN L169 SmtUtils]: Spent 773.00 ms on a formula simplification that was a NOOP. DAG size: 611 [2018-07-23 15:35:56,786 WARN L169 SmtUtils]: Spent 730.00 ms on a formula simplification that was a NOOP. DAG size: 613 [2018-07-23 15:35:57,256 WARN L169 SmtUtils]: Spent 465.00 ms on a formula simplification that was a NOOP. DAG size: 608 [2018-07-23 15:35:58,258 WARN L169 SmtUtils]: Spent 996.00 ms on a formula simplification. DAG size of input: 615 DAG size of output: 612 [2018-07-23 15:35:58,264 INFO L424 ceAbstractionStarter]: At program point ULTIMATE.initEXIT(lines 36 39) the Hoare annotation is: true [2018-07-23 15:35:58,264 INFO L417 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 36 39) the Hoare annotation is: (and (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#valid| |old(#valid)|)) [2018-07-23 15:35:58,264 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 36 39) no Hoare annotation was computed. [2018-07-23 15:35:58,264 INFO L424 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 41 46) the Hoare annotation is: true [2018-07-23 15:35:58,265 INFO L424 ceAbstractionStarter]: At program point ULTIMATE.startFINAL(lines 41 46) the Hoare annotation is: true [2018-07-23 15:35:58,265 INFO L424 ceAbstractionStarter]: At program point ULTIMATE.startEXIT(lines 41 46) the Hoare annotation is: true [2018-07-23 15:35:58,265 INFO L424 ceAbstractionStarter]: At program point L44(line 44) the Hoare annotation is: true [2018-07-23 15:35:58,265 INFO L417 ceAbstractionStarter]: At program point mainErr1RequiresViolationPRE_CONDITION(lines 16 59) the Hoare annotation is: false [2018-07-23 15:35:58,265 INFO L421 ceAbstractionStarter]: For program point mainFINAL(lines 1 34) no Hoare annotation was computed. [2018-07-23 15:35:58,270 INFO L417 ceAbstractionStarter]: At program point L12(lines 12 31) the Hoare annotation is: (let ((.cse5 (select |#length| main_~q~1.base))) (let ((.cse3 (= 400 .cse5)) (.cse0 (= main_~p~1.offset 0)) (.cse2 (select |#valid| main_~q~1.base)) (.cse1 (+ main_~p~1.offset .cse5))) (or (and .cse0 (<= (+ main_~p~1.offset 372) main_~q~1.offset) (<= (+ main_~q~1.offset 28) .cse1) .cse2) (and (<= (+ main_~p~1.offset 184) main_~q~1.offset) (<= (+ main_~q~1.offset 216) .cse1) .cse0 .cse2) (and .cse0 .cse2 (<= (+ main_~q~1.offset 204) .cse1) (<= (+ main_~p~1.offset 196) main_~q~1.offset)) (and .cse0 .cse2 (<= (+ main_~q~1.offset 360) .cse1) (<= (+ main_~p~1.offset 40) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 56) .cse1) .cse0 (<= (+ main_~p~1.offset 344) main_~q~1.offset) .cse2) (and (<= (+ main_~p~1.offset 336) main_~q~1.offset) .cse0 (<= (+ main_~q~1.offset 64) .cse1) .cse2) (and .cse0 (<= (+ main_~p~1.offset 296) main_~q~1.offset) (<= (+ main_~q~1.offset 104) .cse1) .cse2) (and (<= (+ main_~p~1.offset 180) main_~q~1.offset) .cse0 (<= (+ main_~q~1.offset 220) .cse1) .cse2) (and .cse0 (<= (+ main_~q~1.offset 252) .cse1) (<= (+ main_~p~1.offset 148) main_~q~1.offset) .cse2) (and .cse0 (<= (+ main_~q~1.offset 168) .cse1) (<= (+ main_~p~1.offset 232) main_~q~1.offset) .cse2) (and (<= (+ main_~q~1.offset 376) .cse1) .cse0 (<= (+ main_~p~1.offset 24) main_~q~1.offset) .cse2) (and (<= (+ main_~q~1.offset 364) .cse1) .cse0 (<= (+ main_~p~1.offset 36) main_~q~1.offset) .cse2) (and (<= (+ main_~p~1.offset 260) main_~q~1.offset) .cse0 (<= (+ main_~q~1.offset 140) .cse1) .cse2) (and (<= (+ main_~q~1.offset 332) .cse1) .cse0 .cse2 (<= (+ main_~p~1.offset 68) main_~q~1.offset)) (and .cse0 (<= (+ main_~q~1.offset 272) .cse1) .cse2 (<= (+ main_~p~1.offset 128) main_~q~1.offset)) (and .cse0 (<= (+ main_~q~1.offset 84) .cse1) (<= (+ main_~p~1.offset 316) main_~q~1.offset) .cse2) (and .cse0 (<= (+ main_~p~1.offset 120) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 280) .cse1)) (and (= main_~p~1.offset main_~q~1.offset) .cse0 .cse3 .cse2) (and (<= (+ main_~q~1.offset 172) .cse1) .cse0 (<= (+ main_~p~1.offset 228) main_~q~1.offset) .cse2) (and .cse0 (<= (+ main_~p~1.offset 12) main_~q~1.offset) (<= (+ main_~q~1.offset 388) .cse1) .cse2) (and .cse0 (<= (+ main_~q~1.offset 380) .cse1) (<= (+ main_~p~1.offset 20) main_~q~1.offset) .cse2) (and (<= (+ main_~p~1.offset 212) main_~q~1.offset) (<= (+ main_~q~1.offset 188) .cse1) .cse0 .cse2) (and (<= (+ main_~p~1.offset 256) main_~q~1.offset) .cse0 (<= (+ main_~q~1.offset 144) .cse1) .cse2) (and (<= (+ main_~p~1.offset 328) main_~q~1.offset) .cse0 .cse2 (<= (+ main_~q~1.offset 72) .cse1)) (and (<= (+ main_~q~1.offset 152) .cse1) .cse0 .cse2 (<= (+ main_~p~1.offset 248) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 348) .cse1) .cse0 .cse2 (<= (+ main_~p~1.offset 52) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 228) .cse1) .cse0 (<= (+ main_~p~1.offset 172) main_~q~1.offset) .cse2) (and .cse0 (<= (+ main_~q~1.offset 96) .cse1) (<= (+ main_~p~1.offset 304) main_~q~1.offset) .cse2) (and (<= (+ main_~p~1.offset 188) main_~q~1.offset) .cse0 (<= (+ main_~q~1.offset 212) .cse1) .cse2) (and .cse0 (<= (+ main_~p~1.offset 60) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 340) .cse1)) (let ((.cse4 (+ main_~p~1.offset 4))) (and .cse0 .cse3 (<= .cse4 main_~q~1.offset) .cse2 (<= main_~q~1.offset .cse4))) (and (<= (+ main_~p~1.offset 300) main_~q~1.offset) .cse0 (<= (+ main_~q~1.offset 100) .cse1) .cse2) (and (<= (+ main_~p~1.offset 208) main_~q~1.offset) .cse0 .cse2 (<= (+ main_~q~1.offset 192) .cse1)) (and .cse0 (<= (+ main_~q~1.offset 60) .cse1) .cse2 (<= (+ main_~p~1.offset 340) main_~q~1.offset)) (and .cse0 (<= (+ main_~p~1.offset 116) main_~q~1.offset) (<= (+ main_~q~1.offset 284) .cse1) .cse2) (and .cse0 .cse2 (<= (+ main_~p~1.offset 64) main_~q~1.offset) (<= (+ main_~q~1.offset 336) .cse1)) (and .cse0 (<= (+ main_~p~1.offset 204) main_~q~1.offset) (<= (+ main_~q~1.offset 196) .cse1) .cse2) (and .cse0 .cse2 (<= (+ main_~p~1.offset 268) main_~q~1.offset) (<= (+ main_~q~1.offset 132) .cse1)) (and (<= (+ main_~q~1.offset 248) .cse1) .cse0 .cse2 (<= (+ main_~p~1.offset 152) main_~q~1.offset)) (and .cse0 (<= (+ main_~p~1.offset 100) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 300) .cse1)) (and (<= (+ main_~q~1.offset 236) .cse1) (<= (+ main_~p~1.offset 164) main_~q~1.offset) .cse0 .cse2) (and (<= (+ main_~q~1.offset 160) .cse1) .cse0 (<= (+ main_~p~1.offset 240) main_~q~1.offset) .cse2) (and (<= (+ main_~p~1.offset 132) main_~q~1.offset) .cse0 .cse2 (<= (+ main_~q~1.offset 268) .cse1)) (and .cse0 (<= (+ main_~q~1.offset 68) .cse1) .cse2 (<= (+ main_~p~1.offset 332) main_~q~1.offset)) (and .cse0 (<= (+ main_~p~1.offset 396) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 4) .cse1)) (and .cse0 (<= (+ main_~q~1.offset 312) .cse1) .cse2 (<= (+ main_~p~1.offset 88) main_~q~1.offset)) (and .cse0 .cse2 (<= (+ main_~p~1.offset 80) main_~q~1.offset) (<= (+ main_~q~1.offset 320) .cse1)) (and (<= (+ main_~p~1.offset 8) main_~q~1.offset) .cse0 (<= (+ main_~q~1.offset 392) .cse1) .cse2) (and .cse0 (<= (+ main_~q~1.offset 200) .cse1) .cse2 (<= (+ main_~p~1.offset 200) main_~q~1.offset)) (and .cse0 (<= (+ main_~p~1.offset 92) main_~q~1.offset) (<= (+ main_~q~1.offset 308) .cse1) .cse2) (and (<= (+ main_~q~1.offset 372) .cse1) .cse0 (<= (+ main_~p~1.offset 28) main_~q~1.offset) .cse2) (and .cse0 (<= (+ main_~p~1.offset 352) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 48) .cse1)) (and .cse0 (<= (+ main_~p~1.offset 124) main_~q~1.offset) (<= (+ main_~q~1.offset 276) .cse1) .cse2) (and .cse0 (<= (+ main_~p~1.offset 264) main_~q~1.offset) (<= (+ main_~q~1.offset 136) .cse1) .cse2) (and .cse0 (<= (+ main_~p~1.offset 136) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 264) .cse1)) (and .cse0 (<= (+ main_~p~1.offset 216) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 184) .cse1)) (and .cse0 (<= (+ main_~q~1.offset 44) .cse1) .cse2 (<= (+ main_~p~1.offset 356) main_~q~1.offset)) (and .cse0 (<= (+ main_~q~1.offset 256) .cse1) (<= (+ main_~p~1.offset 144) main_~q~1.offset) .cse2) (and .cse0 (<= (+ main_~q~1.offset 12) .cse1) .cse2 (<= (+ main_~p~1.offset 388) main_~q~1.offset)) (and .cse0 (<= (+ main_~q~1.offset 356) .cse1) (<= (+ main_~p~1.offset 44) main_~q~1.offset) .cse2) (and (<= (+ main_~q~1.offset 20) .cse1) .cse0 (<= (+ main_~p~1.offset 380) main_~q~1.offset) .cse2) (and .cse0 (<= (+ main_~p~1.offset 320) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 80) .cse1)) (and (<= (+ main_~p~1.offset 392) main_~q~1.offset) .cse0 (<= (+ main_~q~1.offset 8) .cse1) .cse2) (and (<= (+ main_~p~1.offset 168) main_~q~1.offset) (<= (+ main_~q~1.offset 232) .cse1) .cse0 .cse2) (and (<= (+ main_~q~1.offset 352) .cse1) .cse0 (<= (+ main_~p~1.offset 48) main_~q~1.offset) .cse2) (and .cse0 (<= (+ main_~p~1.offset 236) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 164) .cse1)) (and (<= (+ main_~q~1.offset 384) .cse1) .cse0 .cse2 (<= (+ main_~p~1.offset 16) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 360) main_~q~1.offset) .cse0 (<= (+ main_~q~1.offset 40) .cse1) .cse2) (and (<= (+ main_~p~1.offset 244) main_~q~1.offset) .cse0 .cse2 (<= (+ main_~q~1.offset 156) .cse1)) (and .cse0 (<= (+ main_~q~1.offset 76) .cse1) (<= (+ main_~p~1.offset 324) main_~q~1.offset) .cse2) (and (<= (+ main_~q~1.offset 344) .cse1) .cse0 (<= (+ main_~p~1.offset 56) main_~q~1.offset) .cse2) (and .cse0 (<= (+ main_~q~1.offset 324) .cse1) (<= (+ main_~p~1.offset 76) main_~q~1.offset) .cse2) (and .cse0 (<= (+ main_~q~1.offset 176) .cse1) .cse2 (<= (+ main_~p~1.offset 224) main_~q~1.offset)) (and .cse0 (<= (+ main_~p~1.offset 140) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 260) .cse1)) (and .cse0 .cse2 (<= (+ main_~p~1.offset 272) main_~q~1.offset) (<= (+ main_~q~1.offset 128) .cse1)) (and .cse0 .cse2 (<= (+ main_~p~1.offset 288) main_~q~1.offset) (<= (+ main_~q~1.offset 112) .cse1)) (and (<= (+ main_~q~1.offset 240) .cse1) .cse0 (<= (+ main_~p~1.offset 160) main_~q~1.offset) .cse2) (and .cse0 (<= (+ main_~p~1.offset 276) main_~q~1.offset) (<= (+ main_~q~1.offset 124) .cse1) .cse2) (and .cse0 (<= (+ main_~p~1.offset 280) main_~q~1.offset) (<= (+ main_~q~1.offset 120) .cse1) .cse2) (and (<= (+ main_~q~1.offset 108) .cse1) .cse0 (<= (+ main_~p~1.offset 292) main_~q~1.offset) .cse2) (and .cse0 (<= (+ main_~q~1.offset 316) .cse1) (<= (+ main_~p~1.offset 84) main_~q~1.offset) .cse2) (and (<= (+ main_~p~1.offset 364) main_~q~1.offset) (<= (+ main_~q~1.offset 36) .cse1) .cse0 .cse2) (and .cse0 (<= (+ main_~p~1.offset 376) main_~q~1.offset) (<= (+ main_~q~1.offset 24) .cse1) .cse2) (and .cse0 (<= (+ main_~p~1.offset 176) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 224) .cse1)) (and (<= (+ main_~p~1.offset 312) main_~q~1.offset) .cse0 .cse2 (<= (+ main_~q~1.offset 88) .cse1)) (and (<= (+ main_~p~1.offset 72) main_~q~1.offset) .cse0 (<= (+ main_~q~1.offset 328) .cse1) .cse2) (and .cse2 (<= (+ main_~p~1.offset 400) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 148) .cse1) .cse0 (<= (+ main_~p~1.offset 252) main_~q~1.offset) .cse2) (and .cse0 .cse2 (<= (+ main_~q~1.offset 304) .cse1) (<= (+ main_~p~1.offset 96) main_~q~1.offset)) (and .cse0 (<= (+ main_~q~1.offset 116) .cse1) (<= (+ main_~p~1.offset 284) main_~q~1.offset) .cse2) (and .cse0 (<= (+ main_~p~1.offset 32) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 368) .cse1)) (and (<= (+ main_~p~1.offset 192) main_~q~1.offset) (<= (+ main_~q~1.offset 208) .cse1) .cse0 .cse2) (and .cse0 (<= (+ main_~q~1.offset 288) .cse1) .cse2 (<= (+ main_~p~1.offset 112) main_~q~1.offset)) (and .cse0 .cse2 (<= (+ main_~p~1.offset 348) main_~q~1.offset) (<= (+ main_~q~1.offset 52) .cse1)) (and (<= (+ main_~q~1.offset 16) .cse1) .cse0 (<= (+ main_~p~1.offset 384) main_~q~1.offset) .cse2) (and (<= (+ main_~q~1.offset 180) .cse1) .cse0 (<= (+ main_~p~1.offset 220) main_~q~1.offset) .cse2) (and .cse0 (<= (+ main_~p~1.offset 308) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 92) .cse1)) (and .cse0 (<= (+ main_~q~1.offset 292) .cse1) .cse2 (<= (+ main_~p~1.offset 108) main_~q~1.offset)) (and .cse0 (<= (+ main_~p~1.offset 368) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 32) .cse1)) (and .cse0 (<= (+ main_~q~1.offset 296) .cse1) (<= (+ main_~p~1.offset 104) main_~q~1.offset) .cse2) (and .cse0 (<= (+ main_~p~1.offset 156) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 244) .cse1))))) [2018-07-23 15:35:58,270 INFO L421 ceAbstractionStarter]: For program point L9(line 9) no Hoare annotation was computed. [2018-07-23 15:35:58,270 INFO L417 ceAbstractionStarter]: At program point mainErr0RequiresViolationPRE_CONDITION(lines 16 58) the Hoare annotation is: false [2018-07-23 15:35:58,270 INFO L424 ceAbstractionStarter]: At program point mainEXIT(lines 1 34) the Hoare annotation is: true [2018-07-23 15:35:58,271 INFO L417 ceAbstractionStarter]: At program point mainENTRY(lines 1 34) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-07-23 15:35:58,275 INFO L417 ceAbstractionStarter]: At program point L16(line 16) the Hoare annotation is: (let ((.cse5 (select |#length| main_~q~1.base))) (let ((.cse3 (= 400 .cse5)) (.cse0 (= main_~p~1.offset 0)) (.cse2 (select |#valid| main_~q~1.base)) (.cse1 (+ main_~p~1.offset .cse5))) (or (and .cse0 (<= (+ main_~p~1.offset 372) main_~q~1.offset) (<= (+ main_~q~1.offset 28) .cse1) .cse2) (and (<= (+ main_~p~1.offset 184) main_~q~1.offset) (<= (+ main_~q~1.offset 216) .cse1) .cse0 .cse2) (and .cse0 .cse2 (<= (+ main_~q~1.offset 204) .cse1) (<= (+ main_~p~1.offset 196) main_~q~1.offset)) (and .cse0 .cse2 (<= (+ main_~q~1.offset 360) .cse1) (<= (+ main_~p~1.offset 40) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 56) .cse1) .cse0 (<= (+ main_~p~1.offset 344) main_~q~1.offset) .cse2) (and (<= (+ main_~p~1.offset 336) main_~q~1.offset) .cse0 (<= (+ main_~q~1.offset 64) .cse1) .cse2) (and .cse0 (<= (+ main_~p~1.offset 296) main_~q~1.offset) (<= (+ main_~q~1.offset 104) .cse1) .cse2) (and (<= (+ main_~p~1.offset 180) main_~q~1.offset) .cse0 (<= (+ main_~q~1.offset 220) .cse1) .cse2) (and .cse0 (<= (+ main_~q~1.offset 252) .cse1) (<= (+ main_~p~1.offset 148) main_~q~1.offset) .cse2) (and .cse0 (<= (+ main_~q~1.offset 168) .cse1) (<= (+ main_~p~1.offset 232) main_~q~1.offset) .cse2) (and (<= (+ main_~q~1.offset 376) .cse1) .cse0 (<= (+ main_~p~1.offset 24) main_~q~1.offset) .cse2) (and (<= (+ main_~q~1.offset 364) .cse1) .cse0 (<= (+ main_~p~1.offset 36) main_~q~1.offset) .cse2) (and (<= (+ main_~p~1.offset 260) main_~q~1.offset) .cse0 (<= (+ main_~q~1.offset 140) .cse1) .cse2) (and (<= (+ main_~q~1.offset 332) .cse1) .cse0 .cse2 (<= (+ main_~p~1.offset 68) main_~q~1.offset)) (and .cse0 (<= (+ main_~q~1.offset 272) .cse1) .cse2 (<= (+ main_~p~1.offset 128) main_~q~1.offset)) (and .cse0 (<= (+ main_~q~1.offset 84) .cse1) (<= (+ main_~p~1.offset 316) main_~q~1.offset) .cse2) (and .cse0 (<= (+ main_~p~1.offset 120) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 280) .cse1)) (and (= main_~p~1.offset main_~q~1.offset) .cse0 .cse3 .cse2) (and (<= (+ main_~q~1.offset 172) .cse1) .cse0 (<= (+ main_~p~1.offset 228) main_~q~1.offset) .cse2) (and .cse0 (<= (+ main_~p~1.offset 12) main_~q~1.offset) (<= (+ main_~q~1.offset 388) .cse1) .cse2) (and .cse0 (<= (+ main_~q~1.offset 380) .cse1) (<= (+ main_~p~1.offset 20) main_~q~1.offset) .cse2) (and (<= (+ main_~p~1.offset 212) main_~q~1.offset) (<= (+ main_~q~1.offset 188) .cse1) .cse0 .cse2) (and (<= (+ main_~p~1.offset 256) main_~q~1.offset) .cse0 (<= (+ main_~q~1.offset 144) .cse1) .cse2) (and (<= (+ main_~p~1.offset 328) main_~q~1.offset) .cse0 .cse2 (<= (+ main_~q~1.offset 72) .cse1)) (and (<= (+ main_~q~1.offset 152) .cse1) .cse0 .cse2 (<= (+ main_~p~1.offset 248) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 348) .cse1) .cse0 .cse2 (<= (+ main_~p~1.offset 52) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 228) .cse1) .cse0 (<= (+ main_~p~1.offset 172) main_~q~1.offset) .cse2) (and .cse0 (<= (+ main_~q~1.offset 96) .cse1) (<= (+ main_~p~1.offset 304) main_~q~1.offset) .cse2) (and (<= (+ main_~p~1.offset 188) main_~q~1.offset) .cse0 (<= (+ main_~q~1.offset 212) .cse1) .cse2) (and .cse0 (<= (+ main_~p~1.offset 60) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 340) .cse1)) (let ((.cse4 (+ main_~p~1.offset 4))) (and .cse0 .cse3 (<= .cse4 main_~q~1.offset) .cse2 (<= main_~q~1.offset .cse4))) (and (<= (+ main_~p~1.offset 300) main_~q~1.offset) .cse0 (<= (+ main_~q~1.offset 100) .cse1) .cse2) (and (<= (+ main_~p~1.offset 208) main_~q~1.offset) .cse0 .cse2 (<= (+ main_~q~1.offset 192) .cse1)) (and .cse0 (<= (+ main_~q~1.offset 60) .cse1) .cse2 (<= (+ main_~p~1.offset 340) main_~q~1.offset)) (and .cse0 (<= (+ main_~p~1.offset 116) main_~q~1.offset) (<= (+ main_~q~1.offset 284) .cse1) .cse2) (and .cse0 .cse2 (<= (+ main_~p~1.offset 64) main_~q~1.offset) (<= (+ main_~q~1.offset 336) .cse1)) (and .cse0 (<= (+ main_~p~1.offset 204) main_~q~1.offset) (<= (+ main_~q~1.offset 196) .cse1) .cse2) (and .cse0 .cse2 (<= (+ main_~p~1.offset 268) main_~q~1.offset) (<= (+ main_~q~1.offset 132) .cse1)) (and (<= (+ main_~q~1.offset 248) .cse1) .cse0 .cse2 (<= (+ main_~p~1.offset 152) main_~q~1.offset)) (and .cse0 (<= (+ main_~p~1.offset 100) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 300) .cse1)) (and (<= (+ main_~q~1.offset 236) .cse1) (<= (+ main_~p~1.offset 164) main_~q~1.offset) .cse0 .cse2) (and (<= (+ main_~q~1.offset 160) .cse1) .cse0 (<= (+ main_~p~1.offset 240) main_~q~1.offset) .cse2) (and (<= (+ main_~p~1.offset 132) main_~q~1.offset) .cse0 .cse2 (<= (+ main_~q~1.offset 268) .cse1)) (and .cse0 (<= (+ main_~q~1.offset 68) .cse1) .cse2 (<= (+ main_~p~1.offset 332) main_~q~1.offset)) (and .cse0 (<= (+ main_~p~1.offset 396) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 4) .cse1)) (and .cse0 (<= (+ main_~q~1.offset 312) .cse1) .cse2 (<= (+ main_~p~1.offset 88) main_~q~1.offset)) (and .cse0 .cse2 (<= (+ main_~p~1.offset 80) main_~q~1.offset) (<= (+ main_~q~1.offset 320) .cse1)) (and (<= (+ main_~p~1.offset 8) main_~q~1.offset) .cse0 (<= (+ main_~q~1.offset 392) .cse1) .cse2) (and .cse0 (<= (+ main_~q~1.offset 200) .cse1) .cse2 (<= (+ main_~p~1.offset 200) main_~q~1.offset)) (and .cse0 (<= (+ main_~p~1.offset 92) main_~q~1.offset) (<= (+ main_~q~1.offset 308) .cse1) .cse2) (and (<= (+ main_~q~1.offset 372) .cse1) .cse0 (<= (+ main_~p~1.offset 28) main_~q~1.offset) .cse2) (and .cse0 (<= (+ main_~p~1.offset 352) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 48) .cse1)) (and .cse0 (<= (+ main_~p~1.offset 124) main_~q~1.offset) (<= (+ main_~q~1.offset 276) .cse1) .cse2) (and .cse0 (<= (+ main_~p~1.offset 264) main_~q~1.offset) (<= (+ main_~q~1.offset 136) .cse1) .cse2) (and .cse0 (<= (+ main_~p~1.offset 136) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 264) .cse1)) (and .cse0 (<= (+ main_~p~1.offset 216) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 184) .cse1)) (and .cse0 (<= (+ main_~q~1.offset 44) .cse1) .cse2 (<= (+ main_~p~1.offset 356) main_~q~1.offset)) (and .cse0 (<= (+ main_~q~1.offset 256) .cse1) (<= (+ main_~p~1.offset 144) main_~q~1.offset) .cse2) (and .cse0 (<= (+ main_~q~1.offset 12) .cse1) .cse2 (<= (+ main_~p~1.offset 388) main_~q~1.offset)) (and .cse0 (<= (+ main_~q~1.offset 356) .cse1) (<= (+ main_~p~1.offset 44) main_~q~1.offset) .cse2) (and (<= (+ main_~q~1.offset 20) .cse1) .cse0 (<= (+ main_~p~1.offset 380) main_~q~1.offset) .cse2) (and .cse0 (<= (+ main_~p~1.offset 320) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 80) .cse1)) (and (<= (+ main_~p~1.offset 392) main_~q~1.offset) .cse0 (<= (+ main_~q~1.offset 8) .cse1) .cse2) (and (<= (+ main_~p~1.offset 168) main_~q~1.offset) (<= (+ main_~q~1.offset 232) .cse1) .cse0 .cse2) (and (<= (+ main_~q~1.offset 352) .cse1) .cse0 (<= (+ main_~p~1.offset 48) main_~q~1.offset) .cse2) (and .cse0 (<= (+ main_~p~1.offset 236) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 164) .cse1)) (and (<= (+ main_~q~1.offset 384) .cse1) .cse0 .cse2 (<= (+ main_~p~1.offset 16) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 360) main_~q~1.offset) .cse0 (<= (+ main_~q~1.offset 40) .cse1) .cse2) (and .cse0 (<= (+ main_~q~1.offset 76) .cse1) (<= (+ main_~p~1.offset 324) main_~q~1.offset) .cse2) (and (<= (+ main_~p~1.offset 244) main_~q~1.offset) .cse0 .cse2 (<= (+ main_~q~1.offset 156) .cse1)) (and (<= (+ main_~q~1.offset 344) .cse1) .cse0 (<= (+ main_~p~1.offset 56) main_~q~1.offset) .cse2) (and .cse0 (<= (+ main_~q~1.offset 324) .cse1) (<= (+ main_~p~1.offset 76) main_~q~1.offset) .cse2) (and .cse0 (<= (+ main_~q~1.offset 176) .cse1) .cse2 (<= (+ main_~p~1.offset 224) main_~q~1.offset)) (and .cse0 (<= (+ main_~p~1.offset 140) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 260) .cse1)) (and .cse0 .cse2 (<= (+ main_~p~1.offset 272) main_~q~1.offset) (<= (+ main_~q~1.offset 128) .cse1)) (and .cse0 .cse2 (<= (+ main_~p~1.offset 288) main_~q~1.offset) (<= (+ main_~q~1.offset 112) .cse1)) (and (<= (+ main_~q~1.offset 240) .cse1) .cse0 (<= (+ main_~p~1.offset 160) main_~q~1.offset) .cse2) (and .cse0 (<= (+ main_~p~1.offset 276) main_~q~1.offset) (<= (+ main_~q~1.offset 124) .cse1) .cse2) (and .cse0 (<= (+ main_~p~1.offset 280) main_~q~1.offset) (<= (+ main_~q~1.offset 120) .cse1) .cse2) (and (<= (+ main_~q~1.offset 108) .cse1) .cse0 (<= (+ main_~p~1.offset 292) main_~q~1.offset) .cse2) (and .cse0 (<= (+ main_~q~1.offset 316) .cse1) (<= (+ main_~p~1.offset 84) main_~q~1.offset) .cse2) (and (<= (+ main_~p~1.offset 364) main_~q~1.offset) (<= (+ main_~q~1.offset 36) .cse1) .cse0 .cse2) (and .cse0 (<= (+ main_~p~1.offset 376) main_~q~1.offset) (<= (+ main_~q~1.offset 24) .cse1) .cse2) (and .cse0 (<= (+ main_~p~1.offset 176) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 224) .cse1)) (and (<= (+ main_~p~1.offset 312) main_~q~1.offset) .cse0 .cse2 (<= (+ main_~q~1.offset 88) .cse1)) (and (<= (+ main_~p~1.offset 72) main_~q~1.offset) .cse0 (<= (+ main_~q~1.offset 328) .cse1) .cse2) (and (<= (+ main_~q~1.offset 148) .cse1) .cse0 (<= (+ main_~p~1.offset 252) main_~q~1.offset) .cse2) (and .cse0 .cse2 (<= (+ main_~q~1.offset 304) .cse1) (<= (+ main_~p~1.offset 96) main_~q~1.offset)) (and .cse0 (<= (+ main_~q~1.offset 116) .cse1) (<= (+ main_~p~1.offset 284) main_~q~1.offset) .cse2) (and .cse0 (<= (+ main_~p~1.offset 32) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 368) .cse1)) (and (<= (+ main_~p~1.offset 192) main_~q~1.offset) (<= (+ main_~q~1.offset 208) .cse1) .cse0 .cse2) (and .cse0 (<= (+ main_~q~1.offset 288) .cse1) .cse2 (<= (+ main_~p~1.offset 112) main_~q~1.offset)) (and .cse0 .cse2 (<= (+ main_~p~1.offset 348) main_~q~1.offset) (<= (+ main_~q~1.offset 52) .cse1)) (and (<= (+ main_~q~1.offset 16) .cse1) .cse0 (<= (+ main_~p~1.offset 384) main_~q~1.offset) .cse2) (and (<= (+ main_~q~1.offset 180) .cse1) .cse0 (<= (+ main_~p~1.offset 220) main_~q~1.offset) .cse2) (and .cse0 (<= (+ main_~p~1.offset 308) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 92) .cse1)) (and .cse0 (<= (+ main_~q~1.offset 292) .cse1) .cse2 (<= (+ main_~p~1.offset 108) main_~q~1.offset)) (and .cse0 (<= (+ main_~p~1.offset 368) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 32) .cse1)) (and .cse0 (<= (+ main_~q~1.offset 296) .cse1) (<= (+ main_~p~1.offset 104) main_~q~1.offset) .cse2) (and .cse0 (<= (+ main_~p~1.offset 156) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 244) .cse1))))) [2018-07-23 15:35:58,280 INFO L417 ceAbstractionStarter]: At program point L15(lines 15 18) the Hoare annotation is: (let ((.cse5 (select |#length| main_~q~1.base))) (let ((.cse3 (= 400 .cse5)) (.cse0 (= main_~p~1.offset 0)) (.cse2 (select |#valid| main_~q~1.base)) (.cse1 (+ main_~p~1.offset .cse5))) (or (and .cse0 (<= (+ main_~p~1.offset 372) main_~q~1.offset) (<= (+ main_~q~1.offset 28) .cse1) .cse2) (and (<= (+ main_~p~1.offset 184) main_~q~1.offset) (<= (+ main_~q~1.offset 216) .cse1) .cse0 .cse2) (and .cse0 .cse2 (<= (+ main_~q~1.offset 204) .cse1) (<= (+ main_~p~1.offset 196) main_~q~1.offset)) (and (not |main_#t~short2|) .cse2 (<= (+ main_~p~1.offset 400) main_~q~1.offset)) (and .cse0 .cse2 (<= (+ main_~q~1.offset 360) .cse1) (<= (+ main_~p~1.offset 40) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 56) .cse1) .cse0 (<= (+ main_~p~1.offset 344) main_~q~1.offset) .cse2) (and (<= (+ main_~p~1.offset 336) main_~q~1.offset) .cse0 (<= (+ main_~q~1.offset 64) .cse1) .cse2) (and .cse0 (<= (+ main_~p~1.offset 296) main_~q~1.offset) (<= (+ main_~q~1.offset 104) .cse1) .cse2) (and (<= (+ main_~p~1.offset 180) main_~q~1.offset) .cse0 (<= (+ main_~q~1.offset 220) .cse1) .cse2) (and .cse0 (<= (+ main_~q~1.offset 252) .cse1) (<= (+ main_~p~1.offset 148) main_~q~1.offset) .cse2) (and .cse0 (<= (+ main_~q~1.offset 168) .cse1) (<= (+ main_~p~1.offset 232) main_~q~1.offset) .cse2) (and (<= (+ main_~q~1.offset 376) .cse1) .cse0 (<= (+ main_~p~1.offset 24) main_~q~1.offset) .cse2) (and (<= (+ main_~q~1.offset 364) .cse1) .cse0 (<= (+ main_~p~1.offset 36) main_~q~1.offset) .cse2) (and (<= (+ main_~p~1.offset 260) main_~q~1.offset) .cse0 (<= (+ main_~q~1.offset 140) .cse1) .cse2) (and (<= (+ main_~q~1.offset 332) .cse1) .cse0 .cse2 (<= (+ main_~p~1.offset 68) main_~q~1.offset)) (and .cse0 (<= (+ main_~q~1.offset 272) .cse1) .cse2 (<= (+ main_~p~1.offset 128) main_~q~1.offset)) (and .cse0 (<= (+ main_~q~1.offset 84) .cse1) (<= (+ main_~p~1.offset 316) main_~q~1.offset) .cse2) (and .cse0 (<= (+ main_~p~1.offset 120) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 280) .cse1)) (and (= main_~p~1.offset main_~q~1.offset) .cse0 .cse3 .cse2) (and (<= (+ main_~q~1.offset 172) .cse1) .cse0 (<= (+ main_~p~1.offset 228) main_~q~1.offset) .cse2) (and .cse0 (<= (+ main_~p~1.offset 12) main_~q~1.offset) (<= (+ main_~q~1.offset 388) .cse1) .cse2) (and .cse0 (<= (+ main_~q~1.offset 380) .cse1) (<= (+ main_~p~1.offset 20) main_~q~1.offset) .cse2) (and (<= (+ main_~p~1.offset 212) main_~q~1.offset) (<= (+ main_~q~1.offset 188) .cse1) .cse0 .cse2) (and (<= (+ main_~p~1.offset 256) main_~q~1.offset) .cse0 (<= (+ main_~q~1.offset 144) .cse1) .cse2) (and (<= (+ main_~p~1.offset 328) main_~q~1.offset) .cse0 .cse2 (<= (+ main_~q~1.offset 72) .cse1)) (and (<= (+ main_~q~1.offset 152) .cse1) .cse0 .cse2 (<= (+ main_~p~1.offset 248) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 348) .cse1) .cse0 .cse2 (<= (+ main_~p~1.offset 52) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 228) .cse1) .cse0 (<= (+ main_~p~1.offset 172) main_~q~1.offset) .cse2) (and .cse0 (<= (+ main_~q~1.offset 96) .cse1) (<= (+ main_~p~1.offset 304) main_~q~1.offset) .cse2) (and (<= (+ main_~p~1.offset 188) main_~q~1.offset) .cse0 (<= (+ main_~q~1.offset 212) .cse1) .cse2) (and .cse0 (<= (+ main_~p~1.offset 60) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 340) .cse1)) (let ((.cse4 (+ main_~p~1.offset 4))) (and .cse0 .cse3 (<= .cse4 main_~q~1.offset) .cse2 (<= main_~q~1.offset .cse4))) (and (<= (+ main_~p~1.offset 300) main_~q~1.offset) .cse0 (<= (+ main_~q~1.offset 100) .cse1) .cse2) (and (<= (+ main_~p~1.offset 208) main_~q~1.offset) .cse0 .cse2 (<= (+ main_~q~1.offset 192) .cse1)) (and .cse0 (<= (+ main_~q~1.offset 60) .cse1) .cse2 (<= (+ main_~p~1.offset 340) main_~q~1.offset)) (and .cse0 (<= (+ main_~p~1.offset 116) main_~q~1.offset) (<= (+ main_~q~1.offset 284) .cse1) .cse2) (and .cse0 .cse2 (<= (+ main_~p~1.offset 64) main_~q~1.offset) (<= (+ main_~q~1.offset 336) .cse1)) (and .cse0 (<= (+ main_~p~1.offset 204) main_~q~1.offset) (<= (+ main_~q~1.offset 196) .cse1) .cse2) (and .cse0 .cse2 (<= (+ main_~p~1.offset 268) main_~q~1.offset) (<= (+ main_~q~1.offset 132) .cse1)) (and (<= (+ main_~q~1.offset 248) .cse1) .cse0 .cse2 (<= (+ main_~p~1.offset 152) main_~q~1.offset)) (and .cse0 (<= (+ main_~p~1.offset 100) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 300) .cse1)) (and (<= (+ main_~q~1.offset 236) .cse1) (<= (+ main_~p~1.offset 164) main_~q~1.offset) .cse0 .cse2) (and (<= (+ main_~q~1.offset 160) .cse1) .cse0 (<= (+ main_~p~1.offset 240) main_~q~1.offset) .cse2) (and (<= (+ main_~p~1.offset 132) main_~q~1.offset) .cse0 .cse2 (<= (+ main_~q~1.offset 268) .cse1)) (and .cse0 (<= (+ main_~q~1.offset 68) .cse1) .cse2 (<= (+ main_~p~1.offset 332) main_~q~1.offset)) (and .cse0 (<= (+ main_~p~1.offset 396) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 4) .cse1)) (and .cse0 (<= (+ main_~q~1.offset 312) .cse1) .cse2 (<= (+ main_~p~1.offset 88) main_~q~1.offset)) (and .cse0 .cse2 (<= (+ main_~p~1.offset 80) main_~q~1.offset) (<= (+ main_~q~1.offset 320) .cse1)) (and (<= (+ main_~p~1.offset 8) main_~q~1.offset) .cse0 (<= (+ main_~q~1.offset 392) .cse1) .cse2) (and .cse0 (<= (+ main_~q~1.offset 200) .cse1) .cse2 (<= (+ main_~p~1.offset 200) main_~q~1.offset)) (and .cse0 (<= (+ main_~p~1.offset 92) main_~q~1.offset) (<= (+ main_~q~1.offset 308) .cse1) .cse2) (and (<= (+ main_~q~1.offset 372) .cse1) .cse0 (<= (+ main_~p~1.offset 28) main_~q~1.offset) .cse2) (and .cse0 (<= (+ main_~p~1.offset 352) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 48) .cse1)) (and .cse0 (<= (+ main_~p~1.offset 124) main_~q~1.offset) (<= (+ main_~q~1.offset 276) .cse1) .cse2) (and .cse0 (<= (+ main_~p~1.offset 264) main_~q~1.offset) (<= (+ main_~q~1.offset 136) .cse1) .cse2) (and .cse0 (<= (+ main_~p~1.offset 136) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 264) .cse1)) (and .cse0 (<= (+ main_~p~1.offset 216) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 184) .cse1)) (and .cse0 (<= (+ main_~q~1.offset 44) .cse1) .cse2 (<= (+ main_~p~1.offset 356) main_~q~1.offset)) (and .cse0 (<= (+ main_~q~1.offset 256) .cse1) (<= (+ main_~p~1.offset 144) main_~q~1.offset) .cse2) (and .cse0 (<= (+ main_~q~1.offset 12) .cse1) .cse2 (<= (+ main_~p~1.offset 388) main_~q~1.offset)) (and .cse0 (<= (+ main_~q~1.offset 356) .cse1) (<= (+ main_~p~1.offset 44) main_~q~1.offset) .cse2) (and (<= (+ main_~q~1.offset 20) .cse1) .cse0 (<= (+ main_~p~1.offset 380) main_~q~1.offset) .cse2) (and .cse0 (<= (+ main_~p~1.offset 320) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 80) .cse1)) (and (<= (+ main_~p~1.offset 392) main_~q~1.offset) .cse0 (<= (+ main_~q~1.offset 8) .cse1) .cse2) (and (<= (+ main_~p~1.offset 168) main_~q~1.offset) (<= (+ main_~q~1.offset 232) .cse1) .cse0 .cse2) (and (<= (+ main_~q~1.offset 352) .cse1) .cse0 (<= (+ main_~p~1.offset 48) main_~q~1.offset) .cse2) (and .cse0 (<= (+ main_~p~1.offset 236) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 164) .cse1)) (and (<= (+ main_~q~1.offset 384) .cse1) .cse0 .cse2 (<= (+ main_~p~1.offset 16) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 360) main_~q~1.offset) .cse0 (<= (+ main_~q~1.offset 40) .cse1) .cse2) (and .cse0 (<= (+ main_~q~1.offset 76) .cse1) (<= (+ main_~p~1.offset 324) main_~q~1.offset) .cse2) (and (<= (+ main_~p~1.offset 244) main_~q~1.offset) .cse0 .cse2 (<= (+ main_~q~1.offset 156) .cse1)) (and (<= (+ main_~q~1.offset 344) .cse1) .cse0 (<= (+ main_~p~1.offset 56) main_~q~1.offset) .cse2) (and .cse0 (<= (+ main_~q~1.offset 324) .cse1) (<= (+ main_~p~1.offset 76) main_~q~1.offset) .cse2) (and .cse0 (<= (+ main_~q~1.offset 176) .cse1) .cse2 (<= (+ main_~p~1.offset 224) main_~q~1.offset)) (and .cse0 (<= (+ main_~p~1.offset 140) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 260) .cse1)) (and .cse0 .cse2 (<= (+ main_~p~1.offset 272) main_~q~1.offset) (<= (+ main_~q~1.offset 128) .cse1)) (and .cse0 .cse2 (<= (+ main_~p~1.offset 288) main_~q~1.offset) (<= (+ main_~q~1.offset 112) .cse1)) (and (<= (+ main_~q~1.offset 240) .cse1) .cse0 (<= (+ main_~p~1.offset 160) main_~q~1.offset) .cse2) (and .cse0 (<= (+ main_~p~1.offset 276) main_~q~1.offset) (<= (+ main_~q~1.offset 124) .cse1) .cse2) (and .cse0 (<= (+ main_~p~1.offset 280) main_~q~1.offset) (<= (+ main_~q~1.offset 120) .cse1) .cse2) (and (<= (+ main_~q~1.offset 108) .cse1) .cse0 (<= (+ main_~p~1.offset 292) main_~q~1.offset) .cse2) (and .cse0 (<= (+ main_~q~1.offset 316) .cse1) (<= (+ main_~p~1.offset 84) main_~q~1.offset) .cse2) (and (<= (+ main_~p~1.offset 364) main_~q~1.offset) (<= (+ main_~q~1.offset 36) .cse1) .cse0 .cse2) (and .cse0 (<= (+ main_~p~1.offset 376) main_~q~1.offset) (<= (+ main_~q~1.offset 24) .cse1) .cse2) (and .cse0 (<= (+ main_~p~1.offset 176) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 224) .cse1)) (and (<= (+ main_~p~1.offset 312) main_~q~1.offset) .cse0 .cse2 (<= (+ main_~q~1.offset 88) .cse1)) (and (<= (+ main_~p~1.offset 72) main_~q~1.offset) .cse0 (<= (+ main_~q~1.offset 328) .cse1) .cse2) (and (<= (+ main_~q~1.offset 148) .cse1) .cse0 (<= (+ main_~p~1.offset 252) main_~q~1.offset) .cse2) (and .cse0 .cse2 (<= (+ main_~q~1.offset 304) .cse1) (<= (+ main_~p~1.offset 96) main_~q~1.offset)) (and .cse0 (<= (+ main_~q~1.offset 116) .cse1) (<= (+ main_~p~1.offset 284) main_~q~1.offset) .cse2) (and .cse0 (<= (+ main_~p~1.offset 32) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 368) .cse1)) (and (<= (+ main_~p~1.offset 192) main_~q~1.offset) (<= (+ main_~q~1.offset 208) .cse1) .cse0 .cse2) (and .cse0 (<= (+ main_~q~1.offset 288) .cse1) .cse2 (<= (+ main_~p~1.offset 112) main_~q~1.offset)) (and .cse0 .cse2 (<= (+ main_~p~1.offset 348) main_~q~1.offset) (<= (+ main_~q~1.offset 52) .cse1)) (and (<= (+ main_~q~1.offset 16) .cse1) .cse0 (<= (+ main_~p~1.offset 384) main_~q~1.offset) .cse2) (and (<= (+ main_~q~1.offset 180) .cse1) .cse0 (<= (+ main_~p~1.offset 220) main_~q~1.offset) .cse2) (and .cse0 (<= (+ main_~p~1.offset 308) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 92) .cse1)) (and .cse0 (<= (+ main_~q~1.offset 292) .cse1) .cse2 (<= (+ main_~p~1.offset 108) main_~q~1.offset)) (and .cse0 (<= (+ main_~p~1.offset 368) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 32) .cse1)) (and .cse0 (<= (+ main_~q~1.offset 296) .cse1) (<= (+ main_~p~1.offset 104) main_~q~1.offset) .cse2) (and .cse0 (<= (+ main_~p~1.offset 156) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 244) .cse1))))) [2018-07-23 15:35:58,280 INFO L421 ceAbstractionStarter]: For program point L16'(line 16) no Hoare annotation was computed. [2018-07-23 15:35:58,285 INFO L417 ceAbstractionStarter]: At program point L19(lines 15 27) the Hoare annotation is: (let ((.cse4 (select |#length| main_~q~1.base))) (let ((.cse3 (= 400 .cse4)) (.cse1 (= main_~p~1.offset 0)) (.cse2 (select |#valid| main_~q~1.base)) (.cse0 (+ main_~p~1.offset .cse4))) (or (and (<= (+ main_~p~1.offset 184) main_~q~1.offset) (<= (+ main_~q~1.offset 216) .cse0) .cse1 .cse2) (and .cse1 .cse2 (<= (+ main_~q~1.offset 204) .cse0) (<= (+ main_~p~1.offset 196) main_~q~1.offset)) (and .cse1 .cse2 (<= (+ main_~q~1.offset 360) .cse0) (<= (+ main_~p~1.offset 40) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 56) .cse0) .cse1 (<= (+ main_~p~1.offset 344) main_~q~1.offset) .cse2) (and (<= (+ main_~p~1.offset 336) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 64) .cse0) .cse2) (and .cse1 (<= (+ main_~p~1.offset 204) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 196) .cse0)) (and (<= (+ main_~p~1.offset 180) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 220) .cse0) .cse2) (and .cse1 (<= (+ main_~q~1.offset 380) .cse0) .cse2 (<= (+ main_~p~1.offset 20) main_~q~1.offset)) (and .cse1 (<= (+ main_~q~1.offset 168) .cse0) (<= (+ main_~p~1.offset 232) main_~q~1.offset) .cse2) (and (<= (+ main_~q~1.offset 376) .cse0) .cse1 (<= (+ main_~p~1.offset 24) main_~q~1.offset) .cse2) (and (<= (+ main_~p~1.offset 260) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 140) .cse0) .cse2) (and .cse1 .cse2 (<= (+ main_~p~1.offset 32) main_~q~1.offset) (<= (+ main_~q~1.offset 368) .cse0)) (and (<= (+ main_~q~1.offset 332) .cse0) .cse1 .cse2 (<= (+ main_~p~1.offset 68) main_~q~1.offset)) (and .cse1 (<= (+ main_~q~1.offset 272) .cse0) .cse2 (<= (+ main_~p~1.offset 128) main_~q~1.offset)) (and .cse1 (<= (+ main_~q~1.offset 84) .cse0) (<= (+ main_~p~1.offset 316) main_~q~1.offset) .cse2) (and (= main_~p~1.offset main_~q~1.offset) .cse1 .cse3 .cse2) (and .cse1 (<= (+ main_~p~1.offset 120) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 280) .cse0)) (and (<= (+ main_~q~1.offset 172) .cse0) .cse1 (<= (+ main_~p~1.offset 228) main_~q~1.offset) .cse2) (and .cse1 (<= (+ main_~p~1.offset 12) main_~q~1.offset) (<= (+ main_~q~1.offset 388) .cse0) .cse2) (and (and (<= (+ main_~q~1.offset 4) .cse4) .cse2) (<= (+ main_~p~1.offset 396) main_~q~1.offset)) (and .cse1 (<= (+ main_~p~1.offset 296) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 104) .cse0)) (and (<= (+ main_~p~1.offset 212) main_~q~1.offset) (<= (+ main_~q~1.offset 188) .cse0) .cse1 .cse2) (and (<= (+ main_~p~1.offset 256) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 144) .cse0) .cse2) (and (<= (+ main_~p~1.offset 328) main_~q~1.offset) .cse1 .cse2 (<= (+ main_~q~1.offset 72) .cse0)) (and (<= (+ main_~q~1.offset 152) .cse0) .cse1 .cse2 (<= (+ main_~p~1.offset 248) main_~q~1.offset)) (and .cse1 (<= (+ main_~p~1.offset 372) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 28) .cse0)) (and (<= (+ main_~q~1.offset 348) .cse0) .cse1 .cse2 (<= (+ main_~p~1.offset 52) main_~q~1.offset)) (and .cse1 (<= (+ main_~q~1.offset 96) .cse0) (<= (+ main_~p~1.offset 304) main_~q~1.offset) .cse2) (and (<= (+ main_~q~1.offset 228) .cse0) .cse1 (<= (+ main_~p~1.offset 172) main_~q~1.offset) .cse2) (and .cse1 .cse2 (<= (+ main_~q~1.offset 176) .cse0) (<= (+ main_~p~1.offset 224) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 188) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 212) .cse0) .cse2) (and .cse1 (<= (+ main_~p~1.offset 60) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 340) .cse0)) (let ((.cse5 (+ main_~p~1.offset 4))) (and .cse1 .cse3 (<= .cse5 main_~q~1.offset) .cse2 (<= main_~q~1.offset .cse5))) (and (<= (+ main_~p~1.offset 300) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 100) .cse0) .cse2) (and (<= (+ main_~p~1.offset 208) main_~q~1.offset) .cse1 .cse2 (<= (+ main_~q~1.offset 192) .cse0)) (and .cse1 (<= (+ main_~q~1.offset 60) .cse0) .cse2 (<= (+ main_~p~1.offset 340) main_~q~1.offset)) (and .cse1 (<= (+ main_~p~1.offset 116) main_~q~1.offset) (<= (+ main_~q~1.offset 284) .cse0) .cse2) (and (<= (+ main_~q~1.offset 364) .cse0) .cse1 .cse2 (<= (+ main_~p~1.offset 36) main_~q~1.offset)) (and .cse1 .cse2 (<= (+ main_~p~1.offset 64) main_~q~1.offset) (<= (+ main_~q~1.offset 336) .cse0)) (and .cse1 .cse2 (<= (+ main_~p~1.offset 268) main_~q~1.offset) (<= (+ main_~q~1.offset 132) .cse0)) (and (<= (+ main_~q~1.offset 248) .cse0) .cse1 .cse2 (<= (+ main_~p~1.offset 152) main_~q~1.offset)) (and .cse1 (<= (+ main_~p~1.offset 100) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 300) .cse0)) (and (<= (+ main_~q~1.offset 236) .cse0) (<= (+ main_~p~1.offset 164) main_~q~1.offset) .cse1 .cse2) (and (<= (+ main_~q~1.offset 160) .cse0) .cse1 (<= (+ main_~p~1.offset 240) main_~q~1.offset) .cse2) (and .cse1 .cse2 (<= (+ main_~q~1.offset 68) .cse0) (<= (+ main_~p~1.offset 332) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 132) main_~q~1.offset) .cse1 .cse2 (<= (+ main_~q~1.offset 268) .cse0)) (and .cse1 (<= (+ main_~q~1.offset 312) .cse0) .cse2 (<= (+ main_~p~1.offset 88) main_~q~1.offset)) (and .cse1 .cse2 (<= (+ main_~p~1.offset 80) main_~q~1.offset) (<= (+ main_~q~1.offset 320) .cse0)) (and (<= (+ main_~p~1.offset 8) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 392) .cse0) .cse2) (and .cse1 (<= (+ main_~q~1.offset 200) .cse0) .cse2 (<= (+ main_~p~1.offset 200) main_~q~1.offset)) (and .cse1 (<= (+ main_~p~1.offset 92) main_~q~1.offset) (<= (+ main_~q~1.offset 308) .cse0) .cse2) (and (<= (+ main_~q~1.offset 372) .cse0) .cse1 (<= (+ main_~p~1.offset 28) main_~q~1.offset) .cse2) (and .cse1 (<= (+ main_~p~1.offset 352) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 48) .cse0)) (and .cse1 (<= (+ main_~p~1.offset 264) main_~q~1.offset) (<= (+ main_~q~1.offset 136) .cse0) .cse2) (and .cse1 (<= (+ main_~p~1.offset 124) main_~q~1.offset) (<= (+ main_~q~1.offset 276) .cse0) .cse2) (and .cse1 (<= (+ main_~p~1.offset 136) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 264) .cse0)) (and .cse1 (<= (+ main_~q~1.offset 256) .cse0) (<= (+ main_~p~1.offset 144) main_~q~1.offset) .cse2) (and .cse1 (<= (+ main_~p~1.offset 216) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 184) .cse0)) (and .cse1 (<= (+ main_~q~1.offset 44) .cse0) .cse2 (<= (+ main_~p~1.offset 356) main_~q~1.offset)) (and .cse1 (<= (+ main_~q~1.offset 12) .cse0) .cse2 (<= (+ main_~p~1.offset 388) main_~q~1.offset)) (and .cse1 (<= (+ main_~q~1.offset 356) .cse0) (<= (+ main_~p~1.offset 44) main_~q~1.offset) .cse2) (and (<= (+ main_~q~1.offset 20) .cse0) .cse1 (<= (+ main_~p~1.offset 380) main_~q~1.offset) .cse2) (and .cse1 (<= (+ main_~p~1.offset 320) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 80) .cse0)) (and (<= (+ main_~p~1.offset 392) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 8) .cse0) .cse2) (and (<= (+ main_~p~1.offset 168) main_~q~1.offset) (<= (+ main_~q~1.offset 232) .cse0) .cse1 .cse2) (and (<= (+ main_~q~1.offset 352) .cse0) .cse1 (<= (+ main_~p~1.offset 48) main_~q~1.offset) .cse2) (and .cse1 (<= (+ main_~p~1.offset 236) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 164) .cse0)) (and (<= (+ main_~q~1.offset 384) .cse0) .cse1 .cse2 (<= (+ main_~p~1.offset 16) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 244) main_~q~1.offset) .cse1 .cse2 (<= (+ main_~q~1.offset 156) .cse0)) (and .cse1 (<= (+ main_~q~1.offset 76) .cse0) (<= (+ main_~p~1.offset 324) main_~q~1.offset) .cse2) (and .cse1 (<= (+ main_~q~1.offset 252) .cse0) .cse2 (<= (+ main_~p~1.offset 148) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 344) .cse0) .cse1 (<= (+ main_~p~1.offset 56) main_~q~1.offset) .cse2) (and .cse1 (<= (+ main_~q~1.offset 324) .cse0) (<= (+ main_~p~1.offset 76) main_~q~1.offset) .cse2) (and .cse1 (<= (+ main_~p~1.offset 140) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 260) .cse0)) (and .cse1 .cse2 (<= (+ main_~p~1.offset 272) main_~q~1.offset) (<= (+ main_~q~1.offset 128) .cse0)) (and .cse1 .cse2 (<= (+ main_~p~1.offset 288) main_~q~1.offset) (<= (+ main_~q~1.offset 112) .cse0)) (and (<= (+ main_~q~1.offset 240) .cse0) .cse1 (<= (+ main_~p~1.offset 160) main_~q~1.offset) .cse2) (and .cse1 (<= (+ main_~p~1.offset 276) main_~q~1.offset) (<= (+ main_~q~1.offset 124) .cse0) .cse2) (and .cse1 (<= (+ main_~p~1.offset 280) main_~q~1.offset) (<= (+ main_~q~1.offset 120) .cse0) .cse2) (and (<= (+ main_~q~1.offset 180) .cse0) .cse1 .cse2 (<= (+ main_~p~1.offset 220) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 108) .cse0) .cse1 (<= (+ main_~p~1.offset 292) main_~q~1.offset) .cse2) (and .cse1 (<= (+ main_~p~1.offset 376) main_~q~1.offset) (<= (+ main_~q~1.offset 24) .cse0) .cse2) (and .cse1 (<= (+ main_~q~1.offset 316) .cse0) (<= (+ main_~p~1.offset 84) main_~q~1.offset) .cse2) (and (<= (+ main_~p~1.offset 364) main_~q~1.offset) (<= (+ main_~q~1.offset 36) .cse0) .cse1 .cse2) (and .cse1 (<= (+ main_~p~1.offset 176) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 224) .cse0)) (and (<= (+ main_~p~1.offset 312) main_~q~1.offset) .cse1 .cse2 (<= (+ main_~q~1.offset 88) .cse0)) (and .cse1 .cse2 (<= (+ main_~p~1.offset 368) main_~q~1.offset) (<= (+ main_~q~1.offset 32) .cse0)) (and (<= (+ main_~p~1.offset 72) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 328) .cse0) .cse2) (and (<= (+ main_~q~1.offset 148) .cse0) .cse1 (<= (+ main_~p~1.offset 252) main_~q~1.offset) .cse2) (and .cse1 (<= (+ main_~q~1.offset 116) .cse0) (<= (+ main_~p~1.offset 284) main_~q~1.offset) .cse2) (and (<= (+ main_~p~1.offset 192) main_~q~1.offset) (<= (+ main_~q~1.offset 208) .cse0) .cse1 .cse2) (and .cse1 .cse2 (<= (+ main_~q~1.offset 304) .cse0) (<= (+ main_~p~1.offset 96) main_~q~1.offset)) (and (not |main_#t~short2|) .cse2) (and .cse1 (<= (+ main_~q~1.offset 288) .cse0) .cse2 (<= (+ main_~p~1.offset 112) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 16) .cse0) .cse1 (<= (+ main_~p~1.offset 384) main_~q~1.offset) .cse2) (and (<= (+ main_~p~1.offset 360) main_~q~1.offset) .cse1 .cse2 (<= (+ main_~q~1.offset 40) .cse0)) (and .cse1 .cse2 (<= (+ main_~p~1.offset 348) main_~q~1.offset) (<= (+ main_~q~1.offset 52) .cse0)) (and .cse1 (<= (+ main_~p~1.offset 308) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 92) .cse0)) (and .cse1 (<= (+ main_~q~1.offset 292) .cse0) .cse2 (<= (+ main_~p~1.offset 108) main_~q~1.offset)) (and .cse1 (<= (+ main_~q~1.offset 296) .cse0) (<= (+ main_~p~1.offset 104) main_~q~1.offset) .cse2) (and .cse1 (<= (+ main_~p~1.offset 156) main_~q~1.offset) .cse2 (<= (+ main_~q~1.offset 244) .cse0))))) [2018-07-23 15:35:58,285 INFO L424 ceAbstractionStarter]: At program point L12'(lines 12 31) the Hoare annotation is: true [2018-07-23 15:35:58,342 INFO L202 PluginConnector]: Adding new model PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 03:35:58 BoogieIcfgContainer [2018-07-23 15:35:58,343 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-23 15:35:58,349 INFO L168 Benchmark]: Toolchain (without parser) took 112553.33 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 3.3 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-07-23 15:35:58,350 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.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-23 15:35:58,351 INFO L168 Benchmark]: Boogie Preprocessor took 73.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-23 15:35:58,351 INFO L168 Benchmark]: RCFGBuilder took 342.45 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-23 15:35:58,352 INFO L168 Benchmark]: TraceAbstraction took 112131.12 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 3.3 GB in the end (delta: -1.9 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-07-23 15:35:58,355 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 73.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. * RCFGBuilder took 342.45 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 112131.12 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 3.3 GB in the end (delta: -1.9 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 16]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 16]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((~p~1!offset == 0 && ~p~1!offset + 372 <= ~q~1!offset) && ~q~1!offset + 28 <= ~p~1!offset + #length[~q~1!base]) && #valid[~q~1!base]) || (((~p~1!offset + 184 <= ~q~1!offset && ~q~1!offset + 216 <= ~p~1!offset + #length[~q~1!base]) && ~p~1!offset == 0) && #valid[~q~1!base])) || (((~p~1!offset == 0 && #valid[~q~1!base]) && ~q~1!offset + 204 <= ~p~1!offset + #length[~q~1!base]) && ~p~1!offset + 196 <= ~q~1!offset)) || (((~p~1!offset == 0 && #valid[~q~1!base]) && ~q~1!offset + 360 <= ~p~1!offset + #length[~q~1!base]) && ~p~1!offset + 40 <= ~q~1!offset)) || (((~q~1!offset + 56 <= ~p~1!offset + #length[~q~1!base] && ~p~1!offset == 0) && ~p~1!offset + 344 <= ~q~1!offset) && #valid[~q~1!base])) || (((~p~1!offset + 336 <= ~q~1!offset && ~p~1!offset == 0) && ~q~1!offset + 64 <= ~p~1!offset + #length[~q~1!base]) && #valid[~q~1!base])) || (((~p~1!offset == 0 && ~p~1!offset + 296 <= ~q~1!offset) && ~q~1!offset + 104 <= ~p~1!offset + #length[~q~1!base]) && #valid[~q~1!base])) || (((~p~1!offset + 180 <= ~q~1!offset && ~p~1!offset == 0) && ~q~1!offset + 220 <= ~p~1!offset + #length[~q~1!base]) && #valid[~q~1!base])) || (((~p~1!offset == 0 && ~q~1!offset + 252 <= ~p~1!offset + #length[~q~1!base]) && ~p~1!offset + 148 <= ~q~1!offset) && #valid[~q~1!base])) || (((~p~1!offset == 0 && ~q~1!offset + 168 <= ~p~1!offset + #length[~q~1!base]) && ~p~1!offset + 232 <= ~q~1!offset) && #valid[~q~1!base])) || (((~q~1!offset + 376 <= ~p~1!offset + #length[~q~1!base] && ~p~1!offset == 0) && ~p~1!offset + 24 <= ~q~1!offset) && #valid[~q~1!base])) || (((~q~1!offset + 364 <= ~p~1!offset + #length[~q~1!base] && ~p~1!offset == 0) && ~p~1!offset + 36 <= ~q~1!offset) && #valid[~q~1!base])) || (((~p~1!offset + 260 <= ~q~1!offset && ~p~1!offset == 0) && ~q~1!offset + 140 <= ~p~1!offset + #length[~q~1!base]) && #valid[~q~1!base])) || (((~q~1!offset + 332 <= ~p~1!offset + #length[~q~1!base] && ~p~1!offset == 0) && #valid[~q~1!base]) && ~p~1!offset + 68 <= ~q~1!offset)) || (((~p~1!offset == 0 && ~q~1!offset + 272 <= ~p~1!offset + #length[~q~1!base]) && #valid[~q~1!base]) && ~p~1!offset + 128 <= ~q~1!offset)) || (((~p~1!offset == 0 && ~q~1!offset + 84 <= ~p~1!offset + #length[~q~1!base]) && ~p~1!offset + 316 <= ~q~1!offset) && #valid[~q~1!base])) || (((~p~1!offset == 0 && ~p~1!offset + 120 <= ~q~1!offset) && #valid[~q~1!base]) && ~q~1!offset + 280 <= ~p~1!offset + #length[~q~1!base])) || (((~p~1!offset == ~q~1!offset && ~p~1!offset == 0) && 400 == #length[~q~1!base]) && #valid[~q~1!base])) || (((~q~1!offset + 172 <= ~p~1!offset + #length[~q~1!base] && ~p~1!offset == 0) && ~p~1!offset + 228 <= ~q~1!offset) && #valid[~q~1!base])) || (((~p~1!offset == 0 && ~p~1!offset + 12 <= ~q~1!offset) && ~q~1!offset + 388 <= ~p~1!offset + #length[~q~1!base]) && #valid[~q~1!base])) || (((~p~1!offset == 0 && ~q~1!offset + 380 <= ~p~1!offset + #length[~q~1!base]) && ~p~1!offset + 20 <= ~q~1!offset) && #valid[~q~1!base])) || (((~p~1!offset + 212 <= ~q~1!offset && ~q~1!offset + 188 <= ~p~1!offset + #length[~q~1!base]) && ~p~1!offset == 0) && #valid[~q~1!base])) || (((~p~1!offset + 256 <= ~q~1!offset && ~p~1!offset == 0) && ~q~1!offset + 144 <= ~p~1!offset + #length[~q~1!base]) && #valid[~q~1!base])) || (((~p~1!offset + 328 <= ~q~1!offset && ~p~1!offset == 0) && #valid[~q~1!base]) && ~q~1!offset + 72 <= ~p~1!offset + #length[~q~1!base])) || (((~q~1!offset + 152 <= ~p~1!offset + #length[~q~1!base] && ~p~1!offset == 0) && #valid[~q~1!base]) && ~p~1!offset + 248 <= ~q~1!offset)) || (((~q~1!offset + 348 <= ~p~1!offset + #length[~q~1!base] && ~p~1!offset == 0) && #valid[~q~1!base]) && ~p~1!offset + 52 <= ~q~1!offset)) || (((~q~1!offset + 228 <= ~p~1!offset + #length[~q~1!base] && ~p~1!offset == 0) && ~p~1!offset + 172 <= ~q~1!offset) && #valid[~q~1!base])) || (((~p~1!offset == 0 && ~q~1!offset + 96 <= ~p~1!offset + #length[~q~1!base]) && ~p~1!offset + 304 <= ~q~1!offset) && #valid[~q~1!base])) || (((~p~1!offset + 188 <= ~q~1!offset && ~p~1!offset == 0) && ~q~1!offset + 212 <= ~p~1!offset + #length[~q~1!base]) && #valid[~q~1!base])) || (((~p~1!offset == 0 && ~p~1!offset + 60 <= ~q~1!offset) && #valid[~q~1!base]) && ~q~1!offset + 340 <= ~p~1!offset + #length[~q~1!base])) || ((((~p~1!offset == 0 && 400 == #length[~q~1!base]) && ~p~1!offset + 4 <= ~q~1!offset) && #valid[~q~1!base]) && ~q~1!offset <= ~p~1!offset + 4)) || (((~p~1!offset + 300 <= ~q~1!offset && ~p~1!offset == 0) && ~q~1!offset + 100 <= ~p~1!offset + #length[~q~1!base]) && #valid[~q~1!base])) || (((~p~1!offset + 208 <= ~q~1!offset && ~p~1!offset == 0) && #valid[~q~1!base]) && ~q~1!offset + 192 <= ~p~1!offset + #length[~q~1!base])) || (((~p~1!offset == 0 && ~q~1!offset + 60 <= ~p~1!offset + #length[~q~1!base]) && #valid[~q~1!base]) && ~p~1!offset + 340 <= ~q~1!offset)) || (((~p~1!offset == 0 && ~p~1!offset + 116 <= ~q~1!offset) && ~q~1!offset + 284 <= ~p~1!offset + #length[~q~1!base]) && #valid[~q~1!base])) || (((~p~1!offset == 0 && #valid[~q~1!base]) && ~p~1!offset + 64 <= ~q~1!offset) && ~q~1!offset + 336 <= ~p~1!offset + #length[~q~1!base])) || (((~p~1!offset == 0 && ~p~1!offset + 204 <= ~q~1!offset) && ~q~1!offset + 196 <= ~p~1!offset + #length[~q~1!base]) && #valid[~q~1!base])) || (((~p~1!offset == 0 && #valid[~q~1!base]) && ~p~1!offset + 268 <= ~q~1!offset) && ~q~1!offset + 132 <= ~p~1!offset + #length[~q~1!base])) || (((~q~1!offset + 248 <= ~p~1!offset + #length[~q~1!base] && ~p~1!offset == 0) && #valid[~q~1!base]) && ~p~1!offset + 152 <= ~q~1!offset)) || (((~p~1!offset == 0 && ~p~1!offset + 100 <= ~q~1!offset) && #valid[~q~1!base]) && ~q~1!offset + 300 <= ~p~1!offset + #length[~q~1!base])) || (((~q~1!offset + 236 <= ~p~1!offset + #length[~q~1!base] && ~p~1!offset + 164 <= ~q~1!offset) && ~p~1!offset == 0) && #valid[~q~1!base])) || (((~q~1!offset + 160 <= ~p~1!offset + #length[~q~1!base] && ~p~1!offset == 0) && ~p~1!offset + 240 <= ~q~1!offset) && #valid[~q~1!base])) || (((~p~1!offset + 132 <= ~q~1!offset && ~p~1!offset == 0) && #valid[~q~1!base]) && ~q~1!offset + 268 <= ~p~1!offset + #length[~q~1!base])) || (((~p~1!offset == 0 && ~q~1!offset + 68 <= ~p~1!offset + #length[~q~1!base]) && #valid[~q~1!base]) && ~p~1!offset + 332 <= ~q~1!offset)) || (((~p~1!offset == 0 && ~p~1!offset + 396 <= ~q~1!offset) && #valid[~q~1!base]) && ~q~1!offset + 4 <= ~p~1!offset + #length[~q~1!base])) || (((~p~1!offset == 0 && ~q~1!offset + 312 <= ~p~1!offset + #length[~q~1!base]) && #valid[~q~1!base]) && ~p~1!offset + 88 <= ~q~1!offset)) || (((~p~1!offset == 0 && #valid[~q~1!base]) && ~p~1!offset + 80 <= ~q~1!offset) && ~q~1!offset + 320 <= ~p~1!offset + #length[~q~1!base])) || (((~p~1!offset + 8 <= ~q~1!offset && ~p~1!offset == 0) && ~q~1!offset + 392 <= ~p~1!offset + #length[~q~1!base]) && #valid[~q~1!base])) || (((~p~1!offset == 0 && ~q~1!offset + 200 <= ~p~1!offset + #length[~q~1!base]) && #valid[~q~1!base]) && ~p~1!offset + 200 <= ~q~1!offset)) || (((~p~1!offset == 0 && ~p~1!offset + 92 <= ~q~1!offset) && ~q~1!offset + 308 <= ~p~1!offset + #length[~q~1!base]) && #valid[~q~1!base])) || (((~q~1!offset + 372 <= ~p~1!offset + #length[~q~1!base] && ~p~1!offset == 0) && ~p~1!offset + 28 <= ~q~1!offset) && #valid[~q~1!base])) || (((~p~1!offset == 0 && ~p~1!offset + 352 <= ~q~1!offset) && #valid[~q~1!base]) && ~q~1!offset + 48 <= ~p~1!offset + #length[~q~1!base])) || (((~p~1!offset == 0 && ~p~1!offset + 124 <= ~q~1!offset) && ~q~1!offset + 276 <= ~p~1!offset + #length[~q~1!base]) && #valid[~q~1!base])) || (((~p~1!offset == 0 && ~p~1!offset + 264 <= ~q~1!offset) && ~q~1!offset + 136 <= ~p~1!offset + #length[~q~1!base]) && #valid[~q~1!base])) || (((~p~1!offset == 0 && ~p~1!offset + 136 <= ~q~1!offset) && #valid[~q~1!base]) && ~q~1!offset + 264 <= ~p~1!offset + #length[~q~1!base])) || (((~p~1!offset == 0 && ~p~1!offset + 216 <= ~q~1!offset) && #valid[~q~1!base]) && ~q~1!offset + 184 <= ~p~1!offset + #length[~q~1!base])) || (((~p~1!offset == 0 && ~q~1!offset + 44 <= ~p~1!offset + #length[~q~1!base]) && #valid[~q~1!base]) && ~p~1!offset + 356 <= ~q~1!offset)) || (((~p~1!offset == 0 && ~q~1!offset + 256 <= ~p~1!offset + #length[~q~1!base]) && ~p~1!offset + 144 <= ~q~1!offset) && #valid[~q~1!base])) || (((~p~1!offset == 0 && ~q~1!offset + 12 <= ~p~1!offset + #length[~q~1!base]) && #valid[~q~1!base]) && ~p~1!offset + 388 <= ~q~1!offset)) || (((~p~1!offset == 0 && ~q~1!offset + 356 <= ~p~1!offset + #length[~q~1!base]) && ~p~1!offset + 44 <= ~q~1!offset) && #valid[~q~1!base])) || (((~q~1!offset + 20 <= ~p~1!offset + #length[~q~1!base] && ~p~1!offset == 0) && ~p~1!offset + 380 <= ~q~1!offset) && #valid[~q~1!base])) || (((~p~1!offset == 0 && ~p~1!offset + 320 <= ~q~1!offset) && #valid[~q~1!base]) && ~q~1!offset + 80 <= ~p~1!offset + #length[~q~1!base])) || (((~p~1!offset + 392 <= ~q~1!offset && ~p~1!offset == 0) && ~q~1!offset + 8 <= ~p~1!offset + #length[~q~1!base]) && #valid[~q~1!base])) || (((~p~1!offset + 168 <= ~q~1!offset && ~q~1!offset + 232 <= ~p~1!offset + #length[~q~1!base]) && ~p~1!offset == 0) && #valid[~q~1!base])) || (((~q~1!offset + 352 <= ~p~1!offset + #length[~q~1!base] && ~p~1!offset == 0) && ~p~1!offset + 48 <= ~q~1!offset) && #valid[~q~1!base])) || (((~p~1!offset == 0 && ~p~1!offset + 236 <= ~q~1!offset) && #valid[~q~1!base]) && ~q~1!offset + 164 <= ~p~1!offset + #length[~q~1!base])) || (((~q~1!offset + 384 <= ~p~1!offset + #length[~q~1!base] && ~p~1!offset == 0) && #valid[~q~1!base]) && ~p~1!offset + 16 <= ~q~1!offset)) || (((~p~1!offset + 360 <= ~q~1!offset && ~p~1!offset == 0) && ~q~1!offset + 40 <= ~p~1!offset + #length[~q~1!base]) && #valid[~q~1!base])) || (((~p~1!offset + 244 <= ~q~1!offset && ~p~1!offset == 0) && #valid[~q~1!base]) && ~q~1!offset + 156 <= ~p~1!offset + #length[~q~1!base])) || (((~p~1!offset == 0 && ~q~1!offset + 76 <= ~p~1!offset + #length[~q~1!base]) && ~p~1!offset + 324 <= ~q~1!offset) && #valid[~q~1!base])) || (((~q~1!offset + 344 <= ~p~1!offset + #length[~q~1!base] && ~p~1!offset == 0) && ~p~1!offset + 56 <= ~q~1!offset) && #valid[~q~1!base])) || (((~p~1!offset == 0 && ~q~1!offset + 324 <= ~p~1!offset + #length[~q~1!base]) && ~p~1!offset + 76 <= ~q~1!offset) && #valid[~q~1!base])) || (((~p~1!offset == 0 && ~q~1!offset + 176 <= ~p~1!offset + #length[~q~1!base]) && #valid[~q~1!base]) && ~p~1!offset + 224 <= ~q~1!offset)) || (((~p~1!offset == 0 && ~p~1!offset + 140 <= ~q~1!offset) && #valid[~q~1!base]) && ~q~1!offset + 260 <= ~p~1!offset + #length[~q~1!base])) || (((~p~1!offset == 0 && #valid[~q~1!base]) && ~p~1!offset + 272 <= ~q~1!offset) && ~q~1!offset + 128 <= ~p~1!offset + #length[~q~1!base])) || (((~p~1!offset == 0 && #valid[~q~1!base]) && ~p~1!offset + 288 <= ~q~1!offset) && ~q~1!offset + 112 <= ~p~1!offset + #length[~q~1!base])) || (((~q~1!offset + 240 <= ~p~1!offset + #length[~q~1!base] && ~p~1!offset == 0) && ~p~1!offset + 160 <= ~q~1!offset) && #valid[~q~1!base])) || (((~p~1!offset == 0 && ~p~1!offset + 276 <= ~q~1!offset) && ~q~1!offset + 124 <= ~p~1!offset + #length[~q~1!base]) && #valid[~q~1!base])) || (((~p~1!offset == 0 && ~p~1!offset + 280 <= ~q~1!offset) && ~q~1!offset + 120 <= ~p~1!offset + #length[~q~1!base]) && #valid[~q~1!base])) || (((~q~1!offset + 108 <= ~p~1!offset + #length[~q~1!base] && ~p~1!offset == 0) && ~p~1!offset + 292 <= ~q~1!offset) && #valid[~q~1!base])) || (((~p~1!offset == 0 && ~q~1!offset + 316 <= ~p~1!offset + #length[~q~1!base]) && ~p~1!offset + 84 <= ~q~1!offset) && #valid[~q~1!base])) || (((~p~1!offset + 364 <= ~q~1!offset && ~q~1!offset + 36 <= ~p~1!offset + #length[~q~1!base]) && ~p~1!offset == 0) && #valid[~q~1!base])) || (((~p~1!offset == 0 && ~p~1!offset + 376 <= ~q~1!offset) && ~q~1!offset + 24 <= ~p~1!offset + #length[~q~1!base]) && #valid[~q~1!base])) || (((~p~1!offset == 0 && ~p~1!offset + 176 <= ~q~1!offset) && #valid[~q~1!base]) && ~q~1!offset + 224 <= ~p~1!offset + #length[~q~1!base])) || (((~p~1!offset + 312 <= ~q~1!offset && ~p~1!offset == 0) && #valid[~q~1!base]) && ~q~1!offset + 88 <= ~p~1!offset + #length[~q~1!base])) || (((~p~1!offset + 72 <= ~q~1!offset && ~p~1!offset == 0) && ~q~1!offset + 328 <= ~p~1!offset + #length[~q~1!base]) && #valid[~q~1!base])) || (#valid[~q~1!base] && ~p~1!offset + 400 <= ~q~1!offset)) || (((~q~1!offset + 148 <= ~p~1!offset + #length[~q~1!base] && ~p~1!offset == 0) && ~p~1!offset + 252 <= ~q~1!offset) && #valid[~q~1!base])) || (((~p~1!offset == 0 && #valid[~q~1!base]) && ~q~1!offset + 304 <= ~p~1!offset + #length[~q~1!base]) && ~p~1!offset + 96 <= ~q~1!offset)) || (((~p~1!offset == 0 && ~q~1!offset + 116 <= ~p~1!offset + #length[~q~1!base]) && ~p~1!offset + 284 <= ~q~1!offset) && #valid[~q~1!base])) || (((~p~1!offset == 0 && ~p~1!offset + 32 <= ~q~1!offset) && #valid[~q~1!base]) && ~q~1!offset + 368 <= ~p~1!offset + #length[~q~1!base])) || (((~p~1!offset + 192 <= ~q~1!offset && ~q~1!offset + 208 <= ~p~1!offset + #length[~q~1!base]) && ~p~1!offset == 0) && #valid[~q~1!base])) || (((~p~1!offset == 0 && ~q~1!offset + 288 <= ~p~1!offset + #length[~q~1!base]) && #valid[~q~1!base]) && ~p~1!offset + 112 <= ~q~1!offset)) || (((~p~1!offset == 0 && #valid[~q~1!base]) && ~p~1!offset + 348 <= ~q~1!offset) && ~q~1!offset + 52 <= ~p~1!offset + #length[~q~1!base])) || (((~q~1!offset + 16 <= ~p~1!offset + #length[~q~1!base] && ~p~1!offset == 0) && ~p~1!offset + 384 <= ~q~1!offset) && #valid[~q~1!base])) || (((~q~1!offset + 180 <= ~p~1!offset + #length[~q~1!base] && ~p~1!offset == 0) && ~p~1!offset + 220 <= ~q~1!offset) && #valid[~q~1!base])) || (((~p~1!offset == 0 && ~p~1!offset + 308 <= ~q~1!offset) && #valid[~q~1!base]) && ~q~1!offset + 92 <= ~p~1!offset + #length[~q~1!base])) || (((~p~1!offset == 0 && ~q~1!offset + 292 <= ~p~1!offset + #length[~q~1!base]) && #valid[~q~1!base]) && ~p~1!offset + 108 <= ~q~1!offset)) || (((~p~1!offset == 0 && ~p~1!offset + 368 <= ~q~1!offset) && #valid[~q~1!base]) && ~q~1!offset + 32 <= ~p~1!offset + #length[~q~1!base])) || (((~p~1!offset == 0 && ~q~1!offset + 296 <= ~p~1!offset + #length[~q~1!base]) && ~p~1!offset + 104 <= ~q~1!offset) && #valid[~q~1!base])) || (((~p~1!offset == 0 && ~p~1!offset + 156 <= ~q~1!offset) && #valid[~q~1!base]) && ~q~1!offset + 244 <= ~p~1!offset + #length[~q~1!base]) - ProcedureContractResult [Line: 1]: Procedure Contract for main Derived contract for procedure main: true - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 19 locations, 2 error locations. SAFE Result, 112.0s OverallTime, 103 OverallIterations, 101 TraceHistogramMax, 24.4s AutomataDifference, 0.0s DeadEndRemovalTime, 15.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 623 SDtfs, 15829 SDslu, 15008 SDs, 0 SdLazy, 24846 SolverSat, 5218 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5664 GetRequests, 208 SyntacticMatches, 98 SemanticMatches, 5358 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5248 ImplicationChecksByTransitivity, 32.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=409occurred in iteration=102, 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: 8.8s AutomataMinimizationTime, 103 MinimizatonAttempts, 101 StatesRemovedByMinimization, 100 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 15 PreInvPairs, 424 NumberOfFragments, 8428 HoareAnnotationTreeSize, 15 FomulaSimplifications, -1634 FormulaSimplificationTreeSizeReduction, 12.6s HoareSimplificationTime, 15 FomulaSimplificationsInter, 24 FormulaSimplificationTreeSizeReductionInter, 2.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 6.9s SatisfiabilityAnalysisTime, 40.2s InterpolantComputationTime, 21027 NumberOfCodeBlocks, 21027 NumberOfCodeBlocksAsserted, 103 NumberOfCheckSat, 20924 ConstructedInterpolants, 0 QuantifiedInterpolants, 71738277 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 103 InterpolantComputations, 3 PerfectInterpolantSequences, 19605/681752 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/PointerIncrement.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-07-23_15-35-58-384.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/PointerIncrement.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-23_15-35-58-384.csv Received shutdown request...