java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/jain_5.i_2.bplTransformedIcfg_BEv2_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-56c9370 [2018-07-23 15:19:27,803 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-23 15:19:27,805 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-23 15:19:27,817 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-23 15:19:27,818 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-23 15:19:27,819 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-23 15:19:27,820 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-23 15:19:27,822 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-23 15:19:27,824 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-23 15:19:27,825 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-23 15:19:27,826 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-23 15:19:27,826 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-23 15:19:27,827 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-23 15:19:27,828 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-23 15:19:27,829 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-23 15:19:27,830 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-23 15:19:27,831 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-23 15:19:27,833 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-23 15:19:27,835 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-23 15:19:27,837 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-23 15:19:27,838 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-23 15:19:27,839 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-23 15:19:27,842 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-23 15:19:27,842 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-23 15:19:27,842 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-23 15:19:27,843 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-23 15:19:27,844 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-23 15:19:27,845 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-23 15:19:27,846 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-23 15:19:27,847 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-23 15:19:27,847 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-23 15:19:27,848 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-23 15:19:27,848 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-23 15:19:27,848 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-23 15:19:27,849 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-23 15:19:27,850 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-23 15:19:27,851 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf [2018-07-23 15:19:27,867 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-23 15:19:27,868 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-23 15:19:27,869 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-23 15:19:27,869 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-23 15:19:27,869 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-23 15:19:27,870 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-23 15:19:27,870 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-23 15:19:27,870 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-23 15:19:27,914 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-23 15:19:27,933 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-23 15:19:27,937 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-23 15:19:27,938 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-23 15:19:27,939 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-23 15:19:27,940 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/jain_5.i_2.bplTransformedIcfg_BEv2_4.bpl [2018-07-23 15:19:27,940 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/jain_5.i_2.bplTransformedIcfg_BEv2_4.bpl' [2018-07-23 15:19:27,997 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-23 15:19:27,999 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-07-23 15:19:28,000 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-23 15:19:28,000 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-23 15:19:28,000 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-23 15:19:28,029 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "jain_5.i_2.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:19:27" (1/1) ... [2018-07-23 15:19:28,031 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "jain_5.i_2.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:19:27" (1/1) ... [2018-07-23 15:19:28,042 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "jain_5.i_2.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:19:27" (1/1) ... [2018-07-23 15:19:28,042 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "jain_5.i_2.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:19:27" (1/1) ... [2018-07-23 15:19:28,045 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "jain_5.i_2.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:19:27" (1/1) ... [2018-07-23 15:19:28,048 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "jain_5.i_2.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:19:27" (1/1) ... [2018-07-23 15:19:28,049 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "jain_5.i_2.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:19:27" (1/1) ... [2018-07-23 15:19:28,052 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-23 15:19:28,053 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-23 15:19:28,053 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-23 15:19:28,053 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-23 15:19:28,056 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "jain_5.i_2.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:19:27" (1/1) ... [2018-07-23 15:19:28,146 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-07-23 15:19:28,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-23 15:19:28,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-23 15:19:28,378 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-23 15:19:28,379 INFO L202 PluginConnector]: Adding new model jain_5.i_2.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 03:19:28 BoogieIcfgContainer [2018-07-23 15:19:28,379 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-23 15:19:28,382 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-23 15:19:28,382 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-23 15:19:28,386 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-23 15:19:28,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "jain_5.i_2.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:19:27" (1/2) ... [2018-07-23 15:19:28,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ad2964d and model type jain_5.i_2.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 03:19:28, skipping insertion in model container [2018-07-23 15:19:28,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "jain_5.i_2.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 03:19:28" (2/2) ... [2018-07-23 15:19:28,390 INFO L112 eAbstractionObserver]: Analyzing ICFG jain_5.i_2.bplTransformedIcfg_BEv2_4.bpl [2018-07-23 15:19:28,400 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-23 15:19:28,410 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-23 15:19:28,452 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-23 15:19:28,453 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-23 15:19:28,453 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-23 15:19:28,454 INFO L375 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-23 15:19:28,454 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-23 15:19:28,454 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-23 15:19:28,454 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-23 15:19:28,454 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-23 15:19:28,455 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-23 15:19:28,467 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-07-23 15:19:28,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-23 15:19:28,476 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:28,477 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-23 15:19:28,478 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:28,483 INFO L82 PathProgramCache]: Analyzing trace with hash 947099, now seen corresponding path program 1 times [2018-07-23 15:19:28,488 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:28,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:28,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:28,577 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 15:19:28,577 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 15:19:28,581 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 15:19:28,593 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 15:19:28,594 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 15:19:28,597 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2018-07-23 15:19:28,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:28,633 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-07-23 15:19:28,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 15:19:28,635 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-07-23 15:19:28,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:28,646 INFO L225 Difference]: With dead ends: 11 [2018-07-23 15:19:28,646 INFO L226 Difference]: Without dead ends: 8 [2018-07-23 15:19:28,650 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 15:19:28,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-07-23 15:19:28,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2018-07-23 15:19:28,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-07-23 15:19:28,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-07-23 15:19:28,696 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-07-23 15:19:28,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:28,696 INFO L471 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-07-23 15:19:28,697 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 15:19:28,697 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-07-23 15:19:28,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 15:19:28,697 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:28,698 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-07-23 15:19:28,698 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:28,700 INFO L82 PathProgramCache]: Analyzing trace with hash 910108837, now seen corresponding path program 1 times [2018-07-23 15:19:28,700 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:28,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:28,756 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:28,757 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:28,757 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-23 15:19:28,759 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 15:19:28,760 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 15:19:28,760 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-23 15:19:28,761 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 5 states. [2018-07-23 15:19:28,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:28,804 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-07-23 15:19:28,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-23 15:19:28,805 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2018-07-23 15:19:28,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:28,805 INFO L225 Difference]: With dead ends: 12 [2018-07-23 15:19:28,806 INFO L226 Difference]: Without dead ends: 10 [2018-07-23 15:19:28,807 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-23 15:19:28,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-07-23 15:19:28,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2018-07-23 15:19:28,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-23 15:19:28,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-07-23 15:19:28,811 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-07-23 15:19:28,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:28,812 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-07-23 15:19:28,812 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 15:19:28,812 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-07-23 15:19:28,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 15:19:28,813 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:28,813 INFO L353 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-07-23 15:19:28,813 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:28,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1558789329, now seen corresponding path program 2 times [2018-07-23 15:19:28,814 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:28,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:28,891 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-23 15:19:28,891 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:28,891 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-23 15:19:28,892 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 15:19:28,892 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 15:19:28,892 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-23 15:19:28,893 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 6 states. [2018-07-23 15:19:28,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:28,962 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-07-23 15:19:28,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-23 15:19:28,962 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2018-07-23 15:19:28,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:28,963 INFO L225 Difference]: With dead ends: 14 [2018-07-23 15:19:28,965 INFO L226 Difference]: Without dead ends: 12 [2018-07-23 15:19:28,966 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-23 15:19:28,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-07-23 15:19:28,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-07-23 15:19:28,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-23 15:19:28,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-07-23 15:19:28,976 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-07-23 15:19:28,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:28,977 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-07-23 15:19:28,977 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 15:19:28,978 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-07-23 15:19:28,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 15:19:28,979 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:28,979 INFO L353 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-07-23 15:19:28,980 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:28,980 INFO L82 PathProgramCache]: Analyzing trace with hash 946987833, now seen corresponding path program 3 times [2018-07-23 15:19:28,981 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:29,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:29,102 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:29,103 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:29,103 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 15:19:29,103 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 15:19:29,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 15:19:29,104 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 15:19:29,104 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 7 states. [2018-07-23 15:19:29,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:29,159 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-07-23 15:19:29,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-23 15:19:29,160 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2018-07-23 15:19:29,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:29,161 INFO L225 Difference]: With dead ends: 16 [2018-07-23 15:19:29,161 INFO L226 Difference]: Without dead ends: 14 [2018-07-23 15:19:29,162 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 15:19:29,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-07-23 15:19:29,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-07-23 15:19:29,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-23 15:19:29,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-07-23 15:19:29,167 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-07-23 15:19:29,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:29,168 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-07-23 15:19:29,168 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 15:19:29,168 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-07-23 15:19:29,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-23 15:19:29,169 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:29,169 INFO L353 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-07-23 15:19:29,169 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:29,170 INFO L82 PathProgramCache]: Analyzing trace with hash -477812541, now seen corresponding path program 4 times [2018-07-23 15:19:29,170 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:29,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:29,265 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:29,265 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:29,266 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 15:19:29,266 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 15:19:29,266 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 15:19:29,267 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 15:19:29,271 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 8 states. [2018-07-23 15:19:29,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:29,378 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-07-23 15:19:29,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-23 15:19:29,378 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-07-23 15:19:29,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:29,379 INFO L225 Difference]: With dead ends: 18 [2018-07-23 15:19:29,380 INFO L226 Difference]: Without dead ends: 16 [2018-07-23 15:19:29,382 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 15:19:29,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-07-23 15:19:29,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-07-23 15:19:29,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-23 15:19:29,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-07-23 15:19:29,394 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-07-23 15:19:29,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:29,395 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-07-23 15:19:29,395 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 15:19:29,395 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-07-23 15:19:29,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-23 15:19:29,397 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:29,398 INFO L353 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2018-07-23 15:19:29,398 INFO L414 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:29,399 INFO L82 PathProgramCache]: Analyzing trace with hash 383595469, now seen corresponding path program 5 times [2018-07-23 15:19:29,399 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:29,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:29,522 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:29,523 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:29,523 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 15:19:29,524 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 15:19:29,524 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 15:19:29,524 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-23 15:19:29,525 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 9 states. [2018-07-23 15:19:29,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:29,611 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-07-23 15:19:29,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-23 15:19:29,612 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2018-07-23 15:19:29,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:29,613 INFO L225 Difference]: With dead ends: 20 [2018-07-23 15:19:29,613 INFO L226 Difference]: Without dead ends: 18 [2018-07-23 15:19:29,617 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-23 15:19:29,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-07-23 15:19:29,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-07-23 15:19:29,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-07-23 15:19:29,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-07-23 15:19:29,635 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-07-23 15:19:29,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:29,636 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-07-23 15:19:29,636 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 15:19:29,636 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-07-23 15:19:29,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-23 15:19:29,639 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:29,639 INFO L353 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2018-07-23 15:19:29,640 INFO L414 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:29,640 INFO L82 PathProgramCache]: Analyzing trace with hash -731995049, now seen corresponding path program 6 times [2018-07-23 15:19:29,640 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:29,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:29,713 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:29,713 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:29,714 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 15:19:29,714 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 15:19:29,714 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 15:19:29,715 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-07-23 15:19:29,715 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2018-07-23 15:19:29,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:29,803 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-07-23 15:19:29,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 15:19:29,804 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-07-23 15:19:29,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:29,805 INFO L225 Difference]: With dead ends: 22 [2018-07-23 15:19:29,805 INFO L226 Difference]: Without dead ends: 20 [2018-07-23 15:19:29,806 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-07-23 15:19:29,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-07-23 15:19:29,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-07-23 15:19:29,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-07-23 15:19:29,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-07-23 15:19:29,821 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-07-23 15:19:29,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:29,822 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-07-23 15:19:29,822 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 15:19:29,823 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-07-23 15:19:29,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 15:19:29,825 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:29,826 INFO L353 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2018-07-23 15:19:29,826 INFO L414 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:29,827 INFO L82 PathProgramCache]: Analyzing trace with hash 927341153, now seen corresponding path program 7 times [2018-07-23 15:19:29,827 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:29,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:29,894 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:29,895 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:29,895 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 15:19:29,896 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 15:19:29,896 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 15:19:29,896 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-23 15:19:29,897 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 11 states. [2018-07-23 15:19:29,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:29,976 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-07-23 15:19:29,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 15:19:29,976 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-07-23 15:19:29,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:29,978 INFO L225 Difference]: With dead ends: 24 [2018-07-23 15:19:29,978 INFO L226 Difference]: Without dead ends: 22 [2018-07-23 15:19:29,978 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-23 15:19:29,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-07-23 15:19:29,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-07-23 15:19:29,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-07-23 15:19:29,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-07-23 15:19:29,987 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2018-07-23 15:19:29,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:29,988 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-07-23 15:19:29,988 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 15:19:29,988 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-07-23 15:19:29,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 15:19:29,992 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:29,992 INFO L353 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1] [2018-07-23 15:19:29,992 INFO L414 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:29,993 INFO L82 PathProgramCache]: Analyzing trace with hash 2116564459, now seen corresponding path program 8 times [2018-07-23 15:19:29,993 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:30,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:30,064 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:30,065 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:30,065 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 15:19:30,065 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 15:19:30,066 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 15:19:30,066 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-07-23 15:19:30,066 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 12 states. [2018-07-23 15:19:30,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:30,150 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-07-23 15:19:30,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 15:19:30,151 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-07-23 15:19:30,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:30,152 INFO L225 Difference]: With dead ends: 26 [2018-07-23 15:19:30,152 INFO L226 Difference]: Without dead ends: 24 [2018-07-23 15:19:30,153 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-07-23 15:19:30,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-07-23 15:19:30,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-07-23 15:19:30,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-07-23 15:19:30,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-07-23 15:19:30,160 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2018-07-23 15:19:30,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:30,161 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-07-23 15:19:30,161 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 15:19:30,161 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-07-23 15:19:30,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-23 15:19:30,162 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:30,162 INFO L353 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1] [2018-07-23 15:19:30,163 INFO L414 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:30,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1796106507, now seen corresponding path program 9 times [2018-07-23 15:19:30,163 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:30,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:30,243 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:30,243 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:30,243 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-23 15:19:30,244 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 15:19:30,244 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 15:19:30,245 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-07-23 15:19:30,245 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 13 states. [2018-07-23 15:19:30,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:30,341 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-07-23 15:19:30,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 15:19:30,341 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2018-07-23 15:19:30,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:30,342 INFO L225 Difference]: With dead ends: 28 [2018-07-23 15:19:30,343 INFO L226 Difference]: Without dead ends: 26 [2018-07-23 15:19:30,343 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-07-23 15:19:30,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-07-23 15:19:30,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-07-23 15:19:30,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-07-23 15:19:30,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-07-23 15:19:30,352 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2018-07-23 15:19:30,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:30,352 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-07-23 15:19:30,352 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 15:19:30,352 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-07-23 15:19:30,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-07-23 15:19:30,353 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:30,354 INFO L353 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1] [2018-07-23 15:19:30,354 INFO L414 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:30,354 INFO L82 PathProgramCache]: Analyzing trace with hash 518446463, now seen corresponding path program 10 times [2018-07-23 15:19:30,355 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:30,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:30,446 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:30,447 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:30,447 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-23 15:19:30,448 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-23 15:19:30,448 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-23 15:19:30,448 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-07-23 15:19:30,449 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 14 states. [2018-07-23 15:19:30,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:30,562 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-07-23 15:19:30,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 15:19:30,563 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2018-07-23 15:19:30,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:30,564 INFO L225 Difference]: With dead ends: 30 [2018-07-23 15:19:30,564 INFO L226 Difference]: Without dead ends: 28 [2018-07-23 15:19:30,565 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-07-23 15:19:30,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-07-23 15:19:30,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-07-23 15:19:30,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-07-23 15:19:30,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-07-23 15:19:30,574 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2018-07-23 15:19:30,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:30,574 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-07-23 15:19:30,575 INFO L472 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-23 15:19:30,575 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-07-23 15:19:30,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-07-23 15:19:30,576 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:30,576 INFO L353 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1] [2018-07-23 15:19:30,576 INFO L414 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:30,576 INFO L82 PathProgramCache]: Analyzing trace with hash 10791305, now seen corresponding path program 11 times [2018-07-23 15:19:30,577 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:30,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:30,699 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:30,700 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:30,700 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-23 15:19:30,700 INFO L450 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-23 15:19:30,701 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-23 15:19:30,701 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-07-23 15:19:30,702 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 15 states. [2018-07-23 15:19:30,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:30,862 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-07-23 15:19:30,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 15:19:30,862 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 26 [2018-07-23 15:19:30,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:30,863 INFO L225 Difference]: With dead ends: 32 [2018-07-23 15:19:30,863 INFO L226 Difference]: Without dead ends: 30 [2018-07-23 15:19:30,864 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-07-23 15:19:30,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-07-23 15:19:30,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-07-23 15:19:30,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-07-23 15:19:30,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-07-23 15:19:30,874 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2018-07-23 15:19:30,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:30,874 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-07-23 15:19:30,874 INFO L472 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-23 15:19:30,874 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-07-23 15:19:30,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-07-23 15:19:30,875 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:30,876 INFO L353 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1] [2018-07-23 15:19:30,876 INFO L414 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:30,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1780456211, now seen corresponding path program 12 times [2018-07-23 15:19:30,877 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:30,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:31,022 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:31,023 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:31,023 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-23 15:19:31,023 INFO L450 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-23 15:19:31,023 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-23 15:19:31,024 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-07-23 15:19:31,025 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 16 states. [2018-07-23 15:19:31,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:31,205 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-07-23 15:19:31,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-23 15:19:31,206 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2018-07-23 15:19:31,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:31,208 INFO L225 Difference]: With dead ends: 34 [2018-07-23 15:19:31,209 INFO L226 Difference]: Without dead ends: 32 [2018-07-23 15:19:31,209 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-07-23 15:19:31,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-07-23 15:19:31,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-07-23 15:19:31,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-07-23 15:19:31,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-07-23 15:19:31,227 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2018-07-23 15:19:31,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:31,228 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-07-23 15:19:31,228 INFO L472 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-23 15:19:31,228 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-07-23 15:19:31,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-07-23 15:19:31,230 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:31,230 INFO L353 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1] [2018-07-23 15:19:31,230 INFO L414 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:31,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1621381661, now seen corresponding path program 13 times [2018-07-23 15:19:31,231 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:31,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:31,379 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:31,379 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:31,380 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-07-23 15:19:31,380 INFO L450 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-23 15:19:31,380 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-23 15:19:31,381 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-07-23 15:19:31,381 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 17 states. [2018-07-23 15:19:31,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:31,568 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-07-23 15:19:31,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-23 15:19:31,568 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2018-07-23 15:19:31,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:31,569 INFO L225 Difference]: With dead ends: 36 [2018-07-23 15:19:31,569 INFO L226 Difference]: Without dead ends: 34 [2018-07-23 15:19:31,570 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-07-23 15:19:31,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-07-23 15:19:31,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-07-23 15:19:31,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-07-23 15:19:31,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-07-23 15:19:31,595 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2018-07-23 15:19:31,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:31,595 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-07-23 15:19:31,595 INFO L472 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-23 15:19:31,596 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-07-23 15:19:31,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-07-23 15:19:31,597 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:31,597 INFO L353 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1] [2018-07-23 15:19:31,597 INFO L414 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:31,597 INFO L82 PathProgramCache]: Analyzing trace with hash -925405529, now seen corresponding path program 14 times [2018-07-23 15:19:31,598 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:31,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:31,729 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:31,729 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:31,729 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-07-23 15:19:31,730 INFO L450 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-23 15:19:31,730 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-23 15:19:31,731 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-07-23 15:19:31,731 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 18 states. [2018-07-23 15:19:31,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:31,898 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-07-23 15:19:31,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-23 15:19:31,899 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2018-07-23 15:19:31,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:31,903 INFO L225 Difference]: With dead ends: 38 [2018-07-23 15:19:31,903 INFO L226 Difference]: Without dead ends: 36 [2018-07-23 15:19:31,904 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-07-23 15:19:31,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-07-23 15:19:31,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-07-23 15:19:31,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-07-23 15:19:31,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-07-23 15:19:31,918 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2018-07-23 15:19:31,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:31,919 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-07-23 15:19:31,919 INFO L472 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-23 15:19:31,919 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-07-23 15:19:31,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-07-23 15:19:31,920 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:31,921 INFO L353 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1] [2018-07-23 15:19:31,921 INFO L414 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:31,921 INFO L82 PathProgramCache]: Analyzing trace with hash -256536399, now seen corresponding path program 15 times [2018-07-23 15:19:31,924 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:31,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:32,080 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:32,081 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:32,081 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-07-23 15:19:32,081 INFO L450 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-07-23 15:19:32,082 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-07-23 15:19:32,082 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-07-23 15:19:32,085 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 19 states. [2018-07-23 15:19:32,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:32,279 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-07-23 15:19:32,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-23 15:19:32,280 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 34 [2018-07-23 15:19:32,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:32,283 INFO L225 Difference]: With dead ends: 40 [2018-07-23 15:19:32,283 INFO L226 Difference]: Without dead ends: 38 [2018-07-23 15:19:32,284 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-07-23 15:19:32,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-07-23 15:19:32,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-07-23 15:19:32,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-07-23 15:19:32,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-07-23 15:19:32,296 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2018-07-23 15:19:32,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:32,296 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-07-23 15:19:32,297 INFO L472 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-07-23 15:19:32,297 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-07-23 15:19:32,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-07-23 15:19:32,298 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:32,298 INFO L353 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1] [2018-07-23 15:19:32,298 INFO L414 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:32,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1718396869, now seen corresponding path program 16 times [2018-07-23 15:19:32,299 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:32,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:32,442 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:32,442 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:32,443 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-07-23 15:19:32,443 INFO L450 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-07-23 15:19:32,443 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-07-23 15:19:32,444 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-07-23 15:19:32,444 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 20 states. [2018-07-23 15:19:32,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:32,726 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-07-23 15:19:32,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-23 15:19:32,726 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2018-07-23 15:19:32,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:32,727 INFO L225 Difference]: With dead ends: 42 [2018-07-23 15:19:32,727 INFO L226 Difference]: Without dead ends: 40 [2018-07-23 15:19:32,728 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-07-23 15:19:32,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-07-23 15:19:32,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-07-23 15:19:32,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-07-23 15:19:32,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-07-23 15:19:32,753 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2018-07-23 15:19:32,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:32,754 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-07-23 15:19:32,754 INFO L472 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-07-23 15:19:32,756 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-07-23 15:19:32,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-07-23 15:19:32,757 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:32,757 INFO L353 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1] [2018-07-23 15:19:32,757 INFO L414 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:32,759 INFO L82 PathProgramCache]: Analyzing trace with hash -2112002747, now seen corresponding path program 17 times [2018-07-23 15:19:32,759 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:32,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:32,925 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:32,926 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:32,926 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-07-23 15:19:32,926 INFO L450 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-07-23 15:19:32,926 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-07-23 15:19:32,927 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-07-23 15:19:32,927 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 21 states. [2018-07-23 15:19:33,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:33,135 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-07-23 15:19:33,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-23 15:19:33,136 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 38 [2018-07-23 15:19:33,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:33,137 INFO L225 Difference]: With dead ends: 44 [2018-07-23 15:19:33,137 INFO L226 Difference]: Without dead ends: 42 [2018-07-23 15:19:33,138 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-07-23 15:19:33,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-07-23 15:19:33,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-07-23 15:19:33,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-07-23 15:19:33,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-07-23 15:19:33,155 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2018-07-23 15:19:33,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:33,155 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-07-23 15:19:33,155 INFO L472 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-07-23 15:19:33,155 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-07-23 15:19:33,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-07-23 15:19:33,156 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:33,156 INFO L353 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1] [2018-07-23 15:19:33,160 INFO L414 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:33,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1884837839, now seen corresponding path program 18 times [2018-07-23 15:19:33,161 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:33,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:33,317 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:33,317 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:33,317 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-07-23 15:19:33,318 INFO L450 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-07-23 15:19:33,318 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-07-23 15:19:33,318 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-07-23 15:19:33,319 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 22 states. [2018-07-23 15:19:33,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:33,545 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-07-23 15:19:33,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-23 15:19:33,545 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2018-07-23 15:19:33,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:33,546 INFO L225 Difference]: With dead ends: 46 [2018-07-23 15:19:33,546 INFO L226 Difference]: Without dead ends: 44 [2018-07-23 15:19:33,547 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-07-23 15:19:33,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-07-23 15:19:33,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2018-07-23 15:19:33,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-07-23 15:19:33,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-07-23 15:19:33,559 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2018-07-23 15:19:33,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:33,559 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-07-23 15:19:33,559 INFO L472 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-07-23 15:19:33,560 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-07-23 15:19:33,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-07-23 15:19:33,560 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:33,560 INFO L353 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1] [2018-07-23 15:19:33,561 INFO L414 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:33,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1147088935, now seen corresponding path program 19 times [2018-07-23 15:19:33,561 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:33,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:33,716 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:33,717 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:33,717 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-07-23 15:19:33,717 INFO L450 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-07-23 15:19:33,718 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-07-23 15:19:33,718 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-07-23 15:19:33,718 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 23 states. [2018-07-23 15:19:33,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:33,925 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-07-23 15:19:33,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-23 15:19:33,925 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 42 [2018-07-23 15:19:33,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:33,926 INFO L225 Difference]: With dead ends: 48 [2018-07-23 15:19:33,926 INFO L226 Difference]: Without dead ends: 46 [2018-07-23 15:19:33,927 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-07-23 15:19:33,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-07-23 15:19:33,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-07-23 15:19:33,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-07-23 15:19:33,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-07-23 15:19:33,940 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2018-07-23 15:19:33,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:33,940 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-07-23 15:19:33,940 INFO L472 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-07-23 15:19:33,940 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-07-23 15:19:33,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-07-23 15:19:33,941 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:33,941 INFO L353 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1] [2018-07-23 15:19:33,941 INFO L414 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:33,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1454075235, now seen corresponding path program 20 times [2018-07-23 15:19:33,942 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:33,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:34,112 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:34,112 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:34,113 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-07-23 15:19:34,113 INFO L450 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-07-23 15:19:34,113 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-07-23 15:19:34,114 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-07-23 15:19:34,114 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 24 states. [2018-07-23 15:19:34,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:34,367 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-07-23 15:19:34,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-23 15:19:34,367 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2018-07-23 15:19:34,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:34,368 INFO L225 Difference]: With dead ends: 50 [2018-07-23 15:19:34,368 INFO L226 Difference]: Without dead ends: 48 [2018-07-23 15:19:34,368 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-07-23 15:19:34,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-07-23 15:19:34,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2018-07-23 15:19:34,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-07-23 15:19:34,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-07-23 15:19:34,386 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2018-07-23 15:19:34,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:34,386 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-07-23 15:19:34,386 INFO L472 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-07-23 15:19:34,386 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-07-23 15:19:34,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-07-23 15:19:34,387 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:34,387 INFO L353 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1] [2018-07-23 15:19:34,387 INFO L414 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:34,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1501876333, now seen corresponding path program 21 times [2018-07-23 15:19:34,388 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:34,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:34,564 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:34,564 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:34,564 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-07-23 15:19:34,565 INFO L450 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-07-23 15:19:34,566 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-07-23 15:19:34,567 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-07-23 15:19:34,567 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 25 states. [2018-07-23 15:19:34,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:34,809 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-07-23 15:19:34,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-23 15:19:34,809 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 46 [2018-07-23 15:19:34,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:34,810 INFO L225 Difference]: With dead ends: 52 [2018-07-23 15:19:34,810 INFO L226 Difference]: Without dead ends: 50 [2018-07-23 15:19:34,812 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-07-23 15:19:34,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-07-23 15:19:34,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-07-23 15:19:34,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-07-23 15:19:34,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-07-23 15:19:34,828 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2018-07-23 15:19:34,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:34,829 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-07-23 15:19:34,829 INFO L472 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-07-23 15:19:34,829 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-07-23 15:19:34,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-07-23 15:19:34,830 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:34,830 INFO L353 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1] [2018-07-23 15:19:34,832 INFO L414 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:34,833 INFO L82 PathProgramCache]: Analyzing trace with hash 194091255, now seen corresponding path program 22 times [2018-07-23 15:19:34,833 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:34,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:35,039 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:35,040 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:35,040 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-07-23 15:19:35,040 INFO L450 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-07-23 15:19:35,041 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-07-23 15:19:35,041 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-07-23 15:19:35,041 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 26 states. [2018-07-23 15:19:35,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:35,348 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-07-23 15:19:35,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-23 15:19:35,348 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2018-07-23 15:19:35,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:35,349 INFO L225 Difference]: With dead ends: 54 [2018-07-23 15:19:35,349 INFO L226 Difference]: Without dead ends: 52 [2018-07-23 15:19:35,350 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-07-23 15:19:35,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-07-23 15:19:35,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2018-07-23 15:19:35,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-07-23 15:19:35,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-07-23 15:19:35,371 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2018-07-23 15:19:35,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:35,375 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-07-23 15:19:35,375 INFO L472 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-07-23 15:19:35,375 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-07-23 15:19:35,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-07-23 15:19:35,376 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:35,376 INFO L353 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1] [2018-07-23 15:19:35,376 INFO L414 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:35,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1838049025, now seen corresponding path program 23 times [2018-07-23 15:19:35,377 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:35,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:35,629 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:35,630 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:35,630 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-07-23 15:19:35,630 INFO L450 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-07-23 15:19:35,631 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-07-23 15:19:35,631 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-07-23 15:19:35,631 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 27 states. [2018-07-23 15:19:35,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:35,903 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-07-23 15:19:35,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-23 15:19:35,903 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 50 [2018-07-23 15:19:35,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:35,904 INFO L225 Difference]: With dead ends: 56 [2018-07-23 15:19:35,904 INFO L226 Difference]: Without dead ends: 54 [2018-07-23 15:19:35,904 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-07-23 15:19:35,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-07-23 15:19:35,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-07-23 15:19:35,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-07-23 15:19:35,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-07-23 15:19:35,920 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2018-07-23 15:19:35,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:35,923 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-07-23 15:19:35,923 INFO L472 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-07-23 15:19:35,923 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-07-23 15:19:35,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-07-23 15:19:35,923 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:35,924 INFO L353 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1] [2018-07-23 15:19:35,924 INFO L414 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:35,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1133501067, now seen corresponding path program 24 times [2018-07-23 15:19:35,924 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:35,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:36,129 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:36,130 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:36,130 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-07-23 15:19:36,130 INFO L450 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-07-23 15:19:36,130 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-07-23 15:19:36,131 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-07-23 15:19:36,131 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 28 states. [2018-07-23 15:19:36,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:36,469 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-07-23 15:19:36,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-23 15:19:36,469 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 52 [2018-07-23 15:19:36,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:36,470 INFO L225 Difference]: With dead ends: 58 [2018-07-23 15:19:36,470 INFO L226 Difference]: Without dead ends: 56 [2018-07-23 15:19:36,471 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-07-23 15:19:36,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-07-23 15:19:36,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2018-07-23 15:19:36,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-07-23 15:19:36,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-07-23 15:19:36,495 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2018-07-23 15:19:36,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:36,495 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-07-23 15:19:36,495 INFO L472 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-07-23 15:19:36,495 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-07-23 15:19:36,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-07-23 15:19:36,497 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:36,498 INFO L353 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1] [2018-07-23 15:19:36,498 INFO L414 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:36,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1627221099, now seen corresponding path program 25 times [2018-07-23 15:19:36,498 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:36,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:36,720 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:36,721 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:36,721 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-07-23 15:19:36,721 INFO L450 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-07-23 15:19:36,722 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-07-23 15:19:36,722 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-07-23 15:19:36,722 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 29 states. [2018-07-23 15:19:37,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:37,048 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-07-23 15:19:37,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-23 15:19:37,048 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 54 [2018-07-23 15:19:37,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:37,049 INFO L225 Difference]: With dead ends: 60 [2018-07-23 15:19:37,049 INFO L226 Difference]: Without dead ends: 58 [2018-07-23 15:19:37,050 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-07-23 15:19:37,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-07-23 15:19:37,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-07-23 15:19:37,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-07-23 15:19:37,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-07-23 15:19:37,068 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2018-07-23 15:19:37,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:37,068 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-07-23 15:19:37,069 INFO L472 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-07-23 15:19:37,069 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-07-23 15:19:37,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-07-23 15:19:37,071 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:37,071 INFO L353 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1] [2018-07-23 15:19:37,071 INFO L414 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:37,072 INFO L82 PathProgramCache]: Analyzing trace with hash -391433697, now seen corresponding path program 26 times [2018-07-23 15:19:37,072 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:37,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:37,299 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:37,300 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:37,300 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-07-23 15:19:37,300 INFO L450 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-07-23 15:19:37,301 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-07-23 15:19:37,301 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-07-23 15:19:37,302 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 30 states. [2018-07-23 15:19:37,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:37,632 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-07-23 15:19:37,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-23 15:19:37,632 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2018-07-23 15:19:37,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:37,633 INFO L225 Difference]: With dead ends: 62 [2018-07-23 15:19:37,633 INFO L226 Difference]: Without dead ends: 60 [2018-07-23 15:19:37,634 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-07-23 15:19:37,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-07-23 15:19:37,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2018-07-23 15:19:37,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-07-23 15:19:37,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-07-23 15:19:37,653 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2018-07-23 15:19:37,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:37,653 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-07-23 15:19:37,653 INFO L472 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-07-23 15:19:37,653 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-07-23 15:19:37,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-07-23 15:19:37,654 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:37,654 INFO L353 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1] [2018-07-23 15:19:37,654 INFO L414 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:37,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1789285929, now seen corresponding path program 27 times [2018-07-23 15:19:37,655 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:37,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:37,920 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:37,921 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:37,921 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-07-23 15:19:37,921 INFO L450 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-07-23 15:19:37,922 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-07-23 15:19:37,922 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-07-23 15:19:37,923 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 31 states. [2018-07-23 15:19:38,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:38,326 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-07-23 15:19:38,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-23 15:19:38,326 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 58 [2018-07-23 15:19:38,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:38,328 INFO L225 Difference]: With dead ends: 64 [2018-07-23 15:19:38,328 INFO L226 Difference]: Without dead ends: 62 [2018-07-23 15:19:38,329 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-07-23 15:19:38,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-07-23 15:19:38,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-07-23 15:19:38,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-07-23 15:19:38,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-07-23 15:19:38,355 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2018-07-23 15:19:38,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:38,355 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-07-23 15:19:38,355 INFO L472 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-07-23 15:19:38,355 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-07-23 15:19:38,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-07-23 15:19:38,356 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:38,356 INFO L353 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1] [2018-07-23 15:19:38,356 INFO L414 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:38,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1516806067, now seen corresponding path program 28 times [2018-07-23 15:19:38,357 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:38,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:38,634 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:38,634 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:38,634 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-07-23 15:19:38,635 INFO L450 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-07-23 15:19:38,635 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-07-23 15:19:38,635 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-07-23 15:19:38,636 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 32 states. [2018-07-23 15:19:39,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:39,000 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-07-23 15:19:39,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-07-23 15:19:39,001 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 60 [2018-07-23 15:19:39,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:39,001 INFO L225 Difference]: With dead ends: 66 [2018-07-23 15:19:39,002 INFO L226 Difference]: Without dead ends: 64 [2018-07-23 15:19:39,002 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-07-23 15:19:39,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-07-23 15:19:39,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2018-07-23 15:19:39,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-07-23 15:19:39,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-07-23 15:19:39,022 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2018-07-23 15:19:39,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:39,023 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-07-23 15:19:39,023 INFO L472 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-07-23 15:19:39,023 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-07-23 15:19:39,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-07-23 15:19:39,023 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:39,024 INFO L353 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1] [2018-07-23 15:19:39,024 INFO L414 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:39,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1656663741, now seen corresponding path program 29 times [2018-07-23 15:19:39,024 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:39,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:39,276 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:39,276 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:39,276 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-07-23 15:19:39,277 INFO L450 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-07-23 15:19:39,277 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-07-23 15:19:39,277 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-07-23 15:19:39,278 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 33 states. [2018-07-23 15:19:39,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:39,644 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-07-23 15:19:39,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-23 15:19:39,644 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 62 [2018-07-23 15:19:39,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:39,645 INFO L225 Difference]: With dead ends: 68 [2018-07-23 15:19:39,645 INFO L226 Difference]: Without dead ends: 66 [2018-07-23 15:19:39,646 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-07-23 15:19:39,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-07-23 15:19:39,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2018-07-23 15:19:39,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-07-23 15:19:39,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-07-23 15:19:39,666 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2018-07-23 15:19:39,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:39,666 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-07-23 15:19:39,666 INFO L472 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-07-23 15:19:39,667 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-07-23 15:19:39,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-07-23 15:19:39,667 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:39,667 INFO L353 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1] [2018-07-23 15:19:39,668 INFO L414 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:39,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1379065017, now seen corresponding path program 30 times [2018-07-23 15:19:39,668 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:39,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:39,931 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:39,932 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:39,932 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-07-23 15:19:39,933 INFO L450 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-07-23 15:19:39,933 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-07-23 15:19:39,933 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-07-23 15:19:39,934 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 34 states. [2018-07-23 15:19:40,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:40,331 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-07-23 15:19:40,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-23 15:19:40,331 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 64 [2018-07-23 15:19:40,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:40,332 INFO L225 Difference]: With dead ends: 70 [2018-07-23 15:19:40,332 INFO L226 Difference]: Without dead ends: 68 [2018-07-23 15:19:40,333 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-07-23 15:19:40,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-07-23 15:19:40,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2018-07-23 15:19:40,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-07-23 15:19:40,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-07-23 15:19:40,353 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2018-07-23 15:19:40,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:40,354 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-07-23 15:19:40,354 INFO L472 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-07-23 15:19:40,354 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-07-23 15:19:40,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-07-23 15:19:40,354 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:40,355 INFO L353 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1] [2018-07-23 15:19:40,355 INFO L414 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:40,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1863359825, now seen corresponding path program 31 times [2018-07-23 15:19:40,355 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:40,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:40,626 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:40,626 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:40,626 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-07-23 15:19:40,627 INFO L450 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-07-23 15:19:40,627 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-07-23 15:19:40,628 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-07-23 15:19:40,628 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 35 states. [2018-07-23 15:19:41,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:41,046 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-07-23 15:19:41,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-23 15:19:41,046 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 66 [2018-07-23 15:19:41,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:41,047 INFO L225 Difference]: With dead ends: 72 [2018-07-23 15:19:41,047 INFO L226 Difference]: Without dead ends: 70 [2018-07-23 15:19:41,048 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-07-23 15:19:41,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-07-23 15:19:41,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-07-23 15:19:41,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-07-23 15:19:41,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-07-23 15:19:41,070 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2018-07-23 15:19:41,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:41,070 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-07-23 15:19:41,070 INFO L472 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-07-23 15:19:41,071 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-07-23 15:19:41,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-07-23 15:19:41,071 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:41,071 INFO L353 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1] [2018-07-23 15:19:41,072 INFO L414 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:41,072 INFO L82 PathProgramCache]: Analyzing trace with hash -312623909, now seen corresponding path program 32 times [2018-07-23 15:19:41,072 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:41,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:41,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:41,396 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:41,396 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-07-23 15:19:41,396 INFO L450 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-07-23 15:19:41,397 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-07-23 15:19:41,400 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-07-23 15:19:41,400 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 36 states. [2018-07-23 15:19:41,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:41,878 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-07-23 15:19:41,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-07-23 15:19:41,878 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 68 [2018-07-23 15:19:41,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:41,879 INFO L225 Difference]: With dead ends: 74 [2018-07-23 15:19:41,879 INFO L226 Difference]: Without dead ends: 72 [2018-07-23 15:19:41,880 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-07-23 15:19:41,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-07-23 15:19:41,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2018-07-23 15:19:41,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-07-23 15:19:41,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-07-23 15:19:41,901 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2018-07-23 15:19:41,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:41,901 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-07-23 15:19:41,901 INFO L472 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-07-23 15:19:41,901 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-07-23 15:19:41,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-07-23 15:19:41,902 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:41,902 INFO L353 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1] [2018-07-23 15:19:41,902 INFO L414 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:41,902 INFO L82 PathProgramCache]: Analyzing trace with hash 216080869, now seen corresponding path program 33 times [2018-07-23 15:19:41,903 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:41,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:42,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:42,239 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:42,239 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-07-23 15:19:42,239 INFO L450 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-07-23 15:19:42,240 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-07-23 15:19:42,241 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-07-23 15:19:42,241 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 37 states. [2018-07-23 15:19:42,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:42,696 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-07-23 15:19:42,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-07-23 15:19:42,696 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 70 [2018-07-23 15:19:42,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:42,697 INFO L225 Difference]: With dead ends: 76 [2018-07-23 15:19:42,697 INFO L226 Difference]: Without dead ends: 74 [2018-07-23 15:19:42,698 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-07-23 15:19:42,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-07-23 15:19:42,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-07-23 15:19:42,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-07-23 15:19:42,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-07-23 15:19:42,721 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2018-07-23 15:19:42,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:42,722 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-07-23 15:19:42,722 INFO L472 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-07-23 15:19:42,722 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-07-23 15:19:42,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-07-23 15:19:42,723 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:42,723 INFO L353 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1] [2018-07-23 15:19:42,723 INFO L414 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:42,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1495231599, now seen corresponding path program 34 times [2018-07-23 15:19:42,724 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:42,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:43,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:43,004 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:43,005 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-07-23 15:19:43,005 INFO L450 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-07-23 15:19:43,005 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-07-23 15:19:43,006 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-07-23 15:19:43,006 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 38 states. [2018-07-23 15:19:43,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:43,477 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-07-23 15:19:43,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-07-23 15:19:43,477 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 72 [2018-07-23 15:19:43,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:43,478 INFO L225 Difference]: With dead ends: 78 [2018-07-23 15:19:43,478 INFO L226 Difference]: Without dead ends: 76 [2018-07-23 15:19:43,479 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-07-23 15:19:43,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-07-23 15:19:43,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2018-07-23 15:19:43,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-07-23 15:19:43,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-07-23 15:19:43,503 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2018-07-23 15:19:43,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:43,503 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-07-23 15:19:43,503 INFO L472 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-07-23 15:19:43,503 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-07-23 15:19:43,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-07-23 15:19:43,504 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:43,504 INFO L353 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1] [2018-07-23 15:19:43,504 INFO L414 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:43,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1896530823, now seen corresponding path program 35 times [2018-07-23 15:19:43,505 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:43,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:43,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:43,792 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:43,793 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-07-23 15:19:43,793 INFO L450 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-07-23 15:19:43,793 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-07-23 15:19:43,794 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-07-23 15:19:43,794 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 39 states. [2018-07-23 15:19:44,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:44,287 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-07-23 15:19:44,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-07-23 15:19:44,287 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 74 [2018-07-23 15:19:44,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:44,288 INFO L225 Difference]: With dead ends: 80 [2018-07-23 15:19:44,288 INFO L226 Difference]: Without dead ends: 78 [2018-07-23 15:19:44,289 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-07-23 15:19:44,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-07-23 15:19:44,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-07-23 15:19:44,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-07-23 15:19:44,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-07-23 15:19:44,312 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2018-07-23 15:19:44,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:44,313 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-07-23 15:19:44,313 INFO L472 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-07-23 15:19:44,313 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-07-23 15:19:44,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-07-23 15:19:44,314 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:44,314 INFO L353 BasicCegarLoop]: trace histogram [37, 36, 1, 1, 1] [2018-07-23 15:19:44,314 INFO L414 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:44,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1500040701, now seen corresponding path program 36 times [2018-07-23 15:19:44,314 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:44,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:44,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:44,634 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:44,635 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-07-23 15:19:44,635 INFO L450 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-07-23 15:19:44,635 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-07-23 15:19:44,637 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-07-23 15:19:44,638 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 40 states. [2018-07-23 15:19:45,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:45,118 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-07-23 15:19:45,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-07-23 15:19:45,119 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 76 [2018-07-23 15:19:45,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:45,119 INFO L225 Difference]: With dead ends: 82 [2018-07-23 15:19:45,119 INFO L226 Difference]: Without dead ends: 80 [2018-07-23 15:19:45,120 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-07-23 15:19:45,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-07-23 15:19:45,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2018-07-23 15:19:45,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-07-23 15:19:45,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-07-23 15:19:45,142 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2018-07-23 15:19:45,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:45,143 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-07-23 15:19:45,143 INFO L472 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-07-23 15:19:45,143 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-07-23 15:19:45,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-07-23 15:19:45,144 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:45,144 INFO L353 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1] [2018-07-23 15:19:45,144 INFO L414 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:45,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1569844493, now seen corresponding path program 37 times [2018-07-23 15:19:45,144 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:45,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:45,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:45,443 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:45,443 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-07-23 15:19:45,443 INFO L450 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-07-23 15:19:45,444 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-07-23 15:19:45,444 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-07-23 15:19:45,445 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 41 states. [2018-07-23 15:19:45,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:45,966 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-07-23 15:19:45,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-07-23 15:19:45,966 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 78 [2018-07-23 15:19:45,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:45,967 INFO L225 Difference]: With dead ends: 84 [2018-07-23 15:19:45,967 INFO L226 Difference]: Without dead ends: 82 [2018-07-23 15:19:45,968 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-07-23 15:19:45,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-07-23 15:19:45,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-07-23 15:19:45,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-07-23 15:19:45,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-07-23 15:19:45,998 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2018-07-23 15:19:45,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:45,998 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-07-23 15:19:45,998 INFO L472 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-07-23 15:19:45,998 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-07-23 15:19:45,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-07-23 15:19:45,999 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:45,999 INFO L353 BasicCegarLoop]: trace histogram [39, 38, 1, 1, 1] [2018-07-23 15:19:45,999 INFO L414 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:46,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1086983575, now seen corresponding path program 38 times [2018-07-23 15:19:46,000 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:46,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:46,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:46,305 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:46,305 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-07-23 15:19:46,305 INFO L450 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-07-23 15:19:46,305 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-07-23 15:19:46,306 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-07-23 15:19:46,306 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 42 states. [2018-07-23 15:19:46,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:46,813 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-07-23 15:19:46,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-07-23 15:19:46,813 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 80 [2018-07-23 15:19:46,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:46,814 INFO L225 Difference]: With dead ends: 86 [2018-07-23 15:19:46,814 INFO L226 Difference]: Without dead ends: 84 [2018-07-23 15:19:46,815 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-07-23 15:19:46,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-07-23 15:19:46,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2018-07-23 15:19:46,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-07-23 15:19:46,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-07-23 15:19:46,839 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 80 [2018-07-23 15:19:46,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:46,840 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-07-23 15:19:46,840 INFO L472 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-07-23 15:19:46,840 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-07-23 15:19:46,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-07-23 15:19:46,841 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:46,841 INFO L353 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1] [2018-07-23 15:19:46,841 INFO L414 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:46,841 INFO L82 PathProgramCache]: Analyzing trace with hash 914109345, now seen corresponding path program 39 times [2018-07-23 15:19:46,842 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:46,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:47,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:47,157 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:47,157 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-07-23 15:19:47,157 INFO L450 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-07-23 15:19:47,158 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-07-23 15:19:47,159 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-07-23 15:19:47,159 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 43 states. [2018-07-23 15:19:47,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:47,742 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-07-23 15:19:47,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-07-23 15:19:47,742 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 82 [2018-07-23 15:19:47,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:47,743 INFO L225 Difference]: With dead ends: 88 [2018-07-23 15:19:47,743 INFO L226 Difference]: Without dead ends: 86 [2018-07-23 15:19:47,744 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-07-23 15:19:47,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-07-23 15:19:47,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2018-07-23 15:19:47,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-07-23 15:19:47,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-07-23 15:19:47,767 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 82 [2018-07-23 15:19:47,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:47,768 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-07-23 15:19:47,768 INFO L472 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-07-23 15:19:47,768 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-07-23 15:19:47,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-07-23 15:19:47,769 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:47,769 INFO L353 BasicCegarLoop]: trace histogram [41, 40, 1, 1, 1] [2018-07-23 15:19:47,769 INFO L414 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:47,770 INFO L82 PathProgramCache]: Analyzing trace with hash -2009268437, now seen corresponding path program 40 times [2018-07-23 15:19:47,770 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:47,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:48,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:48,076 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:48,076 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-07-23 15:19:48,077 INFO L450 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-07-23 15:19:48,077 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-07-23 15:19:48,078 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-07-23 15:19:48,078 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 44 states. [2018-07-23 15:19:48,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:48,597 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-07-23 15:19:48,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-07-23 15:19:48,597 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 84 [2018-07-23 15:19:48,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:48,598 INFO L225 Difference]: With dead ends: 90 [2018-07-23 15:19:48,598 INFO L226 Difference]: Without dead ends: 88 [2018-07-23 15:19:48,599 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-07-23 15:19:48,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-07-23 15:19:48,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2018-07-23 15:19:48,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-07-23 15:19:48,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-07-23 15:19:48,622 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 84 [2018-07-23 15:19:48,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:48,622 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-07-23 15:19:48,622 INFO L472 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-07-23 15:19:48,623 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-07-23 15:19:48,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-07-23 15:19:48,623 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:48,623 INFO L353 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1] [2018-07-23 15:19:48,624 INFO L414 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:48,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1828261941, now seen corresponding path program 41 times [2018-07-23 15:19:48,624 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:48,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:48,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:48,963 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:48,963 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-07-23 15:19:48,963 INFO L450 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-07-23 15:19:48,964 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-07-23 15:19:48,964 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-07-23 15:19:48,965 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 45 states. [2018-07-23 15:19:49,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:49,505 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-07-23 15:19:49,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-07-23 15:19:49,505 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 86 [2018-07-23 15:19:49,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:49,506 INFO L225 Difference]: With dead ends: 92 [2018-07-23 15:19:49,506 INFO L226 Difference]: Without dead ends: 90 [2018-07-23 15:19:49,507 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-07-23 15:19:49,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-07-23 15:19:49,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-07-23 15:19:49,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-07-23 15:19:49,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-07-23 15:19:49,530 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 86 [2018-07-23 15:19:49,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:49,530 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-07-23 15:19:49,530 INFO L472 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-07-23 15:19:49,530 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-07-23 15:19:49,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-07-23 15:19:49,531 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:49,531 INFO L353 BasicCegarLoop]: trace histogram [43, 42, 1, 1, 1] [2018-07-23 15:19:49,531 INFO L414 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:49,532 INFO L82 PathProgramCache]: Analyzing trace with hash 318047935, now seen corresponding path program 42 times [2018-07-23 15:19:49,532 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:49,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:49,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:49,856 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:49,856 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-07-23 15:19:49,857 INFO L450 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-07-23 15:19:49,857 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-07-23 15:19:49,858 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-07-23 15:19:49,858 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 46 states. [2018-07-23 15:19:50,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:50,440 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-07-23 15:19:50,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-07-23 15:19:50,441 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 88 [2018-07-23 15:19:50,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:50,441 INFO L225 Difference]: With dead ends: 94 [2018-07-23 15:19:50,442 INFO L226 Difference]: Without dead ends: 92 [2018-07-23 15:19:50,443 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-07-23 15:19:50,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-07-23 15:19:50,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2018-07-23 15:19:50,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-07-23 15:19:50,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-07-23 15:19:50,466 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 88 [2018-07-23 15:19:50,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:50,466 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-07-23 15:19:50,466 INFO L472 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-07-23 15:19:50,466 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-07-23 15:19:50,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-07-23 15:19:50,467 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:50,467 INFO L353 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1] [2018-07-23 15:19:50,467 INFO L414 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:50,468 INFO L82 PathProgramCache]: Analyzing trace with hash 701334217, now seen corresponding path program 43 times [2018-07-23 15:19:50,468 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:50,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:50,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:50,793 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:50,793 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-07-23 15:19:50,793 INFO L450 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-07-23 15:19:50,794 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-07-23 15:19:50,794 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-07-23 15:19:50,795 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 47 states. [2018-07-23 15:19:51,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:51,359 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-07-23 15:19:51,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-07-23 15:19:51,359 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 90 [2018-07-23 15:19:51,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:51,360 INFO L225 Difference]: With dead ends: 96 [2018-07-23 15:19:51,360 INFO L226 Difference]: Without dead ends: 94 [2018-07-23 15:19:51,361 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-07-23 15:19:51,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-07-23 15:19:51,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2018-07-23 15:19:51,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-07-23 15:19:51,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-07-23 15:19:51,388 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 90 [2018-07-23 15:19:51,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:51,388 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-07-23 15:19:51,388 INFO L472 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-07-23 15:19:51,388 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-07-23 15:19:51,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-07-23 15:19:51,389 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:51,389 INFO L353 BasicCegarLoop]: trace histogram [45, 44, 1, 1, 1] [2018-07-23 15:19:51,389 INFO L414 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:51,390 INFO L82 PathProgramCache]: Analyzing trace with hash -327736237, now seen corresponding path program 44 times [2018-07-23 15:19:51,390 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:51,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:51,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:51,732 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:51,732 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-07-23 15:19:51,732 INFO L450 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-07-23 15:19:51,732 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-07-23 15:19:51,733 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-07-23 15:19:51,734 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 48 states. [2018-07-23 15:19:52,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:52,331 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-07-23 15:19:52,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-07-23 15:19:52,332 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 92 [2018-07-23 15:19:52,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:52,333 INFO L225 Difference]: With dead ends: 98 [2018-07-23 15:19:52,333 INFO L226 Difference]: Without dead ends: 96 [2018-07-23 15:19:52,334 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-07-23 15:19:52,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-07-23 15:19:52,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2018-07-23 15:19:52,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-07-23 15:19:52,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-07-23 15:19:52,363 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 92 [2018-07-23 15:19:52,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:52,364 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-07-23 15:19:52,364 INFO L472 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-07-23 15:19:52,364 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-07-23 15:19:52,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-07-23 15:19:52,365 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:52,365 INFO L353 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1] [2018-07-23 15:19:52,365 INFO L414 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:52,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1421964451, now seen corresponding path program 45 times [2018-07-23 15:19:52,366 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:52,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:52,745 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:52,745 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:52,745 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-07-23 15:19:52,746 INFO L450 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-07-23 15:19:52,746 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-07-23 15:19:52,747 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-07-23 15:19:52,747 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 49 states. [2018-07-23 15:19:53,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:53,415 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-07-23 15:19:53,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-07-23 15:19:53,416 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 94 [2018-07-23 15:19:53,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:53,417 INFO L225 Difference]: With dead ends: 100 [2018-07-23 15:19:53,417 INFO L226 Difference]: Without dead ends: 98 [2018-07-23 15:19:53,417 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-07-23 15:19:53,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-07-23 15:19:53,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2018-07-23 15:19:53,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-07-23 15:19:53,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-07-23 15:19:53,443 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 94 [2018-07-23 15:19:53,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:53,443 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-07-23 15:19:53,443 INFO L472 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-07-23 15:19:53,443 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-07-23 15:19:53,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-07-23 15:19:53,444 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:53,444 INFO L353 BasicCegarLoop]: trace histogram [47, 46, 1, 1, 1] [2018-07-23 15:19:53,444 INFO L414 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:53,447 INFO L82 PathProgramCache]: Analyzing trace with hash -708290585, now seen corresponding path program 46 times [2018-07-23 15:19:53,447 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:53,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:53,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:53,787 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:53,787 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-07-23 15:19:53,787 INFO L450 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-07-23 15:19:53,788 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-07-23 15:19:53,788 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-07-23 15:19:53,789 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 50 states. [2018-07-23 15:19:54,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:54,261 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-07-23 15:19:54,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-07-23 15:19:54,261 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 96 [2018-07-23 15:19:54,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:54,262 INFO L225 Difference]: With dead ends: 102 [2018-07-23 15:19:54,262 INFO L226 Difference]: Without dead ends: 100 [2018-07-23 15:19:54,262 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-07-23 15:19:54,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-07-23 15:19:54,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2018-07-23 15:19:54,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-07-23 15:19:54,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-07-23 15:19:54,287 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 96 [2018-07-23 15:19:54,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:54,287 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-07-23 15:19:54,287 INFO L472 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-07-23 15:19:54,287 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-07-23 15:19:54,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-07-23 15:19:54,288 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:54,288 INFO L353 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1] [2018-07-23 15:19:54,289 INFO L414 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:54,289 INFO L82 PathProgramCache]: Analyzing trace with hash -2062472719, now seen corresponding path program 47 times [2018-07-23 15:19:54,289 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:54,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:54,657 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:54,657 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:54,658 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-07-23 15:19:54,658 INFO L450 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-07-23 15:19:54,658 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-07-23 15:19:54,659 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-07-23 15:19:54,659 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 51 states. [2018-07-23 15:19:55,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:55,327 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-07-23 15:19:55,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-07-23 15:19:55,327 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 98 [2018-07-23 15:19:55,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:55,328 INFO L225 Difference]: With dead ends: 104 [2018-07-23 15:19:55,329 INFO L226 Difference]: Without dead ends: 102 [2018-07-23 15:19:55,332 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-07-23 15:19:55,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-07-23 15:19:55,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2018-07-23 15:19:55,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-07-23 15:19:55,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-07-23 15:19:55,362 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 98 [2018-07-23 15:19:55,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:55,363 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-07-23 15:19:55,363 INFO L472 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-07-23 15:19:55,363 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-07-23 15:19:55,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-07-23 15:19:55,364 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:55,364 INFO L353 BasicCegarLoop]: trace histogram [49, 48, 1, 1, 1] [2018-07-23 15:19:55,364 INFO L414 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:55,364 INFO L82 PathProgramCache]: Analyzing trace with hash -2056412805, now seen corresponding path program 48 times [2018-07-23 15:19:55,364 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:55,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:55,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:55,734 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:55,735 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-07-23 15:19:55,735 INFO L450 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-07-23 15:19:55,735 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-07-23 15:19:55,735 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-07-23 15:19:55,736 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 52 states. [2018-07-23 15:19:56,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:56,268 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-07-23 15:19:56,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-07-23 15:19:56,268 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 100 [2018-07-23 15:19:56,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:56,269 INFO L225 Difference]: With dead ends: 106 [2018-07-23 15:19:56,269 INFO L226 Difference]: Without dead ends: 104 [2018-07-23 15:19:56,270 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-07-23 15:19:56,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-07-23 15:19:56,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2018-07-23 15:19:56,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-07-23 15:19:56,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-07-23 15:19:56,294 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 100 [2018-07-23 15:19:56,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:56,295 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-07-23 15:19:56,295 INFO L472 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-07-23 15:19:56,295 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-07-23 15:19:56,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-07-23 15:19:56,295 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:56,296 INFO L353 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1] [2018-07-23 15:19:56,296 INFO L414 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:56,296 INFO L82 PathProgramCache]: Analyzing trace with hash -527802747, now seen corresponding path program 49 times [2018-07-23 15:19:56,296 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:56,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:56,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:56,590 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:56,591 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-07-23 15:19:56,591 INFO L450 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-07-23 15:19:56,591 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-07-23 15:19:56,592 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-07-23 15:19:56,592 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 53 states. [2018-07-23 15:19:57,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:57,072 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-07-23 15:19:57,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-07-23 15:19:57,073 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 102 [2018-07-23 15:19:57,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:57,074 INFO L225 Difference]: With dead ends: 108 [2018-07-23 15:19:57,074 INFO L226 Difference]: Without dead ends: 106 [2018-07-23 15:19:57,075 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-07-23 15:19:57,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-07-23 15:19:57,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2018-07-23 15:19:57,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-07-23 15:19:57,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-07-23 15:19:57,097 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 102 [2018-07-23 15:19:57,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:57,098 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-07-23 15:19:57,098 INFO L472 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-07-23 15:19:57,098 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-07-23 15:19:57,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-07-23 15:19:57,098 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:57,098 INFO L353 BasicCegarLoop]: trace histogram [51, 50, 1, 1, 1] [2018-07-23 15:19:57,099 INFO L414 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:57,099 INFO L82 PathProgramCache]: Analyzing trace with hash -412352241, now seen corresponding path program 50 times [2018-07-23 15:19:57,099 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:57,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:57,389 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:57,390 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:57,390 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-07-23 15:19:57,390 INFO L450 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-07-23 15:19:57,390 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-07-23 15:19:57,391 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-07-23 15:19:57,391 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 54 states. [2018-07-23 15:19:57,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:57,882 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-07-23 15:19:57,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-07-23 15:19:57,882 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 104 [2018-07-23 15:19:57,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:57,883 INFO L225 Difference]: With dead ends: 110 [2018-07-23 15:19:57,883 INFO L226 Difference]: Without dead ends: 108 [2018-07-23 15:19:57,884 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-07-23 15:19:57,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-07-23 15:19:57,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2018-07-23 15:19:57,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-07-23 15:19:57,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-07-23 15:19:57,913 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 104 [2018-07-23 15:19:57,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:57,913 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-07-23 15:19:57,913 INFO L472 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-07-23 15:19:57,913 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-07-23 15:19:57,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-07-23 15:19:57,914 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:57,914 INFO L353 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1] [2018-07-23 15:19:57,914 INFO L414 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:57,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1133565671, now seen corresponding path program 51 times [2018-07-23 15:19:57,914 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:57,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:58,314 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:58,315 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:58,315 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-07-23 15:19:58,315 INFO L450 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-07-23 15:19:58,315 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-07-23 15:19:58,315 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-07-23 15:19:58,316 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 55 states. [2018-07-23 15:19:58,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:58,810 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2018-07-23 15:19:58,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-07-23 15:19:58,810 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 106 [2018-07-23 15:19:58,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:58,811 INFO L225 Difference]: With dead ends: 112 [2018-07-23 15:19:58,811 INFO L226 Difference]: Without dead ends: 110 [2018-07-23 15:19:58,812 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-07-23 15:19:58,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-07-23 15:19:58,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2018-07-23 15:19:58,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-07-23 15:19:58,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-07-23 15:19:58,843 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 106 [2018-07-23 15:19:58,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:58,843 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-07-23 15:19:58,843 INFO L472 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-07-23 15:19:58,843 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-07-23 15:19:58,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-07-23 15:19:58,844 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:58,844 INFO L353 BasicCegarLoop]: trace histogram [53, 52, 1, 1, 1] [2018-07-23 15:19:58,844 INFO L414 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:58,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1565030051, now seen corresponding path program 52 times [2018-07-23 15:19:58,845 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:58,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:59,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:59,172 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:59,172 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-07-23 15:19:59,173 INFO L450 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-07-23 15:19:59,173 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-07-23 15:19:59,173 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-07-23 15:19:59,174 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 56 states. [2018-07-23 15:19:59,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:59,688 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-07-23 15:19:59,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-07-23 15:19:59,688 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 108 [2018-07-23 15:19:59,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:59,689 INFO L225 Difference]: With dead ends: 114 [2018-07-23 15:19:59,689 INFO L226 Difference]: Without dead ends: 112 [2018-07-23 15:19:59,690 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-07-23 15:19:59,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-07-23 15:19:59,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2018-07-23 15:19:59,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-07-23 15:19:59,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-07-23 15:19:59,717 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 108 [2018-07-23 15:19:59,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:59,718 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-07-23 15:19:59,718 INFO L472 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-07-23 15:19:59,718 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-07-23 15:19:59,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-07-23 15:19:59,718 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:59,719 INFO L353 BasicCegarLoop]: trace histogram [54, 53, 1, 1, 1] [2018-07-23 15:19:59,719 INFO L414 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:19:59,719 INFO L82 PathProgramCache]: Analyzing trace with hash 755272109, now seen corresponding path program 53 times [2018-07-23 15:19:59,719 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:59,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:00,015 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:00,015 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:00,015 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-07-23 15:20:00,016 INFO L450 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-07-23 15:20:00,016 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-07-23 15:20:00,016 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-07-23 15:20:00,017 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 57 states. [2018-07-23 15:20:00,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:00,570 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-07-23 15:20:00,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-07-23 15:20:00,570 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 110 [2018-07-23 15:20:00,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:00,570 INFO L225 Difference]: With dead ends: 116 [2018-07-23 15:20:00,571 INFO L226 Difference]: Without dead ends: 114 [2018-07-23 15:20:00,571 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-07-23 15:20:00,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-07-23 15:20:00,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2018-07-23 15:20:00,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-07-23 15:20:00,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-07-23 15:20:00,592 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 110 [2018-07-23 15:20:00,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:00,593 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-07-23 15:20:00,593 INFO L472 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-07-23 15:20:00,593 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-07-23 15:20:00,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-07-23 15:20:00,593 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:00,593 INFO L353 BasicCegarLoop]: trace histogram [55, 54, 1, 1, 1] [2018-07-23 15:20:00,594 INFO L414 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:00,594 INFO L82 PathProgramCache]: Analyzing trace with hash -33029577, now seen corresponding path program 54 times [2018-07-23 15:20:00,594 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:00,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:00,897 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:00,897 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:00,898 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-07-23 15:20:00,898 INFO L450 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-07-23 15:20:00,898 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-07-23 15:20:00,899 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-07-23 15:20:00,899 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 58 states. [2018-07-23 15:20:01,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:01,458 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2018-07-23 15:20:01,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-07-23 15:20:01,459 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 112 [2018-07-23 15:20:01,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:01,460 INFO L225 Difference]: With dead ends: 118 [2018-07-23 15:20:01,460 INFO L226 Difference]: Without dead ends: 116 [2018-07-23 15:20:01,460 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-07-23 15:20:01,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-07-23 15:20:01,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2018-07-23 15:20:01,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-07-23 15:20:01,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-07-23 15:20:01,486 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 112 [2018-07-23 15:20:01,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:01,487 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-07-23 15:20:01,487 INFO L472 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-07-23 15:20:01,487 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-07-23 15:20:01,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-07-23 15:20:01,488 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:01,488 INFO L353 BasicCegarLoop]: trace histogram [56, 55, 1, 1, 1] [2018-07-23 15:20:01,488 INFO L414 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:01,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1676705727, now seen corresponding path program 55 times [2018-07-23 15:20:01,489 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:01,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:01,805 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:01,806 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:01,806 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-07-23 15:20:01,806 INFO L450 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-07-23 15:20:01,806 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-07-23 15:20:01,807 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-07-23 15:20:01,807 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 59 states. [2018-07-23 15:20:02,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:02,419 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2018-07-23 15:20:02,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-07-23 15:20:02,419 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 114 [2018-07-23 15:20:02,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:02,420 INFO L225 Difference]: With dead ends: 120 [2018-07-23 15:20:02,420 INFO L226 Difference]: Without dead ends: 118 [2018-07-23 15:20:02,421 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-07-23 15:20:02,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-07-23 15:20:02,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2018-07-23 15:20:02,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-07-23 15:20:02,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-07-23 15:20:02,455 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 114 [2018-07-23 15:20:02,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:02,455 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-07-23 15:20:02,455 INFO L472 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-07-23 15:20:02,456 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-07-23 15:20:02,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-07-23 15:20:02,456 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:02,456 INFO L353 BasicCegarLoop]: trace histogram [57, 56, 1, 1, 1] [2018-07-23 15:20:02,457 INFO L414 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:02,457 INFO L82 PathProgramCache]: Analyzing trace with hash -701520949, now seen corresponding path program 56 times [2018-07-23 15:20:02,457 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:02,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:02,882 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:02,882 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:02,882 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-07-23 15:20:02,883 INFO L450 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-07-23 15:20:02,883 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-07-23 15:20:02,883 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-07-23 15:20:02,883 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 60 states. [2018-07-23 15:20:03,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:03,454 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2018-07-23 15:20:03,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-07-23 15:20:03,454 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 116 [2018-07-23 15:20:03,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:03,455 INFO L225 Difference]: With dead ends: 122 [2018-07-23 15:20:03,455 INFO L226 Difference]: Without dead ends: 120 [2018-07-23 15:20:03,455 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-07-23 15:20:03,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-07-23 15:20:03,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2018-07-23 15:20:03,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-07-23 15:20:03,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-07-23 15:20:03,481 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 116 [2018-07-23 15:20:03,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:03,481 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-07-23 15:20:03,481 INFO L472 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-07-23 15:20:03,481 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-07-23 15:20:03,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-07-23 15:20:03,481 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:03,481 INFO L353 BasicCegarLoop]: trace histogram [58, 57, 1, 1, 1] [2018-07-23 15:20:03,482 INFO L414 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:03,482 INFO L82 PathProgramCache]: Analyzing trace with hash 148180181, now seen corresponding path program 57 times [2018-07-23 15:20:03,482 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:03,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:03,832 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:03,832 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:03,833 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-07-23 15:20:03,833 INFO L450 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-07-23 15:20:03,833 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-07-23 15:20:03,834 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-07-23 15:20:03,834 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 61 states. [2018-07-23 15:20:04,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:04,469 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2018-07-23 15:20:04,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-07-23 15:20:04,469 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 118 [2018-07-23 15:20:04,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:04,470 INFO L225 Difference]: With dead ends: 124 [2018-07-23 15:20:04,470 INFO L226 Difference]: Without dead ends: 122 [2018-07-23 15:20:04,471 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-07-23 15:20:04,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-07-23 15:20:04,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2018-07-23 15:20:04,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-07-23 15:20:04,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-07-23 15:20:04,506 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 118 [2018-07-23 15:20:04,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:04,506 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-07-23 15:20:04,506 INFO L472 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-07-23 15:20:04,507 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-07-23 15:20:04,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-07-23 15:20:04,507 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:04,507 INFO L353 BasicCegarLoop]: trace histogram [59, 58, 1, 1, 1] [2018-07-23 15:20:04,508 INFO L414 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:04,508 INFO L82 PathProgramCache]: Analyzing trace with hash 667179871, now seen corresponding path program 58 times [2018-07-23 15:20:04,508 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:04,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:04,940 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:04,940 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:04,940 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-07-23 15:20:04,941 INFO L450 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-07-23 15:20:04,941 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-07-23 15:20:04,941 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-07-23 15:20:04,941 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 62 states. [2018-07-23 15:20:05,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:05,487 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2018-07-23 15:20:05,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-07-23 15:20:05,487 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 120 [2018-07-23 15:20:05,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:05,488 INFO L225 Difference]: With dead ends: 126 [2018-07-23 15:20:05,488 INFO L226 Difference]: Without dead ends: 124 [2018-07-23 15:20:05,489 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-07-23 15:20:05,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-07-23 15:20:05,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2018-07-23 15:20:05,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-07-23 15:20:05,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-07-23 15:20:05,520 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 120 [2018-07-23 15:20:05,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:05,521 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-07-23 15:20:05,521 INFO L472 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-07-23 15:20:05,521 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-07-23 15:20:05,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-07-23 15:20:05,522 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:05,522 INFO L353 BasicCegarLoop]: trace histogram [60, 59, 1, 1, 1] [2018-07-23 15:20:05,522 INFO L414 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:05,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1209675625, now seen corresponding path program 59 times [2018-07-23 15:20:05,522 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:05,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:05,925 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:05,925 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:05,925 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-07-23 15:20:05,926 INFO L450 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-07-23 15:20:05,926 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-07-23 15:20:05,926 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-07-23 15:20:05,926 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 63 states. [2018-07-23 15:20:06,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:06,658 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2018-07-23 15:20:06,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-07-23 15:20:06,658 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 122 [2018-07-23 15:20:06,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:06,659 INFO L225 Difference]: With dead ends: 128 [2018-07-23 15:20:06,659 INFO L226 Difference]: Without dead ends: 126 [2018-07-23 15:20:06,660 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-07-23 15:20:06,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-07-23 15:20:06,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2018-07-23 15:20:06,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-07-23 15:20:06,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-07-23 15:20:06,695 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 122 [2018-07-23 15:20:06,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:06,695 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-07-23 15:20:06,695 INFO L472 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-07-23 15:20:06,695 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-07-23 15:20:06,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-07-23 15:20:06,696 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:06,696 INFO L353 BasicCegarLoop]: trace histogram [61, 60, 1, 1, 1] [2018-07-23 15:20:06,696 INFO L414 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:06,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1437914893, now seen corresponding path program 60 times [2018-07-23 15:20:06,697 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:06,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:07,152 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:07,152 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:07,152 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-07-23 15:20:07,153 INFO L450 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-07-23 15:20:07,153 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-07-23 15:20:07,153 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-07-23 15:20:07,154 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 64 states. [2018-07-23 15:20:08,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:08,000 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2018-07-23 15:20:08,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-07-23 15:20:08,000 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 124 [2018-07-23 15:20:08,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:08,001 INFO L225 Difference]: With dead ends: 130 [2018-07-23 15:20:08,001 INFO L226 Difference]: Without dead ends: 128 [2018-07-23 15:20:08,002 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-07-23 15:20:08,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-07-23 15:20:08,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2018-07-23 15:20:08,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-07-23 15:20:08,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-07-23 15:20:08,040 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 124 [2018-07-23 15:20:08,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:08,040 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-07-23 15:20:08,040 INFO L472 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-07-23 15:20:08,040 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-07-23 15:20:08,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-07-23 15:20:08,041 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:08,041 INFO L353 BasicCegarLoop]: trace histogram [62, 61, 1, 1, 1] [2018-07-23 15:20:08,041 INFO L414 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:08,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1143203837, now seen corresponding path program 61 times [2018-07-23 15:20:08,042 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:08,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:08,494 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:08,494 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:08,494 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-07-23 15:20:08,494 INFO L450 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-07-23 15:20:08,495 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-07-23 15:20:08,495 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-07-23 15:20:08,495 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 65 states. [2018-07-23 15:20:09,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:09,285 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2018-07-23 15:20:09,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-07-23 15:20:09,285 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 126 [2018-07-23 15:20:09,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:09,286 INFO L225 Difference]: With dead ends: 132 [2018-07-23 15:20:09,286 INFO L226 Difference]: Without dead ends: 130 [2018-07-23 15:20:09,287 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-07-23 15:20:09,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-07-23 15:20:09,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2018-07-23 15:20:09,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-07-23 15:20:09,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-07-23 15:20:09,329 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 126 [2018-07-23 15:20:09,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:09,330 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-07-23 15:20:09,330 INFO L472 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-07-23 15:20:09,330 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-07-23 15:20:09,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-07-23 15:20:09,331 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:09,331 INFO L353 BasicCegarLoop]: trace histogram [63, 62, 1, 1, 1] [2018-07-23 15:20:09,331 INFO L414 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:09,331 INFO L82 PathProgramCache]: Analyzing trace with hash -892793721, now seen corresponding path program 62 times [2018-07-23 15:20:09,331 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:09,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:09,782 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:09,783 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:09,783 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-07-23 15:20:09,783 INFO L450 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-07-23 15:20:09,783 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-07-23 15:20:09,784 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-07-23 15:20:09,784 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 66 states. [2018-07-23 15:20:10,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:10,549 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2018-07-23 15:20:10,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-07-23 15:20:10,549 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 128 [2018-07-23 15:20:10,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:10,550 INFO L225 Difference]: With dead ends: 134 [2018-07-23 15:20:10,550 INFO L226 Difference]: Without dead ends: 132 [2018-07-23 15:20:10,550 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-07-23 15:20:10,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-07-23 15:20:10,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2018-07-23 15:20:10,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-07-23 15:20:10,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-07-23 15:20:10,585 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 128 [2018-07-23 15:20:10,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:10,586 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-07-23 15:20:10,586 INFO L472 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-07-23 15:20:10,586 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-07-23 15:20:10,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-07-23 15:20:10,587 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:10,587 INFO L353 BasicCegarLoop]: trace histogram [64, 63, 1, 1, 1] [2018-07-23 15:20:10,588 INFO L414 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:10,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1018640017, now seen corresponding path program 63 times [2018-07-23 15:20:10,588 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:10,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:11,046 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:11,047 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:11,047 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-07-23 15:20:11,047 INFO L450 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-07-23 15:20:11,048 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-07-23 15:20:11,048 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-07-23 15:20:11,048 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 67 states. [2018-07-23 15:20:11,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:11,824 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2018-07-23 15:20:11,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-07-23 15:20:11,825 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 130 [2018-07-23 15:20:11,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:11,826 INFO L225 Difference]: With dead ends: 136 [2018-07-23 15:20:11,826 INFO L226 Difference]: Without dead ends: 134 [2018-07-23 15:20:11,827 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-07-23 15:20:11,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-07-23 15:20:11,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2018-07-23 15:20:11,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-07-23 15:20:11,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-07-23 15:20:11,866 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 130 [2018-07-23 15:20:11,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:11,866 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-07-23 15:20:11,866 INFO L472 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-07-23 15:20:11,866 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-07-23 15:20:11,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-07-23 15:20:11,867 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:11,867 INFO L353 BasicCegarLoop]: trace histogram [65, 64, 1, 1, 1] [2018-07-23 15:20:11,867 INFO L414 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:11,868 INFO L82 PathProgramCache]: Analyzing trace with hash -339540453, now seen corresponding path program 64 times [2018-07-23 15:20:11,868 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:11,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:12,357 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:12,357 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:12,358 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-07-23 15:20:12,358 INFO L450 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-07-23 15:20:12,358 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-07-23 15:20:12,358 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-07-23 15:20:12,359 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 68 states. [2018-07-23 15:20:13,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:13,244 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2018-07-23 15:20:13,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-07-23 15:20:13,244 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 132 [2018-07-23 15:20:13,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:13,245 INFO L225 Difference]: With dead ends: 138 [2018-07-23 15:20:13,245 INFO L226 Difference]: Without dead ends: 136 [2018-07-23 15:20:13,246 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-07-23 15:20:13,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-07-23 15:20:13,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2018-07-23 15:20:13,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-07-23 15:20:13,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-07-23 15:20:13,295 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 132 [2018-07-23 15:20:13,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:13,295 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-07-23 15:20:13,295 INFO L472 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-07-23 15:20:13,295 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-07-23 15:20:13,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-07-23 15:20:13,296 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:13,296 INFO L353 BasicCegarLoop]: trace histogram [66, 65, 1, 1, 1] [2018-07-23 15:20:13,296 INFO L414 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:13,297 INFO L82 PathProgramCache]: Analyzing trace with hash 119085861, now seen corresponding path program 65 times [2018-07-23 15:20:13,297 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:13,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:13,789 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:13,789 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:13,789 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-07-23 15:20:13,789 INFO L450 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-07-23 15:20:13,789 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-07-23 15:20:13,790 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-07-23 15:20:13,790 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 69 states. [2018-07-23 15:20:14,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:14,569 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2018-07-23 15:20:14,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-07-23 15:20:14,569 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 134 [2018-07-23 15:20:14,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:14,570 INFO L225 Difference]: With dead ends: 140 [2018-07-23 15:20:14,570 INFO L226 Difference]: Without dead ends: 138 [2018-07-23 15:20:14,571 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-07-23 15:20:14,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-07-23 15:20:14,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2018-07-23 15:20:14,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-07-23 15:20:14,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-07-23 15:20:14,605 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 134 [2018-07-23 15:20:14,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:14,605 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-07-23 15:20:14,605 INFO L472 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-07-23 15:20:14,606 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-07-23 15:20:14,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-07-23 15:20:14,606 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:14,606 INFO L353 BasicCegarLoop]: trace histogram [67, 66, 1, 1, 1] [2018-07-23 15:20:14,606 INFO L414 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:14,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1522657873, now seen corresponding path program 66 times [2018-07-23 15:20:14,606 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:14,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:15,092 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:15,092 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:15,092 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-07-23 15:20:15,093 INFO L450 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-07-23 15:20:15,093 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-07-23 15:20:15,094 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-07-23 15:20:15,094 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 70 states. [2018-07-23 15:20:15,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:15,814 INFO L93 Difference]: Finished difference Result 142 states and 142 transitions. [2018-07-23 15:20:15,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-07-23 15:20:15,814 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 136 [2018-07-23 15:20:15,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:15,815 INFO L225 Difference]: With dead ends: 142 [2018-07-23 15:20:15,815 INFO L226 Difference]: Without dead ends: 140 [2018-07-23 15:20:15,816 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-07-23 15:20:15,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-07-23 15:20:15,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2018-07-23 15:20:15,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-07-23 15:20:15,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2018-07-23 15:20:15,853 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 136 [2018-07-23 15:20:15,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:15,854 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2018-07-23 15:20:15,854 INFO L472 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-07-23 15:20:15,854 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2018-07-23 15:20:15,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-07-23 15:20:15,854 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:15,854 INFO L353 BasicCegarLoop]: trace histogram [68, 67, 1, 1, 1] [2018-07-23 15:20:15,854 INFO L414 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:15,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1309578681, now seen corresponding path program 67 times [2018-07-23 15:20:15,855 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:15,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:16,349 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:16,349 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:16,350 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-07-23 15:20:16,350 INFO L450 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-07-23 15:20:16,350 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-07-23 15:20:16,351 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-07-23 15:20:16,351 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 71 states. [2018-07-23 15:20:17,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:17,173 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2018-07-23 15:20:17,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-07-23 15:20:17,174 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 138 [2018-07-23 15:20:17,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:17,175 INFO L225 Difference]: With dead ends: 144 [2018-07-23 15:20:17,175 INFO L226 Difference]: Without dead ends: 142 [2018-07-23 15:20:17,176 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-07-23 15:20:17,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-07-23 15:20:17,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2018-07-23 15:20:17,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-07-23 15:20:17,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-07-23 15:20:17,226 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 138 [2018-07-23 15:20:17,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:17,227 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-07-23 15:20:17,227 INFO L472 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-07-23 15:20:17,227 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-07-23 15:20:17,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-07-23 15:20:17,228 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:17,228 INFO L353 BasicCegarLoop]: trace histogram [69, 68, 1, 1, 1] [2018-07-23 15:20:17,228 INFO L414 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:17,228 INFO L82 PathProgramCache]: Analyzing trace with hash 79641411, now seen corresponding path program 68 times [2018-07-23 15:20:17,228 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:17,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:17,901 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:17,901 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:17,901 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-07-23 15:20:17,901 INFO L450 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-07-23 15:20:17,902 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-07-23 15:20:17,902 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-07-23 15:20:17,902 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 72 states. [2018-07-23 15:20:18,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:18,725 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2018-07-23 15:20:18,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-07-23 15:20:18,725 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 140 [2018-07-23 15:20:18,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:18,726 INFO L225 Difference]: With dead ends: 146 [2018-07-23 15:20:18,727 INFO L226 Difference]: Without dead ends: 144 [2018-07-23 15:20:18,727 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-07-23 15:20:18,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-07-23 15:20:18,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2018-07-23 15:20:18,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-07-23 15:20:18,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-07-23 15:20:18,760 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 140 [2018-07-23 15:20:18,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:18,761 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-07-23 15:20:18,761 INFO L472 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-07-23 15:20:18,761 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-07-23 15:20:18,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-07-23 15:20:18,762 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:18,762 INFO L353 BasicCegarLoop]: trace histogram [70, 69, 1, 1, 1] [2018-07-23 15:20:18,762 INFO L414 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:18,762 INFO L82 PathProgramCache]: Analyzing trace with hash -774068659, now seen corresponding path program 69 times [2018-07-23 15:20:18,762 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:18,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:19,356 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:19,356 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:19,356 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-07-23 15:20:19,357 INFO L450 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-07-23 15:20:19,357 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-07-23 15:20:19,357 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-07-23 15:20:19,357 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 73 states. [2018-07-23 15:20:20,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:20,149 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2018-07-23 15:20:20,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-07-23 15:20:20,150 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 142 [2018-07-23 15:20:20,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:20,150 INFO L225 Difference]: With dead ends: 148 [2018-07-23 15:20:20,150 INFO L226 Difference]: Without dead ends: 146 [2018-07-23 15:20:20,151 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-07-23 15:20:20,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-07-23 15:20:20,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2018-07-23 15:20:20,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-07-23 15:20:20,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-07-23 15:20:20,201 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 142 [2018-07-23 15:20:20,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:20,201 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-07-23 15:20:20,201 INFO L472 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-07-23 15:20:20,202 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-07-23 15:20:20,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-07-23 15:20:20,202 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:20,203 INFO L353 BasicCegarLoop]: trace histogram [71, 70, 1, 1, 1] [2018-07-23 15:20:20,203 INFO L414 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:20,203 INFO L82 PathProgramCache]: Analyzing trace with hash -850692393, now seen corresponding path program 70 times [2018-07-23 15:20:20,203 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:20,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:20,728 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:20,728 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:20,728 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-07-23 15:20:20,729 INFO L450 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-07-23 15:20:20,729 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-07-23 15:20:20,729 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-07-23 15:20:20,729 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 74 states. [2018-07-23 15:20:21,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:21,675 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2018-07-23 15:20:21,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-07-23 15:20:21,675 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 144 [2018-07-23 15:20:21,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:21,676 INFO L225 Difference]: With dead ends: 150 [2018-07-23 15:20:21,676 INFO L226 Difference]: Without dead ends: 148 [2018-07-23 15:20:21,677 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-07-23 15:20:21,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-07-23 15:20:21,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2018-07-23 15:20:21,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-07-23 15:20:21,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-07-23 15:20:21,716 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 144 [2018-07-23 15:20:21,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:21,716 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-07-23 15:20:21,716 INFO L472 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-07-23 15:20:21,716 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-07-23 15:20:21,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-07-23 15:20:21,717 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:21,717 INFO L353 BasicCegarLoop]: trace histogram [72, 71, 1, 1, 1] [2018-07-23 15:20:21,717 INFO L414 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:21,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1471656735, now seen corresponding path program 71 times [2018-07-23 15:20:21,717 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:21,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:22,331 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:22,332 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:22,332 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-07-23 15:20:22,332 INFO L450 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-07-23 15:20:22,333 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-07-23 15:20:22,333 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-07-23 15:20:22,333 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 75 states. [2018-07-23 15:20:23,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:23,353 INFO L93 Difference]: Finished difference Result 152 states and 152 transitions. [2018-07-23 15:20:23,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-07-23 15:20:23,353 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 146 [2018-07-23 15:20:23,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:23,354 INFO L225 Difference]: With dead ends: 152 [2018-07-23 15:20:23,354 INFO L226 Difference]: Without dead ends: 150 [2018-07-23 15:20:23,355 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-07-23 15:20:23,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-07-23 15:20:23,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2018-07-23 15:20:23,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-07-23 15:20:23,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-07-23 15:20:23,405 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 146 [2018-07-23 15:20:23,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:23,406 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-07-23 15:20:23,406 INFO L472 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-07-23 15:20:23,406 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-07-23 15:20:23,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-07-23 15:20:23,407 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:23,407 INFO L353 BasicCegarLoop]: trace histogram [73, 72, 1, 1, 1] [2018-07-23 15:20:23,407 INFO L414 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:23,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1217935253, now seen corresponding path program 72 times [2018-07-23 15:20:23,407 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:23,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:24,034 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:24,034 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:24,034 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-07-23 15:20:24,035 INFO L450 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-07-23 15:20:24,035 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-07-23 15:20:24,035 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-07-23 15:20:24,035 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 76 states. [2018-07-23 15:20:25,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:25,055 INFO L93 Difference]: Finished difference Result 154 states and 154 transitions. [2018-07-23 15:20:25,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-07-23 15:20:25,055 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 148 [2018-07-23 15:20:25,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:25,056 INFO L225 Difference]: With dead ends: 154 [2018-07-23 15:20:25,056 INFO L226 Difference]: Without dead ends: 152 [2018-07-23 15:20:25,057 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-07-23 15:20:25,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-07-23 15:20:25,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2018-07-23 15:20:25,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-07-23 15:20:25,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-07-23 15:20:25,116 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 148 [2018-07-23 15:20:25,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:25,117 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-07-23 15:20:25,117 INFO L472 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-07-23 15:20:25,117 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-07-23 15:20:25,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-07-23 15:20:25,118 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:25,118 INFO L353 BasicCegarLoop]: trace histogram [74, 73, 1, 1, 1] [2018-07-23 15:20:25,118 INFO L414 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:25,119 INFO L82 PathProgramCache]: Analyzing trace with hash 2090240373, now seen corresponding path program 73 times [2018-07-23 15:20:25,119 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:25,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:26,042 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:26,043 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:26,043 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-07-23 15:20:26,043 INFO L450 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-07-23 15:20:26,043 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-07-23 15:20:26,044 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-07-23 15:20:26,044 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 77 states. [2018-07-23 15:20:27,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:27,042 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2018-07-23 15:20:27,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-07-23 15:20:27,042 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 150 [2018-07-23 15:20:27,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:27,043 INFO L225 Difference]: With dead ends: 156 [2018-07-23 15:20:27,043 INFO L226 Difference]: Without dead ends: 154 [2018-07-23 15:20:27,044 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-07-23 15:20:27,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-07-23 15:20:27,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2018-07-23 15:20:27,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-07-23 15:20:27,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-07-23 15:20:27,087 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 150 [2018-07-23 15:20:27,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:27,088 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-07-23 15:20:27,088 INFO L472 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-07-23 15:20:27,088 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-07-23 15:20:27,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-07-23 15:20:27,088 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:27,089 INFO L353 BasicCegarLoop]: trace histogram [75, 74, 1, 1, 1] [2018-07-23 15:20:27,089 INFO L414 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:27,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1323749377, now seen corresponding path program 74 times [2018-07-23 15:20:27,089 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:27,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:27,829 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:27,830 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:27,830 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-07-23 15:20:27,830 INFO L450 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-07-23 15:20:27,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-07-23 15:20:27,831 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-07-23 15:20:27,832 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 78 states. [2018-07-23 15:20:28,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:28,872 INFO L93 Difference]: Finished difference Result 158 states and 158 transitions. [2018-07-23 15:20:28,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-07-23 15:20:28,872 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 152 [2018-07-23 15:20:28,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:28,873 INFO L225 Difference]: With dead ends: 158 [2018-07-23 15:20:28,873 INFO L226 Difference]: Without dead ends: 156 [2018-07-23 15:20:28,874 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-07-23 15:20:28,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-07-23 15:20:28,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2018-07-23 15:20:28,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-07-23 15:20:28,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-07-23 15:20:28,927 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 152 [2018-07-23 15:20:28,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:28,927 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-07-23 15:20:28,928 INFO L472 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-07-23 15:20:28,928 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-07-23 15:20:28,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-07-23 15:20:28,928 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:28,929 INFO L353 BasicCegarLoop]: trace histogram [76, 75, 1, 1, 1] [2018-07-23 15:20:28,929 INFO L414 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:28,929 INFO L82 PathProgramCache]: Analyzing trace with hash -812884983, now seen corresponding path program 75 times [2018-07-23 15:20:28,929 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:29,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:29,612 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:29,612 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:29,612 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-07-23 15:20:29,612 INFO L450 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-07-23 15:20:29,613 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-07-23 15:20:29,613 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-07-23 15:20:29,613 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 79 states. [2018-07-23 15:20:30,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:30,603 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2018-07-23 15:20:30,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-07-23 15:20:30,603 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 154 [2018-07-23 15:20:30,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:30,604 INFO L225 Difference]: With dead ends: 160 [2018-07-23 15:20:30,604 INFO L226 Difference]: Without dead ends: 158 [2018-07-23 15:20:30,604 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-07-23 15:20:30,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-07-23 15:20:30,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2018-07-23 15:20:30,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-07-23 15:20:30,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-07-23 15:20:30,663 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 154 [2018-07-23 15:20:30,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:30,663 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-07-23 15:20:30,664 INFO L472 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-07-23 15:20:30,664 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-07-23 15:20:30,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-07-23 15:20:30,664 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:30,665 INFO L353 BasicCegarLoop]: trace histogram [77, 76, 1, 1, 1] [2018-07-23 15:20:30,665 INFO L414 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:30,665 INFO L82 PathProgramCache]: Analyzing trace with hash 501525907, now seen corresponding path program 76 times [2018-07-23 15:20:30,665 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:30,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:31,392 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:31,392 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:31,392 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-07-23 15:20:31,393 INFO L450 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-07-23 15:20:31,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-07-23 15:20:31,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-07-23 15:20:31,394 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 80 states. [2018-07-23 15:20:32,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:32,559 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2018-07-23 15:20:32,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-07-23 15:20:32,559 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 156 [2018-07-23 15:20:32,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:32,560 INFO L225 Difference]: With dead ends: 162 [2018-07-23 15:20:32,560 INFO L226 Difference]: Without dead ends: 160 [2018-07-23 15:20:32,560 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-07-23 15:20:32,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-07-23 15:20:32,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 159. [2018-07-23 15:20:32,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-07-23 15:20:32,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2018-07-23 15:20:32,620 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 156 [2018-07-23 15:20:32,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:32,620 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2018-07-23 15:20:32,620 INFO L472 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-07-23 15:20:32,620 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2018-07-23 15:20:32,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-07-23 15:20:32,621 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:32,621 INFO L353 BasicCegarLoop]: trace histogram [78, 77, 1, 1, 1] [2018-07-23 15:20:32,622 INFO L414 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:32,622 INFO L82 PathProgramCache]: Analyzing trace with hash 930006173, now seen corresponding path program 77 times [2018-07-23 15:20:32,622 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:32,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:33,396 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:33,396 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:33,396 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-07-23 15:20:33,396 INFO L450 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-07-23 15:20:33,397 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-07-23 15:20:33,397 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-07-23 15:20:33,397 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 81 states. [2018-07-23 15:20:34,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:34,579 INFO L93 Difference]: Finished difference Result 164 states and 164 transitions. [2018-07-23 15:20:34,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-07-23 15:20:34,579 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 158 [2018-07-23 15:20:34,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:34,580 INFO L225 Difference]: With dead ends: 164 [2018-07-23 15:20:34,580 INFO L226 Difference]: Without dead ends: 162 [2018-07-23 15:20:34,581 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-07-23 15:20:34,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-07-23 15:20:34,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2018-07-23 15:20:34,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-07-23 15:20:34,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-07-23 15:20:34,626 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 158 [2018-07-23 15:20:34,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:34,626 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-07-23 15:20:34,626 INFO L472 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-07-23 15:20:34,627 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-07-23 15:20:34,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-07-23 15:20:34,627 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:34,627 INFO L353 BasicCegarLoop]: trace histogram [79, 78, 1, 1, 1] [2018-07-23 15:20:34,627 INFO L414 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:34,628 INFO L82 PathProgramCache]: Analyzing trace with hash 382681383, now seen corresponding path program 78 times [2018-07-23 15:20:34,628 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:34,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:35,363 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:35,363 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:35,363 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-07-23 15:20:35,364 INFO L450 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-07-23 15:20:35,364 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-07-23 15:20:35,364 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2018-07-23 15:20:35,364 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 82 states. [2018-07-23 15:20:36,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:36,567 INFO L93 Difference]: Finished difference Result 166 states and 166 transitions. [2018-07-23 15:20:36,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-07-23 15:20:36,567 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 160 [2018-07-23 15:20:36,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:36,568 INFO L225 Difference]: With dead ends: 166 [2018-07-23 15:20:36,568 INFO L226 Difference]: Without dead ends: 164 [2018-07-23 15:20:36,569 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2018-07-23 15:20:36,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-07-23 15:20:36,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 163. [2018-07-23 15:20:36,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-07-23 15:20:36,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-07-23 15:20:36,620 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 160 [2018-07-23 15:20:36,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:36,620 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-07-23 15:20:36,620 INFO L472 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-07-23 15:20:36,620 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-07-23 15:20:36,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-07-23 15:20:36,621 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:36,621 INFO L353 BasicCegarLoop]: trace histogram [80, 79, 1, 1, 1] [2018-07-23 15:20:36,621 INFO L414 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:36,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1610431695, now seen corresponding path program 79 times [2018-07-23 15:20:36,622 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:36,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:37,405 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:37,405 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:37,405 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-07-23 15:20:37,406 INFO L450 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-07-23 15:20:37,406 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-07-23 15:20:37,407 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-07-23 15:20:37,407 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 83 states. [2018-07-23 15:20:38,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:38,767 INFO L93 Difference]: Finished difference Result 168 states and 168 transitions. [2018-07-23 15:20:38,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-07-23 15:20:38,768 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 162 [2018-07-23 15:20:38,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:38,769 INFO L225 Difference]: With dead ends: 168 [2018-07-23 15:20:38,769 INFO L226 Difference]: Without dead ends: 166 [2018-07-23 15:20:38,770 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-07-23 15:20:38,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-07-23 15:20:38,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2018-07-23 15:20:38,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-07-23 15:20:38,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-07-23 15:20:38,842 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 162 [2018-07-23 15:20:38,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:38,842 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-07-23 15:20:38,842 INFO L472 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-07-23 15:20:38,842 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-07-23 15:20:38,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-07-23 15:20:38,843 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:38,843 INFO L353 BasicCegarLoop]: trace histogram [81, 80, 1, 1, 1] [2018-07-23 15:20:38,844 INFO L414 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:38,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1436685637, now seen corresponding path program 80 times [2018-07-23 15:20:38,844 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:39,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:39,724 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:39,724 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:39,724 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-07-23 15:20:39,724 INFO L450 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-07-23 15:20:39,725 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-07-23 15:20:39,725 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2018-07-23 15:20:39,725 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 84 states. [2018-07-23 15:20:41,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:41,088 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2018-07-23 15:20:41,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-07-23 15:20:41,088 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 164 [2018-07-23 15:20:41,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:41,089 INFO L225 Difference]: With dead ends: 170 [2018-07-23 15:20:41,089 INFO L226 Difference]: Without dead ends: 168 [2018-07-23 15:20:41,089 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2018-07-23 15:20:41,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-07-23 15:20:41,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 167. [2018-07-23 15:20:41,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-07-23 15:20:41,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2018-07-23 15:20:41,137 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 164 [2018-07-23 15:20:41,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:41,137 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2018-07-23 15:20:41,137 INFO L472 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-07-23 15:20:41,137 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2018-07-23 15:20:41,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-07-23 15:20:41,138 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:41,138 INFO L353 BasicCegarLoop]: trace histogram [82, 81, 1, 1, 1] [2018-07-23 15:20:41,138 INFO L414 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:41,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1970448443, now seen corresponding path program 81 times [2018-07-23 15:20:41,139 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:41,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:41,923 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:41,924 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:41,924 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-07-23 15:20:41,924 INFO L450 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-07-23 15:20:41,924 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-07-23 15:20:41,925 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2018-07-23 15:20:41,925 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 85 states. [2018-07-23 15:20:43,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:43,183 INFO L93 Difference]: Finished difference Result 172 states and 172 transitions. [2018-07-23 15:20:43,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-07-23 15:20:43,183 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 166 [2018-07-23 15:20:43,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:43,184 INFO L225 Difference]: With dead ends: 172 [2018-07-23 15:20:43,184 INFO L226 Difference]: Without dead ends: 170 [2018-07-23 15:20:43,184 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2018-07-23 15:20:43,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-07-23 15:20:43,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2018-07-23 15:20:43,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-07-23 15:20:43,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2018-07-23 15:20:43,241 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 166 [2018-07-23 15:20:43,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:43,241 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2018-07-23 15:20:43,241 INFO L472 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-07-23 15:20:43,241 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2018-07-23 15:20:43,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-07-23 15:20:43,242 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:43,242 INFO L353 BasicCegarLoop]: trace histogram [83, 82, 1, 1, 1] [2018-07-23 15:20:43,242 INFO L414 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:43,243 INFO L82 PathProgramCache]: Analyzing trace with hash 479570511, now seen corresponding path program 82 times [2018-07-23 15:20:43,243 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:43,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:44,133 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:44,134 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:44,134 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-07-23 15:20:44,134 INFO L450 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-07-23 15:20:44,134 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-07-23 15:20:44,134 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2018-07-23 15:20:44,135 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 86 states. [2018-07-23 15:20:45,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:45,392 INFO L93 Difference]: Finished difference Result 174 states and 174 transitions. [2018-07-23 15:20:45,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-07-23 15:20:45,392 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 168 [2018-07-23 15:20:45,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:45,393 INFO L225 Difference]: With dead ends: 174 [2018-07-23 15:20:45,393 INFO L226 Difference]: Without dead ends: 172 [2018-07-23 15:20:45,394 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2018-07-23 15:20:45,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-07-23 15:20:45,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 171. [2018-07-23 15:20:45,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-07-23 15:20:45,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-07-23 15:20:45,445 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 168 [2018-07-23 15:20:45,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:45,446 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-07-23 15:20:45,446 INFO L472 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-07-23 15:20:45,446 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-07-23 15:20:45,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-07-23 15:20:45,446 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:45,446 INFO L353 BasicCegarLoop]: trace histogram [84, 83, 1, 1, 1] [2018-07-23 15:20:45,447 INFO L414 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:45,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1305707097, now seen corresponding path program 83 times [2018-07-23 15:20:45,447 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:45,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:46,291 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:46,291 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:46,292 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-07-23 15:20:46,292 INFO L450 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-07-23 15:20:46,292 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-07-23 15:20:46,293 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2018-07-23 15:20:46,293 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 87 states. [2018-07-23 15:20:47,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:47,573 INFO L93 Difference]: Finished difference Result 176 states and 176 transitions. [2018-07-23 15:20:47,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-07-23 15:20:47,574 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 170 [2018-07-23 15:20:47,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:47,575 INFO L225 Difference]: With dead ends: 176 [2018-07-23 15:20:47,575 INFO L226 Difference]: Without dead ends: 174 [2018-07-23 15:20:47,576 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2018-07-23 15:20:47,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-07-23 15:20:47,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2018-07-23 15:20:47,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-07-23 15:20:47,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-07-23 15:20:47,639 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 170 [2018-07-23 15:20:47,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:47,639 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-07-23 15:20:47,639 INFO L472 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-07-23 15:20:47,639 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-07-23 15:20:47,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-07-23 15:20:47,640 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:47,640 INFO L353 BasicCegarLoop]: trace histogram [85, 84, 1, 1, 1] [2018-07-23 15:20:47,640 INFO L414 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:47,640 INFO L82 PathProgramCache]: Analyzing trace with hash 654016483, now seen corresponding path program 84 times [2018-07-23 15:20:47,641 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:47,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:48,502 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-23 15:20:48,503 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:48,503 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-07-23 15:20:48,503 INFO L450 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-07-23 15:20:48,504 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-07-23 15:20:48,504 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2018-07-23 15:20:48,504 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 88 states. [2018-07-23 15:20:49,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:49,814 INFO L93 Difference]: Finished difference Result 178 states and 178 transitions. [2018-07-23 15:20:49,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-07-23 15:20:49,814 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 172 [2018-07-23 15:20:49,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:49,815 INFO L225 Difference]: With dead ends: 178 [2018-07-23 15:20:49,815 INFO L226 Difference]: Without dead ends: 176 [2018-07-23 15:20:49,816 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2018-07-23 15:20:49,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-07-23 15:20:49,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 175. [2018-07-23 15:20:49,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-07-23 15:20:49,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2018-07-23 15:20:49,888 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 172 [2018-07-23 15:20:49,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:49,889 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2018-07-23 15:20:49,889 INFO L472 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-07-23 15:20:49,889 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2018-07-23 15:20:49,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-07-23 15:20:49,890 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:49,890 INFO L353 BasicCegarLoop]: trace histogram [86, 85, 1, 1, 1] [2018-07-23 15:20:49,890 INFO L414 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:49,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1444561645, now seen corresponding path program 85 times [2018-07-23 15:20:49,891 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:50,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:50,779 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:50,779 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:50,779 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-07-23 15:20:50,779 INFO L450 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-07-23 15:20:50,780 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-07-23 15:20:50,780 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2018-07-23 15:20:50,780 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 89 states. [2018-07-23 15:20:51,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:51,906 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2018-07-23 15:20:51,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-07-23 15:20:51,906 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 174 [2018-07-23 15:20:51,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:51,907 INFO L225 Difference]: With dead ends: 180 [2018-07-23 15:20:51,907 INFO L226 Difference]: Without dead ends: 178 [2018-07-23 15:20:51,908 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2018-07-23 15:20:51,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-07-23 15:20:51,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2018-07-23 15:20:51,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-07-23 15:20:51,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-07-23 15:20:51,958 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 174 [2018-07-23 15:20:51,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:51,958 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-07-23 15:20:51,959 INFO L472 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-07-23 15:20:51,959 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-07-23 15:20:51,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-07-23 15:20:51,959 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:51,960 INFO L353 BasicCegarLoop]: trace histogram [87, 86, 1, 1, 1] [2018-07-23 15:20:51,960 INFO L414 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:51,960 INFO L82 PathProgramCache]: Analyzing trace with hash 949250935, now seen corresponding path program 86 times [2018-07-23 15:20:51,960 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:52,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:52,786 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:52,786 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:52,786 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-07-23 15:20:52,787 INFO L450 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-07-23 15:20:52,787 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-07-23 15:20:52,788 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=7833, Unknown=0, NotChecked=0, Total=8010 [2018-07-23 15:20:52,788 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 90 states. [2018-07-23 15:20:54,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:54,157 INFO L93 Difference]: Finished difference Result 182 states and 182 transitions. [2018-07-23 15:20:54,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-07-23 15:20:54,157 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 176 [2018-07-23 15:20:54,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:54,158 INFO L225 Difference]: With dead ends: 182 [2018-07-23 15:20:54,158 INFO L226 Difference]: Without dead ends: 180 [2018-07-23 15:20:54,159 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=177, Invalid=7833, Unknown=0, NotChecked=0, Total=8010 [2018-07-23 15:20:54,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-07-23 15:20:54,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 179. [2018-07-23 15:20:54,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-07-23 15:20:54,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2018-07-23 15:20:54,208 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 176 [2018-07-23 15:20:54,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:54,209 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2018-07-23 15:20:54,209 INFO L472 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-07-23 15:20:54,209 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2018-07-23 15:20:54,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-07-23 15:20:54,209 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:54,209 INFO L353 BasicCegarLoop]: trace histogram [88, 87, 1, 1, 1] [2018-07-23 15:20:54,210 INFO L414 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:54,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1697028481, now seen corresponding path program 87 times [2018-07-23 15:20:54,210 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:54,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:55,053 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:55,053 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:55,053 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-07-23 15:20:55,054 INFO L450 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-07-23 15:20:55,054 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-07-23 15:20:55,054 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=8011, Unknown=0, NotChecked=0, Total=8190 [2018-07-23 15:20:55,055 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 91 states. [2018-07-23 15:20:56,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:56,388 INFO L93 Difference]: Finished difference Result 184 states and 184 transitions. [2018-07-23 15:20:56,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-07-23 15:20:56,388 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 178 [2018-07-23 15:20:56,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:56,389 INFO L225 Difference]: With dead ends: 184 [2018-07-23 15:20:56,389 INFO L226 Difference]: Without dead ends: 182 [2018-07-23 15:20:56,390 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=8011, Unknown=0, NotChecked=0, Total=8190 [2018-07-23 15:20:56,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-07-23 15:20:56,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2018-07-23 15:20:56,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-07-23 15:20:56,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-07-23 15:20:56,438 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 178 [2018-07-23 15:20:56,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:56,439 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-07-23 15:20:56,439 INFO L472 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-07-23 15:20:56,439 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-07-23 15:20:56,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-07-23 15:20:56,439 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:56,440 INFO L353 BasicCegarLoop]: trace histogram [89, 88, 1, 1, 1] [2018-07-23 15:20:56,440 INFO L414 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:56,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1243255541, now seen corresponding path program 88 times [2018-07-23 15:20:56,440 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:56,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:57,324 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:57,324 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:57,325 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-07-23 15:20:57,325 INFO L450 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-07-23 15:20:57,325 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-07-23 15:20:57,326 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=8191, Unknown=0, NotChecked=0, Total=8372 [2018-07-23 15:20:57,326 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 92 states. [2018-07-23 15:20:58,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:58,732 INFO L93 Difference]: Finished difference Result 186 states and 186 transitions. [2018-07-23 15:20:58,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-07-23 15:20:58,732 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 180 [2018-07-23 15:20:58,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:58,733 INFO L225 Difference]: With dead ends: 186 [2018-07-23 15:20:58,733 INFO L226 Difference]: Without dead ends: 184 [2018-07-23 15:20:58,733 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=8191, Unknown=0, NotChecked=0, Total=8372 [2018-07-23 15:20:58,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-07-23 15:20:58,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2018-07-23 15:20:58,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-07-23 15:20:58,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-07-23 15:20:58,786 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 180 [2018-07-23 15:20:58,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:58,786 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-07-23 15:20:58,786 INFO L472 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-07-23 15:20:58,786 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-07-23 15:20:58,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-07-23 15:20:58,787 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:58,787 INFO L353 BasicCegarLoop]: trace histogram [90, 89, 1, 1, 1] [2018-07-23 15:20:58,787 INFO L414 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:58,787 INFO L82 PathProgramCache]: Analyzing trace with hash -767719915, now seen corresponding path program 89 times [2018-07-23 15:20:58,787 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:58,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:59,692 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:59,693 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:59,693 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-07-23 15:20:59,693 INFO L450 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-07-23 15:20:59,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-07-23 15:20:59,694 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=8373, Unknown=0, NotChecked=0, Total=8556 [2018-07-23 15:20:59,694 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 93 states. [2018-07-23 15:21:01,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:21:01,158 INFO L93 Difference]: Finished difference Result 188 states and 188 transitions. [2018-07-23 15:21:01,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-07-23 15:21:01,159 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 182 [2018-07-23 15:21:01,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:21:01,159 INFO L225 Difference]: With dead ends: 188 [2018-07-23 15:21:01,160 INFO L226 Difference]: Without dead ends: 186 [2018-07-23 15:21:01,160 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=8373, Unknown=0, NotChecked=0, Total=8556 [2018-07-23 15:21:01,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-07-23 15:21:01,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2018-07-23 15:21:01,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-07-23 15:21:01,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-07-23 15:21:01,210 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 182 [2018-07-23 15:21:01,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:21:01,210 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-07-23 15:21:01,211 INFO L472 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-07-23 15:21:01,211 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-07-23 15:21:01,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-07-23 15:21:01,211 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:21:01,211 INFO L353 BasicCegarLoop]: trace histogram [91, 90, 1, 1, 1] [2018-07-23 15:21:01,211 INFO L414 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:21:01,212 INFO L82 PathProgramCache]: Analyzing trace with hash 955483295, now seen corresponding path program 90 times [2018-07-23 15:21:01,212 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:21:01,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:21:02,114 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:21:02,114 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:21:02,114 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-07-23 15:21:02,115 INFO L450 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-07-23 15:21:02,115 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-07-23 15:21:02,115 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=8557, Unknown=0, NotChecked=0, Total=8742 [2018-07-23 15:21:02,115 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 94 states. [2018-07-23 15:21:03,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:21:03,460 INFO L93 Difference]: Finished difference Result 190 states and 190 transitions. [2018-07-23 15:21:03,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-07-23 15:21:03,460 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 184 [2018-07-23 15:21:03,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:21:03,461 INFO L225 Difference]: With dead ends: 190 [2018-07-23 15:21:03,461 INFO L226 Difference]: Without dead ends: 188 [2018-07-23 15:21:03,462 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=185, Invalid=8557, Unknown=0, NotChecked=0, Total=8742 [2018-07-23 15:21:03,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-07-23 15:21:03,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 187. [2018-07-23 15:21:03,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-07-23 15:21:03,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2018-07-23 15:21:03,517 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 184 [2018-07-23 15:21:03,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:21:03,517 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2018-07-23 15:21:03,517 INFO L472 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-07-23 15:21:03,517 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2018-07-23 15:21:03,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-07-23 15:21:03,518 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:21:03,518 INFO L353 BasicCegarLoop]: trace histogram [92, 91, 1, 1, 1] [2018-07-23 15:21:03,518 INFO L414 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:21:03,518 INFO L82 PathProgramCache]: Analyzing trace with hash -903608151, now seen corresponding path program 91 times [2018-07-23 15:21:03,519 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:21:03,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:21:04,499 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:21:04,500 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:21:04,500 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-07-23 15:21:04,500 INFO L450 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-07-23 15:21:04,501 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-07-23 15:21:04,501 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=8743, Unknown=0, NotChecked=0, Total=8930 [2018-07-23 15:21:04,501 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 95 states. [2018-07-23 15:21:06,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:21:06,035 INFO L93 Difference]: Finished difference Result 192 states and 192 transitions. [2018-07-23 15:21:06,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-07-23 15:21:06,035 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 186 [2018-07-23 15:21:06,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:21:06,036 INFO L225 Difference]: With dead ends: 192 [2018-07-23 15:21:06,036 INFO L226 Difference]: Without dead ends: 190 [2018-07-23 15:21:06,037 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=187, Invalid=8743, Unknown=0, NotChecked=0, Total=8930 [2018-07-23 15:21:06,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-07-23 15:21:06,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2018-07-23 15:21:06,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-07-23 15:21:06,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2018-07-23 15:21:06,099 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 186 [2018-07-23 15:21:06,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:21:06,099 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2018-07-23 15:21:06,100 INFO L472 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-07-23 15:21:06,100 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2018-07-23 15:21:06,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-07-23 15:21:06,100 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:21:06,100 INFO L353 BasicCegarLoop]: trace histogram [93, 92, 1, 1, 1] [2018-07-23 15:21:06,101 INFO L414 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:21:06,101 INFO L82 PathProgramCache]: Analyzing trace with hash -784092621, now seen corresponding path program 92 times [2018-07-23 15:21:06,101 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:21:06,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:21:07,175 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:21:07,175 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:21:07,175 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-07-23 15:21:07,176 INFO L450 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-07-23 15:21:07,176 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-07-23 15:21:07,177 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=8931, Unknown=0, NotChecked=0, Total=9120 [2018-07-23 15:21:07,177 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 96 states. [2018-07-23 15:21:08,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:21:08,851 INFO L93 Difference]: Finished difference Result 194 states and 194 transitions. [2018-07-23 15:21:08,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-07-23 15:21:08,851 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 188 [2018-07-23 15:21:08,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:21:08,852 INFO L225 Difference]: With dead ends: 194 [2018-07-23 15:21:08,852 INFO L226 Difference]: Without dead ends: 192 [2018-07-23 15:21:08,853 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=189, Invalid=8931, Unknown=0, NotChecked=0, Total=9120 [2018-07-23 15:21:08,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-07-23 15:21:08,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 191. [2018-07-23 15:21:08,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-07-23 15:21:08,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-07-23 15:21:08,932 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 188 [2018-07-23 15:21:08,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:21:08,932 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2018-07-23 15:21:08,932 INFO L472 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-07-23 15:21:08,932 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-07-23 15:21:08,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-07-23 15:21:08,933 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:21:08,934 INFO L353 BasicCegarLoop]: trace histogram [94, 93, 1, 1, 1] [2018-07-23 15:21:08,934 INFO L414 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:21:08,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1893785283, now seen corresponding path program 93 times [2018-07-23 15:21:08,934 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:21:09,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:21:10,068 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:21:10,068 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:21:10,068 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-07-23 15:21:10,069 INFO L450 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-07-23 15:21:10,069 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-07-23 15:21:10,069 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=9121, Unknown=0, NotChecked=0, Total=9312 [2018-07-23 15:21:10,069 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 97 states. [2018-07-23 15:21:11,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:21:11,633 INFO L93 Difference]: Finished difference Result 196 states and 196 transitions. [2018-07-23 15:21:11,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-07-23 15:21:11,633 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 190 [2018-07-23 15:21:11,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:21:11,634 INFO L225 Difference]: With dead ends: 196 [2018-07-23 15:21:11,634 INFO L226 Difference]: Without dead ends: 194 [2018-07-23 15:21:11,634 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=191, Invalid=9121, Unknown=0, NotChecked=0, Total=9312 [2018-07-23 15:21:11,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-07-23 15:21:11,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2018-07-23 15:21:11,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-07-23 15:21:11,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-07-23 15:21:11,699 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 190 [2018-07-23 15:21:11,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:21:11,699 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-07-23 15:21:11,699 INFO L472 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-07-23 15:21:11,699 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-07-23 15:21:11,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-07-23 15:21:11,700 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:21:11,700 INFO L353 BasicCegarLoop]: trace histogram [95, 94, 1, 1, 1] [2018-07-23 15:21:11,700 INFO L414 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:21:11,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1138423239, now seen corresponding path program 94 times [2018-07-23 15:21:11,701 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:21:11,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:21:12,815 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:21:12,815 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:21:12,815 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-07-23 15:21:12,816 INFO L450 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-07-23 15:21:12,816 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-07-23 15:21:12,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=9313, Unknown=0, NotChecked=0, Total=9506 [2018-07-23 15:21:12,817 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 98 states. [2018-07-23 15:21:14,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:21:14,304 INFO L93 Difference]: Finished difference Result 198 states and 198 transitions. [2018-07-23 15:21:14,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-07-23 15:21:14,305 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 192 [2018-07-23 15:21:14,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:21:14,306 INFO L225 Difference]: With dead ends: 198 [2018-07-23 15:21:14,306 INFO L226 Difference]: Without dead ends: 196 [2018-07-23 15:21:14,307 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=193, Invalid=9313, Unknown=0, NotChecked=0, Total=9506 [2018-07-23 15:21:14,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-07-23 15:21:14,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 195. [2018-07-23 15:21:14,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-07-23 15:21:14,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2018-07-23 15:21:14,387 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 192 [2018-07-23 15:21:14,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:21:14,387 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 195 transitions. [2018-07-23 15:21:14,387 INFO L472 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-07-23 15:21:14,387 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2018-07-23 15:21:14,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-07-23 15:21:14,388 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:21:14,388 INFO L353 BasicCegarLoop]: trace histogram [96, 95, 1, 1, 1] [2018-07-23 15:21:14,389 INFO L414 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:21:14,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1191981103, now seen corresponding path program 95 times [2018-07-23 15:21:14,389 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:21:14,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:21:15,563 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:21:15,563 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:21:15,563 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-07-23 15:21:15,564 INFO L450 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-07-23 15:21:15,564 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-07-23 15:21:15,565 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=9507, Unknown=0, NotChecked=0, Total=9702 [2018-07-23 15:21:15,565 INFO L87 Difference]: Start difference. First operand 195 states and 195 transitions. Second operand 99 states. [2018-07-23 15:21:17,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:21:17,235 INFO L93 Difference]: Finished difference Result 200 states and 200 transitions. [2018-07-23 15:21:17,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-07-23 15:21:17,235 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 194 [2018-07-23 15:21:17,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:21:17,236 INFO L225 Difference]: With dead ends: 200 [2018-07-23 15:21:17,236 INFO L226 Difference]: Without dead ends: 198 [2018-07-23 15:21:17,237 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=195, Invalid=9507, Unknown=0, NotChecked=0, Total=9702 [2018-07-23 15:21:17,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-07-23 15:21:17,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2018-07-23 15:21:17,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-07-23 15:21:17,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2018-07-23 15:21:17,306 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 194 [2018-07-23 15:21:17,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:21:17,306 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2018-07-23 15:21:17,306 INFO L472 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-07-23 15:21:17,306 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2018-07-23 15:21:17,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-07-23 15:21:17,307 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:21:17,308 INFO L353 BasicCegarLoop]: trace histogram [97, 96, 1, 1, 1] [2018-07-23 15:21:17,308 INFO L414 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:21:17,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1262374747, now seen corresponding path program 96 times [2018-07-23 15:21:17,308 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:21:17,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:21:18,540 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 9312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:21:18,541 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:21:18,541 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-07-23 15:21:18,541 INFO L450 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-07-23 15:21:18,541 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-07-23 15:21:18,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=9703, Unknown=0, NotChecked=0, Total=9900 [2018-07-23 15:21:18,542 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 100 states. [2018-07-23 15:21:20,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:21:20,263 INFO L93 Difference]: Finished difference Result 202 states and 202 transitions. [2018-07-23 15:21:20,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-07-23 15:21:20,264 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 196 [2018-07-23 15:21:20,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:21:20,265 INFO L225 Difference]: With dead ends: 202 [2018-07-23 15:21:20,265 INFO L226 Difference]: Without dead ends: 200 [2018-07-23 15:21:20,265 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=197, Invalid=9703, Unknown=0, NotChecked=0, Total=9900 [2018-07-23 15:21:20,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-07-23 15:21:20,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 199. [2018-07-23 15:21:20,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-07-23 15:21:20,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2018-07-23 15:21:20,335 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 196 [2018-07-23 15:21:20,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:21:20,336 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2018-07-23 15:21:20,336 INFO L472 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-07-23 15:21:20,336 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2018-07-23 15:21:20,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-07-23 15:21:20,336 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:21:20,336 INFO L353 BasicCegarLoop]: trace histogram [98, 97, 1, 1, 1] [2018-07-23 15:21:20,337 INFO L414 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:21:20,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1961301093, now seen corresponding path program 97 times [2018-07-23 15:21:20,337 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:21:20,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:21:21,598 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 9506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:21:21,598 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:21:21,598 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-07-23 15:21:21,599 INFO L450 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-07-23 15:21:21,599 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-07-23 15:21:21,600 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=9901, Unknown=0, NotChecked=0, Total=10100 [2018-07-23 15:21:21,600 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand 101 states. [2018-07-23 15:21:23,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:21:23,391 INFO L93 Difference]: Finished difference Result 204 states and 204 transitions. [2018-07-23 15:21:23,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-07-23 15:21:23,392 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 198 [2018-07-23 15:21:23,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:21:23,393 INFO L225 Difference]: With dead ends: 204 [2018-07-23 15:21:23,393 INFO L226 Difference]: Without dead ends: 202 [2018-07-23 15:21:23,393 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=199, Invalid=9901, Unknown=0, NotChecked=0, Total=10100 [2018-07-23 15:21:23,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-07-23 15:21:23,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2018-07-23 15:21:23,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-07-23 15:21:23,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-07-23 15:21:23,459 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 198 [2018-07-23 15:21:23,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:21:23,459 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-07-23 15:21:23,459 INFO L472 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-07-23 15:21:23,459 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-07-23 15:21:23,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-07-23 15:21:23,460 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:21:23,460 INFO L353 BasicCegarLoop]: trace histogram [99, 98, 1, 1, 1] [2018-07-23 15:21:23,460 INFO L414 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:21:23,460 INFO L82 PathProgramCache]: Analyzing trace with hash -680345873, now seen corresponding path program 98 times [2018-07-23 15:21:23,460 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:21:23,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:21:24,627 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 9702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:21:24,628 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:21:24,628 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-07-23 15:21:24,628 INFO L450 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-07-23 15:21:24,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-07-23 15:21:24,629 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=10101, Unknown=0, NotChecked=0, Total=10302 [2018-07-23 15:21:24,629 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 102 states. [2018-07-23 15:21:26,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:21:26,267 INFO L93 Difference]: Finished difference Result 206 states and 206 transitions. [2018-07-23 15:21:26,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-07-23 15:21:26,268 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 200 [2018-07-23 15:21:26,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:21:26,269 INFO L225 Difference]: With dead ends: 206 [2018-07-23 15:21:26,269 INFO L226 Difference]: Without dead ends: 204 [2018-07-23 15:21:26,269 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=201, Invalid=10101, Unknown=0, NotChecked=0, Total=10302 [2018-07-23 15:21:26,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-07-23 15:21:26,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 203. [2018-07-23 15:21:26,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-07-23 15:21:26,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2018-07-23 15:21:26,344 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 200 [2018-07-23 15:21:26,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:21:26,344 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 203 transitions. [2018-07-23 15:21:26,344 INFO L472 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-07-23 15:21:26,344 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2018-07-23 15:21:26,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-07-23 15:21:26,345 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:21:26,345 INFO L353 BasicCegarLoop]: trace histogram [100, 99, 1, 1, 1] [2018-07-23 15:21:26,346 INFO L414 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:21:26,346 INFO L82 PathProgramCache]: Analyzing trace with hash -977408263, now seen corresponding path program 99 times [2018-07-23 15:21:26,346 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:21:26,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:21:27,850 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 9900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:21:27,850 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:21:27,851 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-07-23 15:21:27,851 INFO L450 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-07-23 15:21:27,851 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-07-23 15:21:27,852 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2018-07-23 15:21:27,853 INFO L87 Difference]: Start difference. First operand 203 states and 203 transitions. Second operand 103 states. [2018-07-23 15:21:29,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:21:29,647 INFO L93 Difference]: Finished difference Result 208 states and 208 transitions. [2018-07-23 15:21:29,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-07-23 15:21:29,647 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 202 [2018-07-23 15:21:29,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:21:29,648 INFO L225 Difference]: With dead ends: 208 [2018-07-23 15:21:29,648 INFO L226 Difference]: Without dead ends: 206 [2018-07-23 15:21:29,648 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2018-07-23 15:21:29,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-07-23 15:21:29,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2018-07-23 15:21:29,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-07-23 15:21:29,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2018-07-23 15:21:29,711 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 202 [2018-07-23 15:21:29,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:21:29,712 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2018-07-23 15:21:29,712 INFO L472 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-07-23 15:21:29,712 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2018-07-23 15:21:29,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-07-23 15:21:29,713 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:21:29,713 INFO L353 BasicCegarLoop]: trace histogram [101, 100, 1, 1, 1] [2018-07-23 15:21:29,713 INFO L414 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:21:29,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1308443779, now seen corresponding path program 100 times [2018-07-23 15:21:29,713 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:21:30,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:21:31,065 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 10100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:21:31,065 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:21:31,065 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-07-23 15:21:31,066 INFO L450 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-07-23 15:21:31,066 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-07-23 15:21:31,067 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=10507, Unknown=0, NotChecked=0, Total=10712 [2018-07-23 15:21:31,067 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 104 states. [2018-07-23 15:21:32,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:21:32,916 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2018-07-23 15:21:32,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-07-23 15:21:32,916 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 204 [2018-07-23 15:21:32,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:21:32,917 INFO L225 Difference]: With dead ends: 210 [2018-07-23 15:21:32,917 INFO L226 Difference]: Without dead ends: 208 [2018-07-23 15:21:32,918 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=205, Invalid=10507, Unknown=0, NotChecked=0, Total=10712 [2018-07-23 15:21:32,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-07-23 15:21:32,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 207. [2018-07-23 15:21:32,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-07-23 15:21:32,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2018-07-23 15:21:32,985 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 204 [2018-07-23 15:21:32,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:21:32,986 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2018-07-23 15:21:32,986 INFO L472 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-07-23 15:21:32,986 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2018-07-23 15:21:32,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-07-23 15:21:32,986 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:21:32,987 INFO L353 BasicCegarLoop]: trace histogram [102, 101, 1, 1, 1] [2018-07-23 15:21:32,987 INFO L414 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:21:32,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1010999411, now seen corresponding path program 101 times [2018-07-23 15:21:32,987 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:21:33,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:21:34,208 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 10302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:21:34,208 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:21:34,208 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2018-07-23 15:21:34,209 INFO L450 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-07-23 15:21:34,209 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-07-23 15:21:34,210 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=10713, Unknown=0, NotChecked=0, Total=10920 [2018-07-23 15:21:34,210 INFO L87 Difference]: Start difference. First operand 207 states and 207 transitions. Second operand 105 states. [2018-07-23 15:21:36,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:21:36,130 INFO L93 Difference]: Finished difference Result 212 states and 212 transitions. [2018-07-23 15:21:36,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-07-23 15:21:36,130 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 206 [2018-07-23 15:21:36,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:21:36,131 INFO L225 Difference]: With dead ends: 212 [2018-07-23 15:21:36,131 INFO L226 Difference]: Without dead ends: 210 [2018-07-23 15:21:36,132 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=207, Invalid=10713, Unknown=0, NotChecked=0, Total=10920 [2018-07-23 15:21:36,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-07-23 15:21:36,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2018-07-23 15:21:36,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-07-23 15:21:36,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2018-07-23 15:21:36,209 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 206 [2018-07-23 15:21:36,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:21:36,209 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2018-07-23 15:21:36,209 INFO L472 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-07-23 15:21:36,210 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2018-07-23 15:21:36,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-07-23 15:21:36,210 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:21:36,210 INFO L353 BasicCegarLoop]: trace histogram [103, 102, 1, 1, 1] [2018-07-23 15:21:36,210 INFO L414 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:21:36,211 INFO L82 PathProgramCache]: Analyzing trace with hash -907878377, now seen corresponding path program 102 times [2018-07-23 15:21:36,211 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:21:36,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:21:37,679 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 10506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:21:37,679 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:21:37,679 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-07-23 15:21:37,680 INFO L450 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-07-23 15:21:37,680 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-07-23 15:21:37,681 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=10921, Unknown=0, NotChecked=0, Total=11130 [2018-07-23 15:21:37,681 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 106 states. [2018-07-23 15:21:39,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:21:39,649 INFO L93 Difference]: Finished difference Result 214 states and 214 transitions. [2018-07-23 15:21:39,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-07-23 15:21:39,650 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 208 [2018-07-23 15:21:39,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:21:39,650 INFO L225 Difference]: With dead ends: 214 [2018-07-23 15:21:39,650 INFO L226 Difference]: Without dead ends: 212 [2018-07-23 15:21:39,651 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=209, Invalid=10921, Unknown=0, NotChecked=0, Total=11130 [2018-07-23 15:21:39,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-07-23 15:21:39,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 211. [2018-07-23 15:21:39,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-07-23 15:21:39,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2018-07-23 15:21:39,750 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 208 [2018-07-23 15:21:39,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:21:39,750 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2018-07-23 15:21:39,750 INFO L472 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-07-23 15:21:39,750 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2018-07-23 15:21:39,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-07-23 15:21:39,751 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:21:39,751 INFO L353 BasicCegarLoop]: trace histogram [104, 103, 1, 1, 1] [2018-07-23 15:21:39,752 INFO L414 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:21:39,752 INFO L82 PathProgramCache]: Analyzing trace with hash -592812511, now seen corresponding path program 103 times [2018-07-23 15:21:39,752 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:21:40,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:21:41,234 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 10712 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:21:41,234 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:21:41,234 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2018-07-23 15:21:41,235 INFO L450 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-07-23 15:21:41,235 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-07-23 15:21:41,236 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=11131, Unknown=0, NotChecked=0, Total=11342 [2018-07-23 15:21:41,236 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 107 states. [2018-07-23 15:21:43,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:21:43,239 INFO L93 Difference]: Finished difference Result 216 states and 216 transitions. [2018-07-23 15:21:43,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-07-23 15:21:43,239 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 210 [2018-07-23 15:21:43,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:21:43,240 INFO L225 Difference]: With dead ends: 216 [2018-07-23 15:21:43,240 INFO L226 Difference]: Without dead ends: 214 [2018-07-23 15:21:43,241 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=211, Invalid=11131, Unknown=0, NotChecked=0, Total=11342 [2018-07-23 15:21:43,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-07-23 15:21:43,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 213. [2018-07-23 15:21:43,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-07-23 15:21:43,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2018-07-23 15:21:43,327 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 210 [2018-07-23 15:21:43,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:21:43,328 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2018-07-23 15:21:43,328 INFO L472 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-07-23 15:21:43,328 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2018-07-23 15:21:43,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-07-23 15:21:43,329 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:21:43,329 INFO L353 BasicCegarLoop]: trace histogram [105, 104, 1, 1, 1] [2018-07-23 15:21:43,329 INFO L414 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:21:43,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1537773995, now seen corresponding path program 104 times [2018-07-23 15:21:43,330 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:21:43,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:21:44,875 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 0 proven. 10920 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:21:44,875 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:21:44,875 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-07-23 15:21:44,876 INFO L450 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-07-23 15:21:44,876 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-07-23 15:21:44,877 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=11343, Unknown=0, NotChecked=0, Total=11556 [2018-07-23 15:21:44,877 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 108 states. [2018-07-23 15:21:47,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:21:47,036 INFO L93 Difference]: Finished difference Result 218 states and 218 transitions. [2018-07-23 15:21:47,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-07-23 15:21:47,037 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 212 [2018-07-23 15:21:47,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:21:47,037 INFO L225 Difference]: With dead ends: 218 [2018-07-23 15:21:47,038 INFO L226 Difference]: Without dead ends: 216 [2018-07-23 15:21:47,038 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=213, Invalid=11343, Unknown=0, NotChecked=0, Total=11556 [2018-07-23 15:21:47,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-07-23 15:21:47,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 215. [2018-07-23 15:21:47,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-07-23 15:21:47,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 215 transitions. [2018-07-23 15:21:47,121 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 215 transitions. Word has length 212 [2018-07-23 15:21:47,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:21:47,121 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 215 transitions. [2018-07-23 15:21:47,121 INFO L472 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-07-23 15:21:47,121 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 215 transitions. [2018-07-23 15:21:47,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-07-23 15:21:47,122 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:21:47,122 INFO L353 BasicCegarLoop]: trace histogram [106, 105, 1, 1, 1] [2018-07-23 15:21:47,122 INFO L414 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:21:47,123 INFO L82 PathProgramCache]: Analyzing trace with hash 332006069, now seen corresponding path program 105 times [2018-07-23 15:21:47,123 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:21:47,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:21:48,621 INFO L134 CoverageAnalysis]: Checked inductivity of 11130 backedges. 0 proven. 11130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:21:48,621 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:21:48,621 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-07-23 15:21:48,622 INFO L450 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-07-23 15:21:48,622 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-07-23 15:21:48,623 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=11557, Unknown=0, NotChecked=0, Total=11772 [2018-07-23 15:21:48,623 INFO L87 Difference]: Start difference. First operand 215 states and 215 transitions. Second operand 109 states. [2018-07-23 15:21:50,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:21:50,354 INFO L93 Difference]: Finished difference Result 220 states and 220 transitions. [2018-07-23 15:21:50,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-07-23 15:21:50,355 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 214 [2018-07-23 15:21:50,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:21:50,355 INFO L225 Difference]: With dead ends: 220 [2018-07-23 15:21:50,356 INFO L226 Difference]: Without dead ends: 218 [2018-07-23 15:21:50,356 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=215, Invalid=11557, Unknown=0, NotChecked=0, Total=11772 [2018-07-23 15:21:50,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-07-23 15:21:50,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2018-07-23 15:21:50,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-07-23 15:21:50,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2018-07-23 15:21:50,438 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 214 [2018-07-23 15:21:50,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:21:50,438 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2018-07-23 15:21:50,438 INFO L472 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-07-23 15:21:50,438 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2018-07-23 15:21:50,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-07-23 15:21:50,439 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:21:50,439 INFO L353 BasicCegarLoop]: trace histogram [107, 106, 1, 1, 1] [2018-07-23 15:21:50,439 INFO L414 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:21:50,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1230199103, now seen corresponding path program 106 times [2018-07-23 15:21:50,439 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:21:50,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:21:52,002 INFO L134 CoverageAnalysis]: Checked inductivity of 11342 backedges. 0 proven. 11342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:21:52,002 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:21:52,003 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-07-23 15:21:52,003 INFO L450 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-07-23 15:21:52,003 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-07-23 15:21:52,004 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=11773, Unknown=0, NotChecked=0, Total=11990 [2018-07-23 15:21:52,004 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 110 states. [2018-07-23 15:21:54,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:21:54,081 INFO L93 Difference]: Finished difference Result 222 states and 222 transitions. [2018-07-23 15:21:54,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-07-23 15:21:54,081 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 216 [2018-07-23 15:21:54,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:21:54,082 INFO L225 Difference]: With dead ends: 222 [2018-07-23 15:21:54,082 INFO L226 Difference]: Without dead ends: 220 [2018-07-23 15:21:54,082 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=217, Invalid=11773, Unknown=0, NotChecked=0, Total=11990 [2018-07-23 15:21:54,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-07-23 15:21:54,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 219. [2018-07-23 15:21:54,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-07-23 15:21:54,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 219 transitions. [2018-07-23 15:21:54,164 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 219 transitions. Word has length 216 [2018-07-23 15:21:54,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:21:54,164 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 219 transitions. [2018-07-23 15:21:54,164 INFO L472 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-07-23 15:21:54,165 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 219 transitions. [2018-07-23 15:21:54,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-07-23 15:21:54,165 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:21:54,165 INFO L353 BasicCegarLoop]: trace histogram [108, 107, 1, 1, 1] [2018-07-23 15:21:54,165 INFO L414 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:21:54,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1105278281, now seen corresponding path program 107 times [2018-07-23 15:21:54,166 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:21:54,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:21:55,736 INFO L134 CoverageAnalysis]: Checked inductivity of 11556 backedges. 0 proven. 11556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:21:55,736 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:21:55,737 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2018-07-23 15:21:55,737 INFO L450 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-07-23 15:21:55,737 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-07-23 15:21:55,738 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=11991, Unknown=0, NotChecked=0, Total=12210 [2018-07-23 15:21:55,738 INFO L87 Difference]: Start difference. First operand 219 states and 219 transitions. Second operand 111 states. [2018-07-23 15:21:57,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:21:57,842 INFO L93 Difference]: Finished difference Result 224 states and 224 transitions. [2018-07-23 15:21:57,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-07-23 15:21:57,843 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 218 [2018-07-23 15:21:57,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:21:57,843 INFO L225 Difference]: With dead ends: 224 [2018-07-23 15:21:57,843 INFO L226 Difference]: Without dead ends: 222 [2018-07-23 15:21:57,844 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=219, Invalid=11991, Unknown=0, NotChecked=0, Total=12210 [2018-07-23 15:21:57,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-07-23 15:21:57,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 221. [2018-07-23 15:21:57,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-07-23 15:21:57,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2018-07-23 15:21:57,936 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 218 [2018-07-23 15:21:57,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:21:57,936 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2018-07-23 15:21:57,937 INFO L472 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-07-23 15:21:57,937 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2018-07-23 15:21:57,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-07-23 15:21:57,937 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:21:57,937 INFO L353 BasicCegarLoop]: trace histogram [109, 108, 1, 1, 1] [2018-07-23 15:21:57,938 INFO L414 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:21:57,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1315452627, now seen corresponding path program 108 times [2018-07-23 15:21:57,938 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:21:58,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:21:59,548 INFO L134 CoverageAnalysis]: Checked inductivity of 11772 backedges. 0 proven. 11772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:21:59,548 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:21:59,548 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-07-23 15:21:59,549 INFO L450 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-07-23 15:21:59,549 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-07-23 15:21:59,549 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=12211, Unknown=0, NotChecked=0, Total=12432 [2018-07-23 15:21:59,549 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 112 states. [2018-07-23 15:22:01,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:22:01,670 INFO L93 Difference]: Finished difference Result 226 states and 226 transitions. [2018-07-23 15:22:01,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-07-23 15:22:01,671 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 220 [2018-07-23 15:22:01,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:22:01,671 INFO L225 Difference]: With dead ends: 226 [2018-07-23 15:22:01,671 INFO L226 Difference]: Without dead ends: 224 [2018-07-23 15:22:01,672 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=221, Invalid=12211, Unknown=0, NotChecked=0, Total=12432 [2018-07-23 15:22:01,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-07-23 15:22:01,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 223. [2018-07-23 15:22:01,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-07-23 15:22:01,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 223 transitions. [2018-07-23 15:22:01,763 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 223 transitions. Word has length 220 [2018-07-23 15:22:01,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:22:01,763 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 223 transitions. [2018-07-23 15:22:01,764 INFO L472 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-07-23 15:22:01,764 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 223 transitions. [2018-07-23 15:22:01,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-07-23 15:22:01,764 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:22:01,765 INFO L353 BasicCegarLoop]: trace histogram [110, 109, 1, 1, 1] [2018-07-23 15:22:01,765 INFO L414 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:22:01,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1429536221, now seen corresponding path program 109 times [2018-07-23 15:22:01,765 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:22:02,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:22:03,383 INFO L134 CoverageAnalysis]: Checked inductivity of 11990 backedges. 0 proven. 11990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:22:03,384 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:22:03,384 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2018-07-23 15:22:03,384 INFO L450 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-07-23 15:22:03,384 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-07-23 15:22:03,385 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=12433, Unknown=0, NotChecked=0, Total=12656 [2018-07-23 15:22:03,385 INFO L87 Difference]: Start difference. First operand 223 states and 223 transitions. Second operand 113 states. [2018-07-23 15:22:05,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:22:05,562 INFO L93 Difference]: Finished difference Result 228 states and 228 transitions. [2018-07-23 15:22:05,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-07-23 15:22:05,562 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 222 [2018-07-23 15:22:05,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:22:05,562 INFO L225 Difference]: With dead ends: 228 [2018-07-23 15:22:05,563 INFO L226 Difference]: Without dead ends: 226 [2018-07-23 15:22:05,563 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=223, Invalid=12433, Unknown=0, NotChecked=0, Total=12656 [2018-07-23 15:22:05,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-07-23 15:22:05,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2018-07-23 15:22:05,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-07-23 15:22:05,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2018-07-23 15:22:05,649 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 222 [2018-07-23 15:22:05,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:22:05,650 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2018-07-23 15:22:05,650 INFO L472 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-07-23 15:22:05,650 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2018-07-23 15:22:05,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-07-23 15:22:05,650 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:22:05,650 INFO L353 BasicCegarLoop]: trace histogram [111, 110, 1, 1, 1] [2018-07-23 15:22:05,651 INFO L414 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:22:05,651 INFO L82 PathProgramCache]: Analyzing trace with hash -605279641, now seen corresponding path program 110 times [2018-07-23 15:22:05,651 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:22:05,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:22:07,168 INFO L134 CoverageAnalysis]: Checked inductivity of 12210 backedges. 0 proven. 12210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:22:07,168 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:22:07,168 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-07-23 15:22:07,168 INFO L450 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-07-23 15:22:07,169 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-07-23 15:22:07,169 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=12657, Unknown=0, NotChecked=0, Total=12882 [2018-07-23 15:22:07,169 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 114 states. [2018-07-23 15:22:09,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:22:09,238 INFO L93 Difference]: Finished difference Result 230 states and 230 transitions. [2018-07-23 15:22:09,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-07-23 15:22:09,238 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 224 [2018-07-23 15:22:09,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:22:09,239 INFO L225 Difference]: With dead ends: 230 [2018-07-23 15:22:09,239 INFO L226 Difference]: Without dead ends: 228 [2018-07-23 15:22:09,240 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 1 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-23 15:22:09,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-07-23 15:22:09,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 227. [2018-07-23 15:22:09,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-07-23 15:22:09,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2018-07-23 15:22:09,322 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 224 [2018-07-23 15:22:09,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:22:09,322 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2018-07-23 15:22:09,322 INFO L472 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-07-23 15:22:09,322 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2018-07-23 15:22:09,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-07-23 15:22:09,323 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:22:09,323 INFO L353 BasicCegarLoop]: trace histogram [112, 111, 1, 1, 1] [2018-07-23 15:22:09,323 INFO L414 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:22:09,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1853203343, now seen corresponding path program 111 times [2018-07-23 15:22:09,323 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:22:09,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:22:10,813 INFO L134 CoverageAnalysis]: Checked inductivity of 12432 backedges. 0 proven. 12432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:22:10,813 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:22:10,813 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2018-07-23 15:22:10,813 INFO L450 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-07-23 15:22:10,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-07-23 15:22:10,814 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=12883, Unknown=0, NotChecked=0, Total=13110 [2018-07-23 15:22:10,814 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 115 states. [2018-07-23 15:22:12,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:22:12,948 INFO L93 Difference]: Finished difference Result 232 states and 232 transitions. [2018-07-23 15:22:12,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-07-23 15:22:12,949 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 226 [2018-07-23 15:22:12,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:22:12,949 INFO L225 Difference]: With dead ends: 232 [2018-07-23 15:22:12,949 INFO L226 Difference]: Without dead ends: 230 [2018-07-23 15:22:12,950 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=227, Invalid=12883, Unknown=0, NotChecked=0, Total=13110 [2018-07-23 15:22:12,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-07-23 15:22:13,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2018-07-23 15:22:13,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-07-23 15:22:13,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2018-07-23 15:22:13,049 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 226 [2018-07-23 15:22:13,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:22:13,049 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2018-07-23 15:22:13,049 INFO L472 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-07-23 15:22:13,049 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2018-07-23 15:22:13,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-07-23 15:22:13,050 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:22:13,051 INFO L353 BasicCegarLoop]: trace histogram [113, 112, 1, 1, 1] [2018-07-23 15:22:13,051 INFO L414 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:22:13,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1482961915, now seen corresponding path program 112 times [2018-07-23 15:22:13,051 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:22:13,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:22:14,613 INFO L134 CoverageAnalysis]: Checked inductivity of 12656 backedges. 0 proven. 12656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:22:14,613 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:22:14,613 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-07-23 15:22:14,614 INFO L450 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-07-23 15:22:14,614 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-07-23 15:22:14,614 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=13111, Unknown=0, NotChecked=0, Total=13340 [2018-07-23 15:22:14,615 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 116 states. [2018-07-23 15:22:16,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:22:16,910 INFO L93 Difference]: Finished difference Result 234 states and 234 transitions. [2018-07-23 15:22:16,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-07-23 15:22:16,910 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 228 [2018-07-23 15:22:16,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:22:16,911 INFO L225 Difference]: With dead ends: 234 [2018-07-23 15:22:16,911 INFO L226 Difference]: Without dead ends: 232 [2018-07-23 15:22:16,912 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=229, Invalid=13111, Unknown=0, NotChecked=0, Total=13340 [2018-07-23 15:22:16,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-07-23 15:22:17,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 231. [2018-07-23 15:22:17,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-07-23 15:22:17,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2018-07-23 15:22:17,016 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 228 [2018-07-23 15:22:17,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:22:17,017 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 231 transitions. [2018-07-23 15:22:17,017 INFO L472 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-07-23 15:22:17,017 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 231 transitions. [2018-07-23 15:22:17,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-07-23 15:22:17,017 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:22:17,017 INFO L353 BasicCegarLoop]: trace histogram [114, 113, 1, 1, 1] [2018-07-23 15:22:17,018 INFO L414 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:22:17,018 INFO L82 PathProgramCache]: Analyzing trace with hash -802795259, now seen corresponding path program 113 times [2018-07-23 15:22:17,018 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:22:17,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:22:18,800 INFO L134 CoverageAnalysis]: Checked inductivity of 12882 backedges. 0 proven. 12882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:22:18,801 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:22:18,801 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2018-07-23 15:22:18,801 INFO L450 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-07-23 15:22:18,801 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-07-23 15:22:18,802 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=13341, Unknown=0, NotChecked=0, Total=13572 [2018-07-23 15:22:18,802 INFO L87 Difference]: Start difference. First operand 231 states and 231 transitions. Second operand 117 states. [2018-07-23 15:22:21,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:22:21,053 INFO L93 Difference]: Finished difference Result 236 states and 236 transitions. [2018-07-23 15:22:21,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-07-23 15:22:21,053 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 230 [2018-07-23 15:22:21,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:22:21,054 INFO L225 Difference]: With dead ends: 236 [2018-07-23 15:22:21,054 INFO L226 Difference]: Without dead ends: 234 [2018-07-23 15:22:21,054 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=231, Invalid=13341, Unknown=0, NotChecked=0, Total=13572 [2018-07-23 15:22:21,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-07-23 15:22:21,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2018-07-23 15:22:21,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-07-23 15:22:21,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2018-07-23 15:22:21,149 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 230 [2018-07-23 15:22:21,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:22:21,150 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2018-07-23 15:22:21,150 INFO L472 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-07-23 15:22:21,150 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2018-07-23 15:22:21,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-07-23 15:22:21,150 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:22:21,150 INFO L353 BasicCegarLoop]: trace histogram [115, 114, 1, 1, 1] [2018-07-23 15:22:21,151 INFO L414 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:22:21,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1607816079, now seen corresponding path program 114 times [2018-07-23 15:22:21,151 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:22:21,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:22:22,917 INFO L134 CoverageAnalysis]: Checked inductivity of 13110 backedges. 0 proven. 13110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:22:22,918 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:22:22,918 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-07-23 15:22:22,918 INFO L450 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-07-23 15:22:22,918 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-07-23 15:22:22,919 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=13573, Unknown=0, NotChecked=0, Total=13806 [2018-07-23 15:22:22,919 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 118 states. [2018-07-23 15:22:25,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:22:25,272 INFO L93 Difference]: Finished difference Result 238 states and 238 transitions. [2018-07-23 15:22:25,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-07-23 15:22:25,272 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 232 [2018-07-23 15:22:25,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:22:25,273 INFO L225 Difference]: With dead ends: 238 [2018-07-23 15:22:25,273 INFO L226 Difference]: Without dead ends: 236 [2018-07-23 15:22:25,274 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=233, Invalid=13573, Unknown=0, NotChecked=0, Total=13806 [2018-07-23 15:22:25,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-07-23 15:22:25,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 235. [2018-07-23 15:22:25,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-07-23 15:22:25,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 235 transitions. [2018-07-23 15:22:25,368 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 235 transitions. Word has length 232 [2018-07-23 15:22:25,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:22:25,368 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 235 transitions. [2018-07-23 15:22:25,368 INFO L472 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-07-23 15:22:25,368 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 235 transitions. [2018-07-23 15:22:25,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-07-23 15:22:25,369 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:22:25,369 INFO L353 BasicCegarLoop]: trace histogram [116, 115, 1, 1, 1] [2018-07-23 15:22:25,369 INFO L414 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:22:25,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1077027943, now seen corresponding path program 115 times [2018-07-23 15:22:25,369 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:22:25,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:22:27,181 INFO L134 CoverageAnalysis]: Checked inductivity of 13340 backedges. 0 proven. 13340 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:22:27,181 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:22:27,181 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2018-07-23 15:22:27,181 INFO L450 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-07-23 15:22:27,182 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-07-23 15:22:27,182 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=13807, Unknown=0, NotChecked=0, Total=14042 [2018-07-23 15:22:27,182 INFO L87 Difference]: Start difference. First operand 235 states and 235 transitions. Second operand 119 states. [2018-07-23 15:22:29,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:22:29,661 INFO L93 Difference]: Finished difference Result 240 states and 240 transitions. [2018-07-23 15:22:29,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-07-23 15:22:29,661 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 234 [2018-07-23 15:22:29,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:22:29,662 INFO L225 Difference]: With dead ends: 240 [2018-07-23 15:22:29,662 INFO L226 Difference]: Without dead ends: 238 [2018-07-23 15:22:29,663 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=235, Invalid=13807, Unknown=0, NotChecked=0, Total=14042 [2018-07-23 15:22:29,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-07-23 15:22:29,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 237. [2018-07-23 15:22:29,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-07-23 15:22:29,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2018-07-23 15:22:29,753 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 234 [2018-07-23 15:22:29,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:22:29,753 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2018-07-23 15:22:29,753 INFO L472 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-07-23 15:22:29,753 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2018-07-23 15:22:29,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-07-23 15:22:29,754 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:22:29,754 INFO L353 BasicCegarLoop]: trace histogram [117, 116, 1, 1, 1] [2018-07-23 15:22:29,754 INFO L414 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:22:29,754 INFO L82 PathProgramCache]: Analyzing trace with hash 63211811, now seen corresponding path program 116 times [2018-07-23 15:22:29,755 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:22:30,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:22:31,445 INFO L134 CoverageAnalysis]: Checked inductivity of 13572 backedges. 0 proven. 13572 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:22:31,445 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:22:31,445 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-07-23 15:22:31,446 INFO L450 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-07-23 15:22:31,446 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-07-23 15:22:31,447 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=14043, Unknown=0, NotChecked=0, Total=14280 [2018-07-23 15:22:31,447 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 120 states. [2018-07-23 15:22:33,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:22:33,989 INFO L93 Difference]: Finished difference Result 242 states and 242 transitions. [2018-07-23 15:22:33,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-07-23 15:22:33,989 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 236 [2018-07-23 15:22:33,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:22:33,989 INFO L225 Difference]: With dead ends: 242 [2018-07-23 15:22:33,990 INFO L226 Difference]: Without dead ends: 240 [2018-07-23 15:22:33,990 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=237, Invalid=14043, Unknown=0, NotChecked=0, Total=14280 [2018-07-23 15:22:33,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-07-23 15:22:34,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 239. [2018-07-23 15:22:34,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-07-23 15:22:34,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 239 transitions. [2018-07-23 15:22:34,087 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 239 transitions. Word has length 236 [2018-07-23 15:22:34,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:22:34,087 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 239 transitions. [2018-07-23 15:22:34,087 INFO L472 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-07-23 15:22:34,087 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 239 transitions. [2018-07-23 15:22:34,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-07-23 15:22:34,088 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:22:34,088 INFO L353 BasicCegarLoop]: trace histogram [118, 117, 1, 1, 1] [2018-07-23 15:22:34,088 INFO L414 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:22:34,088 INFO L82 PathProgramCache]: Analyzing trace with hash 616954925, now seen corresponding path program 117 times [2018-07-23 15:22:34,088 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:22:34,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:22:35,973 INFO L134 CoverageAnalysis]: Checked inductivity of 13806 backedges. 0 proven. 13806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:22:35,973 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:22:35,973 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [120] total 120 [2018-07-23 15:22:35,973 INFO L450 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-07-23 15:22:35,974 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-07-23 15:22:35,974 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=14281, Unknown=0, NotChecked=0, Total=14520 [2018-07-23 15:22:35,974 INFO L87 Difference]: Start difference. First operand 239 states and 239 transitions. Second operand 121 states. [2018-07-23 15:22:38,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:22:38,412 INFO L93 Difference]: Finished difference Result 244 states and 244 transitions. [2018-07-23 15:22:38,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-07-23 15:22:38,412 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 238 [2018-07-23 15:22:38,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:22:38,413 INFO L225 Difference]: With dead ends: 244 [2018-07-23 15:22:38,413 INFO L226 Difference]: Without dead ends: 242 [2018-07-23 15:22:38,414 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=239, Invalid=14281, Unknown=0, NotChecked=0, Total=14520 [2018-07-23 15:22:38,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-07-23 15:22:38,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2018-07-23 15:22:38,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-07-23 15:22:38,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2018-07-23 15:22:38,511 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 238 [2018-07-23 15:22:38,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:22:38,512 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2018-07-23 15:22:38,512 INFO L472 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-07-23 15:22:38,512 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2018-07-23 15:22:38,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-07-23 15:22:38,512 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:22:38,512 INFO L353 BasicCegarLoop]: trace histogram [119, 118, 1, 1, 1] [2018-07-23 15:22:38,513 INFO L414 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:22:38,513 INFO L82 PathProgramCache]: Analyzing trace with hash 188142775, now seen corresponding path program 118 times [2018-07-23 15:22:38,513 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:22:38,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:22:40,296 INFO L134 CoverageAnalysis]: Checked inductivity of 14042 backedges. 0 proven. 14042 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:22:40,297 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:22:40,297 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-07-23 15:22:40,297 INFO L450 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-07-23 15:22:40,297 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-07-23 15:22:40,298 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=14521, Unknown=0, NotChecked=0, Total=14762 [2018-07-23 15:22:40,298 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 122 states. [2018-07-23 15:22:42,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:22:42,716 INFO L93 Difference]: Finished difference Result 246 states and 246 transitions. [2018-07-23 15:22:42,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-07-23 15:22:42,716 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 240 [2018-07-23 15:22:42,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:22:42,717 INFO L225 Difference]: With dead ends: 246 [2018-07-23 15:22:42,717 INFO L226 Difference]: Without dead ends: 244 [2018-07-23 15:22:42,717 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=241, Invalid=14521, Unknown=0, NotChecked=0, Total=14762 [2018-07-23 15:22:42,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-07-23 15:22:42,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 243. [2018-07-23 15:22:42,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-07-23 15:22:42,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 243 transitions. [2018-07-23 15:22:42,817 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 243 transitions. Word has length 240 [2018-07-23 15:22:42,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:22:42,818 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 243 transitions. [2018-07-23 15:22:42,818 INFO L472 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-07-23 15:22:42,818 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 243 transitions. [2018-07-23 15:22:42,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-07-23 15:22:42,818 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:22:42,818 INFO L353 BasicCegarLoop]: trace histogram [120, 119, 1, 1, 1] [2018-07-23 15:22:42,819 INFO L414 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:22:42,819 INFO L82 PathProgramCache]: Analyzing trace with hash 416527041, now seen corresponding path program 119 times [2018-07-23 15:22:42,819 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:22:43,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:22:44,848 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 14280 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:22:44,848 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:22:44,848 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [122] total 122 [2018-07-23 15:22:44,848 INFO L450 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-07-23 15:22:44,849 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-07-23 15:22:44,849 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=14763, Unknown=0, NotChecked=0, Total=15006 [2018-07-23 15:22:44,850 INFO L87 Difference]: Start difference. First operand 243 states and 243 transitions. Second operand 123 states. [2018-07-23 15:22:47,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:22:47,306 INFO L93 Difference]: Finished difference Result 248 states and 248 transitions. [2018-07-23 15:22:47,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-07-23 15:22:47,306 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 242 [2018-07-23 15:22:47,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:22:47,307 INFO L225 Difference]: With dead ends: 248 [2018-07-23 15:22:47,307 INFO L226 Difference]: Without dead ends: 246 [2018-07-23 15:22:47,308 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=243, Invalid=14763, Unknown=0, NotChecked=0, Total=15006 [2018-07-23 15:22:47,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-07-23 15:22:47,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 245. [2018-07-23 15:22:47,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-07-23 15:22:47,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2018-07-23 15:22:47,411 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 242 [2018-07-23 15:22:47,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:22:47,411 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2018-07-23 15:22:47,411 INFO L472 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-07-23 15:22:47,411 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2018-07-23 15:22:47,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-07-23 15:22:47,412 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:22:47,412 INFO L353 BasicCegarLoop]: trace histogram [121, 120, 1, 1, 1] [2018-07-23 15:22:47,412 INFO L414 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:22:47,412 INFO L82 PathProgramCache]: Analyzing trace with hash 850474571, now seen corresponding path program 120 times [2018-07-23 15:22:47,412 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:22:47,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:22:49,534 INFO L134 CoverageAnalysis]: Checked inductivity of 14520 backedges. 0 proven. 14520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:22:49,534 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:22:49,534 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-07-23 15:22:49,535 INFO L450 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-07-23 15:22:49,535 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-07-23 15:22:49,536 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=15007, Unknown=0, NotChecked=0, Total=15252 [2018-07-23 15:22:49,536 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 124 states. [2018-07-23 15:22:52,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:22:52,195 INFO L93 Difference]: Finished difference Result 250 states and 250 transitions. [2018-07-23 15:22:52,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-07-23 15:22:52,196 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 244 [2018-07-23 15:22:52,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:22:52,197 INFO L225 Difference]: With dead ends: 250 [2018-07-23 15:22:52,197 INFO L226 Difference]: Without dead ends: 248 [2018-07-23 15:22:52,198 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=245, Invalid=15007, Unknown=0, NotChecked=0, Total=15252 [2018-07-23 15:22:52,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-07-23 15:22:52,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 247. [2018-07-23 15:22:52,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-07-23 15:22:52,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 247 transitions. [2018-07-23 15:22:52,290 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 247 transitions. Word has length 244 [2018-07-23 15:22:52,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:22:52,291 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 247 transitions. [2018-07-23 15:22:52,291 INFO L472 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-07-23 15:22:52,291 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 247 transitions. [2018-07-23 15:22:52,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-07-23 15:22:52,291 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:22:52,291 INFO L353 BasicCegarLoop]: trace histogram [122, 121, 1, 1, 1] [2018-07-23 15:22:52,292 INFO L414 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:22:52,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1262223189, now seen corresponding path program 121 times [2018-07-23 15:22:52,292 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:22:52,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:22:54,076 INFO L134 CoverageAnalysis]: Checked inductivity of 14762 backedges. 0 proven. 14762 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:22:54,077 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:22:54,077 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [124] total 124 [2018-07-23 15:22:54,077 INFO L450 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-07-23 15:22:54,077 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-07-23 15:22:54,078 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=15253, Unknown=0, NotChecked=0, Total=15500 [2018-07-23 15:22:54,078 INFO L87 Difference]: Start difference. First operand 247 states and 247 transitions. Second operand 125 states. [2018-07-23 15:22:56,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:22:56,600 INFO L93 Difference]: Finished difference Result 252 states and 252 transitions. [2018-07-23 15:22:56,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-07-23 15:22:56,600 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 246 [2018-07-23 15:22:56,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:22:56,601 INFO L225 Difference]: With dead ends: 252 [2018-07-23 15:22:56,601 INFO L226 Difference]: Without dead ends: 250 [2018-07-23 15:22:56,601 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=247, Invalid=15253, Unknown=0, NotChecked=0, Total=15500 [2018-07-23 15:22:56,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-07-23 15:22:56,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2018-07-23 15:22:56,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-07-23 15:22:56,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2018-07-23 15:22:56,706 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 246 [2018-07-23 15:22:56,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:22:56,706 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2018-07-23 15:22:56,706 INFO L472 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-07-23 15:22:56,706 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2018-07-23 15:22:56,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-07-23 15:22:56,707 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:22:56,707 INFO L353 BasicCegarLoop]: trace histogram [123, 122, 1, 1, 1] [2018-07-23 15:22:56,707 INFO L414 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:22:56,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1815653855, now seen corresponding path program 122 times [2018-07-23 15:22:56,707 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:22:57,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:22:58,957 INFO L134 CoverageAnalysis]: Checked inductivity of 15006 backedges. 0 proven. 15006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:22:58,957 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:22:58,958 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-07-23 15:22:58,958 INFO L450 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-07-23 15:22:58,958 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-07-23 15:22:58,959 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=15501, Unknown=0, NotChecked=0, Total=15750 [2018-07-23 15:22:58,959 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 126 states. [2018-07-23 15:23:01,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:23:01,440 INFO L93 Difference]: Finished difference Result 254 states and 254 transitions. [2018-07-23 15:23:01,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-07-23 15:23:01,440 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 248 [2018-07-23 15:23:01,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:23:01,441 INFO L225 Difference]: With dead ends: 254 [2018-07-23 15:23:01,441 INFO L226 Difference]: Without dead ends: 252 [2018-07-23 15:23:01,442 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=249, Invalid=15501, Unknown=0, NotChecked=0, Total=15750 [2018-07-23 15:23:01,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-07-23 15:23:01,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 251. [2018-07-23 15:23:01,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-07-23 15:23:01,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2018-07-23 15:23:01,550 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 248 [2018-07-23 15:23:01,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:23:01,550 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2018-07-23 15:23:01,551 INFO L472 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-07-23 15:23:01,551 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2018-07-23 15:23:01,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-07-23 15:23:01,552 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:23:01,552 INFO L353 BasicCegarLoop]: trace histogram [124, 123, 1, 1, 1] [2018-07-23 15:23:01,552 INFO L414 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:23:01,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1086579177, now seen corresponding path program 123 times [2018-07-23 15:23:01,552 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:23:01,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:23:03,712 INFO L134 CoverageAnalysis]: Checked inductivity of 15252 backedges. 0 proven. 15252 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:23:03,713 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:23:03,713 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [126] total 126 [2018-07-23 15:23:03,713 INFO L450 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-07-23 15:23:03,713 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-07-23 15:23:03,714 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=15751, Unknown=0, NotChecked=0, Total=16002 [2018-07-23 15:23:03,714 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 127 states. [2018-07-23 15:23:06,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:23:06,344 INFO L93 Difference]: Finished difference Result 256 states and 256 transitions. [2018-07-23 15:23:06,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-07-23 15:23:06,344 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 250 [2018-07-23 15:23:06,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:23:06,345 INFO L225 Difference]: With dead ends: 256 [2018-07-23 15:23:06,345 INFO L226 Difference]: Without dead ends: 254 [2018-07-23 15:23:06,346 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=251, Invalid=15751, Unknown=0, NotChecked=0, Total=16002 [2018-07-23 15:23:06,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-07-23 15:23:06,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 253. [2018-07-23 15:23:06,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-07-23 15:23:06,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2018-07-23 15:23:06,454 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 250 [2018-07-23 15:23:06,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:23:06,454 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2018-07-23 15:23:06,454 INFO L472 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-07-23 15:23:06,454 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2018-07-23 15:23:06,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-07-23 15:23:06,455 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:23:06,455 INFO L353 BasicCegarLoop]: trace histogram [125, 124, 1, 1, 1] [2018-07-23 15:23:06,455 INFO L414 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:23:06,455 INFO L82 PathProgramCache]: Analyzing trace with hash 525482867, now seen corresponding path program 124 times [2018-07-23 15:23:06,455 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:23:06,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:23:08,597 INFO L134 CoverageAnalysis]: Checked inductivity of 15500 backedges. 0 proven. 15500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:23:08,598 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:23:08,598 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-07-23 15:23:08,598 INFO L450 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-07-23 15:23:08,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-07-23 15:23:08,599 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=16003, Unknown=0, NotChecked=0, Total=16256 [2018-07-23 15:23:08,599 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 128 states. [2018-07-23 15:23:11,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:23:11,218 INFO L93 Difference]: Finished difference Result 258 states and 258 transitions. [2018-07-23 15:23:11,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-07-23 15:23:11,218 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 252 [2018-07-23 15:23:11,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:23:11,219 INFO L225 Difference]: With dead ends: 258 [2018-07-23 15:23:11,219 INFO L226 Difference]: Without dead ends: 256 [2018-07-23 15:23:11,219 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=253, Invalid=16003, Unknown=0, NotChecked=0, Total=16256 [2018-07-23 15:23:11,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-07-23 15:23:11,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 255. [2018-07-23 15:23:11,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-07-23 15:23:11,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 255 transitions. [2018-07-23 15:23:11,332 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 255 transitions. Word has length 252 [2018-07-23 15:23:11,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:23:11,332 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 255 transitions. [2018-07-23 15:23:11,332 INFO L472 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-07-23 15:23:11,332 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 255 transitions. [2018-07-23 15:23:11,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-07-23 15:23:11,333 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:23:11,333 INFO L353 BasicCegarLoop]: trace histogram [126, 125, 1, 1, 1] [2018-07-23 15:23:11,333 INFO L414 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:23:11,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1817159043, now seen corresponding path program 125 times [2018-07-23 15:23:11,334 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:23:11,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:23:13,636 INFO L134 CoverageAnalysis]: Checked inductivity of 15750 backedges. 0 proven. 15750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:23:13,636 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:23:13,636 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [128] total 128 [2018-07-23 15:23:13,637 INFO L450 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-07-23 15:23:13,637 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-07-23 15:23:13,638 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=16257, Unknown=0, NotChecked=0, Total=16512 [2018-07-23 15:23:13,638 INFO L87 Difference]: Start difference. First operand 255 states and 255 transitions. Second operand 129 states. [2018-07-23 15:23:16,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:23:16,346 INFO L93 Difference]: Finished difference Result 260 states and 260 transitions. [2018-07-23 15:23:16,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-07-23 15:23:16,346 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 254 [2018-07-23 15:23:16,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:23:16,347 INFO L225 Difference]: With dead ends: 260 [2018-07-23 15:23:16,347 INFO L226 Difference]: Without dead ends: 258 [2018-07-23 15:23:16,348 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=255, Invalid=16257, Unknown=0, NotChecked=0, Total=16512 [2018-07-23 15:23:16,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-07-23 15:23:16,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2018-07-23 15:23:16,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-07-23 15:23:16,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2018-07-23 15:23:16,460 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 254 [2018-07-23 15:23:16,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:23:16,461 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2018-07-23 15:23:16,461 INFO L472 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-07-23 15:23:16,461 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2018-07-23 15:23:16,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-07-23 15:23:16,462 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:23:16,462 INFO L353 BasicCegarLoop]: trace histogram [127, 126, 1, 1, 1] [2018-07-23 15:23:16,462 INFO L414 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:23:16,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1761795847, now seen corresponding path program 126 times [2018-07-23 15:23:16,463 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:23:16,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:23:18,695 INFO L134 CoverageAnalysis]: Checked inductivity of 16002 backedges. 0 proven. 16002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:23:18,695 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:23:18,696 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-07-23 15:23:18,696 INFO L450 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-07-23 15:23:18,696 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-07-23 15:23:18,696 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=16513, Unknown=0, NotChecked=0, Total=16770 [2018-07-23 15:23:18,697 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 130 states. [2018-07-23 15:23:21,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:23:21,468 INFO L93 Difference]: Finished difference Result 262 states and 262 transitions. [2018-07-23 15:23:21,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-07-23 15:23:21,468 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 256 [2018-07-23 15:23:21,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:23:21,469 INFO L225 Difference]: With dead ends: 262 [2018-07-23 15:23:21,469 INFO L226 Difference]: Without dead ends: 260 [2018-07-23 15:23:21,469 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 1 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-23 15:23:21,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-07-23 15:23:21,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 259. [2018-07-23 15:23:21,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-07-23 15:23:21,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 259 transitions. [2018-07-23 15:23:21,586 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 259 transitions. Word has length 256 [2018-07-23 15:23:21,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:23:21,587 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 259 transitions. [2018-07-23 15:23:21,587 INFO L472 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-07-23 15:23:21,587 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 259 transitions. [2018-07-23 15:23:21,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-07-23 15:23:21,588 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:23:21,588 INFO L353 BasicCegarLoop]: trace histogram [128, 127, 1, 1, 1] [2018-07-23 15:23:21,588 INFO L414 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:23:21,588 INFO L82 PathProgramCache]: Analyzing trace with hash 868641041, now seen corresponding path program 127 times [2018-07-23 15:23:21,589 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:23:22,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:23:23,919 INFO L134 CoverageAnalysis]: Checked inductivity of 16256 backedges. 0 proven. 16256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:23:23,919 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:23:23,920 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [130] total 130 [2018-07-23 15:23:23,920 INFO L450 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-07-23 15:23:23,920 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-07-23 15:23:23,922 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=16771, Unknown=0, NotChecked=0, Total=17030 [2018-07-23 15:23:23,922 INFO L87 Difference]: Start difference. First operand 259 states and 259 transitions. Second operand 131 states. [2018-07-23 15:23:26,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:23:26,720 INFO L93 Difference]: Finished difference Result 264 states and 264 transitions. [2018-07-23 15:23:26,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-07-23 15:23:26,720 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 258 [2018-07-23 15:23:26,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:23:26,721 INFO L225 Difference]: With dead ends: 264 [2018-07-23 15:23:26,721 INFO L226 Difference]: Without dead ends: 262 [2018-07-23 15:23:26,722 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=259, Invalid=16771, Unknown=0, NotChecked=0, Total=17030 [2018-07-23 15:23:26,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-07-23 15:23:26,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 261. [2018-07-23 15:23:26,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-07-23 15:23:26,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2018-07-23 15:23:26,838 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 258 [2018-07-23 15:23:26,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:23:26,839 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2018-07-23 15:23:26,839 INFO L472 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-07-23 15:23:26,839 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2018-07-23 15:23:26,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-07-23 15:23:26,839 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:23:26,840 INFO L353 BasicCegarLoop]: trace histogram [129, 128, 1, 1, 1] [2018-07-23 15:23:26,840 INFO L414 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:23:26,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1540331675, now seen corresponding path program 128 times [2018-07-23 15:23:26,840 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:23:27,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:23:29,308 INFO L134 CoverageAnalysis]: Checked inductivity of 16512 backedges. 0 proven. 16512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:23:29,309 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:23:29,309 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-07-23 15:23:29,309 INFO L450 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-07-23 15:23:29,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-07-23 15:23:29,311 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=17031, Unknown=0, NotChecked=0, Total=17292 [2018-07-23 15:23:29,311 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 132 states. [2018-07-23 15:23:32,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:23:32,334 INFO L93 Difference]: Finished difference Result 266 states and 266 transitions. [2018-07-23 15:23:32,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-07-23 15:23:32,334 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 260 [2018-07-23 15:23:32,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:23:32,335 INFO L225 Difference]: With dead ends: 266 [2018-07-23 15:23:32,335 INFO L226 Difference]: Without dead ends: 264 [2018-07-23 15:23:32,336 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=261, Invalid=17031, Unknown=0, NotChecked=0, Total=17292 [2018-07-23 15:23:32,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-07-23 15:23:32,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 263. [2018-07-23 15:23:32,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-07-23 15:23:32,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 263 transitions. [2018-07-23 15:23:32,469 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 263 transitions. Word has length 260 [2018-07-23 15:23:32,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:23:32,470 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 263 transitions. [2018-07-23 15:23:32,470 INFO L472 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-07-23 15:23:32,470 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 263 transitions. [2018-07-23 15:23:32,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-07-23 15:23:32,471 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:23:32,471 INFO L353 BasicCegarLoop]: trace histogram [130, 129, 1, 1, 1] [2018-07-23 15:23:32,471 INFO L414 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:23:32,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1505030747, now seen corresponding path program 129 times [2018-07-23 15:23:32,471 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:23:32,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:23:34,929 INFO L134 CoverageAnalysis]: Checked inductivity of 16770 backedges. 0 proven. 16770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:23:34,930 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:23:34,930 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [132] total 132 [2018-07-23 15:23:34,930 INFO L450 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-07-23 15:23:34,931 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-07-23 15:23:34,931 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=17293, Unknown=0, NotChecked=0, Total=17556 [2018-07-23 15:23:34,931 INFO L87 Difference]: Start difference. First operand 263 states and 263 transitions. Second operand 133 states. [2018-07-23 15:23:37,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:23:37,821 INFO L93 Difference]: Finished difference Result 268 states and 268 transitions. [2018-07-23 15:23:37,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-07-23 15:23:37,821 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 262 [2018-07-23 15:23:37,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:23:37,822 INFO L225 Difference]: With dead ends: 268 [2018-07-23 15:23:37,822 INFO L226 Difference]: Without dead ends: 266 [2018-07-23 15:23:37,823 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=263, Invalid=17293, Unknown=0, NotChecked=0, Total=17556 [2018-07-23 15:23:37,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-07-23 15:23:37,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2018-07-23 15:23:37,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-07-23 15:23:37,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2018-07-23 15:23:37,940 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 262 [2018-07-23 15:23:37,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:23:37,940 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2018-07-23 15:23:37,940 INFO L472 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-07-23 15:23:37,941 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2018-07-23 15:23:37,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-07-23 15:23:37,941 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:23:37,941 INFO L353 BasicCegarLoop]: trace histogram [131, 130, 1, 1, 1] [2018-07-23 15:23:37,941 INFO L414 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:23:37,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1069377583, now seen corresponding path program 130 times [2018-07-23 15:23:37,942 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:23:38,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:23:40,239 INFO L134 CoverageAnalysis]: Checked inductivity of 17030 backedges. 0 proven. 17030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:23:40,239 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:23:40,239 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-07-23 15:23:40,239 INFO L450 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-07-23 15:23:40,240 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-07-23 15:23:40,240 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=17557, Unknown=0, NotChecked=0, Total=17822 [2018-07-23 15:23:40,240 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 134 states. [2018-07-23 15:23:43,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:23:43,120 INFO L93 Difference]: Finished difference Result 270 states and 270 transitions. [2018-07-23 15:23:43,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-07-23 15:23:43,120 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 264 [2018-07-23 15:23:43,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:23:43,121 INFO L225 Difference]: With dead ends: 270 [2018-07-23 15:23:43,121 INFO L226 Difference]: Without dead ends: 268 [2018-07-23 15:23:43,122 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=265, Invalid=17557, Unknown=0, NotChecked=0, Total=17822 [2018-07-23 15:23:43,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-07-23 15:23:43,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 267. [2018-07-23 15:23:43,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-07-23 15:23:43,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 267 transitions. [2018-07-23 15:23:43,242 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 267 transitions. Word has length 264 [2018-07-23 15:23:43,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:23:43,243 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 267 transitions. [2018-07-23 15:23:43,243 INFO L472 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-07-23 15:23:43,243 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 267 transitions. [2018-07-23 15:23:43,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-07-23 15:23:43,244 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:23:43,244 INFO L353 BasicCegarLoop]: trace histogram [132, 131, 1, 1, 1] [2018-07-23 15:23:43,244 INFO L414 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:23:43,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1174620217, now seen corresponding path program 131 times [2018-07-23 15:23:43,244 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:23:43,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-07-23 15:23:44,840 WARN L540 AbstractCegarLoop]: Verification canceled [2018-07-23 15:23:44,844 WARN L202 ceAbstractionStarter]: Timeout [2018-07-23 15:23:44,845 INFO L202 PluginConnector]: Adding new model jain_5.i_2.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 03:23:44 BoogieIcfgContainer [2018-07-23 15:23:44,845 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-23 15:23:44,846 INFO L168 Benchmark]: Toolchain (without parser) took 256848.19 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 3.3 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-07-23 15:23:44,847 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 15:23:44,847 INFO L168 Benchmark]: Boogie Preprocessor took 52.87 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 15:23:44,848 INFO L168 Benchmark]: RCFGBuilder took 326.47 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-23 15:23:44,848 INFO L168 Benchmark]: TraceAbstraction took 256462.90 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 3.3 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-07-23 15:23:44,851 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.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 52.87 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 326.47 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 256462.90 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 3.3 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 45]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 45). Cancelled while BasicCegarLoop was analyzing trace of length 267 with TraceHistMax 132, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 265 interpolants. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. TIMEOUT Result, 256.3s OverallTime, 132 OverallIterations, 132 TraceHistogramMax, 144.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9039 SDtfs, 131 SDslu, 758359 SDs, 0 SdLazy, 801328 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 106.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8908 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 8777 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 43.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=267occurred in iteration=131, 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: 6.4s AutomataMinimizationTime, 131 MinimizatonAttempts, 131 StatesRemovedByMinimization, 131 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 17.0s SatisfiabilityAnalysisTime, 81.6s InterpolantComputationTime, 17554 NumberOfCodeBlocks, 17554 NumberOfCodeBlocksAsserted, 131 NumberOfCheckSat, 17423 ConstructedInterpolants, 0 QuantifiedInterpolants, 21222137 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 131 InterpolantComputations, 1 PerfectInterpolantSequences, 0/749320 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/jain_5.i_2.bplTransformedIcfg_BEv2_4.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-07-23_15-23-44-863.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/jain_5.i_2.bplTransformedIcfg_BEv2_4.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-23_15-23-44-863.csv Completed graceful shutdown