java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HiddenEqualityWithBranches.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-e6fd87c [2018-07-25 08:51:39,680 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-25 08:51:39,682 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-25 08:51:39,695 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-25 08:51:39,696 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-25 08:51:39,697 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-25 08:51:39,698 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-25 08:51:39,700 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-25 08:51:39,702 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-25 08:51:39,704 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-25 08:51:39,707 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-25 08:51:39,707 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-25 08:51:39,708 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-25 08:51:39,709 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-25 08:51:39,713 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-25 08:51:39,714 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-25 08:51:39,715 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-25 08:51:39,724 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-25 08:51:39,729 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-25 08:51:39,733 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-25 08:51:39,734 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-25 08:51:39,735 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-25 08:51:39,738 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-25 08:51:39,740 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-25 08:51:39,741 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-25 08:51:39,742 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-25 08:51:39,742 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-25 08:51:39,743 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-25 08:51:39,745 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-25 08:51:39,746 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-25 08:51:39,747 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-25 08:51:39,747 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-25 08:51:39,748 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-25 08:51:39,748 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-25 08:51:39,749 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-25 08:51:39,749 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-25 08:51:39,750 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-07-25 08:51:39,765 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-25 08:51:39,765 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-25 08:51:39,767 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-25 08:51:39,767 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-25 08:51:39,767 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-25 08:51:39,767 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-25 08:51:39,768 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-25 08:51:39,768 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-25 08:51:39,827 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-25 08:51:39,845 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-25 08:51:39,850 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-25 08:51:39,851 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-25 08:51:39,852 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-25 08:51:39,853 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HiddenEqualityWithBranches.bpl [2018-07-25 08:51:39,853 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HiddenEqualityWithBranches.bpl' [2018-07-25 08:51:39,905 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-25 08:51:39,907 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-07-25 08:51:39,907 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-25 08:51:39,908 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-25 08:51:39,908 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-25 08:51:39,928 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:51:39" (1/1) ... [2018-07-25 08:51:39,940 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:51:39" (1/1) ... [2018-07-25 08:51:39,944 WARN L165 Inliner]: Program contained no entry procedure! [2018-07-25 08:51:39,944 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-07-25 08:51:39,944 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-07-25 08:51:39,946 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-25 08:51:39,946 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-25 08:51:39,947 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-25 08:51:39,947 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-25 08:51:39,955 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:51:39" (1/1) ... [2018-07-25 08:51:39,956 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:51:39" (1/1) ... [2018-07-25 08:51:39,956 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:51:39" (1/1) ... [2018-07-25 08:51:39,957 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:51:39" (1/1) ... [2018-07-25 08:51:39,959 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:51:39" (1/1) ... [2018-07-25 08:51:39,963 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:51:39" (1/1) ... [2018-07-25 08:51:39,964 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:51:39" (1/1) ... [2018-07-25 08:51:39,965 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-25 08:51:39,966 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-25 08:51:39,966 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-25 08:51:39,966 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-25 08:51:39,967 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:51:39" (1/1) ... [2018-07-25 08:51:40,036 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-07-25 08:51:40,037 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-07-25 08:51:40,037 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-07-25 08:51:40,252 INFO L270 CfgBuilder]: Using library mode [2018-07-25 08:51:40,253 INFO L202 PluginConnector]: Adding new model HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 08:51:40 BoogieIcfgContainer [2018-07-25 08:51:40,253 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-25 08:51:40,254 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-25 08:51:40,254 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-25 08:51:40,258 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-25 08:51:40,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:51:39" (1/2) ... [2018-07-25 08:51:40,260 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15bfbea6 and model type HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.07 08:51:40, skipping insertion in model container [2018-07-25 08:51:40,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 08:51:40" (2/2) ... [2018-07-25 08:51:40,262 INFO L112 eAbstractionObserver]: Analyzing ICFG HiddenEqualityWithBranches.bpl [2018-07-25 08:51:40,273 INFO L133 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-25 08:51:40,281 INFO L145 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-25 08:51:40,327 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-25 08:51:40,327 INFO L374 AbstractCegarLoop]: Interprodecural is true [2018-07-25 08:51:40,327 INFO L375 AbstractCegarLoop]: Hoare is true [2018-07-25 08:51:40,328 INFO L376 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-25 08:51:40,328 INFO L377 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-25 08:51:40,328 INFO L378 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-25 08:51:40,328 INFO L379 AbstractCegarLoop]: Difference is false [2018-07-25 08:51:40,329 INFO L380 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-25 08:51:40,329 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-25 08:51:40,341 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states. [2018-07-25 08:51:40,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-07-25 08:51:40,349 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:40,350 INFO L354 BasicCegarLoop]: trace histogram [1, 1] [2018-07-25 08:51:40,351 INFO L415 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:40,357 INFO L82 PathProgramCache]: Analyzing trace with hash 979, now seen corresponding path program 1 times [2018-07-25 08:51:40,362 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:40,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:40,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:40,423 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:51:40,424 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-07-25 08:51:40,429 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 08:51:40,444 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 08:51:40,445 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 08:51:40,448 INFO L87 Difference]: Start difference. First operand 4 states. Second operand 3 states. [2018-07-25 08:51:40,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:40,491 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2018-07-25 08:51:40,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 08:51:40,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-07-25 08:51:40,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:40,521 INFO L225 Difference]: With dead ends: 7 [2018-07-25 08:51:40,521 INFO L226 Difference]: Without dead ends: 4 [2018-07-25 08:51:40,529 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 08:51:40,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4 states. [2018-07-25 08:51:40,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4 to 4. [2018-07-25 08:51:40,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-07-25 08:51:40,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2018-07-25 08:51:40,577 INFO L78 Accepts]: Start accepts. Automaton has 4 states and 4 transitions. Word has length 2 [2018-07-25 08:51:40,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:40,577 INFO L472 AbstractCegarLoop]: Abstraction has 4 states and 4 transitions. [2018-07-25 08:51:40,577 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 08:51:40,578 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2018-07-25 08:51:40,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-07-25 08:51:40,578 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:40,578 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-07-25 08:51:40,579 INFO L415 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:40,579 INFO L82 PathProgramCache]: Analyzing trace with hash 30584, now seen corresponding path program 1 times [2018-07-25 08:51:40,580 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:40,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:40,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:40,620 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:40,621 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2018-07-25 08:51:40,623 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 08:51:40,624 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 08:51:40,624 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-25 08:51:40,624 INFO L87 Difference]: Start difference. First operand 4 states and 4 transitions. Second operand 4 states. [2018-07-25 08:51:40,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:40,639 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2018-07-25 08:51:40,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 08:51:40,639 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-07-25 08:51:40,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:40,640 INFO L225 Difference]: With dead ends: 6 [2018-07-25 08:51:40,640 INFO L226 Difference]: Without dead ends: 5 [2018-07-25 08:51:40,642 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-25 08:51:40,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-07-25 08:51:40,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-07-25 08:51:40,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-07-25 08:51:40,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-07-25 08:51:40,644 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-07-25 08:51:40,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:40,645 INFO L472 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-07-25 08:51:40,645 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 08:51:40,645 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-07-25 08:51:40,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-25 08:51:40,646 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:40,646 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1] [2018-07-25 08:51:40,646 INFO L415 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:40,646 INFO L82 PathProgramCache]: Analyzing trace with hash 948339, now seen corresponding path program 2 times [2018-07-25 08:51:40,647 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:40,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:40,689 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:40,690 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:40,690 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-25 08:51:40,690 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 08:51:40,691 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 08:51:40,691 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-25 08:51:40,691 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2018-07-25 08:51:40,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:40,703 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2018-07-25 08:51:40,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-25 08:51:40,704 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-07-25 08:51:40,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:40,705 INFO L225 Difference]: With dead ends: 7 [2018-07-25 08:51:40,705 INFO L226 Difference]: Without dead ends: 6 [2018-07-25 08:51:40,705 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-25 08:51:40,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-07-25 08:51:40,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-07-25 08:51:40,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-07-25 08:51:40,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-07-25 08:51:40,708 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-07-25 08:51:40,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:40,709 INFO L472 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-07-25 08:51:40,709 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 08:51:40,709 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-07-25 08:51:40,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-07-25 08:51:40,709 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:40,710 INFO L354 BasicCegarLoop]: trace histogram [3, 1, 1] [2018-07-25 08:51:40,710 INFO L415 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:40,710 INFO L82 PathProgramCache]: Analyzing trace with hash 29398744, now seen corresponding path program 3 times [2018-07-25 08:51:40,710 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:40,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:40,751 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:40,751 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:40,751 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-25 08:51:40,752 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 08:51:40,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 08:51:40,757 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-07-25 08:51:40,758 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2018-07-25 08:51:40,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:40,772 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-07-25 08:51:40,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-25 08:51:40,772 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-07-25 08:51:40,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:40,773 INFO L225 Difference]: With dead ends: 8 [2018-07-25 08:51:40,773 INFO L226 Difference]: Without dead ends: 7 [2018-07-25 08:51:40,774 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-07-25 08:51:40,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-07-25 08:51:40,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-07-25 08:51:40,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-07-25 08:51:40,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-07-25 08:51:40,776 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-07-25 08:51:40,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:40,777 INFO L472 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-07-25 08:51:40,777 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 08:51:40,777 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-07-25 08:51:40,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 08:51:40,778 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:40,778 INFO L354 BasicCegarLoop]: trace histogram [4, 1, 1] [2018-07-25 08:51:40,778 INFO L415 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:40,779 INFO L82 PathProgramCache]: Analyzing trace with hash 911361299, now seen corresponding path program 4 times [2018-07-25 08:51:40,779 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:40,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:40,832 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:40,832 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:40,833 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-25 08:51:40,833 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 08:51:40,835 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 08:51:40,835 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:51:40,837 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2018-07-25 08:51:40,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:40,868 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-07-25 08:51:40,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-25 08:51:40,868 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-25 08:51:40,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:40,869 INFO L225 Difference]: With dead ends: 9 [2018-07-25 08:51:40,869 INFO L226 Difference]: Without dead ends: 8 [2018-07-25 08:51:40,872 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:51:40,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-07-25 08:51:40,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-07-25 08:51:40,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-07-25 08:51:40,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-07-25 08:51:40,875 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-07-25 08:51:40,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:40,877 INFO L472 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-07-25 08:51:40,877 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 08:51:40,877 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-07-25 08:51:40,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-25 08:51:40,878 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:40,878 INFO L354 BasicCegarLoop]: trace histogram [5, 1, 1] [2018-07-25 08:51:40,878 INFO L415 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:40,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1812570568, now seen corresponding path program 5 times [2018-07-25 08:51:40,879 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:40,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:40,983 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:40,984 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:40,984 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 08:51:40,986 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:51:40,987 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:51:40,987 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:51:40,987 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2018-07-25 08:51:41,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:41,011 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-07-25 08:51:41,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-25 08:51:41,015 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-25 08:51:41,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:41,015 INFO L225 Difference]: With dead ends: 10 [2018-07-25 08:51:41,016 INFO L226 Difference]: Without dead ends: 9 [2018-07-25 08:51:41,016 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:51:41,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-07-25 08:51:41,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-07-25 08:51:41,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-25 08:51:41,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-07-25 08:51:41,023 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-07-25 08:51:41,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:41,023 INFO L472 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-07-25 08:51:41,024 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:51:41,025 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-07-25 08:51:41,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 08:51:41,025 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:41,025 INFO L354 BasicCegarLoop]: trace histogram [6, 1, 1] [2018-07-25 08:51:41,026 INFO L415 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:41,026 INFO L82 PathProgramCache]: Analyzing trace with hash -355112525, now seen corresponding path program 6 times [2018-07-25 08:51:41,026 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:41,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:41,128 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:41,131 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:41,131 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:51:41,131 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 08:51:41,132 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 08:51:41,132 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:51:41,133 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 9 states. [2018-07-25 08:51:41,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:41,161 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-07-25 08:51:41,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-25 08:51:41,161 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2018-07-25 08:51:41,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:41,162 INFO L225 Difference]: With dead ends: 11 [2018-07-25 08:51:41,162 INFO L226 Difference]: Without dead ends: 10 [2018-07-25 08:51:41,166 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:51:41,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-07-25 08:51:41,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-07-25 08:51:41,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-07-25 08:51:41,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-07-25 08:51:41,170 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-07-25 08:51:41,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:41,171 INFO L472 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-07-25 08:51:41,171 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 08:51:41,171 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-07-25 08:51:41,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-07-25 08:51:41,171 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:41,172 INFO L354 BasicCegarLoop]: trace histogram [7, 1, 1] [2018-07-25 08:51:41,172 INFO L415 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:41,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1876413848, now seen corresponding path program 7 times [2018-07-25 08:51:41,172 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:41,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:41,229 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:41,229 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:41,229 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 08:51:41,230 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 08:51:41,230 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 08:51:41,232 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-07-25 08:51:41,233 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 10 states. [2018-07-25 08:51:41,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:41,256 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-07-25 08:51:41,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 08:51:41,258 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2018-07-25 08:51:41,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:41,258 INFO L225 Difference]: With dead ends: 12 [2018-07-25 08:51:41,259 INFO L226 Difference]: Without dead ends: 11 [2018-07-25 08:51:41,260 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-07-25 08:51:41,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-25 08:51:41,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-07-25 08:51:41,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-25 08:51:41,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-07-25 08:51:41,266 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-07-25 08:51:41,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:41,267 INFO L472 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-07-25 08:51:41,267 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 08:51:41,267 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-07-25 08:51:41,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 08:51:41,269 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:41,270 INFO L354 BasicCegarLoop]: trace histogram [8, 1, 1] [2018-07-25 08:51:41,270 INFO L415 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:41,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1960712621, now seen corresponding path program 8 times [2018-07-25 08:51:41,270 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:41,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:41,361 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:41,364 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:41,365 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 08:51:41,365 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:51:41,365 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:51:41,366 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:51:41,366 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 11 states. [2018-07-25 08:51:41,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:41,393 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-07-25 08:51:41,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 08:51:41,394 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2018-07-25 08:51:41,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:41,398 INFO L225 Difference]: With dead ends: 13 [2018-07-25 08:51:41,398 INFO L226 Difference]: Without dead ends: 12 [2018-07-25 08:51:41,399 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:51:41,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-07-25 08:51:41,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-07-25 08:51:41,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-07-25 08:51:41,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-07-25 08:51:41,406 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-07-25 08:51:41,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:41,407 INFO L472 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-07-25 08:51:41,407 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:51:41,407 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-07-25 08:51:41,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-25 08:51:41,408 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:41,408 INFO L354 BasicCegarLoop]: trace histogram [9, 1, 1] [2018-07-25 08:51:41,408 INFO L415 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:41,409 INFO L82 PathProgramCache]: Analyzing trace with hash -652548872, now seen corresponding path program 9 times [2018-07-25 08:51:41,409 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:41,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:41,523 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:41,527 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:41,527 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 08:51:41,527 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 08:51:41,528 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 08:51:41,528 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:51:41,528 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 12 states. [2018-07-25 08:51:41,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:41,557 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-07-25 08:51:41,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 08:51:41,558 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2018-07-25 08:51:41,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:41,558 INFO L225 Difference]: With dead ends: 14 [2018-07-25 08:51:41,559 INFO L226 Difference]: Without dead ends: 13 [2018-07-25 08:51:41,560 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:51:41,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-07-25 08:51:41,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-07-25 08:51:41,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-25 08:51:41,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-07-25 08:51:41,568 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-07-25 08:51:41,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:41,568 INFO L472 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-07-25 08:51:41,568 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 08:51:41,568 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-07-25 08:51:41,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 08:51:41,569 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:41,569 INFO L354 BasicCegarLoop]: trace histogram [10, 1, 1] [2018-07-25 08:51:41,569 INFO L415 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:41,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1245821683, now seen corresponding path program 10 times [2018-07-25 08:51:41,570 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:41,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:41,641 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:41,642 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:41,642 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 08:51:41,643 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 08:51:41,643 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 08:51:41,644 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-07-25 08:51:41,644 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 13 states. [2018-07-25 08:51:41,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:41,671 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-07-25 08:51:41,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 08:51:41,671 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2018-07-25 08:51:41,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:41,672 INFO L225 Difference]: With dead ends: 15 [2018-07-25 08:51:41,672 INFO L226 Difference]: Without dead ends: 14 [2018-07-25 08:51:41,675 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-07-25 08:51:41,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-07-25 08:51:41,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-07-25 08:51:41,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-07-25 08:51:41,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-07-25 08:51:41,683 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-07-25 08:51:41,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:41,684 INFO L472 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-07-25 08:51:41,684 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 08:51:41,684 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-07-25 08:51:41,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 08:51:41,685 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:41,685 INFO L354 BasicCegarLoop]: trace histogram [11, 1, 1] [2018-07-25 08:51:41,688 INFO L415 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:41,689 INFO L82 PathProgramCache]: Analyzing trace with hash -34233256, now seen corresponding path program 11 times [2018-07-25 08:51:41,689 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:41,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:41,757 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:41,757 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:41,757 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 08:51:41,758 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 08:51:41,758 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 08:51:41,759 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-07-25 08:51:41,759 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 14 states. [2018-07-25 08:51:41,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:41,779 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-07-25 08:51:41,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 08:51:41,779 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-07-25 08:51:41,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:41,780 INFO L225 Difference]: With dead ends: 16 [2018-07-25 08:51:41,780 INFO L226 Difference]: Without dead ends: 15 [2018-07-25 08:51:41,781 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-07-25 08:51:41,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-07-25 08:51:41,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-07-25 08:51:41,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-25 08:51:41,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-07-25 08:51:41,788 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-07-25 08:51:41,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:41,789 INFO L472 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-07-25 08:51:41,789 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 08:51:41,789 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-07-25 08:51:41,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-25 08:51:41,790 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:41,790 INFO L354 BasicCegarLoop]: trace histogram [12, 1, 1] [2018-07-25 08:51:41,791 INFO L415 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:41,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1061230701, now seen corresponding path program 12 times [2018-07-25 08:51:41,792 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:41,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:41,854 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:41,855 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:41,855 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 08:51:41,856 INFO L451 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-25 08:51:41,856 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-25 08:51:41,857 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-07-25 08:51:41,857 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 15 states. [2018-07-25 08:51:41,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:41,874 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-07-25 08:51:41,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 08:51:41,875 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2018-07-25 08:51:41,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:41,875 INFO L225 Difference]: With dead ends: 17 [2018-07-25 08:51:41,876 INFO L226 Difference]: Without dead ends: 16 [2018-07-25 08:51:41,876 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-07-25 08:51:41,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-07-25 08:51:41,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-07-25 08:51:41,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-07-25 08:51:41,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-07-25 08:51:41,883 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-07-25 08:51:41,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:41,883 INFO L472 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-07-25 08:51:41,883 INFO L473 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-25 08:51:41,883 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-07-25 08:51:41,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 08:51:41,884 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:41,884 INFO L354 BasicCegarLoop]: trace histogram [13, 1, 1] [2018-07-25 08:51:41,885 INFO L415 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:41,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1461586872, now seen corresponding path program 13 times [2018-07-25 08:51:41,885 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:41,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:41,949 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:41,950 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:41,950 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-25 08:51:41,951 INFO L451 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-25 08:51:41,951 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-25 08:51:41,952 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-07-25 08:51:41,952 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 16 states. [2018-07-25 08:51:41,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:41,973 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-07-25 08:51:41,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-25 08:51:41,973 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2018-07-25 08:51:41,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:41,974 INFO L225 Difference]: With dead ends: 18 [2018-07-25 08:51:41,974 INFO L226 Difference]: Without dead ends: 17 [2018-07-25 08:51:41,976 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-07-25 08:51:41,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-07-25 08:51:41,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-07-25 08:51:41,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-07-25 08:51:41,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-07-25 08:51:41,980 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-07-25 08:51:41,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:41,980 INFO L472 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-07-25 08:51:41,980 INFO L473 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-25 08:51:41,983 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-07-25 08:51:41,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 08:51:41,984 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:41,984 INFO L354 BasicCegarLoop]: trace histogram [14, 1, 1] [2018-07-25 08:51:41,984 INFO L415 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:41,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1935446989, now seen corresponding path program 14 times [2018-07-25 08:51:41,985 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:42,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:42,073 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:42,073 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:42,073 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-25 08:51:42,074 INFO L451 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-25 08:51:42,074 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-25 08:51:42,074 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-07-25 08:51:42,075 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 17 states. [2018-07-25 08:51:42,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:42,086 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-07-25 08:51:42,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 08:51:42,087 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-07-25 08:51:42,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:42,087 INFO L225 Difference]: With dead ends: 19 [2018-07-25 08:51:42,088 INFO L226 Difference]: Without dead ends: 18 [2018-07-25 08:51:42,088 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-07-25 08:51:42,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-07-25 08:51:42,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-07-25 08:51:42,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-07-25 08:51:42,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-07-25 08:51:42,093 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-07-25 08:51:42,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:42,093 INFO L472 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-07-25 08:51:42,093 INFO L473 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-25 08:51:42,094 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-07-25 08:51:42,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-25 08:51:42,094 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:42,094 INFO L354 BasicCegarLoop]: trace histogram [15, 1, 1] [2018-07-25 08:51:42,095 INFO L415 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:42,095 INFO L82 PathProgramCache]: Analyzing trace with hash 130685720, now seen corresponding path program 15 times [2018-07-25 08:51:42,095 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:42,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:42,177 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:42,178 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:42,181 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-07-25 08:51:42,181 INFO L451 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-25 08:51:42,181 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-25 08:51:42,182 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-07-25 08:51:42,182 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 18 states. [2018-07-25 08:51:42,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:42,197 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-07-25 08:51:42,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-25 08:51:42,198 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2018-07-25 08:51:42,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:42,199 INFO L225 Difference]: With dead ends: 20 [2018-07-25 08:51:42,199 INFO L226 Difference]: Without dead ends: 19 [2018-07-25 08:51:42,201 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-07-25 08:51:42,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-07-25 08:51:42,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-07-25 08:51:42,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-07-25 08:51:42,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-07-25 08:51:42,206 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-07-25 08:51:42,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:42,208 INFO L472 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-07-25 08:51:42,208 INFO L473 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-25 08:51:42,208 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-07-25 08:51:42,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 08:51:42,208 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:42,209 INFO L354 BasicCegarLoop]: trace histogram [16, 1, 1] [2018-07-25 08:51:42,209 INFO L415 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:42,209 INFO L82 PathProgramCache]: Analyzing trace with hash -243709741, now seen corresponding path program 16 times [2018-07-25 08:51:42,209 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:42,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:42,288 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:42,288 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:42,289 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-07-25 08:51:42,289 INFO L451 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-07-25 08:51:42,290 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-07-25 08:51:42,290 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-07-25 08:51:42,290 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 19 states. [2018-07-25 08:51:42,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:42,303 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-07-25 08:51:42,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-25 08:51:42,303 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2018-07-25 08:51:42,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:42,304 INFO L225 Difference]: With dead ends: 21 [2018-07-25 08:51:42,304 INFO L226 Difference]: Without dead ends: 20 [2018-07-25 08:51:42,305 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-07-25 08:51:42,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-07-25 08:51:42,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-07-25 08:51:42,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-07-25 08:51:42,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-07-25 08:51:42,308 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-07-25 08:51:42,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:42,309 INFO L472 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-07-25 08:51:42,309 INFO L473 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-07-25 08:51:42,309 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-07-25 08:51:42,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-25 08:51:42,310 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:42,310 INFO L354 BasicCegarLoop]: trace histogram [17, 1, 1] [2018-07-25 08:51:42,310 INFO L415 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:42,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1034932856, now seen corresponding path program 17 times [2018-07-25 08:51:42,311 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:42,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:42,385 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:42,386 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:42,386 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-07-25 08:51:42,386 INFO L451 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-07-25 08:51:42,387 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-07-25 08:51:42,387 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-07-25 08:51:42,388 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 20 states. [2018-07-25 08:51:42,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:42,404 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-07-25 08:51:42,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-25 08:51:42,404 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2018-07-25 08:51:42,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:42,405 INFO L225 Difference]: With dead ends: 22 [2018-07-25 08:51:42,405 INFO L226 Difference]: Without dead ends: 21 [2018-07-25 08:51:42,406 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-07-25 08:51:42,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-07-25 08:51:42,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-07-25 08:51:42,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-07-25 08:51:42,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-07-25 08:51:42,412 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-07-25 08:51:42,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:42,412 INFO L472 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-07-25 08:51:42,413 INFO L473 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-07-25 08:51:42,413 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-07-25 08:51:42,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 08:51:42,413 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:42,414 INFO L354 BasicCegarLoop]: trace histogram [18, 1, 1] [2018-07-25 08:51:42,414 INFO L415 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:42,414 INFO L82 PathProgramCache]: Analyzing trace with hash 2018147699, now seen corresponding path program 18 times [2018-07-25 08:51:42,416 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:42,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:42,518 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:42,519 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:42,519 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-07-25 08:51:42,521 INFO L451 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-07-25 08:51:42,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-07-25 08:51:42,521 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-07-25 08:51:42,522 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 21 states. [2018-07-25 08:51:42,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:42,546 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-07-25 08:51:42,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-25 08:51:42,547 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2018-07-25 08:51:42,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:42,548 INFO L225 Difference]: With dead ends: 23 [2018-07-25 08:51:42,548 INFO L226 Difference]: Without dead ends: 22 [2018-07-25 08:51:42,549 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-07-25 08:51:42,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-07-25 08:51:42,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-07-25 08:51:42,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-07-25 08:51:42,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-07-25 08:51:42,555 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-07-25 08:51:42,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:42,555 INFO L472 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-07-25 08:51:42,555 INFO L473 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-07-25 08:51:42,555 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-07-25 08:51:42,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-25 08:51:42,556 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:42,561 INFO L354 BasicCegarLoop]: trace histogram [19, 1, 1] [2018-07-25 08:51:42,561 INFO L415 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:42,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1861930536, now seen corresponding path program 19 times [2018-07-25 08:51:42,562 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:42,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:42,661 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:42,662 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:42,662 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-07-25 08:51:42,663 INFO L451 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-07-25 08:51:42,663 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-07-25 08:51:42,663 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-07-25 08:51:42,664 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 22 states. [2018-07-25 08:51:42,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:42,684 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-07-25 08:51:42,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-25 08:51:42,684 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2018-07-25 08:51:42,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:42,685 INFO L225 Difference]: With dead ends: 24 [2018-07-25 08:51:42,685 INFO L226 Difference]: Without dead ends: 23 [2018-07-25 08:51:42,685 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-07-25 08:51:42,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-07-25 08:51:42,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-07-25 08:51:42,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-07-25 08:51:42,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-07-25 08:51:42,693 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-07-25 08:51:42,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:42,693 INFO L472 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-07-25 08:51:42,693 INFO L473 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-07-25 08:51:42,694 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-07-25 08:51:42,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-25 08:51:42,695 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:42,695 INFO L354 BasicCegarLoop]: trace histogram [20, 1, 1] [2018-07-25 08:51:42,695 INFO L415 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:42,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1885271533, now seen corresponding path program 20 times [2018-07-25 08:51:42,696 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:42,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:42,793 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:42,794 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:42,794 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-07-25 08:51:42,794 INFO L451 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-07-25 08:51:42,797 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-07-25 08:51:42,797 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-07-25 08:51:42,798 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 23 states. [2018-07-25 08:51:42,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:42,821 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-07-25 08:51:42,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-25 08:51:42,822 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2018-07-25 08:51:42,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:42,823 INFO L225 Difference]: With dead ends: 25 [2018-07-25 08:51:42,824 INFO L226 Difference]: Without dead ends: 24 [2018-07-25 08:51:42,824 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-07-25 08:51:42,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-07-25 08:51:42,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-07-25 08:51:42,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-07-25 08:51:42,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-07-25 08:51:42,830 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-07-25 08:51:42,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:42,831 INFO L472 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-07-25 08:51:42,831 INFO L473 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-07-25 08:51:42,831 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-07-25 08:51:42,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-25 08:51:42,832 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:42,832 INFO L354 BasicCegarLoop]: trace histogram [21, 1, 1] [2018-07-25 08:51:42,832 INFO L415 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:42,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1686124856, now seen corresponding path program 21 times [2018-07-25 08:51:42,833 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:42,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:42,960 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:42,960 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:42,960 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-07-25 08:51:42,961 INFO L451 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-07-25 08:51:42,961 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-07-25 08:51:42,962 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-07-25 08:51:42,962 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 24 states. [2018-07-25 08:51:42,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:42,982 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-07-25 08:51:42,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 08:51:42,982 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2018-07-25 08:51:42,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:42,983 INFO L225 Difference]: With dead ends: 26 [2018-07-25 08:51:42,983 INFO L226 Difference]: Without dead ends: 25 [2018-07-25 08:51:42,984 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-07-25 08:51:42,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-07-25 08:51:42,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-07-25 08:51:42,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-07-25 08:51:42,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-07-25 08:51:42,990 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-07-25 08:51:42,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:42,990 INFO L472 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-07-25 08:51:42,990 INFO L473 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-07-25 08:51:42,990 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-07-25 08:51:42,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-07-25 08:51:42,991 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:42,991 INFO L354 BasicCegarLoop]: trace histogram [22, 1, 1] [2018-07-25 08:51:42,992 INFO L415 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:42,993 INFO L82 PathProgramCache]: Analyzing trace with hash 730263219, now seen corresponding path program 22 times [2018-07-25 08:51:42,993 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:43,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:43,110 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:43,111 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:43,111 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-07-25 08:51:43,111 INFO L451 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-07-25 08:51:43,112 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-07-25 08:51:43,112 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-07-25 08:51:43,112 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 25 states. [2018-07-25 08:51:43,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:43,135 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-07-25 08:51:43,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-25 08:51:43,135 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2018-07-25 08:51:43,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:43,136 INFO L225 Difference]: With dead ends: 27 [2018-07-25 08:51:43,136 INFO L226 Difference]: Without dead ends: 26 [2018-07-25 08:51:43,137 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-07-25 08:51:43,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-07-25 08:51:43,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-07-25 08:51:43,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-07-25 08:51:43,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-07-25 08:51:43,142 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-07-25 08:51:43,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:43,143 INFO L472 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-07-25 08:51:43,143 INFO L473 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-07-25 08:51:43,143 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-07-25 08:51:43,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-25 08:51:43,144 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:43,144 INFO L354 BasicCegarLoop]: trace histogram [23, 1, 1] [2018-07-25 08:51:43,144 INFO L415 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:43,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1163323544, now seen corresponding path program 23 times [2018-07-25 08:51:43,145 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:43,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:43,312 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:43,312 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:43,312 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-07-25 08:51:43,313 INFO L451 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-07-25 08:51:43,313 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-07-25 08:51:43,316 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-07-25 08:51:43,316 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 26 states. [2018-07-25 08:51:43,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:43,348 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-07-25 08:51:43,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-25 08:51:43,348 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2018-07-25 08:51:43,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:43,349 INFO L225 Difference]: With dead ends: 28 [2018-07-25 08:51:43,349 INFO L226 Difference]: Without dead ends: 27 [2018-07-25 08:51:43,350 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-07-25 08:51:43,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-07-25 08:51:43,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-07-25 08:51:43,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-07-25 08:51:43,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-07-25 08:51:43,355 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-07-25 08:51:43,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:43,355 INFO L472 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-07-25 08:51:43,355 INFO L473 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-07-25 08:51:43,355 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-07-25 08:51:43,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-07-25 08:51:43,356 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:43,356 INFO L354 BasicCegarLoop]: trace histogram [24, 1, 1] [2018-07-25 08:51:43,357 INFO L415 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:43,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1703291731, now seen corresponding path program 24 times [2018-07-25 08:51:43,358 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:43,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:43,500 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:43,501 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:43,501 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-07-25 08:51:43,501 INFO L451 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-07-25 08:51:43,502 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-07-25 08:51:43,502 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-07-25 08:51:43,503 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 27 states. [2018-07-25 08:51:43,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:43,519 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-07-25 08:51:43,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-25 08:51:43,519 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 26 [2018-07-25 08:51:43,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:43,520 INFO L225 Difference]: With dead ends: 29 [2018-07-25 08:51:43,520 INFO L226 Difference]: Without dead ends: 28 [2018-07-25 08:51:43,521 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-07-25 08:51:43,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-07-25 08:51:43,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-07-25 08:51:43,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-07-25 08:51:43,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-07-25 08:51:43,528 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-07-25 08:51:43,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:43,529 INFO L472 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-07-25 08:51:43,529 INFO L473 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-07-25 08:51:43,529 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-07-25 08:51:43,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-07-25 08:51:43,531 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:43,532 INFO L354 BasicCegarLoop]: trace histogram [25, 1, 1] [2018-07-25 08:51:43,533 INFO L415 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:43,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1262436344, now seen corresponding path program 25 times [2018-07-25 08:51:43,533 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:43,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:43,662 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:43,664 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:43,664 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-07-25 08:51:43,664 INFO L451 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-07-25 08:51:43,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-07-25 08:51:43,666 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-07-25 08:51:43,666 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 28 states. [2018-07-25 08:51:43,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:43,682 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-07-25 08:51:43,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-25 08:51:43,682 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2018-07-25 08:51:43,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:43,683 INFO L225 Difference]: With dead ends: 30 [2018-07-25 08:51:43,683 INFO L226 Difference]: Without dead ends: 29 [2018-07-25 08:51:43,684 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-07-25 08:51:43,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-07-25 08:51:43,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-07-25 08:51:43,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-07-25 08:51:43,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-07-25 08:51:43,690 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-07-25 08:51:43,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:43,691 INFO L472 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-07-25 08:51:43,691 INFO L473 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-07-25 08:51:43,691 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-07-25 08:51:43,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-07-25 08:51:43,692 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:43,692 INFO L354 BasicCegarLoop]: trace histogram [26, 1, 1] [2018-07-25 08:51:43,692 INFO L415 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:43,693 INFO L82 PathProgramCache]: Analyzing trace with hash 480821235, now seen corresponding path program 26 times [2018-07-25 08:51:43,693 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:43,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:43,839 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:43,839 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:43,840 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-07-25 08:51:43,840 INFO L451 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-07-25 08:51:43,840 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-07-25 08:51:43,841 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-07-25 08:51:43,841 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 29 states. [2018-07-25 08:51:43,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:43,861 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-07-25 08:51:43,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-25 08:51:43,861 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 28 [2018-07-25 08:51:43,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:43,862 INFO L225 Difference]: With dead ends: 31 [2018-07-25 08:51:43,862 INFO L226 Difference]: Without dead ends: 30 [2018-07-25 08:51:43,863 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-07-25 08:51:43,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-07-25 08:51:43,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-07-25 08:51:43,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-07-25 08:51:43,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-07-25 08:51:43,868 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-07-25 08:51:43,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:43,868 INFO L472 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-07-25 08:51:43,868 INFO L473 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-07-25 08:51:43,868 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-07-25 08:51:43,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-07-25 08:51:43,869 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:43,869 INFO L354 BasicCegarLoop]: trace histogram [27, 1, 1] [2018-07-25 08:51:43,869 INFO L415 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:43,870 INFO L82 PathProgramCache]: Analyzing trace with hash 2020556632, now seen corresponding path program 27 times [2018-07-25 08:51:43,870 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:43,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:44,014 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:44,015 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:44,015 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-07-25 08:51:44,016 INFO L451 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-07-25 08:51:44,016 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-07-25 08:51:44,017 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-07-25 08:51:44,017 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 30 states. [2018-07-25 08:51:44,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:44,044 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-07-25 08:51:44,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-25 08:51:44,044 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 [2018-07-25 08:51:44,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:44,045 INFO L225 Difference]: With dead ends: 32 [2018-07-25 08:51:44,045 INFO L226 Difference]: Without dead ends: 31 [2018-07-25 08:51:44,046 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-07-25 08:51:44,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-07-25 08:51:44,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-07-25 08:51:44,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-07-25 08:51:44,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-07-25 08:51:44,053 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-07-25 08:51:44,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:44,053 INFO L472 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-07-25 08:51:44,054 INFO L473 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-07-25 08:51:44,054 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-07-25 08:51:44,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-07-25 08:51:44,054 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:44,054 INFO L354 BasicCegarLoop]: trace histogram [28, 1, 1] [2018-07-25 08:51:44,055 INFO L415 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:44,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1787253613, now seen corresponding path program 28 times [2018-07-25 08:51:44,055 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:44,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:44,208 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:44,209 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:44,209 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-07-25 08:51:44,209 INFO L451 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-07-25 08:51:44,210 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-07-25 08:51:44,210 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-07-25 08:51:44,211 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 31 states. [2018-07-25 08:51:44,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:44,229 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-07-25 08:51:44,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-25 08:51:44,229 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 30 [2018-07-25 08:51:44,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:44,230 INFO L225 Difference]: With dead ends: 33 [2018-07-25 08:51:44,230 INFO L226 Difference]: Without dead ends: 32 [2018-07-25 08:51:44,231 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-07-25 08:51:44,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-07-25 08:51:44,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-07-25 08:51:44,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-07-25 08:51:44,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-07-25 08:51:44,240 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-07-25 08:51:44,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:44,240 INFO L472 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-07-25 08:51:44,243 INFO L473 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-07-25 08:51:44,244 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-07-25 08:51:44,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-07-25 08:51:44,244 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:44,244 INFO L354 BasicCegarLoop]: trace histogram [29, 1, 1] [2018-07-25 08:51:44,245 INFO L415 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:44,245 INFO L82 PathProgramCache]: Analyzing trace with hash 429713080, now seen corresponding path program 29 times [2018-07-25 08:51:44,245 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:44,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:44,569 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:44,570 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:44,570 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-07-25 08:51:44,570 INFO L451 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-07-25 08:51:44,571 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-07-25 08:51:44,571 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-07-25 08:51:44,572 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 32 states. [2018-07-25 08:51:44,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:44,589 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-07-25 08:51:44,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-07-25 08:51:44,589 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 31 [2018-07-25 08:51:44,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:44,590 INFO L225 Difference]: With dead ends: 34 [2018-07-25 08:51:44,590 INFO L226 Difference]: Without dead ends: 33 [2018-07-25 08:51:44,591 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-07-25 08:51:44,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-07-25 08:51:44,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-07-25 08:51:44,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-07-25 08:51:44,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-07-25 08:51:44,594 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-07-25 08:51:44,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:44,594 INFO L472 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-07-25 08:51:44,595 INFO L473 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-07-25 08:51:44,595 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-07-25 08:51:44,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-07-25 08:51:44,595 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:44,595 INFO L354 BasicCegarLoop]: trace histogram [30, 1, 1] [2018-07-25 08:51:44,596 INFO L415 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:44,596 INFO L82 PathProgramCache]: Analyzing trace with hash 436203827, now seen corresponding path program 30 times [2018-07-25 08:51:44,596 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:44,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:44,743 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:44,743 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:44,743 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-07-25 08:51:44,744 INFO L451 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-07-25 08:51:44,744 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-07-25 08:51:44,745 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 08:51:44,745 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 33 states. [2018-07-25 08:51:44,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:44,763 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-07-25 08:51:44,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-25 08:51:44,763 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 32 [2018-07-25 08:51:44,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:44,763 INFO L225 Difference]: With dead ends: 35 [2018-07-25 08:51:44,764 INFO L226 Difference]: Without dead ends: 34 [2018-07-25 08:51:44,764 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 08:51:44,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-07-25 08:51:44,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-07-25 08:51:44,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-07-25 08:51:44,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-07-25 08:51:44,767 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-07-25 08:51:44,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:44,767 INFO L472 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-07-25 08:51:44,767 INFO L473 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-07-25 08:51:44,768 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-07-25 08:51:44,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-07-25 08:51:44,768 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:44,768 INFO L354 BasicCegarLoop]: trace histogram [31, 1, 1] [2018-07-25 08:51:44,768 INFO L415 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:44,769 INFO L82 PathProgramCache]: Analyzing trace with hash 637416984, now seen corresponding path program 31 times [2018-07-25 08:51:44,769 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:44,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:44,920 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:44,921 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:44,921 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-07-25 08:51:44,921 INFO L451 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-07-25 08:51:44,922 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-07-25 08:51:44,922 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 08:51:44,923 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 34 states. [2018-07-25 08:51:44,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:44,938 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-07-25 08:51:44,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-25 08:51:44,938 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 33 [2018-07-25 08:51:44,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:44,939 INFO L225 Difference]: With dead ends: 36 [2018-07-25 08:51:44,939 INFO L226 Difference]: Without dead ends: 35 [2018-07-25 08:51:44,940 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 08:51:44,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-07-25 08:51:44,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-07-25 08:51:44,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-07-25 08:51:44,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-07-25 08:51:44,942 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-07-25 08:51:44,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:44,943 INFO L472 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-07-25 08:51:44,943 INFO L473 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-07-25 08:51:44,943 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-07-25 08:51:44,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-07-25 08:51:44,943 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:44,943 INFO L354 BasicCegarLoop]: trace histogram [32, 1, 1] [2018-07-25 08:51:44,944 INFO L415 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:44,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1714909741, now seen corresponding path program 32 times [2018-07-25 08:51:44,944 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:44,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:45,095 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:45,095 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:45,095 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-07-25 08:51:45,096 INFO L451 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-07-25 08:51:45,096 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-07-25 08:51:45,097 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 08:51:45,097 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 35 states. [2018-07-25 08:51:45,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:45,115 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-07-25 08:51:45,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-25 08:51:45,115 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 34 [2018-07-25 08:51:45,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:45,115 INFO L225 Difference]: With dead ends: 37 [2018-07-25 08:51:45,116 INFO L226 Difference]: Without dead ends: 36 [2018-07-25 08:51:45,116 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 08:51:45,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-07-25 08:51:45,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-07-25 08:51:45,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-07-25 08:51:45,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-07-25 08:51:45,119 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-07-25 08:51:45,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:45,120 INFO L472 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-07-25 08:51:45,120 INFO L473 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-07-25 08:51:45,120 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-07-25 08:51:45,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-07-25 08:51:45,120 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:45,120 INFO L354 BasicCegarLoop]: trace histogram [33, 1, 1] [2018-07-25 08:51:45,121 INFO L415 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:45,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1622594184, now seen corresponding path program 33 times [2018-07-25 08:51:45,121 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:45,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:45,271 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:45,272 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:45,272 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-07-25 08:51:45,272 INFO L451 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-07-25 08:51:45,273 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-07-25 08:51:45,273 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-07-25 08:51:45,274 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 36 states. [2018-07-25 08:51:45,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:45,293 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-07-25 08:51:45,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-07-25 08:51:45,293 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 35 [2018-07-25 08:51:45,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:45,294 INFO L225 Difference]: With dead ends: 38 [2018-07-25 08:51:45,294 INFO L226 Difference]: Without dead ends: 37 [2018-07-25 08:51:45,295 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-07-25 08:51:45,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-07-25 08:51:45,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-07-25 08:51:45,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-07-25 08:51:45,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-07-25 08:51:45,298 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-07-25 08:51:45,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:45,298 INFO L472 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-07-25 08:51:45,298 INFO L473 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-07-25 08:51:45,298 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-07-25 08:51:45,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-07-25 08:51:45,299 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:45,299 INFO L354 BasicCegarLoop]: trace histogram [34, 1, 1] [2018-07-25 08:51:45,299 INFO L415 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:45,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1239188083, now seen corresponding path program 34 times [2018-07-25 08:51:45,299 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:45,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:45,471 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:45,471 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:45,471 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-07-25 08:51:45,471 INFO L451 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-07-25 08:51:45,472 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-07-25 08:51:45,473 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 08:51:45,473 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 37 states. [2018-07-25 08:51:45,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:45,494 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-07-25 08:51:45,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-07-25 08:51:45,495 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 36 [2018-07-25 08:51:45,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:45,495 INFO L225 Difference]: With dead ends: 39 [2018-07-25 08:51:45,495 INFO L226 Difference]: Without dead ends: 38 [2018-07-25 08:51:45,496 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 08:51:45,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-07-25 08:51:45,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-07-25 08:51:45,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-07-25 08:51:45,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-07-25 08:51:45,499 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-07-25 08:51:45,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:45,499 INFO L472 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-07-25 08:51:45,499 INFO L473 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-07-25 08:51:45,500 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-07-25 08:51:45,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-07-25 08:51:45,500 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:45,500 INFO L354 BasicCegarLoop]: trace histogram [35, 1, 1] [2018-07-25 08:51:45,500 INFO L415 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:45,501 INFO L82 PathProgramCache]: Analyzing trace with hash -239874856, now seen corresponding path program 35 times [2018-07-25 08:51:45,501 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:45,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:45,669 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:45,669 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:45,670 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-07-25 08:51:45,670 INFO L451 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-07-25 08:51:45,670 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-07-25 08:51:45,671 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-07-25 08:51:45,671 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 38 states. [2018-07-25 08:51:45,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:45,691 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-07-25 08:51:45,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-07-25 08:51:45,692 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 37 [2018-07-25 08:51:45,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:45,692 INFO L225 Difference]: With dead ends: 40 [2018-07-25 08:51:45,692 INFO L226 Difference]: Without dead ends: 39 [2018-07-25 08:51:45,693 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-07-25 08:51:45,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-07-25 08:51:45,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-07-25 08:51:45,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-07-25 08:51:45,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-07-25 08:51:45,696 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-07-25 08:51:45,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:45,696 INFO L472 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-07-25 08:51:45,696 INFO L473 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-07-25 08:51:45,696 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-07-25 08:51:45,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-07-25 08:51:45,697 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:45,697 INFO L354 BasicCegarLoop]: trace histogram [36, 1, 1] [2018-07-25 08:51:45,697 INFO L415 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:45,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1153814291, now seen corresponding path program 36 times [2018-07-25 08:51:45,698 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:45,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:45,861 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:45,861 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:45,861 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-07-25 08:51:45,862 INFO L451 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-07-25 08:51:45,862 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-07-25 08:51:45,863 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-07-25 08:51:45,863 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 39 states. [2018-07-25 08:51:45,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:45,883 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-07-25 08:51:45,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-07-25 08:51:45,883 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 38 [2018-07-25 08:51:45,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:45,883 INFO L225 Difference]: With dead ends: 41 [2018-07-25 08:51:45,883 INFO L226 Difference]: Without dead ends: 40 [2018-07-25 08:51:45,885 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-07-25 08:51:45,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-07-25 08:51:45,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-07-25 08:51:45,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-07-25 08:51:45,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-07-25 08:51:45,887 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-07-25 08:51:45,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:45,888 INFO L472 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-07-25 08:51:45,888 INFO L473 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-07-25 08:51:45,888 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-07-25 08:51:45,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-07-25 08:51:45,888 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:45,888 INFO L354 BasicCegarLoop]: trace histogram [37, 1, 1] [2018-07-25 08:51:45,889 INFO L415 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:45,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1408504888, now seen corresponding path program 37 times [2018-07-25 08:51:45,889 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:45,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:46,059 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:46,059 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:46,060 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-07-25 08:51:46,060 INFO L451 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-07-25 08:51:46,060 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-07-25 08:51:46,061 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-07-25 08:51:46,062 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 40 states. [2018-07-25 08:51:46,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:46,084 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-07-25 08:51:46,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-07-25 08:51:46,084 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 39 [2018-07-25 08:51:46,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:46,084 INFO L225 Difference]: With dead ends: 42 [2018-07-25 08:51:46,085 INFO L226 Difference]: Without dead ends: 41 [2018-07-25 08:51:46,086 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-07-25 08:51:46,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-07-25 08:51:46,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-07-25 08:51:46,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-07-25 08:51:46,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-07-25 08:51:46,091 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-07-25 08:51:46,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:46,091 INFO L472 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-07-25 08:51:46,091 INFO L473 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-07-25 08:51:46,091 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-07-25 08:51:46,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-07-25 08:51:46,092 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:46,092 INFO L354 BasicCegarLoop]: trace histogram [38, 1, 1] [2018-07-25 08:51:46,092 INFO L415 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:46,092 INFO L82 PathProgramCache]: Analyzing trace with hash 713978803, now seen corresponding path program 38 times [2018-07-25 08:51:46,092 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:46,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:46,263 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:46,263 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:46,264 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-07-25 08:51:46,264 INFO L451 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-07-25 08:51:46,264 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-07-25 08:51:46,265 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-07-25 08:51:46,266 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 41 states. [2018-07-25 08:51:46,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:46,284 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-07-25 08:51:46,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-07-25 08:51:46,284 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 40 [2018-07-25 08:51:46,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:46,285 INFO L225 Difference]: With dead ends: 43 [2018-07-25 08:51:46,285 INFO L226 Difference]: Without dead ends: 42 [2018-07-25 08:51:46,286 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-07-25 08:51:46,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-07-25 08:51:46,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-07-25 08:51:46,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-07-25 08:51:46,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-07-25 08:51:46,292 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-07-25 08:51:46,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:46,292 INFO L472 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-07-25 08:51:46,292 INFO L473 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-07-25 08:51:46,292 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-07-25 08:51:46,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-07-25 08:51:46,293 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:46,293 INFO L354 BasicCegarLoop]: trace histogram [39, 1, 1] [2018-07-25 08:51:46,293 INFO L415 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:46,293 INFO L82 PathProgramCache]: Analyzing trace with hash 658506648, now seen corresponding path program 39 times [2018-07-25 08:51:46,293 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:46,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:46,478 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:46,479 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:46,479 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-07-25 08:51:46,479 INFO L451 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-07-25 08:51:46,480 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-07-25 08:51:46,481 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-07-25 08:51:46,481 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 42 states. [2018-07-25 08:51:46,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:46,502 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-07-25 08:51:46,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-07-25 08:51:46,503 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 41 [2018-07-25 08:51:46,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:46,503 INFO L225 Difference]: With dead ends: 44 [2018-07-25 08:51:46,503 INFO L226 Difference]: Without dead ends: 43 [2018-07-25 08:51:46,505 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-07-25 08:51:46,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-07-25 08:51:46,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-07-25 08:51:46,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-07-25 08:51:46,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-07-25 08:51:46,507 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-07-25 08:51:46,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:46,509 INFO L472 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-07-25 08:51:46,510 INFO L473 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-07-25 08:51:46,510 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-07-25 08:51:46,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-07-25 08:51:46,510 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:46,510 INFO L354 BasicCegarLoop]: trace histogram [40, 1, 1] [2018-07-25 08:51:46,510 INFO L415 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:46,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1061130157, now seen corresponding path program 40 times [2018-07-25 08:51:46,511 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:46,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:46,738 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:46,739 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:46,739 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-07-25 08:51:46,739 INFO L451 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-07-25 08:51:46,740 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-07-25 08:51:46,741 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-07-25 08:51:46,741 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 43 states. [2018-07-25 08:51:46,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:46,768 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-07-25 08:51:46,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-07-25 08:51:46,769 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 42 [2018-07-25 08:51:46,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:46,769 INFO L225 Difference]: With dead ends: 45 [2018-07-25 08:51:46,769 INFO L226 Difference]: Without dead ends: 44 [2018-07-25 08:51:46,771 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-07-25 08:51:46,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-07-25 08:51:46,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-07-25 08:51:46,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-07-25 08:51:46,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-07-25 08:51:46,773 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-07-25 08:51:46,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:46,774 INFO L472 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-07-25 08:51:46,774 INFO L473 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-07-25 08:51:46,774 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-07-25 08:51:46,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-07-25 08:51:46,775 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:46,775 INFO L354 BasicCegarLoop]: trace histogram [41, 1, 1] [2018-07-25 08:51:46,775 INFO L415 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:46,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1464703736, now seen corresponding path program 41 times [2018-07-25 08:51:46,776 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:46,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:47,028 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:47,028 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:47,029 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-07-25 08:51:47,029 INFO L451 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-07-25 08:51:47,030 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-07-25 08:51:47,030 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-07-25 08:51:47,031 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 44 states. [2018-07-25 08:51:47,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:47,053 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-07-25 08:51:47,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-07-25 08:51:47,053 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 43 [2018-07-25 08:51:47,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:47,054 INFO L225 Difference]: With dead ends: 46 [2018-07-25 08:51:47,054 INFO L226 Difference]: Without dead ends: 45 [2018-07-25 08:51:47,056 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-07-25 08:51:47,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-07-25 08:51:47,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-07-25 08:51:47,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-07-25 08:51:47,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-07-25 08:51:47,060 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-07-25 08:51:47,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:47,061 INFO L472 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-07-25 08:51:47,061 INFO L473 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-07-25 08:51:47,061 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-07-25 08:51:47,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-07-25 08:51:47,061 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:47,062 INFO L354 BasicCegarLoop]: trace histogram [42, 1, 1] [2018-07-25 08:51:47,062 INFO L415 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:47,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1838824205, now seen corresponding path program 42 times [2018-07-25 08:51:47,062 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:47,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:47,450 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:47,450 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:47,450 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-07-25 08:51:47,451 INFO L451 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-07-25 08:51:47,452 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-07-25 08:51:47,453 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-07-25 08:51:47,453 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 45 states. [2018-07-25 08:51:47,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:47,478 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-07-25 08:51:47,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-07-25 08:51:47,479 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 44 [2018-07-25 08:51:47,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:47,479 INFO L225 Difference]: With dead ends: 47 [2018-07-25 08:51:47,479 INFO L226 Difference]: Without dead ends: 46 [2018-07-25 08:51:47,482 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-07-25 08:51:47,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-07-25 08:51:47,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-07-25 08:51:47,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-07-25 08:51:47,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-07-25 08:51:47,486 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-07-25 08:51:47,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:47,486 INFO L472 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-07-25 08:51:47,486 INFO L473 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-07-25 08:51:47,486 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-07-25 08:51:47,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-07-25 08:51:47,487 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:47,487 INFO L354 BasicCegarLoop]: trace histogram [43, 1, 1] [2018-07-25 08:51:47,487 INFO L415 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:47,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1168975272, now seen corresponding path program 43 times [2018-07-25 08:51:47,488 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:47,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:47,705 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:47,705 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:47,705 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-07-25 08:51:47,706 INFO L451 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-07-25 08:51:47,706 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-07-25 08:51:47,707 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-07-25 08:51:47,707 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 46 states. [2018-07-25 08:51:47,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:47,735 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-07-25 08:51:47,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-07-25 08:51:47,736 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 45 [2018-07-25 08:51:47,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:47,736 INFO L225 Difference]: With dead ends: 48 [2018-07-25 08:51:47,736 INFO L226 Difference]: Without dead ends: 47 [2018-07-25 08:51:47,737 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-07-25 08:51:47,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-07-25 08:51:47,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-07-25 08:51:47,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-07-25 08:51:47,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-07-25 08:51:47,741 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-07-25 08:51:47,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:47,741 INFO L472 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-07-25 08:51:47,741 INFO L473 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-07-25 08:51:47,741 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-07-25 08:51:47,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-07-25 08:51:47,742 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:47,742 INFO L354 BasicCegarLoop]: trace histogram [44, 1, 1] [2018-07-25 08:51:47,742 INFO L415 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:47,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1878494829, now seen corresponding path program 44 times [2018-07-25 08:51:47,743 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:47,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:47,977 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:47,978 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:47,978 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-07-25 08:51:47,978 INFO L451 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-07-25 08:51:47,979 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-07-25 08:51:47,979 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-07-25 08:51:47,980 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 47 states. [2018-07-25 08:51:48,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:48,001 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-07-25 08:51:48,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-07-25 08:51:48,001 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 46 [2018-07-25 08:51:48,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:48,002 INFO L225 Difference]: With dead ends: 49 [2018-07-25 08:51:48,002 INFO L226 Difference]: Without dead ends: 48 [2018-07-25 08:51:48,003 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-07-25 08:51:48,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-07-25 08:51:48,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-07-25 08:51:48,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-07-25 08:51:48,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-07-25 08:51:48,005 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-07-25 08:51:48,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:48,005 INFO L472 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-07-25 08:51:48,006 INFO L473 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-07-25 08:51:48,006 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-07-25 08:51:48,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-07-25 08:51:48,006 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:48,008 INFO L354 BasicCegarLoop]: trace histogram [45, 1, 1] [2018-07-25 08:51:48,009 INFO L415 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:48,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1896202680, now seen corresponding path program 45 times [2018-07-25 08:51:48,009 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:48,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:48,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:48,232 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:48,232 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-07-25 08:51:48,232 INFO L451 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-07-25 08:51:48,233 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-07-25 08:51:48,233 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-07-25 08:51:48,233 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 48 states. [2018-07-25 08:51:48,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:48,258 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-07-25 08:51:48,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-07-25 08:51:48,258 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 47 [2018-07-25 08:51:48,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:48,259 INFO L225 Difference]: With dead ends: 50 [2018-07-25 08:51:48,259 INFO L226 Difference]: Without dead ends: 49 [2018-07-25 08:51:48,260 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-07-25 08:51:48,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-07-25 08:51:48,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-07-25 08:51:48,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-07-25 08:51:48,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-07-25 08:51:48,264 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-07-25 08:51:48,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:48,264 INFO L472 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-07-25 08:51:48,265 INFO L473 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-07-25 08:51:48,265 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-07-25 08:51:48,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-07-25 08:51:48,265 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:48,265 INFO L354 BasicCegarLoop]: trace histogram [46, 1, 1] [2018-07-25 08:51:48,266 INFO L415 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:48,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1347258829, now seen corresponding path program 46 times [2018-07-25 08:51:48,266 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:48,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:48,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:48,489 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:48,489 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-07-25 08:51:48,489 INFO L451 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-07-25 08:51:48,489 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-07-25 08:51:48,490 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-07-25 08:51:48,490 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 49 states. [2018-07-25 08:51:48,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:48,521 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-07-25 08:51:48,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-07-25 08:51:48,521 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 48 [2018-07-25 08:51:48,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:48,522 INFO L225 Difference]: With dead ends: 51 [2018-07-25 08:51:48,522 INFO L226 Difference]: Without dead ends: 50 [2018-07-25 08:51:48,523 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-07-25 08:51:48,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-07-25 08:51:48,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-07-25 08:51:48,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-07-25 08:51:48,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-07-25 08:51:48,525 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-07-25 08:51:48,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:48,526 INFO L472 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-07-25 08:51:48,526 INFO L473 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-07-25 08:51:48,526 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-07-25 08:51:48,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-07-25 08:51:48,526 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:48,526 INFO L354 BasicCegarLoop]: trace histogram [47, 1, 1] [2018-07-25 08:51:48,527 INFO L415 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:48,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1184649496, now seen corresponding path program 47 times [2018-07-25 08:51:48,527 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:48,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:48,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:48,759 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:48,759 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-07-25 08:51:48,759 INFO L451 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-07-25 08:51:48,760 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-07-25 08:51:48,760 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-07-25 08:51:48,760 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 50 states. [2018-07-25 08:51:48,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:48,790 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-07-25 08:51:48,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-07-25 08:51:48,790 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 49 [2018-07-25 08:51:48,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:48,791 INFO L225 Difference]: With dead ends: 52 [2018-07-25 08:51:48,791 INFO L226 Difference]: Without dead ends: 51 [2018-07-25 08:51:48,792 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-07-25 08:51:48,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-07-25 08:51:48,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-07-25 08:51:48,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-07-25 08:51:48,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-07-25 08:51:48,796 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-07-25 08:51:48,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:48,797 INFO L472 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-07-25 08:51:48,797 INFO L473 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-07-25 08:51:48,797 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-07-25 08:51:48,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-07-25 08:51:48,797 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:48,797 INFO L354 BasicCegarLoop]: trace histogram [48, 1, 1] [2018-07-25 08:51:48,798 INFO L415 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:48,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1930571053, now seen corresponding path program 48 times [2018-07-25 08:51:48,798 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:48,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:49,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:49,035 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:49,035 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-07-25 08:51:49,035 INFO L451 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-07-25 08:51:49,036 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-07-25 08:51:49,037 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-07-25 08:51:49,037 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 51 states. [2018-07-25 08:51:49,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:49,066 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-07-25 08:51:49,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-07-25 08:51:49,067 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 50 [2018-07-25 08:51:49,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:49,067 INFO L225 Difference]: With dead ends: 53 [2018-07-25 08:51:49,067 INFO L226 Difference]: Without dead ends: 52 [2018-07-25 08:51:49,068 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-07-25 08:51:49,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-07-25 08:51:49,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-07-25 08:51:49,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-07-25 08:51:49,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-07-25 08:51:49,072 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-07-25 08:51:49,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:49,072 INFO L472 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-07-25 08:51:49,072 INFO L473 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-07-25 08:51:49,072 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-07-25 08:51:49,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-07-25 08:51:49,074 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:49,074 INFO L354 BasicCegarLoop]: trace histogram [49, 1, 1] [2018-07-25 08:51:49,074 INFO L415 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:49,074 INFO L82 PathProgramCache]: Analyzing trace with hash 281839736, now seen corresponding path program 49 times [2018-07-25 08:51:49,074 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:49,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:49,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:49,305 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:49,306 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-07-25 08:51:49,306 INFO L451 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-07-25 08:51:49,306 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-07-25 08:51:49,307 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-07-25 08:51:49,307 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 52 states. [2018-07-25 08:51:49,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:49,337 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-07-25 08:51:49,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-07-25 08:51:49,337 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 51 [2018-07-25 08:51:49,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:49,338 INFO L225 Difference]: With dead ends: 54 [2018-07-25 08:51:49,338 INFO L226 Difference]: Without dead ends: 53 [2018-07-25 08:51:49,339 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-07-25 08:51:49,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-07-25 08:51:49,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-07-25 08:51:49,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-07-25 08:51:49,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-07-25 08:51:49,343 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-07-25 08:51:49,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:49,343 INFO L472 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-07-25 08:51:49,343 INFO L473 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-07-25 08:51:49,343 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-07-25 08:51:49,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-07-25 08:51:49,344 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:49,344 INFO L354 BasicCegarLoop]: trace histogram [50, 1, 1] [2018-07-25 08:51:49,344 INFO L415 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:49,344 INFO L82 PathProgramCache]: Analyzing trace with hash 147097459, now seen corresponding path program 50 times [2018-07-25 08:51:49,344 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:49,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:49,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:49,616 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:49,616 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-07-25 08:51:49,617 INFO L451 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-07-25 08:51:49,618 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-07-25 08:51:49,619 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-07-25 08:51:49,619 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 53 states. [2018-07-25 08:51:49,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:49,656 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-07-25 08:51:49,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-07-25 08:51:49,656 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 52 [2018-07-25 08:51:49,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:49,657 INFO L225 Difference]: With dead ends: 55 [2018-07-25 08:51:49,657 INFO L226 Difference]: Without dead ends: 54 [2018-07-25 08:51:49,659 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-07-25 08:51:49,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-07-25 08:51:49,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-07-25 08:51:49,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-07-25 08:51:49,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-07-25 08:51:49,667 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-07-25 08:51:49,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:49,667 INFO L472 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-07-25 08:51:49,667 INFO L473 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-07-25 08:51:49,667 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-07-25 08:51:49,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-07-25 08:51:49,668 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:49,668 INFO L354 BasicCegarLoop]: trace histogram [51, 1, 1] [2018-07-25 08:51:49,668 INFO L415 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:49,669 INFO L82 PathProgramCache]: Analyzing trace with hash 265054168, now seen corresponding path program 51 times [2018-07-25 08:51:49,669 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:49,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:49,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:49,979 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:49,979 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-07-25 08:51:49,980 INFO L451 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-07-25 08:51:49,980 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-07-25 08:51:49,981 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-07-25 08:51:49,982 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 54 states. [2018-07-25 08:51:50,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:50,017 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-07-25 08:51:50,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-07-25 08:51:50,018 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 53 [2018-07-25 08:51:50,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:50,019 INFO L225 Difference]: With dead ends: 56 [2018-07-25 08:51:50,019 INFO L226 Difference]: Without dead ends: 55 [2018-07-25 08:51:50,020 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-07-25 08:51:50,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-07-25 08:51:50,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-07-25 08:51:50,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-07-25 08:51:50,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-07-25 08:51:50,023 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2018-07-25 08:51:50,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:50,024 INFO L472 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-07-25 08:51:50,024 INFO L473 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-07-25 08:51:50,024 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-07-25 08:51:50,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-07-25 08:51:50,028 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:50,028 INFO L354 BasicCegarLoop]: trace histogram [52, 1, 1] [2018-07-25 08:51:50,028 INFO L415 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:50,028 INFO L82 PathProgramCache]: Analyzing trace with hash -373255149, now seen corresponding path program 52 times [2018-07-25 08:51:50,029 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:50,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:50,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:50,334 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:50,334 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-07-25 08:51:50,334 INFO L451 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-07-25 08:51:50,335 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-07-25 08:51:50,336 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-07-25 08:51:50,336 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 55 states. [2018-07-25 08:51:50,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:50,461 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-07-25 08:51:50,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-07-25 08:51:50,461 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 54 [2018-07-25 08:51:50,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:50,462 INFO L225 Difference]: With dead ends: 57 [2018-07-25 08:51:50,462 INFO L226 Difference]: Without dead ends: 56 [2018-07-25 08:51:50,463 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-07-25 08:51:50,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-07-25 08:51:50,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-07-25 08:51:50,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-07-25 08:51:50,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-07-25 08:51:50,466 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2018-07-25 08:51:50,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:50,466 INFO L472 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-07-25 08:51:50,466 INFO L473 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-07-25 08:51:50,466 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-07-25 08:51:50,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-07-25 08:51:50,467 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:50,467 INFO L354 BasicCegarLoop]: trace histogram [53, 1, 1] [2018-07-25 08:51:50,467 INFO L415 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:50,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1313992504, now seen corresponding path program 53 times [2018-07-25 08:51:50,467 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:50,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:50,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:50,723 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:50,723 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-07-25 08:51:50,723 INFO L451 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-07-25 08:51:50,724 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-07-25 08:51:50,724 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-07-25 08:51:50,725 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 56 states. [2018-07-25 08:51:50,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:50,752 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-07-25 08:51:50,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-07-25 08:51:50,752 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 55 [2018-07-25 08:51:50,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:50,753 INFO L225 Difference]: With dead ends: 58 [2018-07-25 08:51:50,753 INFO L226 Difference]: Without dead ends: 57 [2018-07-25 08:51:50,754 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-07-25 08:51:50,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-07-25 08:51:50,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-07-25 08:51:50,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-07-25 08:51:50,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-07-25 08:51:50,757 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2018-07-25 08:51:50,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:50,757 INFO L472 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-07-25 08:51:50,757 INFO L473 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-07-25 08:51:50,757 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-07-25 08:51:50,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-07-25 08:51:50,758 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:50,758 INFO L354 BasicCegarLoop]: trace histogram [54, 1, 1] [2018-07-25 08:51:50,758 INFO L415 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:50,758 INFO L82 PathProgramCache]: Analyzing trace with hash 2079062195, now seen corresponding path program 54 times [2018-07-25 08:51:50,758 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:50,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:51,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:51,011 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:51,011 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-07-25 08:51:51,012 INFO L451 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-07-25 08:51:51,012 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-07-25 08:51:51,013 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-07-25 08:51:51,013 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 57 states. [2018-07-25 08:51:51,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:51,045 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-07-25 08:51:51,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-07-25 08:51:51,046 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 56 [2018-07-25 08:51:51,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:51,046 INFO L225 Difference]: With dead ends: 59 [2018-07-25 08:51:51,046 INFO L226 Difference]: Without dead ends: 58 [2018-07-25 08:51:51,048 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-07-25 08:51:51,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-07-25 08:51:51,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-07-25 08:51:51,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-07-25 08:51:51,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-07-25 08:51:51,051 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2018-07-25 08:51:51,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:51,051 INFO L472 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-07-25 08:51:51,051 INFO L473 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-07-25 08:51:51,051 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-07-25 08:51:51,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-07-25 08:51:51,052 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:51,052 INFO L354 BasicCegarLoop]: trace histogram [55, 1, 1] [2018-07-25 08:51:51,052 INFO L415 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:51,052 INFO L82 PathProgramCache]: Analyzing trace with hash 26418840, now seen corresponding path program 55 times [2018-07-25 08:51:51,052 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:51,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:51,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:51,308 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:51,308 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-07-25 08:51:51,309 INFO L451 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-07-25 08:51:51,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-07-25 08:51:51,310 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-07-25 08:51:51,311 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 58 states. [2018-07-25 08:51:51,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:51,351 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-07-25 08:51:51,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-07-25 08:51:51,352 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 57 [2018-07-25 08:51:51,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:51,352 INFO L225 Difference]: With dead ends: 60 [2018-07-25 08:51:51,352 INFO L226 Difference]: Without dead ends: 59 [2018-07-25 08:51:51,353 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-07-25 08:51:51,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-07-25 08:51:51,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-07-25 08:51:51,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-07-25 08:51:51,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-07-25 08:51:51,356 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2018-07-25 08:51:51,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:51,356 INFO L472 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-07-25 08:51:51,356 INFO L473 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-07-25 08:51:51,357 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-07-25 08:51:51,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-07-25 08:51:51,357 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:51,357 INFO L354 BasicCegarLoop]: trace histogram [56, 1, 1] [2018-07-25 08:51:51,358 INFO L415 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:51,358 INFO L82 PathProgramCache]: Analyzing trace with hash 818984275, now seen corresponding path program 56 times [2018-07-25 08:51:51,358 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:51,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:51,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:51,635 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:51,635 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-07-25 08:51:51,635 INFO L451 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-07-25 08:51:51,636 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-07-25 08:51:51,637 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-07-25 08:51:51,637 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 59 states. [2018-07-25 08:51:51,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:51,676 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-07-25 08:51:51,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-07-25 08:51:51,676 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 58 [2018-07-25 08:51:51,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:51,677 INFO L225 Difference]: With dead ends: 61 [2018-07-25 08:51:51,677 INFO L226 Difference]: Without dead ends: 60 [2018-07-25 08:51:51,678 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-07-25 08:51:51,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-07-25 08:51:51,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-07-25 08:51:51,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-07-25 08:51:51,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-07-25 08:51:51,683 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2018-07-25 08:51:51,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:51,683 INFO L472 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-07-25 08:51:51,683 INFO L473 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-07-25 08:51:51,683 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-07-25 08:51:51,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-07-25 08:51:51,684 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:51,684 INFO L354 BasicCegarLoop]: trace histogram [57, 1, 1] [2018-07-25 08:51:51,684 INFO L415 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:51,684 INFO L82 PathProgramCache]: Analyzing trace with hash -381291016, now seen corresponding path program 57 times [2018-07-25 08:51:51,685 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:51,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:51,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:51,989 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:51,989 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-07-25 08:51:51,989 INFO L451 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-07-25 08:51:51,990 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-07-25 08:51:51,991 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-07-25 08:51:51,992 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 60 states. [2018-07-25 08:51:52,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:52,025 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-07-25 08:51:52,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-07-25 08:51:52,025 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 59 [2018-07-25 08:51:52,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:52,026 INFO L225 Difference]: With dead ends: 62 [2018-07-25 08:51:52,026 INFO L226 Difference]: Without dead ends: 61 [2018-07-25 08:51:52,028 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-07-25 08:51:52,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-07-25 08:51:52,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-07-25 08:51:52,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-07-25 08:51:52,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-07-25 08:51:52,030 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2018-07-25 08:51:52,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:52,030 INFO L472 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-07-25 08:51:52,030 INFO L473 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-07-25 08:51:52,031 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-07-25 08:51:52,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-07-25 08:51:52,031 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:52,031 INFO L354 BasicCegarLoop]: trace histogram [58, 1, 1] [2018-07-25 08:51:52,031 INFO L415 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:52,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1064880627, now seen corresponding path program 58 times [2018-07-25 08:51:52,032 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:52,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:52,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:52,321 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:52,322 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-07-25 08:51:52,322 INFO L451 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-07-25 08:51:52,323 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-07-25 08:51:52,324 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-07-25 08:51:52,324 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 61 states. [2018-07-25 08:51:52,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:52,366 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-07-25 08:51:52,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-07-25 08:51:52,366 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 60 [2018-07-25 08:51:52,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:52,367 INFO L225 Difference]: With dead ends: 63 [2018-07-25 08:51:52,367 INFO L226 Difference]: Without dead ends: 62 [2018-07-25 08:51:52,369 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-07-25 08:51:52,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-07-25 08:51:52,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-07-25 08:51:52,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-07-25 08:51:52,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-07-25 08:51:52,372 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2018-07-25 08:51:52,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:52,373 INFO L472 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-07-25 08:51:52,373 INFO L473 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-07-25 08:51:52,373 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-07-25 08:51:52,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-07-25 08:51:52,374 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:52,374 INFO L354 BasicCegarLoop]: trace histogram [59, 1, 1] [2018-07-25 08:51:52,374 INFO L415 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:52,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1348438696, now seen corresponding path program 59 times [2018-07-25 08:51:52,374 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:52,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:52,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:52,684 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:52,684 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-07-25 08:51:52,684 INFO L451 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-07-25 08:51:52,685 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-07-25 08:51:52,686 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-07-25 08:51:52,686 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 62 states. [2018-07-25 08:51:52,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:52,722 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-07-25 08:51:52,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-07-25 08:51:52,722 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 61 [2018-07-25 08:51:52,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:52,723 INFO L225 Difference]: With dead ends: 64 [2018-07-25 08:51:52,724 INFO L226 Difference]: Without dead ends: 63 [2018-07-25 08:51:52,725 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-07-25 08:51:52,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-07-25 08:51:52,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-07-25 08:51:52,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-07-25 08:51:52,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-07-25 08:51:52,728 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2018-07-25 08:51:52,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:52,728 INFO L472 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-07-25 08:51:52,728 INFO L473 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-07-25 08:51:52,728 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-07-25 08:51:52,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-07-25 08:51:52,729 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:52,729 INFO L354 BasicCegarLoop]: trace histogram [60, 1, 1] [2018-07-25 08:51:52,729 INFO L415 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:52,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1148073619, now seen corresponding path program 60 times [2018-07-25 08:51:52,729 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:52,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:53,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:53,027 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:53,027 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-07-25 08:51:53,028 INFO L451 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-07-25 08:51:53,028 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-07-25 08:51:53,029 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-07-25 08:51:53,029 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 63 states. [2018-07-25 08:51:53,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:53,075 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-07-25 08:51:53,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-07-25 08:51:53,075 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 62 [2018-07-25 08:51:53,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:53,076 INFO L225 Difference]: With dead ends: 65 [2018-07-25 08:51:53,076 INFO L226 Difference]: Without dead ends: 64 [2018-07-25 08:51:53,077 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-07-25 08:51:53,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-07-25 08:51:53,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-07-25 08:51:53,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-07-25 08:51:53,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-07-25 08:51:53,080 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2018-07-25 08:51:53,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:53,081 INFO L472 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-07-25 08:51:53,081 INFO L473 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-07-25 08:51:53,081 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-07-25 08:51:53,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-07-25 08:51:53,081 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:53,082 INFO L354 BasicCegarLoop]: trace histogram [61, 1, 1] [2018-07-25 08:51:53,082 INFO L415 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:53,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1230544056, now seen corresponding path program 61 times [2018-07-25 08:51:53,082 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:53,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:53,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:53,513 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:53,513 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-07-25 08:51:53,513 INFO L451 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-07-25 08:51:53,514 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-07-25 08:51:53,516 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-07-25 08:51:53,517 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 64 states. [2018-07-25 08:51:53,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:53,553 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-07-25 08:51:53,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-07-25 08:51:53,553 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 63 [2018-07-25 08:51:53,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:53,554 INFO L225 Difference]: With dead ends: 66 [2018-07-25 08:51:53,554 INFO L226 Difference]: Without dead ends: 65 [2018-07-25 08:51:53,555 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-07-25 08:51:53,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-07-25 08:51:53,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-07-25 08:51:53,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-07-25 08:51:53,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-07-25 08:51:53,559 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2018-07-25 08:51:53,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:53,559 INFO L472 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-07-25 08:51:53,560 INFO L473 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-07-25 08:51:53,560 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-07-25 08:51:53,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-07-25 08:51:53,560 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:53,561 INFO L354 BasicCegarLoop]: trace histogram [62, 1, 1] [2018-07-25 08:51:53,561 INFO L415 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:53,561 INFO L82 PathProgramCache]: Analyzing trace with hash -507839693, now seen corresponding path program 62 times [2018-07-25 08:51:53,561 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:53,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:53,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:53,848 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:53,849 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-07-25 08:51:53,849 INFO L451 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-07-25 08:51:53,852 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-07-25 08:51:53,853 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-07-25 08:51:53,853 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 65 states. [2018-07-25 08:51:53,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:53,899 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-07-25 08:51:53,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-07-25 08:51:53,899 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 64 [2018-07-25 08:51:53,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:53,900 INFO L225 Difference]: With dead ends: 67 [2018-07-25 08:51:53,900 INFO L226 Difference]: Without dead ends: 66 [2018-07-25 08:51:53,901 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-07-25 08:51:53,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-07-25 08:51:53,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-07-25 08:51:53,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-07-25 08:51:53,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-07-25 08:51:53,904 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2018-07-25 08:51:53,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:53,904 INFO L472 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-07-25 08:51:53,904 INFO L473 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-07-25 08:51:53,904 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-07-25 08:51:53,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-07-25 08:51:53,905 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:53,905 INFO L354 BasicCegarLoop]: trace histogram [63, 1, 1] [2018-07-25 08:51:53,905 INFO L415 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:53,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1436838936, now seen corresponding path program 63 times [2018-07-25 08:51:53,906 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:53,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:54,233 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:54,234 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:54,234 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-07-25 08:51:54,234 INFO L451 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-07-25 08:51:54,235 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-07-25 08:51:54,236 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-07-25 08:51:54,241 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 66 states. [2018-07-25 08:51:54,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:54,274 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-07-25 08:51:54,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-07-25 08:51:54,274 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 65 [2018-07-25 08:51:54,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:54,275 INFO L225 Difference]: With dead ends: 68 [2018-07-25 08:51:54,275 INFO L226 Difference]: Without dead ends: 67 [2018-07-25 08:51:54,276 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-07-25 08:51:54,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-07-25 08:51:54,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-07-25 08:51:54,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-07-25 08:51:54,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-07-25 08:51:54,279 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2018-07-25 08:51:54,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:54,280 INFO L472 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-07-25 08:51:54,280 INFO L473 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-07-25 08:51:54,280 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-07-25 08:51:54,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-07-25 08:51:54,280 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:54,281 INFO L354 BasicCegarLoop]: trace histogram [64, 1, 1] [2018-07-25 08:51:54,281 INFO L415 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:54,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1592334291, now seen corresponding path program 64 times [2018-07-25 08:51:54,281 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:54,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:54,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:54,584 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:54,584 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-07-25 08:51:54,584 INFO L451 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-07-25 08:51:54,585 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-07-25 08:51:54,585 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-07-25 08:51:54,586 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 67 states. [2018-07-25 08:51:54,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:54,631 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-07-25 08:51:54,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-07-25 08:51:54,631 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 66 [2018-07-25 08:51:54,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:54,632 INFO L225 Difference]: With dead ends: 69 [2018-07-25 08:51:54,632 INFO L226 Difference]: Without dead ends: 68 [2018-07-25 08:51:54,633 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-07-25 08:51:54,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-07-25 08:51:54,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-07-25 08:51:54,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-07-25 08:51:54,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-07-25 08:51:54,636 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2018-07-25 08:51:54,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:54,636 INFO L472 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-07-25 08:51:54,636 INFO L473 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-07-25 08:51:54,637 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-07-25 08:51:54,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-07-25 08:51:54,637 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:54,637 INFO L354 BasicCegarLoop]: trace histogram [65, 1, 1] [2018-07-25 08:51:54,638 INFO L415 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:54,638 INFO L82 PathProgramCache]: Analyzing trace with hash 2117723000, now seen corresponding path program 65 times [2018-07-25 08:51:54,638 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:54,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:54,930 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:54,931 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:54,931 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-07-25 08:51:54,931 INFO L451 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-07-25 08:51:54,932 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-07-25 08:51:54,932 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-07-25 08:51:54,933 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 68 states. [2018-07-25 08:51:54,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:54,981 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-07-25 08:51:54,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-07-25 08:51:54,982 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 67 [2018-07-25 08:51:54,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:54,982 INFO L225 Difference]: With dead ends: 70 [2018-07-25 08:51:54,982 INFO L226 Difference]: Without dead ends: 69 [2018-07-25 08:51:54,983 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-07-25 08:51:54,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-07-25 08:51:54,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-07-25 08:51:54,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-07-25 08:51:54,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-07-25 08:51:54,986 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2018-07-25 08:51:54,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:54,986 INFO L472 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-07-25 08:51:54,986 INFO L473 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-07-25 08:51:54,986 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-07-25 08:51:54,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-07-25 08:51:54,987 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:54,987 INFO L354 BasicCegarLoop]: trace histogram [66, 1, 1] [2018-07-25 08:51:54,987 INFO L415 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:54,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1224903795, now seen corresponding path program 66 times [2018-07-25 08:51:54,988 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:55,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:55,297 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:55,298 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:55,298 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-07-25 08:51:55,298 INFO L451 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-07-25 08:51:55,299 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-07-25 08:51:55,299 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-07-25 08:51:55,300 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 69 states. [2018-07-25 08:51:55,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:55,336 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-07-25 08:51:55,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-07-25 08:51:55,337 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 68 [2018-07-25 08:51:55,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:55,337 INFO L225 Difference]: With dead ends: 71 [2018-07-25 08:51:55,337 INFO L226 Difference]: Without dead ends: 70 [2018-07-25 08:51:55,338 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-07-25 08:51:55,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-07-25 08:51:55,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-07-25 08:51:55,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-07-25 08:51:55,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-07-25 08:51:55,341 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2018-07-25 08:51:55,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:55,341 INFO L472 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-07-25 08:51:55,342 INFO L473 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-07-25 08:51:55,342 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-07-25 08:51:55,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-07-25 08:51:55,342 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:55,343 INFO L354 BasicCegarLoop]: trace histogram [67, 1, 1] [2018-07-25 08:51:55,343 INFO L415 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:55,343 INFO L82 PathProgramCache]: Analyzing trace with hash -682687784, now seen corresponding path program 67 times [2018-07-25 08:51:55,343 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:55,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:55,681 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:55,681 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:55,681 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-07-25 08:51:55,682 INFO L451 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-07-25 08:51:55,683 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-07-25 08:51:55,683 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-07-25 08:51:55,683 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 70 states. [2018-07-25 08:51:55,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:55,737 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-07-25 08:51:55,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-07-25 08:51:55,737 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 69 [2018-07-25 08:51:55,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:55,738 INFO L225 Difference]: With dead ends: 72 [2018-07-25 08:51:55,738 INFO L226 Difference]: Without dead ends: 71 [2018-07-25 08:51:55,739 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-07-25 08:51:55,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-07-25 08:51:55,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-07-25 08:51:55,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-07-25 08:51:55,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-07-25 08:51:55,742 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2018-07-25 08:51:55,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:55,742 INFO L472 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-07-25 08:51:55,742 INFO L473 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-07-25 08:51:55,742 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-07-25 08:51:55,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-07-25 08:51:55,743 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:55,743 INFO L354 BasicCegarLoop]: trace histogram [68, 1, 1] [2018-07-25 08:51:55,743 INFO L415 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:55,744 INFO L82 PathProgramCache]: Analyzing trace with hash 311515411, now seen corresponding path program 68 times [2018-07-25 08:51:55,744 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:55,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:56,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:56,158 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:56,158 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-07-25 08:51:56,159 INFO L451 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-07-25 08:51:56,159 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-07-25 08:51:56,160 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-07-25 08:51:56,160 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 71 states. [2018-07-25 08:51:56,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:56,216 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-07-25 08:51:56,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-07-25 08:51:56,216 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 70 [2018-07-25 08:51:56,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:56,217 INFO L225 Difference]: With dead ends: 73 [2018-07-25 08:51:56,217 INFO L226 Difference]: Without dead ends: 72 [2018-07-25 08:51:56,218 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-07-25 08:51:56,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-07-25 08:51:56,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-07-25 08:51:56,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-07-25 08:51:56,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-07-25 08:51:56,221 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2018-07-25 08:51:56,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:56,221 INFO L472 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-07-25 08:51:56,221 INFO L473 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-07-25 08:51:56,222 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-07-25 08:51:56,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-07-25 08:51:56,222 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:56,222 INFO L354 BasicCegarLoop]: trace histogram [69, 1, 1] [2018-07-25 08:51:56,223 INFO L415 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:56,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1067043384, now seen corresponding path program 69 times [2018-07-25 08:51:56,223 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:56,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:56,596 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:56,596 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:56,596 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-07-25 08:51:56,597 INFO L451 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-07-25 08:51:56,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-07-25 08:51:56,598 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-07-25 08:51:56,598 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 72 states. [2018-07-25 08:51:56,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:56,664 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-07-25 08:51:56,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-07-25 08:51:56,664 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 71 [2018-07-25 08:51:56,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:56,665 INFO L225 Difference]: With dead ends: 74 [2018-07-25 08:51:56,665 INFO L226 Difference]: Without dead ends: 73 [2018-07-25 08:51:56,666 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-07-25 08:51:56,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-07-25 08:51:56,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-07-25 08:51:56,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-07-25 08:51:56,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-07-25 08:51:56,669 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2018-07-25 08:51:56,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:56,669 INFO L472 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-07-25 08:51:56,670 INFO L473 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-07-25 08:51:56,670 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-07-25 08:51:56,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-07-25 08:51:56,670 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:56,670 INFO L354 BasicCegarLoop]: trace histogram [70, 1, 1] [2018-07-25 08:51:56,671 INFO L415 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:56,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1281393229, now seen corresponding path program 70 times [2018-07-25 08:51:56,671 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:56,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:57,017 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:57,018 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:57,018 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-07-25 08:51:57,019 INFO L451 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-07-25 08:51:57,020 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-07-25 08:51:57,021 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-07-25 08:51:57,021 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 73 states. [2018-07-25 08:51:57,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:57,081 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-07-25 08:51:57,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-07-25 08:51:57,081 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 72 [2018-07-25 08:51:57,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:57,082 INFO L225 Difference]: With dead ends: 75 [2018-07-25 08:51:57,082 INFO L226 Difference]: Without dead ends: 74 [2018-07-25 08:51:57,083 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-07-25 08:51:57,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-07-25 08:51:57,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-07-25 08:51:57,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-07-25 08:51:57,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-07-25 08:51:57,086 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2018-07-25 08:51:57,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:57,087 INFO L472 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-07-25 08:51:57,087 INFO L473 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-07-25 08:51:57,087 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-07-25 08:51:57,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-07-25 08:51:57,088 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:57,088 INFO L354 BasicCegarLoop]: trace histogram [71, 1, 1] [2018-07-25 08:51:57,088 INFO L415 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:57,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1068484200, now seen corresponding path program 71 times [2018-07-25 08:51:57,088 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:57,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:57,428 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:57,428 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:57,428 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-07-25 08:51:57,429 INFO L451 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-07-25 08:51:57,433 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-07-25 08:51:57,433 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-07-25 08:51:57,434 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 74 states. [2018-07-25 08:51:57,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:57,483 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-07-25 08:51:57,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-07-25 08:51:57,484 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 73 [2018-07-25 08:51:57,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:57,484 INFO L225 Difference]: With dead ends: 76 [2018-07-25 08:51:57,484 INFO L226 Difference]: Without dead ends: 75 [2018-07-25 08:51:57,486 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-07-25 08:51:57,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-07-25 08:51:57,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-07-25 08:51:57,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-07-25 08:51:57,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-07-25 08:51:57,489 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2018-07-25 08:51:57,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:57,489 INFO L472 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-07-25 08:51:57,489 INFO L473 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-07-25 08:51:57,489 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-07-25 08:51:57,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-07-25 08:51:57,490 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:57,490 INFO L354 BasicCegarLoop]: trace histogram [72, 1, 1] [2018-07-25 08:51:57,490 INFO L415 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:57,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1236728403, now seen corresponding path program 72 times [2018-07-25 08:51:57,490 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:57,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:57,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:57,823 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:57,824 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-07-25 08:51:57,824 INFO L451 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-07-25 08:51:57,825 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-07-25 08:51:57,825 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-07-25 08:51:57,826 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 75 states. [2018-07-25 08:51:57,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:57,869 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-07-25 08:51:57,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-07-25 08:51:57,870 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 74 [2018-07-25 08:51:57,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:57,870 INFO L225 Difference]: With dead ends: 77 [2018-07-25 08:51:57,871 INFO L226 Difference]: Without dead ends: 76 [2018-07-25 08:51:57,872 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-07-25 08:51:57,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-07-25 08:51:57,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-07-25 08:51:57,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-07-25 08:51:57,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-07-25 08:51:57,875 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2018-07-25 08:51:57,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:57,875 INFO L472 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-07-25 08:51:57,876 INFO L473 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-07-25 08:51:57,876 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-07-25 08:51:57,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-07-25 08:51:57,876 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:57,877 INFO L354 BasicCegarLoop]: trace histogram [73, 1, 1] [2018-07-25 08:51:57,877 INFO L415 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:57,877 INFO L82 PathProgramCache]: Analyzing trace with hash -316124936, now seen corresponding path program 73 times [2018-07-25 08:51:57,877 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:57,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:58,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:58,211 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:58,211 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-07-25 08:51:58,212 INFO L451 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-07-25 08:51:58,213 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-07-25 08:51:58,213 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-07-25 08:51:58,214 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 76 states. [2018-07-25 08:51:58,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:58,255 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-07-25 08:51:58,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-07-25 08:51:58,255 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 75 [2018-07-25 08:51:58,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:58,256 INFO L225 Difference]: With dead ends: 78 [2018-07-25 08:51:58,256 INFO L226 Difference]: Without dead ends: 77 [2018-07-25 08:51:58,257 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-07-25 08:51:58,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-07-25 08:51:58,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-07-25 08:51:58,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-07-25 08:51:58,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-07-25 08:51:58,260 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2018-07-25 08:51:58,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:58,261 INFO L472 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-07-25 08:51:58,261 INFO L473 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-07-25 08:51:58,261 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-07-25 08:51:58,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-07-25 08:51:58,261 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:58,261 INFO L354 BasicCegarLoop]: trace histogram [74, 1, 1] [2018-07-25 08:51:58,262 INFO L415 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:58,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1209938189, now seen corresponding path program 74 times [2018-07-25 08:51:58,262 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:58,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:58,631 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:58,631 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:58,631 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-07-25 08:51:58,632 INFO L451 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-07-25 08:51:58,633 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-07-25 08:51:58,634 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-07-25 08:51:58,634 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 77 states. [2018-07-25 08:51:58,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:58,684 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-07-25 08:51:58,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-07-25 08:51:58,684 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 76 [2018-07-25 08:51:58,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:58,685 INFO L225 Difference]: With dead ends: 79 [2018-07-25 08:51:58,685 INFO L226 Difference]: Without dead ends: 78 [2018-07-25 08:51:58,687 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-07-25 08:51:58,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-07-25 08:51:58,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-07-25 08:51:58,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-07-25 08:51:58,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-07-25 08:51:58,691 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2018-07-25 08:51:58,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:58,691 INFO L472 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-07-25 08:51:58,691 INFO L473 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-07-25 08:51:58,692 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-07-25 08:51:58,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-07-25 08:51:58,692 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:58,693 INFO L354 BasicCegarLoop]: trace histogram [75, 1, 1] [2018-07-25 08:51:58,693 INFO L415 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:58,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1146622040, now seen corresponding path program 75 times [2018-07-25 08:51:58,693 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:58,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:59,159 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:59,159 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:59,160 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-07-25 08:51:59,160 INFO L451 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-07-25 08:51:59,162 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-07-25 08:51:59,163 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-07-25 08:51:59,163 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 78 states. [2018-07-25 08:51:59,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:59,221 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-07-25 08:51:59,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-07-25 08:51:59,221 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 77 [2018-07-25 08:51:59,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:59,222 INFO L225 Difference]: With dead ends: 80 [2018-07-25 08:51:59,222 INFO L226 Difference]: Without dead ends: 79 [2018-07-25 08:51:59,224 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-07-25 08:51:59,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-07-25 08:51:59,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-07-25 08:51:59,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-07-25 08:51:59,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-07-25 08:51:59,227 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2018-07-25 08:51:59,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:59,228 INFO L472 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-07-25 08:51:59,228 INFO L473 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-07-25 08:51:59,228 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-07-25 08:51:59,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-07-25 08:51:59,229 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:59,229 INFO L354 BasicCegarLoop]: trace histogram [76, 1, 1] [2018-07-25 08:51:59,229 INFO L415 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:59,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1185545107, now seen corresponding path program 76 times [2018-07-25 08:51:59,230 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:59,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:59,660 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:59,661 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:59,661 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-07-25 08:51:59,661 INFO L451 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-07-25 08:51:59,662 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-07-25 08:51:59,663 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-07-25 08:51:59,663 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 79 states. [2018-07-25 08:51:59,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:59,732 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-07-25 08:51:59,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-07-25 08:51:59,732 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 78 [2018-07-25 08:51:59,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:59,733 INFO L225 Difference]: With dead ends: 81 [2018-07-25 08:51:59,733 INFO L226 Difference]: Without dead ends: 80 [2018-07-25 08:51:59,734 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-07-25 08:51:59,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-07-25 08:51:59,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-07-25 08:51:59,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-07-25 08:51:59,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-07-25 08:51:59,738 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2018-07-25 08:51:59,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:59,738 INFO L472 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-07-25 08:51:59,738 INFO L473 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-07-25 08:51:59,738 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-07-25 08:51:59,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-07-25 08:51:59,739 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:59,739 INFO L354 BasicCegarLoop]: trace histogram [77, 1, 1] [2018-07-25 08:51:59,739 INFO L415 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:59,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1902807112, now seen corresponding path program 77 times [2018-07-25 08:51:59,740 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:59,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:00,045 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:00,045 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:00,046 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-07-25 08:52:00,046 INFO L451 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-07-25 08:52:00,047 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-07-25 08:52:00,048 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-07-25 08:52:00,048 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 80 states. [2018-07-25 08:52:00,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:00,125 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-07-25 08:52:00,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-07-25 08:52:00,126 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 79 [2018-07-25 08:52:00,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:00,126 INFO L225 Difference]: With dead ends: 82 [2018-07-25 08:52:00,127 INFO L226 Difference]: Without dead ends: 81 [2018-07-25 08:52:00,128 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-07-25 08:52:00,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-07-25 08:52:00,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-07-25 08:52:00,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-07-25 08:52:00,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-07-25 08:52:00,131 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2018-07-25 08:52:00,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:00,131 INFO L472 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-07-25 08:52:00,131 INFO L473 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-07-25 08:52:00,131 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-07-25 08:52:00,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-07-25 08:52:00,132 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:00,132 INFO L354 BasicCegarLoop]: trace histogram [78, 1, 1] [2018-07-25 08:52:00,133 INFO L415 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:00,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1142521907, now seen corresponding path program 78 times [2018-07-25 08:52:00,133 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:00,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:00,487 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:00,487 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:00,487 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-07-25 08:52:00,487 INFO L451 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-07-25 08:52:00,489 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-07-25 08:52:00,489 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-07-25 08:52:00,490 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 81 states. [2018-07-25 08:52:00,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:00,571 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-07-25 08:52:00,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-07-25 08:52:00,572 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 80 [2018-07-25 08:52:00,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:00,572 INFO L225 Difference]: With dead ends: 83 [2018-07-25 08:52:00,573 INFO L226 Difference]: Without dead ends: 82 [2018-07-25 08:52:00,574 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-07-25 08:52:00,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-07-25 08:52:00,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-07-25 08:52:00,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-07-25 08:52:00,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-07-25 08:52:00,577 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2018-07-25 08:52:00,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:00,577 INFO L472 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-07-25 08:52:00,577 INFO L473 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-07-25 08:52:00,577 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-07-25 08:52:00,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-07-25 08:52:00,578 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:00,578 INFO L354 BasicCegarLoop]: trace histogram [79, 1, 1] [2018-07-25 08:52:00,579 INFO L415 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:00,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1058440984, now seen corresponding path program 79 times [2018-07-25 08:52:00,579 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:00,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:00,924 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:00,924 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:00,925 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-07-25 08:52:00,925 INFO L451 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-07-25 08:52:00,926 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-07-25 08:52:00,927 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-07-25 08:52:00,927 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 82 states. [2018-07-25 08:52:00,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:00,989 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-07-25 08:52:00,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-07-25 08:52:00,989 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 81 [2018-07-25 08:52:00,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:00,990 INFO L225 Difference]: With dead ends: 84 [2018-07-25 08:52:00,990 INFO L226 Difference]: Without dead ends: 83 [2018-07-25 08:52:00,991 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-07-25 08:52:00,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-07-25 08:52:00,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-07-25 08:52:00,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-07-25 08:52:00,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-07-25 08:52:00,994 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2018-07-25 08:52:00,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:00,994 INFO L472 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-07-25 08:52:00,994 INFO L473 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-07-25 08:52:00,995 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-07-25 08:52:00,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-07-25 08:52:00,995 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:00,995 INFO L354 BasicCegarLoop]: trace histogram [80, 1, 1] [2018-07-25 08:52:00,996 INFO L415 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:00,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1548067629, now seen corresponding path program 80 times [2018-07-25 08:52:00,996 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:01,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:01,325 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:01,326 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:01,326 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-07-25 08:52:01,326 INFO L451 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-07-25 08:52:01,328 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-07-25 08:52:01,328 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-07-25 08:52:01,328 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 83 states. [2018-07-25 08:52:01,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:01,373 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-07-25 08:52:01,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-07-25 08:52:01,374 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 82 [2018-07-25 08:52:01,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:01,374 INFO L225 Difference]: With dead ends: 85 [2018-07-25 08:52:01,374 INFO L226 Difference]: Without dead ends: 84 [2018-07-25 08:52:01,375 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-07-25 08:52:01,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-07-25 08:52:01,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-07-25 08:52:01,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-07-25 08:52:01,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-07-25 08:52:01,379 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2018-07-25 08:52:01,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:01,379 INFO L472 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-07-25 08:52:01,379 INFO L473 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-07-25 08:52:01,379 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-07-25 08:52:01,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-07-25 08:52:01,380 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:01,380 INFO L354 BasicCegarLoop]: trace histogram [81, 1, 1] [2018-07-25 08:52:01,380 INFO L415 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:01,381 INFO L82 PathProgramCache]: Analyzing trace with hash -745456008, now seen corresponding path program 81 times [2018-07-25 08:52:01,381 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:01,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:01,721 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:01,721 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:01,722 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-07-25 08:52:01,722 INFO L451 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-07-25 08:52:01,723 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-07-25 08:52:01,724 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-07-25 08:52:01,724 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 84 states. [2018-07-25 08:52:01,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:01,810 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-07-25 08:52:01,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-07-25 08:52:01,810 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 83 [2018-07-25 08:52:01,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:01,811 INFO L225 Difference]: With dead ends: 86 [2018-07-25 08:52:01,811 INFO L226 Difference]: Without dead ends: 85 [2018-07-25 08:52:01,813 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-07-25 08:52:01,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-07-25 08:52:01,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-07-25 08:52:01,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-07-25 08:52:01,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-07-25 08:52:01,817 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2018-07-25 08:52:01,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:01,817 INFO L472 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-07-25 08:52:01,817 INFO L473 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-07-25 08:52:01,817 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-07-25 08:52:01,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-07-25 08:52:01,818 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:01,818 INFO L354 BasicCegarLoop]: trace histogram [82, 1, 1] [2018-07-25 08:52:01,818 INFO L415 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:01,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1634299533, now seen corresponding path program 82 times [2018-07-25 08:52:01,819 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:01,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:02,236 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:02,236 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:02,236 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-07-25 08:52:02,237 INFO L451 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-07-25 08:52:02,237 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-07-25 08:52:02,238 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-07-25 08:52:02,238 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 85 states. [2018-07-25 08:52:02,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:02,320 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-07-25 08:52:02,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-07-25 08:52:02,321 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 84 [2018-07-25 08:52:02,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:02,321 INFO L225 Difference]: With dead ends: 87 [2018-07-25 08:52:02,321 INFO L226 Difference]: Without dead ends: 86 [2018-07-25 08:52:02,322 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-07-25 08:52:02,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-07-25 08:52:02,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-07-25 08:52:02,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-07-25 08:52:02,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-07-25 08:52:02,325 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2018-07-25 08:52:02,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:02,325 INFO L472 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-07-25 08:52:02,325 INFO L473 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-07-25 08:52:02,325 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-07-25 08:52:02,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-07-25 08:52:02,326 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:02,326 INFO L354 BasicCegarLoop]: trace histogram [83, 1, 1] [2018-07-25 08:52:02,326 INFO L415 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:02,327 INFO L82 PathProgramCache]: Analyzing trace with hash 876322264, now seen corresponding path program 83 times [2018-07-25 08:52:02,327 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:02,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:02,649 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:02,650 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:02,650 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-07-25 08:52:02,650 INFO L451 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-07-25 08:52:02,651 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-07-25 08:52:02,651 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-07-25 08:52:02,652 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 86 states. [2018-07-25 08:52:02,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:02,698 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-07-25 08:52:02,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-07-25 08:52:02,698 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 85 [2018-07-25 08:52:02,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:02,699 INFO L225 Difference]: With dead ends: 88 [2018-07-25 08:52:02,699 INFO L226 Difference]: Without dead ends: 87 [2018-07-25 08:52:02,700 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-07-25 08:52:02,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-07-25 08:52:02,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-07-25 08:52:02,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-07-25 08:52:02,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-07-25 08:52:02,703 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2018-07-25 08:52:02,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:02,703 INFO L472 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-07-25 08:52:02,703 INFO L473 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-07-25 08:52:02,703 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-07-25 08:52:02,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-07-25 08:52:02,704 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:02,704 INFO L354 BasicCegarLoop]: trace histogram [84, 1, 1] [2018-07-25 08:52:02,704 INFO L415 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:02,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1396186643, now seen corresponding path program 84 times [2018-07-25 08:52:02,705 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:02,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:03,042 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:03,042 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:03,043 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-07-25 08:52:03,043 INFO L451 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-07-25 08:52:03,044 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-07-25 08:52:03,045 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-07-25 08:52:03,045 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 87 states. [2018-07-25 08:52:03,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:03,138 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-07-25 08:52:03,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-07-25 08:52:03,138 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 86 [2018-07-25 08:52:03,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:03,139 INFO L225 Difference]: With dead ends: 89 [2018-07-25 08:52:03,139 INFO L226 Difference]: Without dead ends: 88 [2018-07-25 08:52:03,140 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-07-25 08:52:03,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-07-25 08:52:03,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-07-25 08:52:03,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-07-25 08:52:03,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-07-25 08:52:03,143 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2018-07-25 08:52:03,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:03,143 INFO L472 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-07-25 08:52:03,143 INFO L473 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-07-25 08:52:03,145 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-07-25 08:52:03,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-07-25 08:52:03,146 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:03,146 INFO L354 BasicCegarLoop]: trace histogram [85, 1, 1] [2018-07-25 08:52:03,146 INFO L415 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:03,147 INFO L82 PathProgramCache]: Analyzing trace with hash 332113208, now seen corresponding path program 85 times [2018-07-25 08:52:03,147 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:03,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:03,523 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:03,524 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:03,524 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-07-25 08:52:03,524 INFO L451 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-07-25 08:52:03,525 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-07-25 08:52:03,526 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-07-25 08:52:03,526 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 88 states. [2018-07-25 08:52:03,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:03,588 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-07-25 08:52:03,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-07-25 08:52:03,588 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 87 [2018-07-25 08:52:03,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:03,589 INFO L225 Difference]: With dead ends: 90 [2018-07-25 08:52:03,589 INFO L226 Difference]: Without dead ends: 89 [2018-07-25 08:52:03,590 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-07-25 08:52:03,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-07-25 08:52:03,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-07-25 08:52:03,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-07-25 08:52:03,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-07-25 08:52:03,594 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2018-07-25 08:52:03,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:03,595 INFO L472 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-07-25 08:52:03,595 INFO L473 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-07-25 08:52:03,595 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-07-25 08:52:03,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-07-25 08:52:03,596 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:03,596 INFO L354 BasicCegarLoop]: trace histogram [86, 1, 1] [2018-07-25 08:52:03,596 INFO L415 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:03,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1705575091, now seen corresponding path program 86 times [2018-07-25 08:52:03,597 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:03,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:04,036 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:04,036 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:04,036 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-07-25 08:52:04,037 INFO L451 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-07-25 08:52:04,038 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-07-25 08:52:04,038 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-07-25 08:52:04,039 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 89 states. [2018-07-25 08:52:04,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:04,153 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-07-25 08:52:04,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-07-25 08:52:04,153 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 88 [2018-07-25 08:52:04,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:04,154 INFO L225 Difference]: With dead ends: 91 [2018-07-25 08:52:04,154 INFO L226 Difference]: Without dead ends: 90 [2018-07-25 08:52:04,155 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-07-25 08:52:04,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-07-25 08:52:04,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-07-25 08:52:04,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-07-25 08:52:04,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-07-25 08:52:04,158 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2018-07-25 08:52:04,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:04,158 INFO L472 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-07-25 08:52:04,159 INFO L473 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-07-25 08:52:04,159 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-07-25 08:52:04,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-07-25 08:52:04,159 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:04,160 INFO L354 BasicCegarLoop]: trace histogram [87, 1, 1] [2018-07-25 08:52:04,160 INFO L415 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:04,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1333220504, now seen corresponding path program 87 times [2018-07-25 08:52:04,160 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:04,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:04,581 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:04,581 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:04,581 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-07-25 08:52:04,582 INFO L451 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-07-25 08:52:04,583 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-07-25 08:52:04,583 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-07-25 08:52:04,583 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 90 states. [2018-07-25 08:52:04,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:04,646 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-07-25 08:52:04,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-07-25 08:52:04,647 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 89 [2018-07-25 08:52:04,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:04,648 INFO L225 Difference]: With dead ends: 92 [2018-07-25 08:52:04,648 INFO L226 Difference]: Without dead ends: 91 [2018-07-25 08:52:04,648 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-07-25 08:52:04,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-07-25 08:52:04,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-07-25 08:52:04,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-07-25 08:52:04,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-07-25 08:52:04,652 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2018-07-25 08:52:04,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:04,652 INFO L472 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-07-25 08:52:04,652 INFO L473 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-07-25 08:52:04,652 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-07-25 08:52:04,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-07-25 08:52:04,653 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:04,653 INFO L354 BasicCegarLoop]: trace histogram [88, 1, 1] [2018-07-25 08:52:04,654 INFO L415 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:04,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1619837101, now seen corresponding path program 88 times [2018-07-25 08:52:04,654 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:04,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:05,190 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:05,190 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:05,191 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-07-25 08:52:05,191 INFO L451 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-07-25 08:52:05,192 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-07-25 08:52:05,193 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-07-25 08:52:05,193 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 91 states. [2018-07-25 08:52:05,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:05,309 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-07-25 08:52:05,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-07-25 08:52:05,309 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 90 [2018-07-25 08:52:05,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:05,310 INFO L225 Difference]: With dead ends: 93 [2018-07-25 08:52:05,311 INFO L226 Difference]: Without dead ends: 92 [2018-07-25 08:52:05,311 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-07-25 08:52:05,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-07-25 08:52:05,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-07-25 08:52:05,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-07-25 08:52:05,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-07-25 08:52:05,315 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2018-07-25 08:52:05,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:05,315 INFO L472 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-07-25 08:52:05,315 INFO L473 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-07-25 08:52:05,315 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-07-25 08:52:05,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-07-25 08:52:05,316 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:05,316 INFO L354 BasicCegarLoop]: trace histogram [89, 1, 1] [2018-07-25 08:52:05,317 INFO L415 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:05,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1324657656, now seen corresponding path program 89 times [2018-07-25 08:52:05,317 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:05,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:05,966 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:05,967 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:05,967 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-07-25 08:52:05,967 INFO L451 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-07-25 08:52:05,968 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-07-25 08:52:05,968 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-07-25 08:52:05,969 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 92 states. [2018-07-25 08:52:06,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:06,027 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-07-25 08:52:06,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-07-25 08:52:06,028 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 91 [2018-07-25 08:52:06,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:06,029 INFO L225 Difference]: With dead ends: 94 [2018-07-25 08:52:06,029 INFO L226 Difference]: Without dead ends: 93 [2018-07-25 08:52:06,029 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-07-25 08:52:06,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-07-25 08:52:06,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-07-25 08:52:06,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-07-25 08:52:06,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-07-25 08:52:06,033 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2018-07-25 08:52:06,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:06,033 INFO L472 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-07-25 08:52:06,036 INFO L473 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-07-25 08:52:06,036 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-07-25 08:52:06,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-07-25 08:52:06,037 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:06,037 INFO L354 BasicCegarLoop]: trace histogram [90, 1, 1] [2018-07-25 08:52:06,037 INFO L415 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:06,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1885285389, now seen corresponding path program 90 times [2018-07-25 08:52:06,037 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:06,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:06,390 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:06,391 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:06,391 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-07-25 08:52:06,391 INFO L451 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-07-25 08:52:06,392 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-07-25 08:52:06,392 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-07-25 08:52:06,392 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 93 states. [2018-07-25 08:52:06,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:06,467 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-07-25 08:52:06,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-07-25 08:52:06,467 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 92 [2018-07-25 08:52:06,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:06,468 INFO L225 Difference]: With dead ends: 95 [2018-07-25 08:52:06,468 INFO L226 Difference]: Without dead ends: 94 [2018-07-25 08:52:06,469 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-07-25 08:52:06,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-07-25 08:52:06,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-07-25 08:52:06,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-07-25 08:52:06,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-07-25 08:52:06,472 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2018-07-25 08:52:06,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:06,472 INFO L472 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-07-25 08:52:06,472 INFO L473 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-07-25 08:52:06,472 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-07-25 08:52:06,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-07-25 08:52:06,473 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:06,473 INFO L354 BasicCegarLoop]: trace histogram [91, 1, 1] [2018-07-25 08:52:06,474 INFO L415 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:06,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1685695320, now seen corresponding path program 91 times [2018-07-25 08:52:06,474 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:06,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:06,904 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:06,904 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:06,904 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-07-25 08:52:06,905 INFO L451 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-07-25 08:52:06,906 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-07-25 08:52:06,906 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-07-25 08:52:06,906 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 94 states. [2018-07-25 08:52:07,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:07,017 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-07-25 08:52:07,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-07-25 08:52:07,018 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 93 [2018-07-25 08:52:07,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:07,019 INFO L225 Difference]: With dead ends: 96 [2018-07-25 08:52:07,019 INFO L226 Difference]: Without dead ends: 95 [2018-07-25 08:52:07,020 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-07-25 08:52:07,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-07-25 08:52:07,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-07-25 08:52:07,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-07-25 08:52:07,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-07-25 08:52:07,023 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2018-07-25 08:52:07,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:07,023 INFO L472 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-07-25 08:52:07,023 INFO L473 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-07-25 08:52:07,023 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-07-25 08:52:07,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-07-25 08:52:07,024 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:07,024 INFO L354 BasicCegarLoop]: trace histogram [92, 1, 1] [2018-07-25 08:52:07,024 INFO L415 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:07,025 INFO L82 PathProgramCache]: Analyzing trace with hash 716947603, now seen corresponding path program 92 times [2018-07-25 08:52:07,025 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:07,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:07,368 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:07,368 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:07,368 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-07-25 08:52:07,369 INFO L451 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-07-25 08:52:07,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-07-25 08:52:07,370 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-07-25 08:52:07,370 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 95 states. [2018-07-25 08:52:07,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:07,436 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-07-25 08:52:07,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-07-25 08:52:07,436 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 94 [2018-07-25 08:52:07,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:07,437 INFO L225 Difference]: With dead ends: 97 [2018-07-25 08:52:07,437 INFO L226 Difference]: Without dead ends: 96 [2018-07-25 08:52:07,438 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-07-25 08:52:07,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-07-25 08:52:07,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-07-25 08:52:07,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-07-25 08:52:07,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-07-25 08:52:07,441 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2018-07-25 08:52:07,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:07,441 INFO L472 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-07-25 08:52:07,442 INFO L473 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-07-25 08:52:07,442 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-07-25 08:52:07,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-07-25 08:52:07,442 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:07,443 INFO L354 BasicCegarLoop]: trace histogram [93, 1, 1] [2018-07-25 08:52:07,443 INFO L415 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:07,443 INFO L82 PathProgramCache]: Analyzing trace with hash 750539448, now seen corresponding path program 93 times [2018-07-25 08:52:07,443 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:07,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:07,840 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:07,840 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:07,840 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-07-25 08:52:07,840 INFO L451 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-07-25 08:52:07,841 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-07-25 08:52:07,842 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-07-25 08:52:07,842 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 96 states. [2018-07-25 08:52:07,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:07,891 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-07-25 08:52:07,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-07-25 08:52:07,891 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 95 [2018-07-25 08:52:07,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:07,892 INFO L225 Difference]: With dead ends: 98 [2018-07-25 08:52:07,892 INFO L226 Difference]: Without dead ends: 97 [2018-07-25 08:52:07,893 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-07-25 08:52:07,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-07-25 08:52:07,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-07-25 08:52:07,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-07-25 08:52:07,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-07-25 08:52:07,896 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2018-07-25 08:52:07,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:07,896 INFO L472 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-07-25 08:52:07,896 INFO L473 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-07-25 08:52:07,896 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-07-25 08:52:07,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-07-25 08:52:07,897 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:07,897 INFO L354 BasicCegarLoop]: trace histogram [94, 1, 1] [2018-07-25 08:52:07,897 INFO L415 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:07,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1791886643, now seen corresponding path program 94 times [2018-07-25 08:52:07,898 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:07,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:08,253 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:08,254 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:08,254 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-07-25 08:52:08,254 INFO L451 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-07-25 08:52:08,255 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-07-25 08:52:08,255 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-07-25 08:52:08,256 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 97 states. [2018-07-25 08:52:08,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:08,333 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-07-25 08:52:08,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-07-25 08:52:08,334 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 96 [2018-07-25 08:52:08,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:08,334 INFO L225 Difference]: With dead ends: 99 [2018-07-25 08:52:08,334 INFO L226 Difference]: Without dead ends: 98 [2018-07-25 08:52:08,335 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-07-25 08:52:08,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-07-25 08:52:08,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-07-25 08:52:08,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-07-25 08:52:08,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-07-25 08:52:08,338 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2018-07-25 08:52:08,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:08,338 INFO L472 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-07-25 08:52:08,338 INFO L473 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-07-25 08:52:08,339 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-07-25 08:52:08,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-07-25 08:52:08,339 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:08,339 INFO L354 BasicCegarLoop]: trace histogram [95, 1, 1] [2018-07-25 08:52:08,340 INFO L415 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:08,340 INFO L82 PathProgramCache]: Analyzing trace with hash -286088680, now seen corresponding path program 95 times [2018-07-25 08:52:08,340 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:08,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:08,692 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:08,693 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:08,693 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-07-25 08:52:08,693 INFO L451 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-07-25 08:52:08,694 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-07-25 08:52:08,695 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-07-25 08:52:08,695 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 98 states. [2018-07-25 08:52:08,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:08,841 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-07-25 08:52:08,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-07-25 08:52:08,841 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 97 [2018-07-25 08:52:08,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:08,842 INFO L225 Difference]: With dead ends: 100 [2018-07-25 08:52:08,842 INFO L226 Difference]: Without dead ends: 99 [2018-07-25 08:52:08,843 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-07-25 08:52:08,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-07-25 08:52:08,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-07-25 08:52:08,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-07-25 08:52:08,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-07-25 08:52:08,846 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2018-07-25 08:52:08,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:08,846 INFO L472 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-07-25 08:52:08,846 INFO L473 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-07-25 08:52:08,846 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-07-25 08:52:08,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-07-25 08:52:08,847 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:08,847 INFO L354 BasicCegarLoop]: trace histogram [96, 1, 1] [2018-07-25 08:52:08,847 INFO L415 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:08,848 INFO L82 PathProgramCache]: Analyzing trace with hash -278814253, now seen corresponding path program 96 times [2018-07-25 08:52:08,848 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:08,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:09,164 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:09,164 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:09,165 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-07-25 08:52:09,165 INFO L451 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-07-25 08:52:09,165 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-07-25 08:52:09,166 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-07-25 08:52:09,166 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 99 states. [2018-07-25 08:52:09,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:09,245 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-07-25 08:52:09,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-07-25 08:52:09,245 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 98 [2018-07-25 08:52:09,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:09,246 INFO L225 Difference]: With dead ends: 101 [2018-07-25 08:52:09,246 INFO L226 Difference]: Without dead ends: 100 [2018-07-25 08:52:09,246 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-07-25 08:52:09,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-07-25 08:52:09,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-07-25 08:52:09,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-07-25 08:52:09,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-07-25 08:52:09,250 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2018-07-25 08:52:09,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:09,250 INFO L472 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-07-25 08:52:09,250 INFO L473 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-07-25 08:52:09,250 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-07-25 08:52:09,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-07-25 08:52:09,251 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:09,251 INFO L354 BasicCegarLoop]: trace histogram [97, 1, 1] [2018-07-25 08:52:09,251 INFO L415 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:09,251 INFO L82 PathProgramCache]: Analyzing trace with hash -53307016, now seen corresponding path program 97 times [2018-07-25 08:52:09,251 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:09,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:09,571 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:09,571 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:09,571 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-07-25 08:52:09,571 INFO L451 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-07-25 08:52:09,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-07-25 08:52:09,572 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-07-25 08:52:09,573 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 100 states. [2018-07-25 08:52:09,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:09,661 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-07-25 08:52:09,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-07-25 08:52:09,661 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 99 [2018-07-25 08:52:09,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:09,662 INFO L225 Difference]: With dead ends: 102 [2018-07-25 08:52:09,662 INFO L226 Difference]: Without dead ends: 101 [2018-07-25 08:52:09,663 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-07-25 08:52:09,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-07-25 08:52:09,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-07-25 08:52:09,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-07-25 08:52:09,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-07-25 08:52:09,666 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2018-07-25 08:52:09,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:09,666 INFO L472 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-07-25 08:52:09,666 INFO L473 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-07-25 08:52:09,666 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-07-25 08:52:09,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-07-25 08:52:09,667 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:09,667 INFO L354 BasicCegarLoop]: trace histogram [98, 1, 1] [2018-07-25 08:52:09,667 INFO L415 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:09,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1652517261, now seen corresponding path program 98 times [2018-07-25 08:52:09,668 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:09,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:10,045 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:10,046 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:10,046 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-07-25 08:52:10,046 INFO L451 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-07-25 08:52:10,047 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-07-25 08:52:10,047 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-07-25 08:52:10,048 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 101 states. [2018-07-25 08:52:10,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:10,130 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-07-25 08:52:10,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-07-25 08:52:10,130 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 100 [2018-07-25 08:52:10,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:10,131 INFO L225 Difference]: With dead ends: 103 [2018-07-25 08:52:10,131 INFO L226 Difference]: Without dead ends: 102 [2018-07-25 08:52:10,131 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-07-25 08:52:10,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-07-25 08:52:10,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-07-25 08:52:10,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-07-25 08:52:10,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-07-25 08:52:10,135 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2018-07-25 08:52:10,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:10,135 INFO L472 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-07-25 08:52:10,135 INFO L473 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-07-25 08:52:10,135 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-07-25 08:52:10,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-07-25 08:52:10,135 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:10,135 INFO L354 BasicCegarLoop]: trace histogram [99, 1, 1] [2018-07-25 08:52:10,136 INFO L415 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:10,136 INFO L82 PathProgramCache]: Analyzing trace with hash 311572696, now seen corresponding path program 99 times [2018-07-25 08:52:10,136 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:10,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:10,475 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:10,475 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:10,475 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-07-25 08:52:10,476 INFO L451 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-07-25 08:52:10,477 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-07-25 08:52:10,477 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-07-25 08:52:10,477 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 102 states. [2018-07-25 08:52:10,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:10,559 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-07-25 08:52:10,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-07-25 08:52:10,559 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 101 [2018-07-25 08:52:10,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:10,560 INFO L225 Difference]: With dead ends: 104 [2018-07-25 08:52:10,560 INFO L226 Difference]: Without dead ends: 103 [2018-07-25 08:52:10,561 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-07-25 08:52:10,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-07-25 08:52:10,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-07-25 08:52:10,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-07-25 08:52:10,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-07-25 08:52:10,564 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2018-07-25 08:52:10,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:10,565 INFO L472 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-07-25 08:52:10,565 INFO L473 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-07-25 08:52:10,565 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-07-25 08:52:10,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-07-25 08:52:10,566 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:10,566 INFO L354 BasicCegarLoop]: trace histogram [100, 1, 1] [2018-07-25 08:52:10,566 INFO L415 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:10,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1068819219, now seen corresponding path program 100 times [2018-07-25 08:52:10,566 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:10,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:11,920 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:11,920 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:11,920 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-07-25 08:52:11,921 INFO L451 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-07-25 08:52:11,921 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-07-25 08:52:11,922 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2018-07-25 08:52:11,923 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 103 states. [2018-07-25 08:52:13,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:13,399 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-07-25 08:52:13,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-07-25 08:52:13,399 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 102 [2018-07-25 08:52:13,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:13,400 INFO L225 Difference]: With dead ends: 105 [2018-07-25 08:52:13,401 INFO L226 Difference]: Without dead ends: 104 [2018-07-25 08:52:13,401 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2018-07-25 08:52:13,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-07-25 08:52:13,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-07-25 08:52:13,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-07-25 08:52:13,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-07-25 08:52:13,408 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2018-07-25 08:52:13,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:13,409 INFO L472 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-07-25 08:52:13,409 INFO L473 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-07-25 08:52:13,409 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-07-25 08:52:13,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-07-25 08:52:13,409 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:13,409 INFO L354 BasicCegarLoop]: trace histogram [101, 1, 1] [2018-07-25 08:52:13,410 INFO L415 AbstractCegarLoop]: === Iteration 102 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:13,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1226342344, now seen corresponding path program 101 times [2018-07-25 08:52:13,410 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:13,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:14,266 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:14,267 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:14,267 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-07-25 08:52:14,267 INFO L451 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-07-25 08:52:14,267 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-07-25 08:52:14,268 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=10507, Unknown=0, NotChecked=0, Total=10712 [2018-07-25 08:52:14,268 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 104 states. [2018-07-25 08:52:15,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:15,063 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-07-25 08:52:15,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-07-25 08:52:15,063 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 103 [2018-07-25 08:52:15,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:15,064 INFO L225 Difference]: With dead ends: 106 [2018-07-25 08:52:15,064 INFO L226 Difference]: Without dead ends: 105 [2018-07-25 08:52:15,065 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=205, Invalid=10507, Unknown=0, NotChecked=0, Total=10712 [2018-07-25 08:52:15,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-07-25 08:52:15,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-07-25 08:52:15,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-07-25 08:52:15,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-07-25 08:52:15,073 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2018-07-25 08:52:15,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:15,073 INFO L472 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-07-25 08:52:15,073 INFO L473 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-07-25 08:52:15,073 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-07-25 08:52:15,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-07-25 08:52:15,074 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:15,074 INFO L354 BasicCegarLoop]: trace histogram [102, 1, 1] [2018-07-25 08:52:15,074 INFO L415 AbstractCegarLoop]: === Iteration 103 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:15,075 INFO L82 PathProgramCache]: Analyzing trace with hash 638093235, now seen corresponding path program 102 times [2018-07-25 08:52:15,075 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:15,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:16,142 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:16,142 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:16,142 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-07-25 08:52:16,143 INFO L451 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-07-25 08:52:16,143 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-07-25 08:52:16,144 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=10713, Unknown=0, NotChecked=0, Total=10920 [2018-07-25 08:52:16,144 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 105 states. [2018-07-25 08:52:17,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:17,260 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-07-25 08:52:17,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-07-25 08:52:17,261 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 104 [2018-07-25 08:52:17,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:17,261 INFO L225 Difference]: With dead ends: 107 [2018-07-25 08:52:17,262 INFO L226 Difference]: Without dead ends: 106 [2018-07-25 08:52:17,263 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=207, Invalid=10713, Unknown=0, NotChecked=0, Total=10920 [2018-07-25 08:52:17,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-07-25 08:52:17,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-07-25 08:52:17,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-07-25 08:52:17,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-07-25 08:52:17,271 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2018-07-25 08:52:17,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:17,271 INFO L472 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-07-25 08:52:17,272 INFO L473 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-07-25 08:52:17,272 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-07-25 08:52:17,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-07-25 08:52:17,272 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:17,272 INFO L354 BasicCegarLoop]: trace histogram [103, 1, 1] [2018-07-25 08:52:17,273 INFO L415 AbstractCegarLoop]: === Iteration 104 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:17,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1693945960, now seen corresponding path program 103 times [2018-07-25 08:52:17,273 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:17,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:18,171 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:18,171 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:18,171 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2018-07-25 08:52:18,172 INFO L451 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-07-25 08:52:18,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-07-25 08:52:18,174 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=10921, Unknown=0, NotChecked=0, Total=11130 [2018-07-25 08:52:18,174 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 106 states. [2018-07-25 08:52:19,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:19,140 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-07-25 08:52:19,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-07-25 08:52:19,140 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 105 [2018-07-25 08:52:19,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:19,141 INFO L225 Difference]: With dead ends: 108 [2018-07-25 08:52:19,141 INFO L226 Difference]: Without dead ends: 107 [2018-07-25 08:52:19,142 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=209, Invalid=10921, Unknown=0, NotChecked=0, Total=11130 [2018-07-25 08:52:19,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-07-25 08:52:19,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-07-25 08:52:19,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-07-25 08:52:19,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-07-25 08:52:19,150 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2018-07-25 08:52:19,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:19,150 INFO L472 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-07-25 08:52:19,150 INFO L473 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-07-25 08:52:19,151 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-07-25 08:52:19,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-07-25 08:52:19,151 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:19,151 INFO L354 BasicCegarLoop]: trace histogram [104, 1, 1] [2018-07-25 08:52:19,152 INFO L415 AbstractCegarLoop]: === Iteration 105 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:19,152 INFO L82 PathProgramCache]: Analyzing trace with hash -972716973, now seen corresponding path program 104 times [2018-07-25 08:52:19,152 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:19,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:19,865 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:19,865 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:19,865 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-07-25 08:52:19,866 INFO L451 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-07-25 08:52:19,866 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-07-25 08:52:19,866 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=11131, Unknown=0, NotChecked=0, Total=11342 [2018-07-25 08:52:19,867 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 107 states. [2018-07-25 08:52:20,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:20,643 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-07-25 08:52:20,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-07-25 08:52:20,643 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 106 [2018-07-25 08:52:20,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:20,644 INFO L225 Difference]: With dead ends: 109 [2018-07-25 08:52:20,644 INFO L226 Difference]: Without dead ends: 108 [2018-07-25 08:52:20,645 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=211, Invalid=11131, Unknown=0, NotChecked=0, Total=11342 [2018-07-25 08:52:20,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-07-25 08:52:20,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-07-25 08:52:20,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-07-25 08:52:20,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-07-25 08:52:20,651 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2018-07-25 08:52:20,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:20,651 INFO L472 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-07-25 08:52:20,652 INFO L473 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-07-25 08:52:20,652 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-07-25 08:52:20,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-07-25 08:52:20,652 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:20,652 INFO L354 BasicCegarLoop]: trace histogram [105, 1, 1] [2018-07-25 08:52:20,653 INFO L415 AbstractCegarLoop]: === Iteration 106 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:20,653 INFO L82 PathProgramCache]: Analyzing trace with hash -89454856, now seen corresponding path program 105 times [2018-07-25 08:52:20,653 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:20,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:21,277 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:21,277 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:21,277 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2018-07-25 08:52:21,277 INFO L451 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-07-25 08:52:21,278 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-07-25 08:52:21,278 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=11343, Unknown=0, NotChecked=0, Total=11556 [2018-07-25 08:52:21,278 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 108 states. [2018-07-25 08:52:22,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:22,280 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-07-25 08:52:22,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-07-25 08:52:22,281 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 107 [2018-07-25 08:52:22,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:22,281 INFO L225 Difference]: With dead ends: 110 [2018-07-25 08:52:22,281 INFO L226 Difference]: Without dead ends: 109 [2018-07-25 08:52:22,282 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=213, Invalid=11343, Unknown=0, NotChecked=0, Total=11556 [2018-07-25 08:52:22,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-07-25 08:52:22,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-07-25 08:52:22,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-07-25 08:52:22,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-07-25 08:52:22,287 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2018-07-25 08:52:22,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:22,288 INFO L472 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-07-25 08:52:22,288 INFO L473 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-07-25 08:52:22,288 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-07-25 08:52:22,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-07-25 08:52:22,288 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:22,289 INFO L354 BasicCegarLoop]: trace histogram [106, 1, 1] [2018-07-25 08:52:22,289 INFO L415 AbstractCegarLoop]: === Iteration 107 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:22,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1521866995, now seen corresponding path program 106 times [2018-07-25 08:52:22,289 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:22,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:23,096 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:23,096 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:23,096 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-07-25 08:52:23,097 INFO L451 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-07-25 08:52:23,097 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-07-25 08:52:23,098 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=11557, Unknown=0, NotChecked=0, Total=11772 [2018-07-25 08:52:23,098 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 109 states. [2018-07-25 08:52:23,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:23,922 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-07-25 08:52:23,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-07-25 08:52:23,923 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 108 [2018-07-25 08:52:23,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:23,924 INFO L225 Difference]: With dead ends: 111 [2018-07-25 08:52:23,924 INFO L226 Difference]: Without dead ends: 110 [2018-07-25 08:52:23,925 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=215, Invalid=11557, Unknown=0, NotChecked=0, Total=11772 [2018-07-25 08:52:23,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-07-25 08:52:23,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-07-25 08:52:23,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-07-25 08:52:23,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-07-25 08:52:23,932 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2018-07-25 08:52:23,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:23,932 INFO L472 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-07-25 08:52:23,932 INFO L473 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-07-25 08:52:23,933 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-07-25 08:52:23,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-07-25 08:52:23,933 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:23,933 INFO L354 BasicCegarLoop]: trace histogram [107, 1, 1] [2018-07-25 08:52:23,934 INFO L415 AbstractCegarLoop]: === Iteration 108 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:23,934 INFO L82 PathProgramCache]: Analyzing trace with hash -66763176, now seen corresponding path program 107 times [2018-07-25 08:52:23,934 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:23,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:24,903 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:24,903 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:24,904 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-07-25 08:52:24,904 INFO L451 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-07-25 08:52:24,904 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-07-25 08:52:24,905 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=11773, Unknown=0, NotChecked=0, Total=11990 [2018-07-25 08:52:24,905 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 110 states. [2018-07-25 08:52:26,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:26,185 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2018-07-25 08:52:26,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-07-25 08:52:26,185 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 109 [2018-07-25 08:52:26,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:26,186 INFO L225 Difference]: With dead ends: 112 [2018-07-25 08:52:26,186 INFO L226 Difference]: Without dead ends: 111 [2018-07-25 08:52:26,187 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=217, Invalid=11773, Unknown=0, NotChecked=0, Total=11990 [2018-07-25 08:52:26,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-07-25 08:52:26,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-07-25 08:52:26,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-07-25 08:52:26,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-07-25 08:52:26,195 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2018-07-25 08:52:26,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:26,195 INFO L472 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-07-25 08:52:26,195 INFO L473 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-07-25 08:52:26,195 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-07-25 08:52:26,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-07-25 08:52:26,196 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:26,196 INFO L354 BasicCegarLoop]: trace histogram [108, 1, 1] [2018-07-25 08:52:26,196 INFO L415 AbstractCegarLoop]: === Iteration 109 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:26,196 INFO L82 PathProgramCache]: Analyzing trace with hash -2069658221, now seen corresponding path program 108 times [2018-07-25 08:52:26,196 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:26,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:26,969 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:26,969 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:26,969 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-07-25 08:52:26,970 INFO L451 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-07-25 08:52:26,970 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-07-25 08:52:26,970 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=11991, Unknown=0, NotChecked=0, Total=12210 [2018-07-25 08:52:26,970 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 111 states. [2018-07-25 08:52:27,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:27,760 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-07-25 08:52:27,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-07-25 08:52:27,760 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 110 [2018-07-25 08:52:27,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:27,761 INFO L225 Difference]: With dead ends: 113 [2018-07-25 08:52:27,761 INFO L226 Difference]: Without dead ends: 112 [2018-07-25 08:52:27,762 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=219, Invalid=11991, Unknown=0, NotChecked=0, Total=12210 [2018-07-25 08:52:27,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-07-25 08:52:27,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-07-25 08:52:27,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-07-25 08:52:27,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-07-25 08:52:27,770 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2018-07-25 08:52:27,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:27,771 INFO L472 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-07-25 08:52:27,771 INFO L473 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-07-25 08:52:27,771 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-07-25 08:52:27,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-07-25 08:52:27,771 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:27,772 INFO L354 BasicCegarLoop]: trace histogram [109, 1, 1] [2018-07-25 08:52:27,772 INFO L415 AbstractCegarLoop]: === Iteration 110 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:27,772 INFO L82 PathProgramCache]: Analyzing trace with hash 265104824, now seen corresponding path program 109 times [2018-07-25 08:52:27,772 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:27,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:28,428 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:28,428 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:28,428 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2018-07-25 08:52:28,429 INFO L451 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-07-25 08:52:28,429 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-07-25 08:52:28,430 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=12211, Unknown=0, NotChecked=0, Total=12432 [2018-07-25 08:52:28,430 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 112 states. [2018-07-25 08:52:29,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:29,279 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-07-25 08:52:29,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-07-25 08:52:29,279 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 111 [2018-07-25 08:52:29,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:29,280 INFO L225 Difference]: With dead ends: 114 [2018-07-25 08:52:29,280 INFO L226 Difference]: Without dead ends: 113 [2018-07-25 08:52:29,281 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=221, Invalid=12211, Unknown=0, NotChecked=0, Total=12432 [2018-07-25 08:52:29,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-07-25 08:52:29,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-07-25 08:52:29,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-07-25 08:52:29,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-07-25 08:52:29,289 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2018-07-25 08:52:29,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:29,290 INFO L472 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-07-25 08:52:29,290 INFO L473 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-07-25 08:52:29,290 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-07-25 08:52:29,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-07-25 08:52:29,290 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:29,291 INFO L354 BasicCegarLoop]: trace histogram [110, 1, 1] [2018-07-25 08:52:29,291 INFO L415 AbstractCegarLoop]: === Iteration 111 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:29,291 INFO L82 PathProgramCache]: Analyzing trace with hash -371684813, now seen corresponding path program 110 times [2018-07-25 08:52:29,291 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:29,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:29,936 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:29,936 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:29,937 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-07-25 08:52:29,937 INFO L451 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-07-25 08:52:29,937 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-07-25 08:52:29,938 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=12433, Unknown=0, NotChecked=0, Total=12656 [2018-07-25 08:52:29,938 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 113 states. [2018-07-25 08:52:30,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:30,840 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-07-25 08:52:30,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-07-25 08:52:30,841 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 112 [2018-07-25 08:52:30,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:30,842 INFO L225 Difference]: With dead ends: 115 [2018-07-25 08:52:30,842 INFO L226 Difference]: Without dead ends: 114 [2018-07-25 08:52:30,843 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=223, Invalid=12433, Unknown=0, NotChecked=0, Total=12656 [2018-07-25 08:52:30,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-07-25 08:52:30,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-07-25 08:52:30,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-07-25 08:52:30,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2018-07-25 08:52:30,853 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2018-07-25 08:52:30,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:30,854 INFO L472 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2018-07-25 08:52:30,854 INFO L473 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-07-25 08:52:30,854 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-07-25 08:52:30,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-07-25 08:52:30,854 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:30,855 INFO L354 BasicCegarLoop]: trace histogram [111, 1, 1] [2018-07-25 08:52:30,855 INFO L415 AbstractCegarLoop]: === Iteration 112 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:30,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1362672920, now seen corresponding path program 111 times [2018-07-25 08:52:30,855 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:30,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:31,594 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:31,594 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:31,594 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2018-07-25 08:52:31,594 INFO L451 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-07-25 08:52:31,595 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-07-25 08:52:31,596 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=12657, Unknown=0, NotChecked=0, Total=12882 [2018-07-25 08:52:31,596 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 114 states. [2018-07-25 08:52:32,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:32,471 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-07-25 08:52:32,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-07-25 08:52:32,471 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 113 [2018-07-25 08:52:32,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:32,472 INFO L225 Difference]: With dead ends: 116 [2018-07-25 08:52:32,472 INFO L226 Difference]: Without dead ends: 115 [2018-07-25 08:52:32,473 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=225, Invalid=12657, Unknown=0, NotChecked=0, Total=12882 [2018-07-25 08:52:32,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-07-25 08:52:32,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-07-25 08:52:32,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-07-25 08:52:32,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-07-25 08:52:32,480 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 113 [2018-07-25 08:52:32,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:32,480 INFO L472 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-07-25 08:52:32,480 INFO L473 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-07-25 08:52:32,481 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-07-25 08:52:32,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-07-25 08:52:32,481 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:32,481 INFO L354 BasicCegarLoop]: trace histogram [112, 1, 1] [2018-07-25 08:52:32,482 INFO L415 AbstractCegarLoop]: === Iteration 113 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:32,482 INFO L82 PathProgramCache]: Analyzing trace with hash -706812205, now seen corresponding path program 112 times [2018-07-25 08:52:32,482 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:32,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:33,282 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:33,282 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:33,282 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-07-25 08:52:33,282 INFO L451 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-07-25 08:52:33,283 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-07-25 08:52:33,283 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=12883, Unknown=0, NotChecked=0, Total=13110 [2018-07-25 08:52:33,284 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 115 states. [2018-07-25 08:52:34,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:34,180 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-07-25 08:52:34,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-07-25 08:52:34,180 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 114 [2018-07-25 08:52:34,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:34,181 INFO L225 Difference]: With dead ends: 117 [2018-07-25 08:52:34,181 INFO L226 Difference]: Without dead ends: 116 [2018-07-25 08:52:34,182 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=227, Invalid=12883, Unknown=0, NotChecked=0, Total=13110 [2018-07-25 08:52:34,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-07-25 08:52:34,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-07-25 08:52:34,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-07-25 08:52:34,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-07-25 08:52:34,190 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 114 [2018-07-25 08:52:34,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:34,190 INFO L472 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-07-25 08:52:34,190 INFO L473 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-07-25 08:52:34,190 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-07-25 08:52:34,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-07-25 08:52:34,191 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:34,191 INFO L354 BasicCegarLoop]: trace histogram [113, 1, 1] [2018-07-25 08:52:34,191 INFO L415 AbstractCegarLoop]: === Iteration 114 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:34,191 INFO L82 PathProgramCache]: Analyzing trace with hash -436341640, now seen corresponding path program 113 times [2018-07-25 08:52:34,191 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:34,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:34,858 INFO L134 CoverageAnalysis]: Checked inductivity of 6441 backedges. 0 proven. 6441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:34,858 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:34,858 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2018-07-25 08:52:34,858 INFO L451 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-07-25 08:52:34,859 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-07-25 08:52:34,859 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=13111, Unknown=0, NotChecked=0, Total=13340 [2018-07-25 08:52:34,859 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 116 states. [2018-07-25 08:52:35,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:35,785 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2018-07-25 08:52:35,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-07-25 08:52:35,786 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 115 [2018-07-25 08:52:35,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:35,786 INFO L225 Difference]: With dead ends: 118 [2018-07-25 08:52:35,786 INFO L226 Difference]: Without dead ends: 117 [2018-07-25 08:52:35,787 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=229, Invalid=13111, Unknown=0, NotChecked=0, Total=13340 [2018-07-25 08:52:35,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-07-25 08:52:35,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-07-25 08:52:35,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-07-25 08:52:35,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-07-25 08:52:35,794 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 115 [2018-07-25 08:52:35,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:35,795 INFO L472 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-07-25 08:52:35,795 INFO L473 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-07-25 08:52:35,795 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-07-25 08:52:35,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-07-25 08:52:35,795 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:35,796 INFO L354 BasicCegarLoop]: trace histogram [114, 1, 1] [2018-07-25 08:52:35,796 INFO L415 AbstractCegarLoop]: === Iteration 115 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:35,796 INFO L82 PathProgramCache]: Analyzing trace with hash -641688717, now seen corresponding path program 114 times [2018-07-25 08:52:35,796 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:35,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:36,527 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:36,528 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:36,528 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-07-25 08:52:36,528 INFO L451 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-07-25 08:52:36,528 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-07-25 08:52:36,529 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=13341, Unknown=0, NotChecked=0, Total=13572 [2018-07-25 08:52:36,529 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 117 states. [2018-07-25 08:52:37,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:37,413 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-07-25 08:52:37,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-07-25 08:52:37,413 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 116 [2018-07-25 08:52:37,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:37,414 INFO L225 Difference]: With dead ends: 119 [2018-07-25 08:52:37,414 INFO L226 Difference]: Without dead ends: 118 [2018-07-25 08:52:37,415 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=231, Invalid=13341, Unknown=0, NotChecked=0, Total=13572 [2018-07-25 08:52:37,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-07-25 08:52:37,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-07-25 08:52:37,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-07-25 08:52:37,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2018-07-25 08:52:37,423 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 116 [2018-07-25 08:52:37,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:37,423 INFO L472 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2018-07-25 08:52:37,423 INFO L473 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-07-25 08:52:37,423 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2018-07-25 08:52:37,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-07-25 08:52:37,424 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:37,424 INFO L354 BasicCegarLoop]: trace histogram [115, 1, 1] [2018-07-25 08:52:37,424 INFO L415 AbstractCegarLoop]: === Iteration 116 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:37,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1582486488, now seen corresponding path program 115 times [2018-07-25 08:52:37,424 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:37,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:38,128 INFO L134 CoverageAnalysis]: Checked inductivity of 6670 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:38,129 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:38,129 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2018-07-25 08:52:38,129 INFO L451 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-07-25 08:52:38,129 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-07-25 08:52:38,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=13573, Unknown=0, NotChecked=0, Total=13806 [2018-07-25 08:52:38,130 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 118 states. [2018-07-25 08:52:39,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:39,080 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2018-07-25 08:52:39,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-07-25 08:52:39,081 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 117 [2018-07-25 08:52:39,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:39,081 INFO L225 Difference]: With dead ends: 120 [2018-07-25 08:52:39,081 INFO L226 Difference]: Without dead ends: 119 [2018-07-25 08:52:39,082 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=233, Invalid=13573, Unknown=0, NotChecked=0, Total=13806 [2018-07-25 08:52:39,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-07-25 08:52:39,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-07-25 08:52:39,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-07-25 08:52:39,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-07-25 08:52:39,088 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 117 [2018-07-25 08:52:39,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:39,089 INFO L472 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-07-25 08:52:39,089 INFO L473 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-07-25 08:52:39,089 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-07-25 08:52:39,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-07-25 08:52:39,089 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:39,090 INFO L354 BasicCegarLoop]: trace histogram [116, 1, 1] [2018-07-25 08:52:39,090 INFO L415 AbstractCegarLoop]: === Iteration 117 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:39,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1812441107, now seen corresponding path program 116 times [2018-07-25 08:52:39,090 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:39,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:39,964 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:39,964 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:39,964 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-07-25 08:52:39,964 INFO L451 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-07-25 08:52:39,965 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-07-25 08:52:39,965 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=13807, Unknown=0, NotChecked=0, Total=14042 [2018-07-25 08:52:39,965 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 119 states. [2018-07-25 08:52:40,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:40,911 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-07-25 08:52:40,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-07-25 08:52:40,911 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 118 [2018-07-25 08:52:40,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:40,912 INFO L225 Difference]: With dead ends: 121 [2018-07-25 08:52:40,912 INFO L226 Difference]: Without dead ends: 120 [2018-07-25 08:52:40,912 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=235, Invalid=13807, Unknown=0, NotChecked=0, Total=14042 [2018-07-25 08:52:40,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-07-25 08:52:40,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-07-25 08:52:40,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-07-25 08:52:40,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2018-07-25 08:52:40,918 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 118 [2018-07-25 08:52:40,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:40,918 INFO L472 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2018-07-25 08:52:40,918 INFO L473 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-07-25 08:52:40,918 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2018-07-25 08:52:40,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-07-25 08:52:40,919 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:40,919 INFO L354 BasicCegarLoop]: trace histogram [117, 1, 1] [2018-07-25 08:52:40,919 INFO L415 AbstractCegarLoop]: === Iteration 118 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:40,919 INFO L82 PathProgramCache]: Analyzing trace with hash 351099704, now seen corresponding path program 117 times [2018-07-25 08:52:40,919 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:40,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:41,629 INFO L134 CoverageAnalysis]: Checked inductivity of 6903 backedges. 0 proven. 6903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:41,629 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:41,629 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2018-07-25 08:52:41,630 INFO L451 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-07-25 08:52:41,630 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-07-25 08:52:41,631 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=14043, Unknown=0, NotChecked=0, Total=14280 [2018-07-25 08:52:41,631 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 120 states. [2018-07-25 08:52:42,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:42,615 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2018-07-25 08:52:42,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-07-25 08:52:42,615 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 119 [2018-07-25 08:52:42,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:42,616 INFO L225 Difference]: With dead ends: 122 [2018-07-25 08:52:42,616 INFO L226 Difference]: Without dead ends: 121 [2018-07-25 08:52:42,617 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=237, Invalid=14043, Unknown=0, NotChecked=0, Total=14280 [2018-07-25 08:52:42,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-07-25 08:52:42,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-07-25 08:52:42,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-07-25 08:52:42,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-07-25 08:52:42,625 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 119 [2018-07-25 08:52:42,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:42,625 INFO L472 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-07-25 08:52:42,625 INFO L473 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-07-25 08:52:42,626 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-07-25 08:52:42,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-07-25 08:52:42,626 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:42,626 INFO L354 BasicCegarLoop]: trace histogram [118, 1, 1] [2018-07-25 08:52:42,627 INFO L415 AbstractCegarLoop]: === Iteration 119 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:42,627 INFO L82 PathProgramCache]: Analyzing trace with hash -2000810829, now seen corresponding path program 118 times [2018-07-25 08:52:42,627 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:42,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:43,455 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:43,455 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:43,455 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-07-25 08:52:43,456 INFO L451 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-07-25 08:52:43,456 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-07-25 08:52:43,457 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=14281, Unknown=0, NotChecked=0, Total=14520 [2018-07-25 08:52:43,457 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 121 states. [2018-07-25 08:52:44,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:44,470 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-07-25 08:52:44,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-07-25 08:52:44,471 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 120 [2018-07-25 08:52:44,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:44,471 INFO L225 Difference]: With dead ends: 123 [2018-07-25 08:52:44,471 INFO L226 Difference]: Without dead ends: 122 [2018-07-25 08:52:44,472 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=239, Invalid=14281, Unknown=0, NotChecked=0, Total=14520 [2018-07-25 08:52:44,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-07-25 08:52:44,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-07-25 08:52:44,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-07-25 08:52:44,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2018-07-25 08:52:44,479 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 120 [2018-07-25 08:52:44,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:44,480 INFO L472 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2018-07-25 08:52:44,480 INFO L473 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-07-25 08:52:44,480 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2018-07-25 08:52:44,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-07-25 08:52:44,480 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:44,480 INFO L354 BasicCegarLoop]: trace histogram [119, 1, 1] [2018-07-25 08:52:44,480 INFO L415 AbstractCegarLoop]: === Iteration 120 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:44,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1895593320, now seen corresponding path program 119 times [2018-07-25 08:52:44,481 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:44,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:45,289 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:45,289 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:45,289 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [120] total 120 [2018-07-25 08:52:45,290 INFO L451 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-07-25 08:52:45,290 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-07-25 08:52:45,291 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=14521, Unknown=0, NotChecked=0, Total=14762 [2018-07-25 08:52:45,291 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 122 states. [2018-07-25 08:52:46,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:46,341 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2018-07-25 08:52:46,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-07-25 08:52:46,341 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 121 [2018-07-25 08:52:46,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:46,341 INFO L225 Difference]: With dead ends: 124 [2018-07-25 08:52:46,341 INFO L226 Difference]: Without dead ends: 123 [2018-07-25 08:52:46,342 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=241, Invalid=14521, Unknown=0, NotChecked=0, Total=14762 [2018-07-25 08:52:46,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-07-25 08:52:46,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-07-25 08:52:46,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-07-25 08:52:46,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-07-25 08:52:46,350 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 121 [2018-07-25 08:52:46,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:46,351 INFO L472 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-07-25 08:52:46,351 INFO L473 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-07-25 08:52:46,351 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-07-25 08:52:46,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-07-25 08:52:46,351 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:46,352 INFO L354 BasicCegarLoop]: trace histogram [120, 1, 1] [2018-07-25 08:52:46,352 INFO L415 AbstractCegarLoop]: === Iteration 121 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:46,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1366149459, now seen corresponding path program 120 times [2018-07-25 08:52:46,352 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:46,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:47,501 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:47,501 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:47,502 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-07-25 08:52:47,502 INFO L451 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-07-25 08:52:47,502 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-07-25 08:52:47,503 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=14763, Unknown=0, NotChecked=0, Total=15006 [2018-07-25 08:52:47,503 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 123 states. [2018-07-25 08:52:48,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:48,584 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-07-25 08:52:48,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-07-25 08:52:48,585 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 122 [2018-07-25 08:52:48,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:48,586 INFO L225 Difference]: With dead ends: 125 [2018-07-25 08:52:48,586 INFO L226 Difference]: Without dead ends: 124 [2018-07-25 08:52:48,587 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=243, Invalid=14763, Unknown=0, NotChecked=0, Total=15006 [2018-07-25 08:52:48,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-07-25 08:52:48,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-07-25 08:52:48,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-07-25 08:52:48,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2018-07-25 08:52:48,595 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 122 [2018-07-25 08:52:48,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:48,596 INFO L472 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2018-07-25 08:52:48,596 INFO L473 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-07-25 08:52:48,596 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2018-07-25 08:52:48,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-07-25 08:52:48,597 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:48,597 INFO L354 BasicCegarLoop]: trace histogram [121, 1, 1] [2018-07-25 08:52:48,597 INFO L415 AbstractCegarLoop]: === Iteration 122 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:48,597 INFO L82 PathProgramCache]: Analyzing trace with hash -599039496, now seen corresponding path program 121 times [2018-07-25 08:52:48,597 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:48,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:49,625 INFO L134 CoverageAnalysis]: Checked inductivity of 7381 backedges. 0 proven. 7381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:49,625 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:49,626 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [122] total 122 [2018-07-25 08:52:49,626 INFO L451 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-07-25 08:52:49,626 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-07-25 08:52:49,627 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=15007, Unknown=0, NotChecked=0, Total=15252 [2018-07-25 08:52:49,627 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 124 states. [2018-07-25 08:52:50,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:50,647 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2018-07-25 08:52:50,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-07-25 08:52:50,647 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 123 [2018-07-25 08:52:50,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:50,648 INFO L225 Difference]: With dead ends: 126 [2018-07-25 08:52:50,648 INFO L226 Difference]: Without dead ends: 125 [2018-07-25 08:52:50,649 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=245, Invalid=15007, Unknown=0, NotChecked=0, Total=15252 [2018-07-25 08:52:50,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-07-25 08:52:50,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-07-25 08:52:50,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-07-25 08:52:50,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-07-25 08:52:50,657 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 123 [2018-07-25 08:52:50,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:50,657 INFO L472 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-07-25 08:52:50,657 INFO L473 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-07-25 08:52:50,657 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-07-25 08:52:50,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-07-25 08:52:50,658 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:50,658 INFO L354 BasicCegarLoop]: trace histogram [122, 1, 1] [2018-07-25 08:52:50,658 INFO L415 AbstractCegarLoop]: === Iteration 123 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:50,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1390354957, now seen corresponding path program 122 times [2018-07-25 08:52:50,658 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:50,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:51,475 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:51,475 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:51,475 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-07-25 08:52:51,476 INFO L451 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-07-25 08:52:51,476 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-07-25 08:52:51,477 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=15253, Unknown=0, NotChecked=0, Total=15500 [2018-07-25 08:52:51,478 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 125 states. [2018-07-25 08:52:52,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:52,536 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-07-25 08:52:52,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-07-25 08:52:52,536 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 124 [2018-07-25 08:52:52,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:52,537 INFO L225 Difference]: With dead ends: 127 [2018-07-25 08:52:52,537 INFO L226 Difference]: Without dead ends: 126 [2018-07-25 08:52:52,538 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=247, Invalid=15253, Unknown=0, NotChecked=0, Total=15500 [2018-07-25 08:52:52,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-07-25 08:52:52,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-07-25 08:52:52,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-07-25 08:52:52,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2018-07-25 08:52:52,544 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 124 [2018-07-25 08:52:52,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:52,545 INFO L472 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2018-07-25 08:52:52,545 INFO L473 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-07-25 08:52:52,545 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2018-07-25 08:52:52,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-07-25 08:52:52,546 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:52,546 INFO L354 BasicCegarLoop]: trace histogram [123, 1, 1] [2018-07-25 08:52:52,546 INFO L415 AbstractCegarLoop]: === Iteration 124 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:52,546 INFO L82 PathProgramCache]: Analyzing trace with hash -151330472, now seen corresponding path program 123 times [2018-07-25 08:52:52,546 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:52,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:53,450 INFO L134 CoverageAnalysis]: Checked inductivity of 7626 backedges. 0 proven. 7626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:53,450 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:53,450 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [124] total 124 [2018-07-25 08:52:53,450 INFO L451 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-07-25 08:52:53,451 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-07-25 08:52:53,451 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=15501, Unknown=0, NotChecked=0, Total=15750 [2018-07-25 08:52:53,452 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 126 states. [2018-07-25 08:52:54,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:54,554 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2018-07-25 08:52:54,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-07-25 08:52:54,554 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 125 [2018-07-25 08:52:54,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:54,555 INFO L225 Difference]: With dead ends: 128 [2018-07-25 08:52:54,555 INFO L226 Difference]: Without dead ends: 127 [2018-07-25 08:52:54,555 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=249, Invalid=15501, Unknown=0, NotChecked=0, Total=15750 [2018-07-25 08:52:54,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-07-25 08:52:54,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-07-25 08:52:54,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-07-25 08:52:54,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-07-25 08:52:54,560 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 125 [2018-07-25 08:52:54,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:54,561 INFO L472 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-07-25 08:52:54,561 INFO L473 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-07-25 08:52:54,561 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-07-25 08:52:54,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-07-25 08:52:54,561 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:54,561 INFO L354 BasicCegarLoop]: trace histogram [124, 1, 1] [2018-07-25 08:52:54,562 INFO L415 AbstractCegarLoop]: === Iteration 125 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:54,562 INFO L82 PathProgramCache]: Analyzing trace with hash -396277101, now seen corresponding path program 124 times [2018-07-25 08:52:54,562 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:54,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:55,363 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:55,363 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:55,363 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-07-25 08:52:55,364 INFO L451 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-07-25 08:52:55,364 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-07-25 08:52:55,364 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=15751, Unknown=0, NotChecked=0, Total=16002 [2018-07-25 08:52:55,365 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 127 states. [2018-07-25 08:52:56,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:56,475 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-07-25 08:52:56,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-07-25 08:52:56,475 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 126 [2018-07-25 08:52:56,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:56,475 INFO L225 Difference]: With dead ends: 129 [2018-07-25 08:52:56,475 INFO L226 Difference]: Without dead ends: 128 [2018-07-25 08:52:56,476 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=251, Invalid=15751, Unknown=0, NotChecked=0, Total=16002 [2018-07-25 08:52:56,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-07-25 08:52:56,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-07-25 08:52:56,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-07-25 08:52:56,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2018-07-25 08:52:56,483 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 126 [2018-07-25 08:52:56,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:56,484 INFO L472 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2018-07-25 08:52:56,484 INFO L473 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-07-25 08:52:56,484 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2018-07-25 08:52:56,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-07-25 08:52:56,484 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:56,485 INFO L354 BasicCegarLoop]: trace histogram [125, 1, 1] [2018-07-25 08:52:56,485 INFO L415 AbstractCegarLoop]: === Iteration 126 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:56,485 INFO L82 PathProgramCache]: Analyzing trace with hash 600311992, now seen corresponding path program 125 times [2018-07-25 08:52:56,485 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:56,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:57,305 INFO L134 CoverageAnalysis]: Checked inductivity of 7875 backedges. 0 proven. 7875 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:57,305 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:57,306 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [126] total 126 [2018-07-25 08:52:57,306 INFO L451 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-07-25 08:52:57,306 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-07-25 08:52:57,307 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=16003, Unknown=0, NotChecked=0, Total=16256 [2018-07-25 08:52:57,308 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 128 states. [2018-07-25 08:52:58,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:58,466 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2018-07-25 08:52:58,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-07-25 08:52:58,466 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 127 [2018-07-25 08:52:58,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:58,467 INFO L225 Difference]: With dead ends: 130 [2018-07-25 08:52:58,467 INFO L226 Difference]: Without dead ends: 129 [2018-07-25 08:52:58,468 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=253, Invalid=16003, Unknown=0, NotChecked=0, Total=16256 [2018-07-25 08:52:58,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-07-25 08:52:58,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-07-25 08:52:58,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-07-25 08:52:58,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-07-25 08:52:58,475 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 127 [2018-07-25 08:52:58,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:58,475 INFO L472 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-07-25 08:52:58,475 INFO L473 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-07-25 08:52:58,476 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-07-25 08:52:58,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-07-25 08:52:58,476 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:58,476 INFO L354 BasicCegarLoop]: trace histogram [126, 1, 1] [2018-07-25 08:52:58,477 INFO L415 AbstractCegarLoop]: === Iteration 127 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:58,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1429802803, now seen corresponding path program 126 times [2018-07-25 08:52:58,477 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:58,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:59,264 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:59,264 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:59,264 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-07-25 08:52:59,265 INFO L451 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-07-25 08:52:59,265 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-07-25 08:52:59,266 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=16257, Unknown=0, NotChecked=0, Total=16512 [2018-07-25 08:52:59,266 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 129 states. [2018-07-25 08:53:00,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:00,384 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-07-25 08:53:00,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-07-25 08:53:00,384 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 128 [2018-07-25 08:53:00,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:00,385 INFO L225 Difference]: With dead ends: 131 [2018-07-25 08:53:00,385 INFO L226 Difference]: Without dead ends: 130 [2018-07-25 08:53:00,386 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=255, Invalid=16257, Unknown=0, NotChecked=0, Total=16512 [2018-07-25 08:53:00,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-07-25 08:53:00,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-07-25 08:53:00,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-07-25 08:53:00,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2018-07-25 08:53:00,393 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 128 [2018-07-25 08:53:00,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:00,394 INFO L472 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2018-07-25 08:53:00,394 INFO L473 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-07-25 08:53:00,394 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2018-07-25 08:53:00,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-07-25 08:53:00,395 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:00,395 INFO L354 BasicCegarLoop]: trace histogram [127, 1, 1] [2018-07-25 08:53:00,395 INFO L415 AbstractCegarLoop]: === Iteration 128 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:00,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1374214168, now seen corresponding path program 127 times [2018-07-25 08:53:00,395 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:00,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:01,547 INFO L134 CoverageAnalysis]: Checked inductivity of 8128 backedges. 0 proven. 8128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:01,548 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:01,548 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [128] total 128 [2018-07-25 08:53:01,552 INFO L451 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-07-25 08:53:01,552 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-07-25 08:53:01,555 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=16513, Unknown=0, NotChecked=0, Total=16770 [2018-07-25 08:53:01,556 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 130 states. [2018-07-25 08:53:02,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:02,763 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2018-07-25 08:53:02,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-07-25 08:53:02,763 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 129 [2018-07-25 08:53:02,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:02,764 INFO L225 Difference]: With dead ends: 132 [2018-07-25 08:53:02,764 INFO L226 Difference]: Without dead ends: 131 [2018-07-25 08:53:02,765 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=257, Invalid=16513, Unknown=0, NotChecked=0, Total=16770 [2018-07-25 08:53:02,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-07-25 08:53:02,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-07-25 08:53:02,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-07-25 08:53:02,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-07-25 08:53:02,770 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 129 [2018-07-25 08:53:02,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:02,771 INFO L472 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-07-25 08:53:02,771 INFO L473 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-07-25 08:53:02,771 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-07-25 08:53:02,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-07-25 08:53:02,771 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:02,772 INFO L354 BasicCegarLoop]: trace histogram [128, 1, 1] [2018-07-25 08:53:02,772 INFO L415 AbstractCegarLoop]: === Iteration 129 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:02,772 INFO L82 PathProgramCache]: Analyzing trace with hash -349033517, now seen corresponding path program 128 times [2018-07-25 08:53:02,772 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:02,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:03,632 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:03,633 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:03,633 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-07-25 08:53:03,633 INFO L451 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-07-25 08:53:03,634 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-07-25 08:53:03,635 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=16771, Unknown=0, NotChecked=0, Total=17030 [2018-07-25 08:53:03,635 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 131 states. [2018-07-25 08:53:04,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:04,817 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-07-25 08:53:04,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-07-25 08:53:04,817 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 130 [2018-07-25 08:53:04,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:04,818 INFO L225 Difference]: With dead ends: 133 [2018-07-25 08:53:04,818 INFO L226 Difference]: Without dead ends: 132 [2018-07-25 08:53:04,819 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=259, Invalid=16771, Unknown=0, NotChecked=0, Total=17030 [2018-07-25 08:53:04,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-07-25 08:53:04,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-07-25 08:53:04,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-07-25 08:53:04,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2018-07-25 08:53:04,827 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 130 [2018-07-25 08:53:04,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:04,827 INFO L472 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2018-07-25 08:53:04,827 INFO L473 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-07-25 08:53:04,827 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2018-07-25 08:53:04,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-07-25 08:53:04,828 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:04,828 INFO L354 BasicCegarLoop]: trace histogram [129, 1, 1] [2018-07-25 08:53:04,828 INFO L415 AbstractCegarLoop]: === Iteration 130 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:04,829 INFO L82 PathProgramCache]: Analyzing trace with hash 2064863096, now seen corresponding path program 129 times [2018-07-25 08:53:04,829 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:04,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:05,716 INFO L134 CoverageAnalysis]: Checked inductivity of 8385 backedges. 0 proven. 8385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:05,717 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:05,717 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [130] total 130 [2018-07-25 08:53:05,717 INFO L451 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-07-25 08:53:05,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-07-25 08:53:05,718 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=17031, Unknown=0, NotChecked=0, Total=17292 [2018-07-25 08:53:05,718 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 132 states. [2018-07-25 08:53:06,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:06,934 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2018-07-25 08:53:06,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-07-25 08:53:06,934 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 131 [2018-07-25 08:53:06,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:06,935 INFO L225 Difference]: With dead ends: 134 [2018-07-25 08:53:06,935 INFO L226 Difference]: Without dead ends: 133 [2018-07-25 08:53:06,937 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=261, Invalid=17031, Unknown=0, NotChecked=0, Total=17292 [2018-07-25 08:53:06,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-07-25 08:53:06,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-07-25 08:53:06,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-07-25 08:53:06,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-07-25 08:53:06,944 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 131 [2018-07-25 08:53:06,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:06,945 INFO L472 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-07-25 08:53:06,945 INFO L473 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-07-25 08:53:06,945 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-07-25 08:53:06,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-07-25 08:53:06,945 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:06,945 INFO L354 BasicCegarLoop]: trace histogram [130, 1, 1] [2018-07-25 08:53:06,946 INFO L415 AbstractCegarLoop]: === Iteration 131 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:06,946 INFO L82 PathProgramCache]: Analyzing trace with hash -413753229, now seen corresponding path program 130 times [2018-07-25 08:53:06,946 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:06,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:07,865 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:07,865 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:07,865 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-07-25 08:53:07,866 INFO L451 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-07-25 08:53:07,866 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-07-25 08:53:07,867 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=17293, Unknown=0, NotChecked=0, Total=17556 [2018-07-25 08:53:07,867 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 133 states. [2018-07-25 08:53:09,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:09,041 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-07-25 08:53:09,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-07-25 08:53:09,041 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 132 [2018-07-25 08:53:09,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:09,041 INFO L225 Difference]: With dead ends: 135 [2018-07-25 08:53:09,042 INFO L226 Difference]: Without dead ends: 134 [2018-07-25 08:53:09,043 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=263, Invalid=17293, Unknown=0, NotChecked=0, Total=17556 [2018-07-25 08:53:09,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-07-25 08:53:09,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-07-25 08:53:09,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-07-25 08:53:09,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2018-07-25 08:53:09,048 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 132 [2018-07-25 08:53:09,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:09,048 INFO L472 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2018-07-25 08:53:09,049 INFO L473 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-07-25 08:53:09,049 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2018-07-25 08:53:09,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-07-25 08:53:09,049 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:09,049 INFO L354 BasicCegarLoop]: trace histogram [131, 1, 1] [2018-07-25 08:53:09,050 INFO L415 AbstractCegarLoop]: === Iteration 132 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:09,050 INFO L82 PathProgramCache]: Analyzing trace with hash 58552024, now seen corresponding path program 131 times [2018-07-25 08:53:09,050 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:09,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:09,978 INFO L134 CoverageAnalysis]: Checked inductivity of 8646 backedges. 0 proven. 8646 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:09,979 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:09,979 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [132] total 132 [2018-07-25 08:53:09,979 INFO L451 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-07-25 08:53:09,979 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-07-25 08:53:09,980 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=17557, Unknown=0, NotChecked=0, Total=17822 [2018-07-25 08:53:09,981 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 134 states. [2018-07-25 08:53:11,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:11,195 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2018-07-25 08:53:11,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-07-25 08:53:11,195 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 133 [2018-07-25 08:53:11,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:11,196 INFO L225 Difference]: With dead ends: 136 [2018-07-25 08:53:11,196 INFO L226 Difference]: Without dead ends: 135 [2018-07-25 08:53:11,198 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=265, Invalid=17557, Unknown=0, NotChecked=0, Total=17822 [2018-07-25 08:53:11,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-07-25 08:53:11,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-07-25 08:53:11,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-07-25 08:53:11,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-07-25 08:53:11,202 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 133 [2018-07-25 08:53:11,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:11,203 INFO L472 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-07-25 08:53:11,203 INFO L473 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-07-25 08:53:11,203 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-07-25 08:53:11,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-07-25 08:53:11,203 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:11,203 INFO L354 BasicCegarLoop]: trace histogram [132, 1, 1] [2018-07-25 08:53:11,203 INFO L415 AbstractCegarLoop]: === Iteration 133 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:11,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1815112979, now seen corresponding path program 132 times [2018-07-25 08:53:11,204 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:11,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:12,165 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:12,165 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:12,165 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-07-25 08:53:12,165 INFO L451 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-07-25 08:53:12,166 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-07-25 08:53:12,166 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=17823, Unknown=0, NotChecked=0, Total=18090 [2018-07-25 08:53:12,167 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 135 states. [2018-07-25 08:53:13,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:13,395 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-07-25 08:53:13,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-07-25 08:53:13,395 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 134 [2018-07-25 08:53:13,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:13,396 INFO L225 Difference]: With dead ends: 137 [2018-07-25 08:53:13,396 INFO L226 Difference]: Without dead ends: 136 [2018-07-25 08:53:13,397 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=267, Invalid=17823, Unknown=0, NotChecked=0, Total=18090 [2018-07-25 08:53:13,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-07-25 08:53:13,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-07-25 08:53:13,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-07-25 08:53:13,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2018-07-25 08:53:13,402 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 134 [2018-07-25 08:53:13,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:13,402 INFO L472 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2018-07-25 08:53:13,402 INFO L473 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-07-25 08:53:13,402 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2018-07-25 08:53:13,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-07-25 08:53:13,403 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:13,403 INFO L354 BasicCegarLoop]: trace histogram [133, 1, 1] [2018-07-25 08:53:13,403 INFO L415 AbstractCegarLoop]: === Iteration 134 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:13,403 INFO L82 PathProgramCache]: Analyzing trace with hash 433927736, now seen corresponding path program 133 times [2018-07-25 08:53:13,403 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:13,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:14,244 INFO L134 CoverageAnalysis]: Checked inductivity of 8911 backedges. 0 proven. 8911 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:14,244 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:14,244 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [134] total 134 [2018-07-25 08:53:14,245 INFO L451 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-07-25 08:53:14,245 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-07-25 08:53:14,246 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=18091, Unknown=0, NotChecked=0, Total=18360 [2018-07-25 08:53:14,246 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 136 states. [2018-07-25 08:53:15,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:15,512 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2018-07-25 08:53:15,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-07-25 08:53:15,513 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 135 [2018-07-25 08:53:15,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:15,513 INFO L225 Difference]: With dead ends: 138 [2018-07-25 08:53:15,513 INFO L226 Difference]: Without dead ends: 137 [2018-07-25 08:53:15,515 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=269, Invalid=18091, Unknown=0, NotChecked=0, Total=18360 [2018-07-25 08:53:15,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-07-25 08:53:15,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-07-25 08:53:15,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-07-25 08:53:15,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-07-25 08:53:15,522 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 135 [2018-07-25 08:53:15,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:15,523 INFO L472 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-07-25 08:53:15,523 INFO L473 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-07-25 08:53:15,523 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-07-25 08:53:15,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-07-25 08:53:15,524 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:15,524 INFO L354 BasicCegarLoop]: trace histogram [134, 1, 1] [2018-07-25 08:53:15,524 INFO L415 AbstractCegarLoop]: === Iteration 135 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:15,524 INFO L82 PathProgramCache]: Analyzing trace with hash 566858163, now seen corresponding path program 134 times [2018-07-25 08:53:15,524 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:15,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:16,503 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:16,503 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:16,503 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-07-25 08:53:16,504 INFO L451 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-07-25 08:53:16,504 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-07-25 08:53:16,505 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=18361, Unknown=0, NotChecked=0, Total=18632 [2018-07-25 08:53:16,505 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 137 states. [2018-07-25 08:53:17,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:17,791 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-07-25 08:53:17,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-07-25 08:53:17,791 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 136 [2018-07-25 08:53:17,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:17,791 INFO L225 Difference]: With dead ends: 139 [2018-07-25 08:53:17,792 INFO L226 Difference]: Without dead ends: 138 [2018-07-25 08:53:17,793 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=271, Invalid=18361, Unknown=0, NotChecked=0, Total=18632 [2018-07-25 08:53:17,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-07-25 08:53:17,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-07-25 08:53:17,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-07-25 08:53:17,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2018-07-25 08:53:17,798 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 136 [2018-07-25 08:53:17,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:17,799 INFO L472 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2018-07-25 08:53:17,799 INFO L473 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-07-25 08:53:17,799 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2018-07-25 08:53:17,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-07-25 08:53:17,799 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:17,799 INFO L354 BasicCegarLoop]: trace histogram [135, 1, 1] [2018-07-25 08:53:17,799 INFO L415 AbstractCegarLoop]: === Iteration 136 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:17,800 INFO L82 PathProgramCache]: Analyzing trace with hash 392734104, now seen corresponding path program 135 times [2018-07-25 08:53:17,800 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:17,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:18,789 INFO L134 CoverageAnalysis]: Checked inductivity of 9180 backedges. 0 proven. 9180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:18,790 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:18,790 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [136] total 136 [2018-07-25 08:53:18,790 INFO L451 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-07-25 08:53:18,790 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-07-25 08:53:18,792 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=18633, Unknown=0, NotChecked=0, Total=18906 [2018-07-25 08:53:18,792 INFO L87 Difference]: Start difference. First operand 138 states and 138 transitions. Second operand 138 states. [2018-07-25 08:53:20,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:20,067 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2018-07-25 08:53:20,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-07-25 08:53:20,067 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 137 [2018-07-25 08:53:20,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:20,068 INFO L225 Difference]: With dead ends: 140 [2018-07-25 08:53:20,068 INFO L226 Difference]: Without dead ends: 139 [2018-07-25 08:53:20,069 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=273, Invalid=18633, Unknown=0, NotChecked=0, Total=18906 [2018-07-25 08:53:20,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-07-25 08:53:20,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-07-25 08:53:20,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-07-25 08:53:20,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2018-07-25 08:53:20,076 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 137 [2018-07-25 08:53:20,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:20,076 INFO L472 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2018-07-25 08:53:20,076 INFO L473 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-07-25 08:53:20,076 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2018-07-25 08:53:20,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-07-25 08:53:20,076 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:20,077 INFO L354 BasicCegarLoop]: trace histogram [136, 1, 1] [2018-07-25 08:53:20,077 INFO L415 AbstractCegarLoop]: === Iteration 137 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:20,077 INFO L82 PathProgramCache]: Analyzing trace with hash -710144429, now seen corresponding path program 136 times [2018-07-25 08:53:20,077 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:20,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:21,026 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:21,026 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:21,026 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-07-25 08:53:21,027 INFO L451 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-07-25 08:53:21,027 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-07-25 08:53:21,028 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=18907, Unknown=0, NotChecked=0, Total=19182 [2018-07-25 08:53:21,028 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 139 states. [2018-07-25 08:53:22,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:22,337 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-07-25 08:53:22,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-07-25 08:53:22,338 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 138 [2018-07-25 08:53:22,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:22,338 INFO L225 Difference]: With dead ends: 141 [2018-07-25 08:53:22,338 INFO L226 Difference]: Without dead ends: 140 [2018-07-25 08:53:22,339 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=275, Invalid=18907, Unknown=0, NotChecked=0, Total=19182 [2018-07-25 08:53:22,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-07-25 08:53:22,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-07-25 08:53:22,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-07-25 08:53:22,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2018-07-25 08:53:22,345 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 138 [2018-07-25 08:53:22,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:22,345 INFO L472 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2018-07-25 08:53:22,345 INFO L473 AbstractCegarLoop]: Interpolant automaton has 139 states. [2018-07-25 08:53:22,345 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2018-07-25 08:53:22,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-07-25 08:53:22,345 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:22,346 INFO L354 BasicCegarLoop]: trace histogram [137, 1, 1] [2018-07-25 08:53:22,346 INFO L415 AbstractCegarLoop]: === Iteration 138 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:22,346 INFO L82 PathProgramCache]: Analyzing trace with hash -539640584, now seen corresponding path program 137 times [2018-07-25 08:53:22,346 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:22,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:23,252 INFO L134 CoverageAnalysis]: Checked inductivity of 9453 backedges. 0 proven. 9453 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:23,252 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:23,253 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [138] total 138 [2018-07-25 08:53:23,253 INFO L451 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-07-25 08:53:23,253 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-07-25 08:53:23,255 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=19183, Unknown=0, NotChecked=0, Total=19460 [2018-07-25 08:53:23,255 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 140 states. [2018-07-25 08:53:24,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:24,582 INFO L93 Difference]: Finished difference Result 142 states and 142 transitions. [2018-07-25 08:53:24,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2018-07-25 08:53:24,582 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 139 [2018-07-25 08:53:24,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:24,582 INFO L225 Difference]: With dead ends: 142 [2018-07-25 08:53:24,583 INFO L226 Difference]: Without dead ends: 141 [2018-07-25 08:53:24,583 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=277, Invalid=19183, Unknown=0, NotChecked=0, Total=19460 [2018-07-25 08:53:24,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-07-25 08:53:24,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-07-25 08:53:24,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-07-25 08:53:24,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-07-25 08:53:24,588 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 139 [2018-07-25 08:53:24,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:24,589 INFO L472 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-07-25 08:53:24,589 INFO L473 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-07-25 08:53:24,589 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-07-25 08:53:24,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-07-25 08:53:24,589 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:24,589 INFO L354 BasicCegarLoop]: trace histogram [138, 1, 1] [2018-07-25 08:53:24,589 INFO L415 AbstractCegarLoop]: === Iteration 139 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:24,590 INFO L82 PathProgramCache]: Analyzing trace with hash 451011315, now seen corresponding path program 138 times [2018-07-25 08:53:24,590 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:24,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:25,588 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:25,589 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:25,589 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-07-25 08:53:25,589 INFO L451 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-07-25 08:53:25,589 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-07-25 08:53:25,590 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=19461, Unknown=0, NotChecked=0, Total=19740 [2018-07-25 08:53:25,591 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 141 states. [2018-07-25 08:53:26,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:26,974 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-07-25 08:53:26,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-07-25 08:53:26,974 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 140 [2018-07-25 08:53:26,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:26,975 INFO L225 Difference]: With dead ends: 143 [2018-07-25 08:53:26,975 INFO L226 Difference]: Without dead ends: 142 [2018-07-25 08:53:26,976 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=279, Invalid=19461, Unknown=0, NotChecked=0, Total=19740 [2018-07-25 08:53:26,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-07-25 08:53:26,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-07-25 08:53:26,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-07-25 08:53:26,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2018-07-25 08:53:26,982 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 140 [2018-07-25 08:53:26,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:26,982 INFO L472 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2018-07-25 08:53:26,982 INFO L473 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-07-25 08:53:26,982 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2018-07-25 08:53:26,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-07-25 08:53:26,983 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:26,983 INFO L354 BasicCegarLoop]: trace histogram [139, 1, 1] [2018-07-25 08:53:26,983 INFO L415 AbstractCegarLoop]: === Iteration 140 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:26,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1096449112, now seen corresponding path program 139 times [2018-07-25 08:53:26,983 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:27,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:27,961 INFO L134 CoverageAnalysis]: Checked inductivity of 9730 backedges. 0 proven. 9730 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:27,961 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:27,961 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [140] total 140 [2018-07-25 08:53:27,962 INFO L451 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-07-25 08:53:27,962 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-07-25 08:53:27,962 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=19741, Unknown=0, NotChecked=0, Total=20022 [2018-07-25 08:53:27,962 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 142 states. [2018-07-25 08:53:29,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:29,276 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2018-07-25 08:53:29,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2018-07-25 08:53:29,277 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 141 [2018-07-25 08:53:29,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:29,277 INFO L225 Difference]: With dead ends: 144 [2018-07-25 08:53:29,277 INFO L226 Difference]: Without dead ends: 143 [2018-07-25 08:53:29,278 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=281, Invalid=19741, Unknown=0, NotChecked=0, Total=20022 [2018-07-25 08:53:29,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-07-25 08:53:29,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-07-25 08:53:29,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-07-25 08:53:29,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-07-25 08:53:29,283 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 141 [2018-07-25 08:53:29,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:29,283 INFO L472 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-07-25 08:53:29,283 INFO L473 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-07-25 08:53:29,283 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-07-25 08:53:29,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-07-25 08:53:29,284 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:29,284 INFO L354 BasicCegarLoop]: trace histogram [140, 1, 1] [2018-07-25 08:53:29,284 INFO L415 AbstractCegarLoop]: === Iteration 141 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:29,284 INFO L82 PathProgramCache]: Analyzing trace with hash -369815661, now seen corresponding path program 140 times [2018-07-25 08:53:29,284 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:29,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:30,352 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:30,352 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:30,353 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2018-07-25 08:53:30,353 INFO L451 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-07-25 08:53:30,353 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-07-25 08:53:30,354 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=20023, Unknown=0, NotChecked=0, Total=20306 [2018-07-25 08:53:30,354 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 143 states. [2018-07-25 08:53:31,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:31,743 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-07-25 08:53:31,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-07-25 08:53:31,743 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 142 [2018-07-25 08:53:31,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:31,744 INFO L225 Difference]: With dead ends: 145 [2018-07-25 08:53:31,744 INFO L226 Difference]: Without dead ends: 144 [2018-07-25 08:53:31,745 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=283, Invalid=20023, Unknown=0, NotChecked=0, Total=20306 [2018-07-25 08:53:31,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-07-25 08:53:31,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-07-25 08:53:31,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-07-25 08:53:31,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 144 transitions. [2018-07-25 08:53:31,751 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 144 transitions. Word has length 142 [2018-07-25 08:53:31,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:31,751 INFO L472 AbstractCegarLoop]: Abstraction has 144 states and 144 transitions. [2018-07-25 08:53:31,751 INFO L473 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-07-25 08:53:31,751 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 144 transitions. [2018-07-25 08:53:31,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-07-25 08:53:31,751 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:31,752 INFO L354 BasicCegarLoop]: trace histogram [141, 1, 1] [2018-07-25 08:53:31,752 INFO L415 AbstractCegarLoop]: === Iteration 142 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:31,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1420616632, now seen corresponding path program 141 times [2018-07-25 08:53:31,752 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:31,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:32,809 INFO L134 CoverageAnalysis]: Checked inductivity of 10011 backedges. 0 proven. 10011 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:32,809 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:32,810 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [142] total 142 [2018-07-25 08:53:32,810 INFO L451 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-07-25 08:53:32,810 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-07-25 08:53:32,811 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=20307, Unknown=0, NotChecked=0, Total=20592 [2018-07-25 08:53:32,811 INFO L87 Difference]: Start difference. First operand 144 states and 144 transitions. Second operand 144 states. [2018-07-25 08:53:34,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:34,243 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2018-07-25 08:53:34,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-07-25 08:53:34,243 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 143 [2018-07-25 08:53:34,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:34,243 INFO L225 Difference]: With dead ends: 146 [2018-07-25 08:53:34,243 INFO L226 Difference]: Without dead ends: 145 [2018-07-25 08:53:34,244 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=285, Invalid=20307, Unknown=0, NotChecked=0, Total=20592 [2018-07-25 08:53:34,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-07-25 08:53:34,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-07-25 08:53:34,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-07-25 08:53:34,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-07-25 08:53:34,250 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 143 [2018-07-25 08:53:34,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:34,250 INFO L472 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-07-25 08:53:34,250 INFO L473 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-07-25 08:53:34,250 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-07-25 08:53:34,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-07-25 08:53:34,251 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:34,251 INFO L354 BasicCegarLoop]: trace histogram [142, 1, 1] [2018-07-25 08:53:34,251 INFO L415 AbstractCegarLoop]: === Iteration 143 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:34,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1089442867, now seen corresponding path program 142 times [2018-07-25 08:53:34,251 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:34,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:35,267 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:35,267 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:35,267 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2018-07-25 08:53:35,268 INFO L451 AbstractCegarLoop]: Interpolant automaton has 145 states [2018-07-25 08:53:35,268 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2018-07-25 08:53:35,269 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=20593, Unknown=0, NotChecked=0, Total=20880 [2018-07-25 08:53:35,269 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 145 states. [2018-07-25 08:53:36,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:36,703 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-07-25 08:53:36,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2018-07-25 08:53:36,703 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 144 [2018-07-25 08:53:36,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:36,704 INFO L225 Difference]: With dead ends: 147 [2018-07-25 08:53:36,704 INFO L226 Difference]: Without dead ends: 146 [2018-07-25 08:53:36,704 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=287, Invalid=20593, Unknown=0, NotChecked=0, Total=20880 [2018-07-25 08:53:36,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-07-25 08:53:36,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-07-25 08:53:36,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-07-25 08:53:36,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2018-07-25 08:53:36,709 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 144 [2018-07-25 08:53:36,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:36,709 INFO L472 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2018-07-25 08:53:36,710 INFO L473 AbstractCegarLoop]: Interpolant automaton has 145 states. [2018-07-25 08:53:36,710 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2018-07-25 08:53:36,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-07-25 08:53:36,710 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:36,710 INFO L354 BasicCegarLoop]: trace histogram [143, 1, 1] [2018-07-25 08:53:36,711 INFO L415 AbstractCegarLoop]: === Iteration 144 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:36,711 INFO L82 PathProgramCache]: Analyzing trace with hash -587009256, now seen corresponding path program 143 times [2018-07-25 08:53:36,711 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:36,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:37,779 INFO L134 CoverageAnalysis]: Checked inductivity of 10296 backedges. 0 proven. 10296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:37,780 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:37,780 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [144] total 144 [2018-07-25 08:53:37,780 INFO L451 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-07-25 08:53:37,780 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-07-25 08:53:37,782 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=20881, Unknown=0, NotChecked=0, Total=21170 [2018-07-25 08:53:37,782 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 146 states. [2018-07-25 08:53:39,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:39,227 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2018-07-25 08:53:39,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-07-25 08:53:39,228 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 145 [2018-07-25 08:53:39,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:39,228 INFO L225 Difference]: With dead ends: 148 [2018-07-25 08:53:39,228 INFO L226 Difference]: Without dead ends: 147 [2018-07-25 08:53:39,230 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=289, Invalid=20881, Unknown=0, NotChecked=0, Total=21170 [2018-07-25 08:53:39,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-07-25 08:53:39,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-07-25 08:53:39,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-07-25 08:53:39,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-07-25 08:53:39,235 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 145 [2018-07-25 08:53:39,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:39,236 INFO L472 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-07-25 08:53:39,236 INFO L473 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-07-25 08:53:39,236 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-07-25 08:53:39,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-07-25 08:53:39,236 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:39,236 INFO L354 BasicCegarLoop]: trace histogram [144, 1, 1] [2018-07-25 08:53:39,236 INFO L415 AbstractCegarLoop]: === Iteration 145 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:39,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1017417517, now seen corresponding path program 144 times [2018-07-25 08:53:39,237 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:39,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:40,343 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:40,344 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:40,344 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2018-07-25 08:53:40,344 INFO L451 AbstractCegarLoop]: Interpolant automaton has 147 states [2018-07-25 08:53:40,345 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2018-07-25 08:53:40,346 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=21171, Unknown=0, NotChecked=0, Total=21462 [2018-07-25 08:53:40,346 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 147 states. [2018-07-25 08:53:41,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:41,868 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-07-25 08:53:41,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-07-25 08:53:41,868 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 146 [2018-07-25 08:53:41,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:41,869 INFO L225 Difference]: With dead ends: 149 [2018-07-25 08:53:41,869 INFO L226 Difference]: Without dead ends: 148 [2018-07-25 08:53:41,869 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=291, Invalid=21171, Unknown=0, NotChecked=0, Total=21462 [2018-07-25 08:53:41,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-07-25 08:53:41,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-07-25 08:53:41,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-07-25 08:53:41,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2018-07-25 08:53:41,875 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 146 [2018-07-25 08:53:41,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:41,875 INFO L472 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2018-07-25 08:53:41,875 INFO L473 AbstractCegarLoop]: Interpolant automaton has 147 states. [2018-07-25 08:53:41,875 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2018-07-25 08:53:41,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-07-25 08:53:41,876 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:41,876 INFO L354 BasicCegarLoop]: trace histogram [145, 1, 1] [2018-07-25 08:53:41,876 INFO L415 AbstractCegarLoop]: === Iteration 146 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:41,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1475171720, now seen corresponding path program 145 times [2018-07-25 08:53:41,876 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:41,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:42,986 INFO L134 CoverageAnalysis]: Checked inductivity of 10585 backedges. 0 proven. 10585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:42,986 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:42,986 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [146] total 146 [2018-07-25 08:53:42,987 INFO L451 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-07-25 08:53:42,987 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-07-25 08:53:42,988 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=21463, Unknown=0, NotChecked=0, Total=21756 [2018-07-25 08:53:42,988 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 148 states. [2018-07-25 08:53:44,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:44,516 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2018-07-25 08:53:44,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2018-07-25 08:53:44,516 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 147 [2018-07-25 08:53:44,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:44,516 INFO L225 Difference]: With dead ends: 150 [2018-07-25 08:53:44,516 INFO L226 Difference]: Without dead ends: 149 [2018-07-25 08:53:44,518 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=293, Invalid=21463, Unknown=0, NotChecked=0, Total=21756 [2018-07-25 08:53:44,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-07-25 08:53:44,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-07-25 08:53:44,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-07-25 08:53:44,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-07-25 08:53:44,524 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 147 [2018-07-25 08:53:44,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:44,524 INFO L472 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-07-25 08:53:44,524 INFO L473 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-07-25 08:53:44,525 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-07-25 08:53:44,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-07-25 08:53:44,525 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:44,525 INFO L354 BasicCegarLoop]: trace histogram [146, 1, 1] [2018-07-25 08:53:44,525 INFO L415 AbstractCegarLoop]: === Iteration 147 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:44,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1514317171, now seen corresponding path program 146 times [2018-07-25 08:53:44,526 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:44,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:45,705 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:45,705 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:45,705 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147] total 147 [2018-07-25 08:53:45,706 INFO L451 AbstractCegarLoop]: Interpolant automaton has 149 states [2018-07-25 08:53:45,706 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2018-07-25 08:53:45,707 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=21757, Unknown=0, NotChecked=0, Total=22052 [2018-07-25 08:53:45,707 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 149 states. [2018-07-25 08:53:47,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:47,203 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-07-25 08:53:47,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2018-07-25 08:53:47,203 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 148 [2018-07-25 08:53:47,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:47,204 INFO L225 Difference]: With dead ends: 151 [2018-07-25 08:53:47,204 INFO L226 Difference]: Without dead ends: 150 [2018-07-25 08:53:47,205 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=295, Invalid=21757, Unknown=0, NotChecked=0, Total=22052 [2018-07-25 08:53:47,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-07-25 08:53:47,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-07-25 08:53:47,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-07-25 08:53:47,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2018-07-25 08:53:47,213 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 148 [2018-07-25 08:53:47,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:47,213 INFO L472 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2018-07-25 08:53:47,213 INFO L473 AbstractCegarLoop]: Interpolant automaton has 149 states. [2018-07-25 08:53:47,213 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2018-07-25 08:53:47,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-07-25 08:53:47,214 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:47,214 INFO L354 BasicCegarLoop]: trace histogram [147, 1, 1] [2018-07-25 08:53:47,214 INFO L415 AbstractCegarLoop]: === Iteration 148 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:47,215 INFO L82 PathProgramCache]: Analyzing trace with hash -300807720, now seen corresponding path program 147 times [2018-07-25 08:53:47,215 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:47,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:48,422 INFO L134 CoverageAnalysis]: Checked inductivity of 10878 backedges. 0 proven. 10878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:48,422 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:48,422 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [148] total 148 [2018-07-25 08:53:48,423 INFO L451 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-07-25 08:53:48,423 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-07-25 08:53:48,424 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=22053, Unknown=0, NotChecked=0, Total=22350 [2018-07-25 08:53:48,424 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 150 states. [2018-07-25 08:53:49,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:49,986 INFO L93 Difference]: Finished difference Result 152 states and 152 transitions. [2018-07-25 08:53:49,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-07-25 08:53:49,986 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 149 [2018-07-25 08:53:49,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:49,987 INFO L225 Difference]: With dead ends: 152 [2018-07-25 08:53:49,987 INFO L226 Difference]: Without dead ends: 151 [2018-07-25 08:53:49,988 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=297, Invalid=22053, Unknown=0, NotChecked=0, Total=22350 [2018-07-25 08:53:49,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-07-25 08:53:49,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-07-25 08:53:49,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-07-25 08:53:49,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-07-25 08:53:49,996 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 149 [2018-07-25 08:53:49,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:49,996 INFO L472 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-07-25 08:53:49,996 INFO L473 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-07-25 08:53:49,996 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-07-25 08:53:49,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-07-25 08:53:49,997 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:49,997 INFO L354 BasicCegarLoop]: trace histogram [148, 1, 1] [2018-07-25 08:53:49,997 INFO L415 AbstractCegarLoop]: === Iteration 149 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:49,997 INFO L82 PathProgramCache]: Analyzing trace with hash -735104493, now seen corresponding path program 148 times [2018-07-25 08:53:49,997 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:50,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:51,048 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:51,048 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:51,048 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149] total 149 [2018-07-25 08:53:51,049 INFO L451 AbstractCegarLoop]: Interpolant automaton has 151 states [2018-07-25 08:53:51,049 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 151 interpolants. [2018-07-25 08:53:51,050 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=22351, Unknown=0, NotChecked=0, Total=22650 [2018-07-25 08:53:51,050 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 151 states. [2018-07-25 08:53:52,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:52,606 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-07-25 08:53:52,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2018-07-25 08:53:52,606 INFO L78 Accepts]: Start accepts. Automaton has 151 states. Word has length 150 [2018-07-25 08:53:52,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:52,607 INFO L225 Difference]: With dead ends: 153 [2018-07-25 08:53:52,607 INFO L226 Difference]: Without dead ends: 152 [2018-07-25 08:53:52,608 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=299, Invalid=22351, Unknown=0, NotChecked=0, Total=22650 [2018-07-25 08:53:52,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-07-25 08:53:52,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-07-25 08:53:52,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-07-25 08:53:52,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2018-07-25 08:53:52,616 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 150 [2018-07-25 08:53:52,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:52,617 INFO L472 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2018-07-25 08:53:52,617 INFO L473 AbstractCegarLoop]: Interpolant automaton has 151 states. [2018-07-25 08:53:52,617 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2018-07-25 08:53:52,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-07-25 08:53:52,618 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:52,618 INFO L354 BasicCegarLoop]: trace histogram [149, 1, 1] [2018-07-25 08:53:52,618 INFO L415 AbstractCegarLoop]: === Iteration 150 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:52,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1313402568, now seen corresponding path program 149 times [2018-07-25 08:53:52,618 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:52,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:53,896 INFO L134 CoverageAnalysis]: Checked inductivity of 11175 backedges. 0 proven. 11175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:53,897 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:53,897 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [150] total 150 [2018-07-25 08:53:53,897 INFO L451 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-07-25 08:53:53,898 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-07-25 08:53:53,898 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=22651, Unknown=0, NotChecked=0, Total=22952 [2018-07-25 08:53:53,899 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 152 states. [2018-07-25 08:53:55,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:55,463 INFO L93 Difference]: Finished difference Result 154 states and 154 transitions. [2018-07-25 08:53:55,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-07-25 08:53:55,464 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 151 [2018-07-25 08:53:55,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:55,464 INFO L225 Difference]: With dead ends: 154 [2018-07-25 08:53:55,464 INFO L226 Difference]: Without dead ends: 153 [2018-07-25 08:53:55,465 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=301, Invalid=22651, Unknown=0, NotChecked=0, Total=22952 [2018-07-25 08:53:55,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-07-25 08:53:55,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-07-25 08:53:55,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-07-25 08:53:55,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-07-25 08:53:55,471 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 151 [2018-07-25 08:53:55,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:55,471 INFO L472 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-07-25 08:53:55,471 INFO L473 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-07-25 08:53:55,472 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-07-25 08:53:55,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-07-25 08:53:55,472 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:55,472 INFO L354 BasicCegarLoop]: trace histogram [150, 1, 1] [2018-07-25 08:53:55,472 INFO L415 AbstractCegarLoop]: === Iteration 151 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:55,472 INFO L82 PathProgramCache]: Analyzing trace with hash -2060773709, now seen corresponding path program 150 times [2018-07-25 08:53:55,472 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:55,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:56,683 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:56,684 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:56,684 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [151] total 151 [2018-07-25 08:53:56,684 INFO L451 AbstractCegarLoop]: Interpolant automaton has 153 states [2018-07-25 08:53:56,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2018-07-25 08:53:56,685 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=22953, Unknown=0, NotChecked=0, Total=23256 [2018-07-25 08:53:56,686 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 153 states. [2018-07-25 08:53:58,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:58,332 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-07-25 08:53:58,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-07-25 08:53:58,332 INFO L78 Accepts]: Start accepts. Automaton has 153 states. Word has length 152 [2018-07-25 08:53:58,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:58,332 INFO L225 Difference]: With dead ends: 155 [2018-07-25 08:53:58,332 INFO L226 Difference]: Without dead ends: 154 [2018-07-25 08:53:58,333 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=303, Invalid=22953, Unknown=0, NotChecked=0, Total=23256 [2018-07-25 08:53:58,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-07-25 08:53:58,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-07-25 08:53:58,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-07-25 08:53:58,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 154 transitions. [2018-07-25 08:53:58,339 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 154 transitions. Word has length 152 [2018-07-25 08:53:58,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:58,339 INFO L472 AbstractCegarLoop]: Abstraction has 154 states and 154 transitions. [2018-07-25 08:53:58,339 INFO L473 AbstractCegarLoop]: Interpolant automaton has 153 states. [2018-07-25 08:53:58,339 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 154 transitions. [2018-07-25 08:53:58,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-07-25 08:53:58,340 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:58,340 INFO L354 BasicCegarLoop]: trace histogram [151, 1, 1] [2018-07-25 08:53:58,340 INFO L415 AbstractCegarLoop]: === Iteration 152 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:58,340 INFO L82 PathProgramCache]: Analyzing trace with hash 540524696, now seen corresponding path program 151 times [2018-07-25 08:53:58,340 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:58,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:59,571 INFO L134 CoverageAnalysis]: Checked inductivity of 11476 backedges. 0 proven. 11476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:59,571 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:59,571 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [152] total 152 [2018-07-25 08:53:59,571 INFO L451 AbstractCegarLoop]: Interpolant automaton has 154 states [2018-07-25 08:53:59,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2018-07-25 08:53:59,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=23257, Unknown=0, NotChecked=0, Total=23562 [2018-07-25 08:53:59,573 INFO L87 Difference]: Start difference. First operand 154 states and 154 transitions. Second operand 154 states. [2018-07-25 08:54:01,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:01,251 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2018-07-25 08:54:01,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2018-07-25 08:54:01,251 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 153 [2018-07-25 08:54:01,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:01,252 INFO L225 Difference]: With dead ends: 156 [2018-07-25 08:54:01,252 INFO L226 Difference]: Without dead ends: 155 [2018-07-25 08:54:01,253 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=305, Invalid=23257, Unknown=0, NotChecked=0, Total=23562 [2018-07-25 08:54:01,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-07-25 08:54:01,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-07-25 08:54:01,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-07-25 08:54:01,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-07-25 08:54:01,260 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 153 [2018-07-25 08:54:01,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:01,260 INFO L472 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-07-25 08:54:01,260 INFO L473 AbstractCegarLoop]: Interpolant automaton has 154 states. [2018-07-25 08:54:01,260 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-07-25 08:54:01,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-07-25 08:54:01,260 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:01,260 INFO L354 BasicCegarLoop]: trace histogram [152, 1, 1] [2018-07-25 08:54:01,261 INFO L415 AbstractCegarLoop]: === Iteration 153 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:01,261 INFO L82 PathProgramCache]: Analyzing trace with hash -423603373, now seen corresponding path program 152 times [2018-07-25 08:54:01,261 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:01,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:02,484 INFO L134 CoverageAnalysis]: Checked inductivity of 11628 backedges. 0 proven. 11628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:02,485 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:02,485 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [153] total 153 [2018-07-25 08:54:02,485 INFO L451 AbstractCegarLoop]: Interpolant automaton has 155 states [2018-07-25 08:54:02,485 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2018-07-25 08:54:02,486 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=23563, Unknown=0, NotChecked=0, Total=23870 [2018-07-25 08:54:02,486 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 155 states. [2018-07-25 08:54:04,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:04,175 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2018-07-25 08:54:04,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2018-07-25 08:54:04,176 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 154 [2018-07-25 08:54:04,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:04,176 INFO L225 Difference]: With dead ends: 157 [2018-07-25 08:54:04,176 INFO L226 Difference]: Without dead ends: 156 [2018-07-25 08:54:04,177 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=307, Invalid=23563, Unknown=0, NotChecked=0, Total=23870 [2018-07-25 08:54:04,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-07-25 08:54:04,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-07-25 08:54:04,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-07-25 08:54:04,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2018-07-25 08:54:04,183 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 154 [2018-07-25 08:54:04,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:04,184 INFO L472 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2018-07-25 08:54:04,184 INFO L473 AbstractCegarLoop]: Interpolant automaton has 155 states. [2018-07-25 08:54:04,184 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2018-07-25 08:54:04,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-07-25 08:54:04,184 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:04,184 INFO L354 BasicCegarLoop]: trace histogram [153, 1, 1] [2018-07-25 08:54:04,184 INFO L415 AbstractCegarLoop]: === Iteration 154 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:04,185 INFO L82 PathProgramCache]: Analyzing trace with hash -246802440, now seen corresponding path program 153 times [2018-07-25 08:54:04,185 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:04,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:05,431 INFO L134 CoverageAnalysis]: Checked inductivity of 11781 backedges. 0 proven. 11781 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:05,431 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:05,431 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [154] total 154 [2018-07-25 08:54:05,432 INFO L451 AbstractCegarLoop]: Interpolant automaton has 156 states [2018-07-25 08:54:05,432 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2018-07-25 08:54:05,433 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=23871, Unknown=0, NotChecked=0, Total=24180 [2018-07-25 08:54:05,433 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 156 states. [2018-07-25 08:54:07,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:07,169 INFO L93 Difference]: Finished difference Result 158 states and 158 transitions. [2018-07-25 08:54:07,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-07-25 08:54:07,169 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 155 [2018-07-25 08:54:07,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:07,170 INFO L225 Difference]: With dead ends: 158 [2018-07-25 08:54:07,170 INFO L226 Difference]: Without dead ends: 157 [2018-07-25 08:54:07,170 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=309, Invalid=23871, Unknown=0, NotChecked=0, Total=24180 [2018-07-25 08:54:07,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-07-25 08:54:07,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-07-25 08:54:07,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-07-25 08:54:07,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-07-25 08:54:07,179 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 155 [2018-07-25 08:54:07,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:07,179 INFO L472 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-07-25 08:54:07,179 INFO L473 AbstractCegarLoop]: Interpolant automaton has 156 states. [2018-07-25 08:54:07,179 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-07-25 08:54:07,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-07-25 08:54:07,180 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:07,180 INFO L354 BasicCegarLoop]: trace histogram [154, 1, 1] [2018-07-25 08:54:07,180 INFO L415 AbstractCegarLoop]: === Iteration 155 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:07,181 INFO L82 PathProgramCache]: Analyzing trace with hash 939059187, now seen corresponding path program 154 times [2018-07-25 08:54:07,181 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:07,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:08,456 INFO L134 CoverageAnalysis]: Checked inductivity of 11935 backedges. 0 proven. 11935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:08,457 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:08,457 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [155] total 155 [2018-07-25 08:54:08,457 INFO L451 AbstractCegarLoop]: Interpolant automaton has 157 states [2018-07-25 08:54:08,457 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 157 interpolants. [2018-07-25 08:54:08,458 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=24181, Unknown=0, NotChecked=0, Total=24492 [2018-07-25 08:54:08,458 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 157 states. [2018-07-25 08:54:10,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:10,229 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-07-25 08:54:10,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2018-07-25 08:54:10,229 INFO L78 Accepts]: Start accepts. Automaton has 157 states. Word has length 156 [2018-07-25 08:54:10,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:10,230 INFO L225 Difference]: With dead ends: 159 [2018-07-25 08:54:10,230 INFO L226 Difference]: Without dead ends: 158 [2018-07-25 08:54:10,232 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=311, Invalid=24181, Unknown=0, NotChecked=0, Total=24492 [2018-07-25 08:54:10,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-07-25 08:54:10,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-07-25 08:54:10,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-07-25 08:54:10,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2018-07-25 08:54:10,238 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 156 [2018-07-25 08:54:10,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:10,239 INFO L472 AbstractCegarLoop]: Abstraction has 158 states and 158 transitions. [2018-07-25 08:54:10,239 INFO L473 AbstractCegarLoop]: Interpolant automaton has 157 states. [2018-07-25 08:54:10,239 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2018-07-25 08:54:10,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-07-25 08:54:10,239 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:10,239 INFO L354 BasicCegarLoop]: trace histogram [155, 1, 1] [2018-07-25 08:54:10,240 INFO L415 AbstractCegarLoop]: === Iteration 156 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:10,240 INFO L82 PathProgramCache]: Analyzing trace with hash -953936040, now seen corresponding path program 155 times [2018-07-25 08:54:10,240 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:10,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:11,578 INFO L134 CoverageAnalysis]: Checked inductivity of 12090 backedges. 0 proven. 12090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:11,578 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:11,578 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [156] total 156 [2018-07-25 08:54:11,579 INFO L451 AbstractCegarLoop]: Interpolant automaton has 158 states [2018-07-25 08:54:11,579 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2018-07-25 08:54:11,579 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=24493, Unknown=0, NotChecked=0, Total=24806 [2018-07-25 08:54:11,580 INFO L87 Difference]: Start difference. First operand 158 states and 158 transitions. Second operand 158 states. [2018-07-25 08:54:13,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:13,276 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2018-07-25 08:54:13,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2018-07-25 08:54:13,276 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 157 [2018-07-25 08:54:13,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:13,276 INFO L225 Difference]: With dead ends: 160 [2018-07-25 08:54:13,276 INFO L226 Difference]: Without dead ends: 159 [2018-07-25 08:54:13,277 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=313, Invalid=24493, Unknown=0, NotChecked=0, Total=24806 [2018-07-25 08:54:13,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-07-25 08:54:13,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-07-25 08:54:13,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-07-25 08:54:13,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2018-07-25 08:54:13,284 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 157 [2018-07-25 08:54:13,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:13,284 INFO L472 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2018-07-25 08:54:13,284 INFO L473 AbstractCegarLoop]: Interpolant automaton has 158 states. [2018-07-25 08:54:13,284 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2018-07-25 08:54:13,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-07-25 08:54:13,285 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:13,285 INFO L354 BasicCegarLoop]: trace histogram [156, 1, 1] [2018-07-25 08:54:13,285 INFO L415 AbstractCegarLoop]: === Iteration 157 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:13,285 INFO L82 PathProgramCache]: Analyzing trace with hash 492754067, now seen corresponding path program 156 times [2018-07-25 08:54:13,285 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:13,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:14,709 INFO L134 CoverageAnalysis]: Checked inductivity of 12246 backedges. 0 proven. 12246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:14,709 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:14,709 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [157] total 157 [2018-07-25 08:54:14,709 INFO L451 AbstractCegarLoop]: Interpolant automaton has 159 states [2018-07-25 08:54:14,710 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 159 interpolants. [2018-07-25 08:54:14,711 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=24807, Unknown=0, NotChecked=0, Total=25122 [2018-07-25 08:54:14,711 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 159 states. [2018-07-25 08:54:16,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:16,533 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-07-25 08:54:16,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2018-07-25 08:54:16,533 INFO L78 Accepts]: Start accepts. Automaton has 159 states. Word has length 158 [2018-07-25 08:54:16,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:16,534 INFO L225 Difference]: With dead ends: 161 [2018-07-25 08:54:16,534 INFO L226 Difference]: Without dead ends: 160 [2018-07-25 08:54:16,535 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=315, Invalid=24807, Unknown=0, NotChecked=0, Total=25122 [2018-07-25 08:54:16,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-07-25 08:54:16,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-07-25 08:54:16,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-07-25 08:54:16,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 160 transitions. [2018-07-25 08:54:16,541 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 160 transitions. Word has length 158 [2018-07-25 08:54:16,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:16,542 INFO L472 AbstractCegarLoop]: Abstraction has 160 states and 160 transitions. [2018-07-25 08:54:16,542 INFO L473 AbstractCegarLoop]: Interpolant automaton has 159 states. [2018-07-25 08:54:16,542 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 160 transitions. [2018-07-25 08:54:16,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-07-25 08:54:16,542 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:16,542 INFO L354 BasicCegarLoop]: trace histogram [157, 1, 1] [2018-07-25 08:54:16,543 INFO L415 AbstractCegarLoop]: === Iteration 158 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:16,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1904492872, now seen corresponding path program 157 times [2018-07-25 08:54:16,543 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:16,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:17,894 INFO L134 CoverageAnalysis]: Checked inductivity of 12403 backedges. 0 proven. 12403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:17,894 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:17,894 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [158] total 158 [2018-07-25 08:54:17,895 INFO L451 AbstractCegarLoop]: Interpolant automaton has 160 states [2018-07-25 08:54:17,895 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2018-07-25 08:54:17,896 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=25123, Unknown=0, NotChecked=0, Total=25440 [2018-07-25 08:54:17,896 INFO L87 Difference]: Start difference. First operand 160 states and 160 transitions. Second operand 160 states. [2018-07-25 08:54:19,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:19,744 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2018-07-25 08:54:19,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2018-07-25 08:54:19,744 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 159 [2018-07-25 08:54:19,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:19,745 INFO L225 Difference]: With dead ends: 162 [2018-07-25 08:54:19,745 INFO L226 Difference]: Without dead ends: 161 [2018-07-25 08:54:19,747 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=317, Invalid=25123, Unknown=0, NotChecked=0, Total=25440 [2018-07-25 08:54:19,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-07-25 08:54:19,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-07-25 08:54:19,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-07-25 08:54:19,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-07-25 08:54:19,753 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 159 [2018-07-25 08:54:19,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:19,753 INFO L472 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-07-25 08:54:19,753 INFO L473 AbstractCegarLoop]: Interpolant automaton has 160 states. [2018-07-25 08:54:19,754 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-07-25 08:54:19,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-07-25 08:54:19,754 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:19,754 INFO L354 BasicCegarLoop]: trace histogram [158, 1, 1] [2018-07-25 08:54:19,754 INFO L415 AbstractCegarLoop]: === Iteration 159 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:19,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1090263347, now seen corresponding path program 158 times [2018-07-25 08:54:19,754 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:19,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:21,080 INFO L134 CoverageAnalysis]: Checked inductivity of 12561 backedges. 0 proven. 12561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:21,081 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:21,081 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [159] total 159 [2018-07-25 08:54:21,081 INFO L451 AbstractCegarLoop]: Interpolant automaton has 161 states [2018-07-25 08:54:21,081 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 161 interpolants. [2018-07-25 08:54:21,083 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=319, Invalid=25441, Unknown=0, NotChecked=0, Total=25760 [2018-07-25 08:54:21,083 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 161 states. [2018-07-25 08:54:22,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:22,860 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-07-25 08:54:22,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2018-07-25 08:54:22,860 INFO L78 Accepts]: Start accepts. Automaton has 161 states. Word has length 160 [2018-07-25 08:54:22,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:22,860 INFO L225 Difference]: With dead ends: 163 [2018-07-25 08:54:22,860 INFO L226 Difference]: Without dead ends: 162 [2018-07-25 08:54:22,862 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=319, Invalid=25441, Unknown=0, NotChecked=0, Total=25760 [2018-07-25 08:54:22,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-07-25 08:54:22,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-07-25 08:54:22,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-07-25 08:54:22,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2018-07-25 08:54:22,869 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 160 [2018-07-25 08:54:22,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:22,869 INFO L472 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2018-07-25 08:54:22,869 INFO L473 AbstractCegarLoop]: Interpolant automaton has 161 states. [2018-07-25 08:54:22,869 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2018-07-25 08:54:22,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-07-25 08:54:22,869 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:22,869 INFO L354 BasicCegarLoop]: trace histogram [159, 1, 1] [2018-07-25 08:54:22,870 INFO L415 AbstractCegarLoop]: === Iteration 160 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:22,870 INFO L82 PathProgramCache]: Analyzing trace with hash -561574376, now seen corresponding path program 159 times [2018-07-25 08:54:22,870 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:22,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:24,214 INFO L134 CoverageAnalysis]: Checked inductivity of 12720 backedges. 0 proven. 12720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:24,215 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:24,215 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [160] total 160 [2018-07-25 08:54:24,215 INFO L451 AbstractCegarLoop]: Interpolant automaton has 162 states [2018-07-25 08:54:24,215 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2018-07-25 08:54:24,216 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=25761, Unknown=0, NotChecked=0, Total=26082 [2018-07-25 08:54:24,216 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 162 states. [2018-07-25 08:54:25,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:25,948 INFO L93 Difference]: Finished difference Result 164 states and 164 transitions. [2018-07-25 08:54:25,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2018-07-25 08:54:25,948 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 161 [2018-07-25 08:54:25,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:25,949 INFO L225 Difference]: With dead ends: 164 [2018-07-25 08:54:25,949 INFO L226 Difference]: Without dead ends: 163 [2018-07-25 08:54:25,949 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=321, Invalid=25761, Unknown=0, NotChecked=0, Total=26082 [2018-07-25 08:54:25,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-07-25 08:54:25,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-07-25 08:54:25,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-07-25 08:54:25,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-07-25 08:54:25,955 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 161 [2018-07-25 08:54:25,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:25,956 INFO L472 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-07-25 08:54:25,956 INFO L473 AbstractCegarLoop]: Interpolant automaton has 162 states. [2018-07-25 08:54:25,956 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-07-25 08:54:25,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-07-25 08:54:25,956 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:25,956 INFO L354 BasicCegarLoop]: trace histogram [160, 1, 1] [2018-07-25 08:54:25,957 INFO L415 AbstractCegarLoop]: === Iteration 161 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:25,957 INFO L82 PathProgramCache]: Analyzing trace with hash -228936237, now seen corresponding path program 160 times [2018-07-25 08:54:25,957 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:25,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:27,261 INFO L134 CoverageAnalysis]: Checked inductivity of 12880 backedges. 0 proven. 12880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:27,262 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:27,262 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [161] total 161 [2018-07-25 08:54:27,262 INFO L451 AbstractCegarLoop]: Interpolant automaton has 163 states [2018-07-25 08:54:27,262 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 163 interpolants. [2018-07-25 08:54:27,263 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=26083, Unknown=0, NotChecked=0, Total=26406 [2018-07-25 08:54:27,264 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 163 states. [2018-07-25 08:54:29,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:29,140 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-07-25 08:54:29,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2018-07-25 08:54:29,141 INFO L78 Accepts]: Start accepts. Automaton has 163 states. Word has length 162 [2018-07-25 08:54:29,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:29,141 INFO L225 Difference]: With dead ends: 165 [2018-07-25 08:54:29,141 INFO L226 Difference]: Without dead ends: 164 [2018-07-25 08:54:29,142 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=323, Invalid=26083, Unknown=0, NotChecked=0, Total=26406 [2018-07-25 08:54:29,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-07-25 08:54:29,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2018-07-25 08:54:29,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-07-25 08:54:29,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2018-07-25 08:54:29,151 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 162 [2018-07-25 08:54:29,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:29,151 INFO L472 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2018-07-25 08:54:29,151 INFO L473 AbstractCegarLoop]: Interpolant automaton has 163 states. [2018-07-25 08:54:29,151 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2018-07-25 08:54:29,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-07-25 08:54:29,152 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:29,152 INFO L354 BasicCegarLoop]: trace histogram [161, 1, 1] [2018-07-25 08:54:29,152 INFO L415 AbstractCegarLoop]: === Iteration 162 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:29,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1492911480, now seen corresponding path program 161 times [2018-07-25 08:54:29,152 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:29,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:30,544 INFO L134 CoverageAnalysis]: Checked inductivity of 13041 backedges. 0 proven. 13041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:30,544 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:30,545 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [162] total 162 [2018-07-25 08:54:30,545 INFO L451 AbstractCegarLoop]: Interpolant automaton has 164 states [2018-07-25 08:54:30,545 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2018-07-25 08:54:30,546 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=26407, Unknown=0, NotChecked=0, Total=26732 [2018-07-25 08:54:30,546 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand 164 states. [2018-07-25 08:54:32,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:32,452 INFO L93 Difference]: Finished difference Result 166 states and 166 transitions. [2018-07-25 08:54:32,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2018-07-25 08:54:32,452 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 163 [2018-07-25 08:54:32,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:32,453 INFO L225 Difference]: With dead ends: 166 [2018-07-25 08:54:32,453 INFO L226 Difference]: Without dead ends: 165 [2018-07-25 08:54:32,455 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=325, Invalid=26407, Unknown=0, NotChecked=0, Total=26732 [2018-07-25 08:54:32,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-07-25 08:54:32,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-07-25 08:54:32,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-07-25 08:54:32,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-07-25 08:54:32,461 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 163 [2018-07-25 08:54:32,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:32,462 INFO L472 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-07-25 08:54:32,462 INFO L473 AbstractCegarLoop]: Interpolant automaton has 164 states. [2018-07-25 08:54:32,462 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-07-25 08:54:32,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-07-25 08:54:32,462 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:32,462 INFO L354 BasicCegarLoop]: trace histogram [162, 1, 1] [2018-07-25 08:54:32,463 INFO L415 AbstractCegarLoop]: === Iteration 163 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:32,463 INFO L82 PathProgramCache]: Analyzing trace with hash -964384141, now seen corresponding path program 162 times [2018-07-25 08:54:32,463 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:32,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:33,947 INFO L134 CoverageAnalysis]: Checked inductivity of 13203 backedges. 0 proven. 13203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:33,947 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:33,948 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [163] total 163 [2018-07-25 08:54:33,948 INFO L451 AbstractCegarLoop]: Interpolant automaton has 165 states [2018-07-25 08:54:33,948 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 165 interpolants. [2018-07-25 08:54:33,949 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=26733, Unknown=0, NotChecked=0, Total=27060 [2018-07-25 08:54:33,949 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 165 states. [2018-07-25 08:54:35,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:35,847 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-07-25 08:54:35,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2018-07-25 08:54:35,847 INFO L78 Accepts]: Start accepts. Automaton has 165 states. Word has length 164 [2018-07-25 08:54:35,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:35,848 INFO L225 Difference]: With dead ends: 167 [2018-07-25 08:54:35,848 INFO L226 Difference]: Without dead ends: 166 [2018-07-25 08:54:35,850 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=327, Invalid=26733, Unknown=0, NotChecked=0, Total=27060 [2018-07-25 08:54:35,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-07-25 08:54:35,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-07-25 08:54:35,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-07-25 08:54:35,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2018-07-25 08:54:35,860 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 164 [2018-07-25 08:54:35,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:35,860 INFO L472 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2018-07-25 08:54:35,860 INFO L473 AbstractCegarLoop]: Interpolant automaton has 165 states. [2018-07-25 08:54:35,860 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2018-07-25 08:54:35,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-07-25 08:54:35,861 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:35,861 INFO L354 BasicCegarLoop]: trace histogram [163, 1, 1] [2018-07-25 08:54:35,861 INFO L415 AbstractCegarLoop]: === Iteration 164 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:35,861 INFO L82 PathProgramCache]: Analyzing trace with hash 168862936, now seen corresponding path program 163 times [2018-07-25 08:54:35,862 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:35,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:37,367 INFO L134 CoverageAnalysis]: Checked inductivity of 13366 backedges. 0 proven. 13366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:37,368 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:37,368 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [164] total 164 [2018-07-25 08:54:37,368 INFO L451 AbstractCegarLoop]: Interpolant automaton has 166 states [2018-07-25 08:54:37,368 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2018-07-25 08:54:37,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=27061, Unknown=0, NotChecked=0, Total=27390 [2018-07-25 08:54:37,369 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 166 states. [2018-07-25 08:54:39,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:39,253 INFO L93 Difference]: Finished difference Result 168 states and 168 transitions. [2018-07-25 08:54:39,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2018-07-25 08:54:39,253 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 165 [2018-07-25 08:54:39,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:39,254 INFO L225 Difference]: With dead ends: 168 [2018-07-25 08:54:39,254 INFO L226 Difference]: Without dead ends: 167 [2018-07-25 08:54:39,255 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=329, Invalid=27061, Unknown=0, NotChecked=0, Total=27390 [2018-07-25 08:54:39,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-07-25 08:54:39,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-07-25 08:54:39,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-07-25 08:54:39,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2018-07-25 08:54:39,261 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 165 [2018-07-25 08:54:39,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:39,261 INFO L472 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2018-07-25 08:54:39,261 INFO L473 AbstractCegarLoop]: Interpolant automaton has 166 states. [2018-07-25 08:54:39,261 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2018-07-25 08:54:39,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-07-25 08:54:39,262 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:39,262 INFO L354 BasicCegarLoop]: trace histogram [164, 1, 1] [2018-07-25 08:54:39,262 INFO L415 AbstractCegarLoop]: === Iteration 165 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:39,262 INFO L82 PathProgramCache]: Analyzing trace with hash 939783955, now seen corresponding path program 164 times [2018-07-25 08:54:39,262 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:39,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:40,603 INFO L134 CoverageAnalysis]: Checked inductivity of 13530 backedges. 0 proven. 13530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:40,604 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:40,604 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [165] total 165 [2018-07-25 08:54:40,604 INFO L451 AbstractCegarLoop]: Interpolant automaton has 167 states [2018-07-25 08:54:40,604 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 167 interpolants. [2018-07-25 08:54:40,605 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=27391, Unknown=0, NotChecked=0, Total=27722 [2018-07-25 08:54:40,605 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 167 states. [2018-07-25 08:54:42,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:42,480 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2018-07-25 08:54:42,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2018-07-25 08:54:42,480 INFO L78 Accepts]: Start accepts. Automaton has 167 states. Word has length 166 [2018-07-25 08:54:42,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:42,480 INFO L225 Difference]: With dead ends: 169 [2018-07-25 08:54:42,480 INFO L226 Difference]: Without dead ends: 168 [2018-07-25 08:54:42,481 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=331, Invalid=27391, Unknown=0, NotChecked=0, Total=27722 [2018-07-25 08:54:42,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-07-25 08:54:42,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-07-25 08:54:42,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-07-25 08:54:42,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 168 transitions. [2018-07-25 08:54:42,488 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 168 transitions. Word has length 166 [2018-07-25 08:54:42,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:42,488 INFO L472 AbstractCegarLoop]: Abstraction has 168 states and 168 transitions. [2018-07-25 08:54:42,488 INFO L473 AbstractCegarLoop]: Interpolant automaton has 167 states. [2018-07-25 08:54:42,488 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 168 transitions. [2018-07-25 08:54:42,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-07-25 08:54:42,489 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:42,489 INFO L354 BasicCegarLoop]: trace histogram [165, 1, 1] [2018-07-25 08:54:42,489 INFO L415 AbstractCegarLoop]: === Iteration 166 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:42,489 INFO L82 PathProgramCache]: Analyzing trace with hash -931468232, now seen corresponding path program 165 times [2018-07-25 08:54:42,490 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:42,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:43,834 INFO L134 CoverageAnalysis]: Checked inductivity of 13695 backedges. 0 proven. 13695 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:43,835 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:43,835 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [166] total 166 [2018-07-25 08:54:43,835 INFO L451 AbstractCegarLoop]: Interpolant automaton has 168 states [2018-07-25 08:54:43,835 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2018-07-25 08:54:43,837 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=333, Invalid=27723, Unknown=0, NotChecked=0, Total=28056 [2018-07-25 08:54:43,837 INFO L87 Difference]: Start difference. First operand 168 states and 168 transitions. Second operand 168 states. [2018-07-25 08:54:45,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:45,840 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2018-07-25 08:54:45,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2018-07-25 08:54:45,840 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 167 [2018-07-25 08:54:45,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:45,841 INFO L225 Difference]: With dead ends: 170 [2018-07-25 08:54:45,841 INFO L226 Difference]: Without dead ends: 169 [2018-07-25 08:54:45,841 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=333, Invalid=27723, Unknown=0, NotChecked=0, Total=28056 [2018-07-25 08:54:45,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-07-25 08:54:45,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-07-25 08:54:45,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-07-25 08:54:45,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2018-07-25 08:54:45,848 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 167 [2018-07-25 08:54:45,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:45,848 INFO L472 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2018-07-25 08:54:45,848 INFO L473 AbstractCegarLoop]: Interpolant automaton has 168 states. [2018-07-25 08:54:45,848 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2018-07-25 08:54:45,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-07-25 08:54:45,848 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:45,849 INFO L354 BasicCegarLoop]: trace histogram [166, 1, 1] [2018-07-25 08:54:45,849 INFO L415 AbstractCegarLoop]: === Iteration 167 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:45,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1189256115, now seen corresponding path program 166 times [2018-07-25 08:54:45,849 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:45,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:47,205 INFO L134 CoverageAnalysis]: Checked inductivity of 13861 backedges. 0 proven. 13861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:47,205 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:47,205 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [167] total 167 [2018-07-25 08:54:47,205 INFO L451 AbstractCegarLoop]: Interpolant automaton has 169 states [2018-07-25 08:54:47,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 169 interpolants. [2018-07-25 08:54:47,207 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=28057, Unknown=0, NotChecked=0, Total=28392 [2018-07-25 08:54:47,207 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 169 states. [2018-07-25 08:54:49,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:49,178 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-07-25 08:54:49,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2018-07-25 08:54:49,178 INFO L78 Accepts]: Start accepts. Automaton has 169 states. Word has length 168 [2018-07-25 08:54:49,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:49,179 INFO L225 Difference]: With dead ends: 171 [2018-07-25 08:54:49,179 INFO L226 Difference]: Without dead ends: 170 [2018-07-25 08:54:49,180 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=335, Invalid=28057, Unknown=0, NotChecked=0, Total=28392 [2018-07-25 08:54:49,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-07-25 08:54:49,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2018-07-25 08:54:49,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-07-25 08:54:49,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 170 transitions. [2018-07-25 08:54:49,190 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 170 transitions. Word has length 168 [2018-07-25 08:54:49,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:49,190 INFO L472 AbstractCegarLoop]: Abstraction has 170 states and 170 transitions. [2018-07-25 08:54:49,190 INFO L473 AbstractCegarLoop]: Interpolant automaton has 169 states. [2018-07-25 08:54:49,190 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 170 transitions. [2018-07-25 08:54:49,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-07-25 08:54:49,191 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:49,191 INFO L354 BasicCegarLoop]: trace histogram [167, 1, 1] [2018-07-25 08:54:49,191 INFO L415 AbstractCegarLoop]: === Iteration 168 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:49,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1787765864, now seen corresponding path program 167 times [2018-07-25 08:54:49,192 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:49,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:50,726 INFO L134 CoverageAnalysis]: Checked inductivity of 14028 backedges. 0 proven. 14028 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:50,727 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:50,727 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [168] total 168 [2018-07-25 08:54:50,727 INFO L451 AbstractCegarLoop]: Interpolant automaton has 170 states [2018-07-25 08:54:50,727 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2018-07-25 08:54:50,728 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=28393, Unknown=0, NotChecked=0, Total=28730 [2018-07-25 08:54:50,729 INFO L87 Difference]: Start difference. First operand 170 states and 170 transitions. Second operand 170 states. [2018-07-25 08:54:52,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:52,700 INFO L93 Difference]: Finished difference Result 172 states and 172 transitions. [2018-07-25 08:54:52,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2018-07-25 08:54:52,701 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 169 [2018-07-25 08:54:52,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:52,701 INFO L225 Difference]: With dead ends: 172 [2018-07-25 08:54:52,701 INFO L226 Difference]: Without dead ends: 171 [2018-07-25 08:54:52,703 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=337, Invalid=28393, Unknown=0, NotChecked=0, Total=28730 [2018-07-25 08:54:52,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-07-25 08:54:52,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-07-25 08:54:52,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-07-25 08:54:52,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-07-25 08:54:52,710 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 169 [2018-07-25 08:54:52,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:52,710 INFO L472 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-07-25 08:54:52,710 INFO L473 AbstractCegarLoop]: Interpolant automaton has 170 states. [2018-07-25 08:54:52,710 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-07-25 08:54:52,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-07-25 08:54:52,711 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:52,711 INFO L354 BasicCegarLoop]: trace histogram [168, 1, 1] [2018-07-25 08:54:52,711 INFO L415 AbstractCegarLoop]: === Iteration 169 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:52,711 INFO L82 PathProgramCache]: Analyzing trace with hash 413833299, now seen corresponding path program 168 times [2018-07-25 08:54:52,711 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:52,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:54,266 INFO L134 CoverageAnalysis]: Checked inductivity of 14196 backedges. 0 proven. 14196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:54,267 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:54,267 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [169] total 169 [2018-07-25 08:54:54,267 INFO L451 AbstractCegarLoop]: Interpolant automaton has 171 states [2018-07-25 08:54:54,267 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 171 interpolants. [2018-07-25 08:54:54,268 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=28731, Unknown=0, NotChecked=0, Total=29070 [2018-07-25 08:54:54,268 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 171 states. [2018-07-25 08:54:56,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:56,261 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2018-07-25 08:54:56,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2018-07-25 08:54:56,261 INFO L78 Accepts]: Start accepts. Automaton has 171 states. Word has length 170 [2018-07-25 08:54:56,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:56,262 INFO L225 Difference]: With dead ends: 173 [2018-07-25 08:54:56,262 INFO L226 Difference]: Without dead ends: 172 [2018-07-25 08:54:56,263 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=339, Invalid=28731, Unknown=0, NotChecked=0, Total=29070 [2018-07-25 08:54:56,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-07-25 08:54:56,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2018-07-25 08:54:56,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-07-25 08:54:56,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2018-07-25 08:54:56,270 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 170 [2018-07-25 08:54:56,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:56,270 INFO L472 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2018-07-25 08:54:56,270 INFO L473 AbstractCegarLoop]: Interpolant automaton has 171 states. [2018-07-25 08:54:56,270 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2018-07-25 08:54:56,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-07-25 08:54:56,270 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:56,270 INFO L354 BasicCegarLoop]: trace histogram [169, 1, 1] [2018-07-25 08:54:56,271 INFO L415 AbstractCegarLoop]: === Iteration 170 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:56,271 INFO L82 PathProgramCache]: Analyzing trace with hash -56069384, now seen corresponding path program 169 times [2018-07-25 08:54:56,271 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:56,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:57,805 INFO L134 CoverageAnalysis]: Checked inductivity of 14365 backedges. 0 proven. 14365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:57,805 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:57,806 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [170] total 170 [2018-07-25 08:54:57,806 INFO L451 AbstractCegarLoop]: Interpolant automaton has 172 states [2018-07-25 08:54:57,806 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2018-07-25 08:54:57,808 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=29071, Unknown=0, NotChecked=0, Total=29412 [2018-07-25 08:54:57,809 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 172 states. [2018-07-25 08:54:59,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:59,857 INFO L93 Difference]: Finished difference Result 174 states and 174 transitions. [2018-07-25 08:54:59,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2018-07-25 08:54:59,858 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 171 [2018-07-25 08:54:59,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:59,858 INFO L225 Difference]: With dead ends: 174 [2018-07-25 08:54:59,858 INFO L226 Difference]: Without dead ends: 173 [2018-07-25 08:54:59,859 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=341, Invalid=29071, Unknown=0, NotChecked=0, Total=29412 [2018-07-25 08:54:59,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-07-25 08:54:59,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-07-25 08:54:59,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-07-25 08:54:59,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-07-25 08:54:59,865 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 171 [2018-07-25 08:54:59,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:59,866 INFO L472 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-07-25 08:54:59,866 INFO L473 AbstractCegarLoop]: Interpolant automaton has 172 states. [2018-07-25 08:54:59,866 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-07-25 08:54:59,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-07-25 08:54:59,866 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:59,866 INFO L354 BasicCegarLoop]: trace histogram [170, 1, 1] [2018-07-25 08:54:59,866 INFO L415 AbstractCegarLoop]: === Iteration 171 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:59,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1738150669, now seen corresponding path program 170 times [2018-07-25 08:54:59,867 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:59,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:55:01,299 INFO L134 CoverageAnalysis]: Checked inductivity of 14535 backedges. 0 proven. 14535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:55:01,299 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:55:01,299 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [171] total 171 [2018-07-25 08:55:01,300 INFO L451 AbstractCegarLoop]: Interpolant automaton has 173 states [2018-07-25 08:55:01,300 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 173 interpolants. [2018-07-25 08:55:01,302 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=29413, Unknown=0, NotChecked=0, Total=29756 [2018-07-25 08:55:01,303 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 173 states. [2018-07-25 08:55:03,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:55:03,230 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-07-25 08:55:03,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2018-07-25 08:55:03,230 INFO L78 Accepts]: Start accepts. Automaton has 173 states. Word has length 172 [2018-07-25 08:55:03,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:55:03,231 INFO L225 Difference]: With dead ends: 175 [2018-07-25 08:55:03,231 INFO L226 Difference]: Without dead ends: 174 [2018-07-25 08:55:03,232 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=343, Invalid=29413, Unknown=0, NotChecked=0, Total=29756 [2018-07-25 08:55:03,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-07-25 08:55:03,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2018-07-25 08:55:03,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-07-25 08:55:03,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 174 transitions. [2018-07-25 08:55:03,238 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 174 transitions. Word has length 172 [2018-07-25 08:55:03,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:55:03,238 INFO L472 AbstractCegarLoop]: Abstraction has 174 states and 174 transitions. [2018-07-25 08:55:03,238 INFO L473 AbstractCegarLoop]: Interpolant automaton has 173 states. [2018-07-25 08:55:03,238 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 174 transitions. [2018-07-25 08:55:03,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-07-25 08:55:03,239 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:55:03,239 INFO L354 BasicCegarLoop]: trace histogram [171, 1, 1] [2018-07-25 08:55:03,239 INFO L415 AbstractCegarLoop]: === Iteration 172 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:55:03,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1951904344, now seen corresponding path program 171 times [2018-07-25 08:55:03,239 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:55:03,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:55:04,636 INFO L134 CoverageAnalysis]: Checked inductivity of 14706 backedges. 0 proven. 14706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:55:04,636 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:55:04,636 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [172] total 172 [2018-07-25 08:55:04,636 INFO L451 AbstractCegarLoop]: Interpolant automaton has 174 states [2018-07-25 08:55:04,637 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2018-07-25 08:55:04,638 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=345, Invalid=29757, Unknown=0, NotChecked=0, Total=30102 [2018-07-25 08:55:04,639 INFO L87 Difference]: Start difference. First operand 174 states and 174 transitions. Second operand 174 states. [2018-07-25 08:55:06,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:55:06,601 INFO L93 Difference]: Finished difference Result 176 states and 176 transitions. [2018-07-25 08:55:06,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2018-07-25 08:55:06,601 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 173 [2018-07-25 08:55:06,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:55:06,601 INFO L225 Difference]: With dead ends: 176 [2018-07-25 08:55:06,602 INFO L226 Difference]: Without dead ends: 175 [2018-07-25 08:55:06,602 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=345, Invalid=29757, Unknown=0, NotChecked=0, Total=30102 [2018-07-25 08:55:06,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-07-25 08:55:06,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-07-25 08:55:06,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-07-25 08:55:06,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2018-07-25 08:55:06,608 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 173 [2018-07-25 08:55:06,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:55:06,608 INFO L472 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2018-07-25 08:55:06,609 INFO L473 AbstractCegarLoop]: Interpolant automaton has 174 states. [2018-07-25 08:55:06,609 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2018-07-25 08:55:06,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-07-25 08:55:06,609 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:55:06,609 INFO L354 BasicCegarLoop]: trace histogram [172, 1, 1] [2018-07-25 08:55:06,609 INFO L415 AbstractCegarLoop]: === Iteration 173 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:55:06,610 INFO L82 PathProgramCache]: Analyzing trace with hash 379492755, now seen corresponding path program 172 times [2018-07-25 08:55:06,610 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:55:06,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:55:08,069 INFO L134 CoverageAnalysis]: Checked inductivity of 14878 backedges. 0 proven. 14878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:55:08,070 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:55:08,070 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [173] total 173 [2018-07-25 08:55:08,070 INFO L451 AbstractCegarLoop]: Interpolant automaton has 175 states [2018-07-25 08:55:08,070 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 175 interpolants. [2018-07-25 08:55:08,072 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=30103, Unknown=0, NotChecked=0, Total=30450 [2018-07-25 08:55:08,072 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 175 states. [2018-07-25 08:55:10,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:55:10,240 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2018-07-25 08:55:10,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2018-07-25 08:55:10,241 INFO L78 Accepts]: Start accepts. Automaton has 175 states. Word has length 174 [2018-07-25 08:55:10,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:55:10,241 INFO L225 Difference]: With dead ends: 177 [2018-07-25 08:55:10,242 INFO L226 Difference]: Without dead ends: 176 [2018-07-25 08:55:10,244 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=347, Invalid=30103, Unknown=0, NotChecked=0, Total=30450 [2018-07-25 08:55:10,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-07-25 08:55:10,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2018-07-25 08:55:10,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-07-25 08:55:10,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2018-07-25 08:55:10,254 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 174 [2018-07-25 08:55:10,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:55:10,254 INFO L472 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2018-07-25 08:55:10,254 INFO L473 AbstractCegarLoop]: Interpolant automaton has 175 states. [2018-07-25 08:55:10,254 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2018-07-25 08:55:10,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-07-25 08:55:10,255 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:55:10,255 INFO L354 BasicCegarLoop]: trace histogram [173, 1, 1] [2018-07-25 08:55:10,255 INFO L415 AbstractCegarLoop]: === Iteration 174 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:55:10,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1120626248, now seen corresponding path program 173 times [2018-07-25 08:55:10,256 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:55:10,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:55:11,848 INFO L134 CoverageAnalysis]: Checked inductivity of 15051 backedges. 0 proven. 15051 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:55:11,848 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:55:11,848 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [174] total 174 [2018-07-25 08:55:11,848 INFO L451 AbstractCegarLoop]: Interpolant automaton has 176 states [2018-07-25 08:55:11,849 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2018-07-25 08:55:11,850 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=30451, Unknown=0, NotChecked=0, Total=30800 [2018-07-25 08:55:11,850 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 176 states. [2018-07-25 08:55:13,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:55:13,996 INFO L93 Difference]: Finished difference Result 178 states and 178 transitions. [2018-07-25 08:55:13,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2018-07-25 08:55:13,996 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 175 [2018-07-25 08:55:13,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:55:13,997 INFO L225 Difference]: With dead ends: 178 [2018-07-25 08:55:13,997 INFO L226 Difference]: Without dead ends: 177 [2018-07-25 08:55:13,998 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=349, Invalid=30451, Unknown=0, NotChecked=0, Total=30800 [2018-07-25 08:55:13,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-07-25 08:55:14,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-07-25 08:55:14,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-07-25 08:55:14,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-07-25 08:55:14,005 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 175 [2018-07-25 08:55:14,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:55:14,005 INFO L472 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-07-25 08:55:14,005 INFO L473 AbstractCegarLoop]: Interpolant automaton has 176 states. [2018-07-25 08:55:14,006 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-07-25 08:55:14,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-07-25 08:55:14,006 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:55:14,006 INFO L354 BasicCegarLoop]: trace histogram [174, 1, 1] [2018-07-25 08:55:14,006 INFO L415 AbstractCegarLoop]: === Iteration 175 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:55:14,006 INFO L82 PathProgramCache]: Analyzing trace with hash -379675085, now seen corresponding path program 174 times [2018-07-25 08:55:14,006 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:55:14,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:55:15,741 INFO L134 CoverageAnalysis]: Checked inductivity of 15225 backedges. 0 proven. 15225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:55:15,742 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:55:15,742 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [175] total 175 [2018-07-25 08:55:15,742 INFO L451 AbstractCegarLoop]: Interpolant automaton has 177 states [2018-07-25 08:55:15,742 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 177 interpolants. [2018-07-25 08:55:15,744 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=30801, Unknown=0, NotChecked=0, Total=31152 [2018-07-25 08:55:15,744 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 177 states. [2018-07-25 08:55:17,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:55:17,899 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-07-25 08:55:17,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2018-07-25 08:55:17,899 INFO L78 Accepts]: Start accepts. Automaton has 177 states. Word has length 176 [2018-07-25 08:55:17,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:55:17,899 INFO L225 Difference]: With dead ends: 179 [2018-07-25 08:55:17,900 INFO L226 Difference]: Without dead ends: 178 [2018-07-25 08:55:17,902 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=351, Invalid=30801, Unknown=0, NotChecked=0, Total=31152 [2018-07-25 08:55:17,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-07-25 08:55:17,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2018-07-25 08:55:17,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-07-25 08:55:17,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2018-07-25 08:55:17,909 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 176 [2018-07-25 08:55:17,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:55:17,909 INFO L472 AbstractCegarLoop]: Abstraction has 178 states and 178 transitions. [2018-07-25 08:55:17,909 INFO L473 AbstractCegarLoop]: Interpolant automaton has 177 states. [2018-07-25 08:55:17,909 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2018-07-25 08:55:17,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-07-25 08:55:17,909 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:55:17,909 INFO L354 BasicCegarLoop]: trace histogram [175, 1, 1] [2018-07-25 08:55:17,910 INFO L415 AbstractCegarLoop]: === Iteration 176 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:55:17,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1114974488, now seen corresponding path program 175 times [2018-07-25 08:55:17,910 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:55:17,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:55:19,650 INFO L134 CoverageAnalysis]: Checked inductivity of 15400 backedges. 0 proven. 15400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:55:19,651 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:55:19,651 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [176] total 176 [2018-07-25 08:55:19,651 INFO L451 AbstractCegarLoop]: Interpolant automaton has 178 states [2018-07-25 08:55:19,651 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2018-07-25 08:55:19,653 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=31153, Unknown=0, NotChecked=0, Total=31506 [2018-07-25 08:55:19,653 INFO L87 Difference]: Start difference. First operand 178 states and 178 transitions. Second operand 178 states. [2018-07-25 08:55:21,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:55:21,833 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2018-07-25 08:55:21,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2018-07-25 08:55:21,833 INFO L78 Accepts]: Start accepts. Automaton has 178 states. Word has length 177 [2018-07-25 08:55:21,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:55:21,834 INFO L225 Difference]: With dead ends: 180 [2018-07-25 08:55:21,834 INFO L226 Difference]: Without dead ends: 179 [2018-07-25 08:55:21,835 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=353, Invalid=31153, Unknown=0, NotChecked=0, Total=31506 [2018-07-25 08:55:21,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-07-25 08:55:21,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-07-25 08:55:21,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-07-25 08:55:21,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2018-07-25 08:55:21,842 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 177 [2018-07-25 08:55:21,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:55:21,842 INFO L472 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2018-07-25 08:55:21,842 INFO L473 AbstractCegarLoop]: Interpolant automaton has 178 states. [2018-07-25 08:55:21,842 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2018-07-25 08:55:21,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-07-25 08:55:21,843 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:55:21,843 INFO L354 BasicCegarLoop]: trace histogram [176, 1, 1] [2018-07-25 08:55:21,843 INFO L415 AbstractCegarLoop]: === Iteration 177 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:55:21,843 INFO L82 PathProgramCache]: Analyzing trace with hash 204470995, now seen corresponding path program 176 times [2018-07-25 08:55:21,843 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:55:21,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:55:23,573 INFO L134 CoverageAnalysis]: Checked inductivity of 15576 backedges. 0 proven. 15576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:55:23,574 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:55:23,574 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [177] total 177 [2018-07-25 08:55:23,574 INFO L451 AbstractCegarLoop]: Interpolant automaton has 179 states [2018-07-25 08:55:23,574 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 179 interpolants. [2018-07-25 08:55:23,575 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=31507, Unknown=0, NotChecked=0, Total=31862 [2018-07-25 08:55:23,575 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 179 states. [2018-07-25 08:55:25,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:55:25,767 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2018-07-25 08:55:25,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2018-07-25 08:55:25,768 INFO L78 Accepts]: Start accepts. Automaton has 179 states. Word has length 178 [2018-07-25 08:55:25,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:55:25,768 INFO L225 Difference]: With dead ends: 181 [2018-07-25 08:55:25,768 INFO L226 Difference]: Without dead ends: 180 [2018-07-25 08:55:25,771 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=355, Invalid=31507, Unknown=0, NotChecked=0, Total=31862 [2018-07-25 08:55:25,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-07-25 08:55:25,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2018-07-25 08:55:25,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-07-25 08:55:25,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 180 transitions. [2018-07-25 08:55:25,782 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 180 transitions. Word has length 178 [2018-07-25 08:55:25,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:55:25,782 INFO L472 AbstractCegarLoop]: Abstraction has 180 states and 180 transitions. [2018-07-25 08:55:25,782 INFO L473 AbstractCegarLoop]: Interpolant automaton has 179 states. [2018-07-25 08:55:25,782 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 180 transitions. [2018-07-25 08:55:25,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-07-25 08:55:25,783 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:55:25,783 INFO L354 BasicCegarLoop]: trace histogram [177, 1, 1] [2018-07-25 08:55:25,783 INFO L415 AbstractCegarLoop]: === Iteration 178 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:55:25,784 INFO L82 PathProgramCache]: Analyzing trace with hash 2043633784, now seen corresponding path program 177 times [2018-07-25 08:55:25,784 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:55:25,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:55:27,571 INFO L134 CoverageAnalysis]: Checked inductivity of 15753 backedges. 0 proven. 15753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:55:27,572 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:55:27,572 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [178] total 178 [2018-07-25 08:55:27,572 INFO L451 AbstractCegarLoop]: Interpolant automaton has 180 states [2018-07-25 08:55:27,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 180 interpolants. [2018-07-25 08:55:27,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=31863, Unknown=0, NotChecked=0, Total=32220 [2018-07-25 08:55:27,573 INFO L87 Difference]: Start difference. First operand 180 states and 180 transitions. Second operand 180 states. [2018-07-25 08:55:29,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:55:29,735 INFO L93 Difference]: Finished difference Result 182 states and 182 transitions. [2018-07-25 08:55:29,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2018-07-25 08:55:29,735 INFO L78 Accepts]: Start accepts. Automaton has 180 states. Word has length 179 [2018-07-25 08:55:29,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:55:29,736 INFO L225 Difference]: With dead ends: 182 [2018-07-25 08:55:29,736 INFO L226 Difference]: Without dead ends: 181 [2018-07-25 08:55:29,737 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=357, Invalid=31863, Unknown=0, NotChecked=0, Total=32220 [2018-07-25 08:55:29,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-07-25 08:55:29,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-07-25 08:55:29,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-07-25 08:55:29,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-07-25 08:55:29,745 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 179 [2018-07-25 08:55:29,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:55:29,745 INFO L472 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-07-25 08:55:29,745 INFO L473 AbstractCegarLoop]: Interpolant automaton has 180 states. [2018-07-25 08:55:29,745 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-07-25 08:55:29,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-07-25 08:55:29,746 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:55:29,746 INFO L354 BasicCegarLoop]: trace histogram [178, 1, 1] [2018-07-25 08:55:29,746 INFO L415 AbstractCegarLoop]: === Iteration 179 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:55:29,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1071861901, now seen corresponding path program 178 times [2018-07-25 08:55:29,747 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:55:29,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:55:31,567 INFO L134 CoverageAnalysis]: Checked inductivity of 15931 backedges. 0 proven. 15931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:55:31,567 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:55:31,567 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [179] total 179 [2018-07-25 08:55:31,567 INFO L451 AbstractCegarLoop]: Interpolant automaton has 181 states [2018-07-25 08:55:31,568 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 181 interpolants. [2018-07-25 08:55:31,568 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=359, Invalid=32221, Unknown=0, NotChecked=0, Total=32580 [2018-07-25 08:55:31,568 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 181 states. [2018-07-25 08:55:33,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:55:33,811 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-07-25 08:55:33,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2018-07-25 08:55:33,811 INFO L78 Accepts]: Start accepts. Automaton has 181 states. Word has length 180 [2018-07-25 08:55:33,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:55:33,812 INFO L225 Difference]: With dead ends: 183 [2018-07-25 08:55:33,812 INFO L226 Difference]: Without dead ends: 182 [2018-07-25 08:55:33,813 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=359, Invalid=32221, Unknown=0, NotChecked=0, Total=32580 [2018-07-25 08:55:33,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-07-25 08:55:33,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-07-25 08:55:33,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-07-25 08:55:33,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2018-07-25 08:55:33,819 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 180 [2018-07-25 08:55:33,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:55:33,820 INFO L472 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2018-07-25 08:55:33,820 INFO L473 AbstractCegarLoop]: Interpolant automaton has 181 states. [2018-07-25 08:55:33,820 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2018-07-25 08:55:33,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-07-25 08:55:33,820 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:55:33,820 INFO L354 BasicCegarLoop]: trace histogram [179, 1, 1] [2018-07-25 08:55:33,820 INFO L415 AbstractCegarLoop]: === Iteration 180 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:55:33,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1132019672, now seen corresponding path program 179 times [2018-07-25 08:55:33,821 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:55:33,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:55:35,514 INFO L134 CoverageAnalysis]: Checked inductivity of 16110 backedges. 0 proven. 16110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:55:35,514 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:55:35,514 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [180] total 180 [2018-07-25 08:55:35,514 INFO L451 AbstractCegarLoop]: Interpolant automaton has 182 states [2018-07-25 08:55:35,514 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 182 interpolants. [2018-07-25 08:55:35,515 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=32581, Unknown=0, NotChecked=0, Total=32942 [2018-07-25 08:55:35,515 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 182 states. [2018-07-25 08:55:37,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:55:37,732 INFO L93 Difference]: Finished difference Result 184 states and 184 transitions. [2018-07-25 08:55:37,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2018-07-25 08:55:37,732 INFO L78 Accepts]: Start accepts. Automaton has 182 states. Word has length 181 [2018-07-25 08:55:37,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:55:37,733 INFO L225 Difference]: With dead ends: 184 [2018-07-25 08:55:37,733 INFO L226 Difference]: Without dead ends: 183 [2018-07-25 08:55:37,734 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=361, Invalid=32581, Unknown=0, NotChecked=0, Total=32942 [2018-07-25 08:55:37,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-07-25 08:55:37,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-07-25 08:55:37,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-07-25 08:55:37,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-07-25 08:55:37,741 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 181 [2018-07-25 08:55:37,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:55:37,741 INFO L472 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-07-25 08:55:37,741 INFO L473 AbstractCegarLoop]: Interpolant automaton has 182 states. [2018-07-25 08:55:37,742 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-07-25 08:55:37,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-07-25 08:55:37,742 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:55:37,742 INFO L354 BasicCegarLoop]: trace histogram [180, 1, 1] [2018-07-25 08:55:37,742 INFO L415 AbstractCegarLoop]: === Iteration 181 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:55:37,742 INFO L82 PathProgramCache]: Analyzing trace with hash 732871699, now seen corresponding path program 180 times [2018-07-25 08:55:37,743 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:55:37,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:55:39,684 INFO L134 CoverageAnalysis]: Checked inductivity of 16290 backedges. 0 proven. 16290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:55:39,684 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:55:39,684 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [181] total 181 [2018-07-25 08:55:39,685 INFO L451 AbstractCegarLoop]: Interpolant automaton has 183 states [2018-07-25 08:55:39,685 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 183 interpolants. [2018-07-25 08:55:39,686 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=363, Invalid=32943, Unknown=0, NotChecked=0, Total=33306 [2018-07-25 08:55:39,686 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 183 states. [2018-07-25 08:55:41,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:55:41,980 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2018-07-25 08:55:41,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2018-07-25 08:55:41,981 INFO L78 Accepts]: Start accepts. Automaton has 183 states. Word has length 182 [2018-07-25 08:55:41,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:55:41,981 INFO L225 Difference]: With dead ends: 185 [2018-07-25 08:55:41,981 INFO L226 Difference]: Without dead ends: 184 [2018-07-25 08:55:41,982 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=363, Invalid=32943, Unknown=0, NotChecked=0, Total=33306 [2018-07-25 08:55:41,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-07-25 08:55:41,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2018-07-25 08:55:41,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-07-25 08:55:41,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 184 transitions. [2018-07-25 08:55:41,993 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 184 transitions. Word has length 182 [2018-07-25 08:55:41,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:55:41,993 INFO L472 AbstractCegarLoop]: Abstraction has 184 states and 184 transitions. [2018-07-25 08:55:41,994 INFO L473 AbstractCegarLoop]: Interpolant automaton has 183 states. [2018-07-25 08:55:41,994 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 184 transitions. [2018-07-25 08:55:41,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-07-25 08:55:41,994 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:55:41,995 INFO L354 BasicCegarLoop]: trace histogram [181, 1, 1] [2018-07-25 08:55:41,995 INFO L415 AbstractCegarLoop]: === Iteration 182 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:55:41,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1244186424, now seen corresponding path program 181 times [2018-07-25 08:55:41,995 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:55:42,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:55:43,821 INFO L134 CoverageAnalysis]: Checked inductivity of 16471 backedges. 0 proven. 16471 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:55:43,822 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:55:43,822 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [182] total 182 [2018-07-25 08:55:43,822 INFO L451 AbstractCegarLoop]: Interpolant automaton has 184 states [2018-07-25 08:55:43,822 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 184 interpolants. [2018-07-25 08:55:43,824 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=365, Invalid=33307, Unknown=0, NotChecked=0, Total=33672 [2018-07-25 08:55:43,824 INFO L87 Difference]: Start difference. First operand 184 states and 184 transitions. Second operand 184 states. [2018-07-25 08:55:46,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:55:46,169 INFO L93 Difference]: Finished difference Result 186 states and 186 transitions. [2018-07-25 08:55:46,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2018-07-25 08:55:46,170 INFO L78 Accepts]: Start accepts. Automaton has 184 states. Word has length 183 [2018-07-25 08:55:46,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:55:46,170 INFO L225 Difference]: With dead ends: 186 [2018-07-25 08:55:46,170 INFO L226 Difference]: Without dead ends: 185 [2018-07-25 08:55:46,171 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=365, Invalid=33307, Unknown=0, NotChecked=0, Total=33672 [2018-07-25 08:55:46,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-07-25 08:55:46,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-07-25 08:55:46,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-07-25 08:55:46,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-07-25 08:55:46,182 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 183 [2018-07-25 08:55:46,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:55:46,182 INFO L472 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-07-25 08:55:46,182 INFO L473 AbstractCegarLoop]: Interpolant automaton has 184 states. [2018-07-25 08:55:46,182 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-07-25 08:55:46,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-07-25 08:55:46,183 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:55:46,183 INFO L354 BasicCegarLoop]: trace histogram [182, 1, 1] [2018-07-25 08:55:46,184 INFO L415 AbstractCegarLoop]: === Iteration 183 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:55:46,184 INFO L82 PathProgramCache]: Analyzing trace with hash -84926285, now seen corresponding path program 182 times [2018-07-25 08:55:46,184 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:55:46,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:55:47,922 INFO L134 CoverageAnalysis]: Checked inductivity of 16653 backedges. 0 proven. 16653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:55:47,923 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:55:47,923 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [183] total 183 [2018-07-25 08:55:47,923 INFO L451 AbstractCegarLoop]: Interpolant automaton has 185 states [2018-07-25 08:55:47,923 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 185 interpolants. [2018-07-25 08:55:47,925 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=33673, Unknown=0, NotChecked=0, Total=34040 [2018-07-25 08:55:47,925 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 185 states. Received shutdown request... [2018-07-25 08:55:48,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 08:55:48,100 WARN L541 AbstractCegarLoop]: Verification canceled [2018-07-25 08:55:48,110 WARN L202 ceAbstractionStarter]: Timeout [2018-07-25 08:55:48,110 INFO L202 PluginConnector]: Adding new model HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.07 08:55:48 BoogieIcfgContainer [2018-07-25 08:55:48,110 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-25 08:55:48,111 INFO L168 Benchmark]: Toolchain (without parser) took 248205.63 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: -1.7 GB). Peak memory consumption was 325.6 MB. Max. memory is 7.1 GB. [2018-07-25 08:55:48,113 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 08:55:48,113 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.74 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 08:55:48,113 INFO L168 Benchmark]: Boogie Preprocessor took 19.13 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 08:55:48,114 INFO L168 Benchmark]: RCFGBuilder took 287.21 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-25 08:55:48,114 INFO L168 Benchmark]: TraceAbstraction took 247856.13 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 3.1 GB in the end (delta: -1.7 GB). Peak memory consumption was 315.1 MB. Max. memory is 7.1 GB. [2018-07-25 08:55:48,117 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.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 38.74 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 19.13 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 287.21 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 247856.13 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 3.1 GB in the end (delta: -1.7 GB). Peak memory consumption was 315.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 30). Cancelled while BasicCegarLoop was constructing difference of abstraction (185states) and interpolant automaton (currently 11 states, 185 states before enhancement), while ReachableStatesComputation was computing reachable states (9 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. TIMEOUT Result, 247.7s OverallTime, 183 OverallIterations, 182 TraceHistogramMax, 126.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 365 SDtfs, 1 SDslu, 0 SDs, 0 SdLazy, 1721287 SolverSat, 229 SolverUnsat, 75 SolverUnknown, 0 SolverNotchecked, 84.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 16836 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16836 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 82.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=185occurred in iteration=182, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 182 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 4.3s SatisfiabilityAnalysisTime, 111.8s InterpolantComputationTime, 17019 NumberOfCodeBlocks, 17019 NumberOfCodeBlocksAsserted, 183 NumberOfCheckSat, 16836 ConstructedInterpolants, 0 QuantifiedInterpolants, 13087198 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 183 InterpolantComputations, 1 PerfectInterpolantSequences, 0/1021384 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/HiddenEqualityWithBranches.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-07-25_08-55-48-126.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/HiddenEqualityWithBranches.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-25_08-55-48-126.csv Completed graceful shutdown