java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplTransformed.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20181015-LoopsPathprograms/phases_false-unreach-call1.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2d08e6e [2018-10-15 13:07:01,830 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 13:07:01,832 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 13:07:01,849 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 13:07:01,850 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 13:07:01,852 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 13:07:01,853 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 13:07:01,856 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 13:07:01,859 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 13:07:01,861 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 13:07:01,863 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 13:07:01,863 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 13:07:01,864 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 13:07:01,867 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 13:07:01,874 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 13:07:01,877 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 13:07:01,877 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 13:07:01,881 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 13:07:01,883 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 13:07:01,887 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 13:07:01,888 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 13:07:01,890 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 13:07:01,895 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 13:07:01,896 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 13:07:01,896 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 13:07:01,897 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 13:07:01,898 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 13:07:01,898 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 13:07:01,899 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 13:07:01,902 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 13:07:01,902 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 13:07:01,903 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 13:07:01,904 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 13:07:01,904 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 13:07:01,905 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 13:07:01,905 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 13:07:01,906 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-15 13:07:01,919 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 13:07:01,920 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 13:07:01,921 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 13:07:01,921 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 13:07:01,921 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 13:07:01,922 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 13:07:01,922 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 13:07:01,922 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 13:07:01,925 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 13:07:01,925 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 13:07:01,925 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 13:07:01,926 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 13:07:01,926 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 13:07:01,927 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 13:07:01,927 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 13:07:01,979 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 13:07:01,996 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 13:07:02,003 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 13:07:02,005 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 13:07:02,006 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 13:07:02,006 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/phases_false-unreach-call1.i_3.bpl [2018-10-15 13:07:02,007 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/phases_false-unreach-call1.i_3.bpl' [2018-10-15 13:07:02,054 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 13:07:02,056 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-15 13:07:02,056 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 13:07:02,056 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 13:07:02,057 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 13:07:02,084 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "phases_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:07:02" (1/1) ... [2018-10-15 13:07:02,086 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "phases_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:07:02" (1/1) ... [2018-10-15 13:07:02,096 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "phases_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:07:02" (1/1) ... [2018-10-15 13:07:02,096 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "phases_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:07:02" (1/1) ... [2018-10-15 13:07:02,099 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "phases_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:07:02" (1/1) ... [2018-10-15 13:07:02,101 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "phases_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:07:02" (1/1) ... [2018-10-15 13:07:02,101 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "phases_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:07:02" (1/1) ... [2018-10-15 13:07:02,103 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 13:07:02,104 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 13:07:02,104 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 13:07:02,104 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 13:07:02,105 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "phases_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:07:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-15 13:07:02,168 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-15 13:07:02,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 13:07:02,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 13:07:02,401 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 13:07:02,402 INFO L202 PluginConnector]: Adding new model phases_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:07:02 BoogieIcfgContainer [2018-10-15 13:07:02,402 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 13:07:02,403 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-15 13:07:02,403 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-15 13:07:02,404 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-15 13:07:02,408 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "phases_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:07:02" (1/1) ... [2018-10-15 13:07:02,413 WARN L219 ansformationObserver]: HeapSeparator: input icfg has no '#valid' array -- returning unchanged Icfg! [2018-10-15 13:07:02,430 INFO L202 PluginConnector]: Adding new model phases_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 01:07:02 BasicIcfg [2018-10-15 13:07:02,430 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-15 13:07:02,432 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 13:07:02,432 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 13:07:02,435 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 13:07:02,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "phases_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:07:02" (1/3) ... [2018-10-15 13:07:02,437 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20a76283 and model type phases_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:07:02, skipping insertion in model container [2018-10-15 13:07:02,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "phases_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:07:02" (2/3) ... [2018-10-15 13:07:02,437 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20a76283 and model type phases_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 01:07:02, skipping insertion in model container [2018-10-15 13:07:02,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "phases_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 01:07:02" (3/3) ... [2018-10-15 13:07:02,439 INFO L112 eAbstractionObserver]: Analyzing ICFG phases_false-unreach-call1.i_3.bplleft_unchanged_by_heapseparator [2018-10-15 13:07:02,450 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 13:07:02,459 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 13:07:02,477 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 13:07:02,509 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 13:07:02,510 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 13:07:02,510 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 13:07:02,510 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 13:07:02,510 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 13:07:02,510 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 13:07:02,511 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 13:07:02,511 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 13:07:02,511 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 13:07:02,526 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-10-15 13:07:02,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-15 13:07:02,544 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:02,545 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:02,547 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:02,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:02,554 INFO L82 PathProgramCache]: Analyzing trace with hash 600124808, now seen corresponding path program 1 times [2018-10-15 13:07:02,623 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:02,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:02,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:02,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 13:07:02,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 13:07:02,856 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 13:07:02,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 13:07:02,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 13:07:02,887 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2018-10-15 13:07:02,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:02,997 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-10-15 13:07:02,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 13:07:03,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-10-15 13:07:03,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:03,012 INFO L225 Difference]: With dead ends: 19 [2018-10-15 13:07:03,012 INFO L226 Difference]: Without dead ends: 19 [2018-10-15 13:07:03,014 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 13:07:03,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-15 13:07:03,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2018-10-15 13:07:03,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-15 13:07:03,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-10-15 13:07:03,043 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 10 [2018-10-15 13:07:03,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:03,044 INFO L481 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-10-15 13:07:03,044 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 13:07:03,044 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-10-15 13:07:03,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-15 13:07:03,044 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:03,045 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:03,045 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:03,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:03,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1880928361, now seen corresponding path program 1 times [2018-10-15 13:07:03,046 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:03,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:03,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:03,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:03,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-15 13:07:03,179 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 13:07:03,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 13:07:03,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-15 13:07:03,180 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 5 states. [2018-10-15 13:07:03,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:03,386 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-10-15 13:07:03,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-15 13:07:03,388 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-10-15 13:07:03,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:03,388 INFO L225 Difference]: With dead ends: 24 [2018-10-15 13:07:03,389 INFO L226 Difference]: Without dead ends: 24 [2018-10-15 13:07:03,390 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-15 13:07:03,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-15 13:07:03,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2018-10-15 13:07:03,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-15 13:07:03,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-10-15 13:07:03,395 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 15 [2018-10-15 13:07:03,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:03,396 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-10-15 13:07:03,396 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 13:07:03,396 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-10-15 13:07:03,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-15 13:07:03,397 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:03,397 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:03,397 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:03,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:03,398 INFO L82 PathProgramCache]: Analyzing trace with hash 618864360, now seen corresponding path program 2 times [2018-10-15 13:07:03,399 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:03,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:03,757 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:03,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:03,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-15 13:07:03,758 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 13:07:03,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 13:07:03,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-15 13:07:03,759 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 7 states. [2018-10-15 13:07:04,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:04,081 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-10-15 13:07:04,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-15 13:07:04,083 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-10-15 13:07:04,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:04,084 INFO L225 Difference]: With dead ends: 29 [2018-10-15 13:07:04,085 INFO L226 Difference]: Without dead ends: 29 [2018-10-15 13:07:04,085 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-10-15 13:07:04,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-15 13:07:04,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2018-10-15 13:07:04,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-15 13:07:04,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-10-15 13:07:04,091 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 20 [2018-10-15 13:07:04,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:04,091 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-10-15 13:07:04,091 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 13:07:04,092 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-10-15 13:07:04,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-15 13:07:04,093 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:04,093 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:04,094 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:04,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:04,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1666893257, now seen corresponding path program 3 times [2018-10-15 13:07:04,095 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:04,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:04,418 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:04,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:04,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 13:07:04,419 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 13:07:04,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 13:07:04,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-15 13:07:04,421 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 9 states. [2018-10-15 13:07:05,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:05,063 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-10-15 13:07:05,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-15 13:07:05,065 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-10-15 13:07:05,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:05,066 INFO L225 Difference]: With dead ends: 34 [2018-10-15 13:07:05,066 INFO L226 Difference]: Without dead ends: 34 [2018-10-15 13:07:05,067 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-10-15 13:07:05,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-15 13:07:05,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2018-10-15 13:07:05,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-15 13:07:05,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-10-15 13:07:05,072 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 25 [2018-10-15 13:07:05,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:05,073 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-10-15 13:07:05,073 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 13:07:05,073 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-10-15 13:07:05,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-15 13:07:05,074 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:05,074 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:05,075 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:05,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:05,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1204475976, now seen corresponding path program 4 times [2018-10-15 13:07:05,076 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:05,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:05,351 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:05,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:05,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 13:07:05,352 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 13:07:05,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 13:07:05,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-10-15 13:07:05,354 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 11 states. [2018-10-15 13:07:05,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:05,789 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-10-15 13:07:05,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-15 13:07:05,791 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-10-15 13:07:05,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:05,793 INFO L225 Difference]: With dead ends: 39 [2018-10-15 13:07:05,793 INFO L226 Difference]: Without dead ends: 39 [2018-10-15 13:07:05,794 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-10-15 13:07:05,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-15 13:07:05,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-10-15 13:07:05,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-15 13:07:05,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-10-15 13:07:05,799 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 30 [2018-10-15 13:07:05,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:05,799 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-10-15 13:07:05,800 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 13:07:05,800 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-10-15 13:07:05,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-15 13:07:05,801 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:05,801 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:05,801 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:05,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:05,802 INFO L82 PathProgramCache]: Analyzing trace with hash -2038801193, now seen corresponding path program 5 times [2018-10-15 13:07:05,803 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:05,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:06,112 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:06,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:06,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 13:07:06,113 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 13:07:06,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 13:07:06,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-10-15 13:07:06,114 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 13 states. [2018-10-15 13:07:07,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:07,141 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-10-15 13:07:07,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-15 13:07:07,141 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 35 [2018-10-15 13:07:07,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:07,142 INFO L225 Difference]: With dead ends: 44 [2018-10-15 13:07:07,142 INFO L226 Difference]: Without dead ends: 44 [2018-10-15 13:07:07,143 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-10-15 13:07:07,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-15 13:07:07,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2018-10-15 13:07:07,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-15 13:07:07,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-10-15 13:07:07,148 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 35 [2018-10-15 13:07:07,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:07,148 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-10-15 13:07:07,149 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 13:07:07,149 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-10-15 13:07:07,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-15 13:07:07,150 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:07,150 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:07,150 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:07,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:07,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1357011368, now seen corresponding path program 6 times [2018-10-15 13:07:07,152 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:07,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:07,442 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:07,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:07,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 13:07:07,443 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 13:07:07,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 13:07:07,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-10-15 13:07:07,444 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 15 states. [2018-10-15 13:07:08,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:08,129 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-10-15 13:07:08,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-15 13:07:08,130 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2018-10-15 13:07:08,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:08,131 INFO L225 Difference]: With dead ends: 49 [2018-10-15 13:07:08,132 INFO L226 Difference]: Without dead ends: 49 [2018-10-15 13:07:08,133 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2018-10-15 13:07:08,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-15 13:07:08,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-10-15 13:07:08,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-15 13:07:08,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-10-15 13:07:08,137 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 40 [2018-10-15 13:07:08,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:08,138 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-10-15 13:07:08,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 13:07:08,138 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-10-15 13:07:08,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-15 13:07:08,139 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:08,140 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:08,140 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:08,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:08,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1488762743, now seen corresponding path program 7 times [2018-10-15 13:07:08,141 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:08,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:08,558 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:08,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:08,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 13:07:08,559 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 13:07:08,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 13:07:08,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-10-15 13:07:08,560 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 17 states. [2018-10-15 13:07:09,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:09,356 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-10-15 13:07:09,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-15 13:07:09,357 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 45 [2018-10-15 13:07:09,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:09,358 INFO L225 Difference]: With dead ends: 54 [2018-10-15 13:07:09,358 INFO L226 Difference]: Without dead ends: 54 [2018-10-15 13:07:09,359 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2018-10-15 13:07:09,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-15 13:07:09,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2018-10-15 13:07:09,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-15 13:07:09,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-10-15 13:07:09,364 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 45 [2018-10-15 13:07:09,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:09,365 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-10-15 13:07:09,365 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 13:07:09,365 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-10-15 13:07:09,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-15 13:07:09,366 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:09,367 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:09,367 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:09,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:09,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1024434952, now seen corresponding path program 8 times [2018-10-15 13:07:09,368 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:09,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:09,787 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:09,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:09,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 13:07:09,788 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 13:07:09,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 13:07:09,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-10-15 13:07:09,789 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 19 states. [2018-10-15 13:07:10,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:10,630 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-10-15 13:07:10,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-15 13:07:10,632 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 50 [2018-10-15 13:07:10,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:10,633 INFO L225 Difference]: With dead ends: 59 [2018-10-15 13:07:10,634 INFO L226 Difference]: Without dead ends: 59 [2018-10-15 13:07:10,635 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 13:07:10,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-15 13:07:10,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2018-10-15 13:07:10,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-15 13:07:10,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-10-15 13:07:10,640 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 50 [2018-10-15 13:07:10,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:10,640 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-10-15 13:07:10,640 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 13:07:10,640 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-10-15 13:07:10,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-15 13:07:10,642 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:10,642 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:10,642 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:10,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:10,642 INFO L82 PathProgramCache]: Analyzing trace with hash 910576151, now seen corresponding path program 9 times [2018-10-15 13:07:10,643 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:10,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:11,655 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:11,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:11,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 13:07:11,656 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 13:07:11,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 13:07:11,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-10-15 13:07:11,657 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 21 states. [2018-10-15 13:07:12,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:12,753 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-10-15 13:07:12,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-15 13:07:12,753 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 55 [2018-10-15 13:07:12,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:12,755 INFO L225 Difference]: With dead ends: 64 [2018-10-15 13:07:12,755 INFO L226 Difference]: Without dead ends: 64 [2018-10-15 13:07:12,757 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 13:07:12,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-10-15 13:07:12,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2018-10-15 13:07:12,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-15 13:07:12,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-10-15 13:07:12,763 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 55 [2018-10-15 13:07:12,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:12,763 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-10-15 13:07:12,764 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 13:07:12,764 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-10-15 13:07:12,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-15 13:07:12,765 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:12,765 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:12,765 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:12,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:12,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1581730712, now seen corresponding path program 10 times [2018-10-15 13:07:12,766 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:12,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:13,507 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:13,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:13,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 13:07:13,508 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 13:07:13,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 13:07:13,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-10-15 13:07:13,509 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 23 states. [2018-10-15 13:07:15,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:15,187 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-10-15 13:07:15,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-15 13:07:15,196 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 60 [2018-10-15 13:07:15,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:15,197 INFO L225 Difference]: With dead ends: 69 [2018-10-15 13:07:15,197 INFO L226 Difference]: Without dead ends: 69 [2018-10-15 13:07:15,198 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 13:07:15,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-15 13:07:15,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2018-10-15 13:07:15,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-10-15 13:07:15,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-10-15 13:07:15,209 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 60 [2018-10-15 13:07:15,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:15,209 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-10-15 13:07:15,209 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 13:07:15,209 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-10-15 13:07:15,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-15 13:07:15,210 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:15,211 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:15,211 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:15,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:15,212 INFO L82 PathProgramCache]: Analyzing trace with hash -110029641, now seen corresponding path program 11 times [2018-10-15 13:07:15,212 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:15,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:15,944 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 0 proven. 286 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:15,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:15,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 13:07:15,944 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 13:07:15,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 13:07:15,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-10-15 13:07:15,945 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 25 states. [2018-10-15 13:07:17,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:17,337 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-10-15 13:07:17,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-15 13:07:17,340 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 65 [2018-10-15 13:07:17,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:17,341 INFO L225 Difference]: With dead ends: 74 [2018-10-15 13:07:17,341 INFO L226 Difference]: Without dead ends: 74 [2018-10-15 13:07:17,342 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=135, Invalid=2027, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 13:07:17,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-15 13:07:17,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2018-10-15 13:07:17,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-10-15 13:07:17,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-10-15 13:07:17,347 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 65 [2018-10-15 13:07:17,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:17,347 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-10-15 13:07:17,347 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 13:07:17,347 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-10-15 13:07:17,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-15 13:07:17,349 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:17,349 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:17,349 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:17,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:17,350 INFO L82 PathProgramCache]: Analyzing trace with hash 214142408, now seen corresponding path program 12 times [2018-10-15 13:07:17,350 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:17,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:17,934 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:17,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:17,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 13:07:17,934 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 13:07:17,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 13:07:17,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-10-15 13:07:17,935 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 27 states. [2018-10-15 13:07:19,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:19,674 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-10-15 13:07:19,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-15 13:07:19,675 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 70 [2018-10-15 13:07:19,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:19,676 INFO L225 Difference]: With dead ends: 79 [2018-10-15 13:07:19,677 INFO L226 Difference]: Without dead ends: 79 [2018-10-15 13:07:19,678 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=147, Invalid=2403, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 13:07:19,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-15 13:07:19,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2018-10-15 13:07:19,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-15 13:07:19,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-10-15 13:07:19,682 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 70 [2018-10-15 13:07:19,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:19,683 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-10-15 13:07:19,683 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 13:07:19,683 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-10-15 13:07:19,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-15 13:07:19,684 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:19,684 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:19,685 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:19,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:19,685 INFO L82 PathProgramCache]: Analyzing trace with hash -736684201, now seen corresponding path program 13 times [2018-10-15 13:07:19,686 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:19,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:20,387 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 0 proven. 403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:20,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:20,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 13:07:20,388 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 13:07:20,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 13:07:20,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-10-15 13:07:20,388 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 29 states. [2018-10-15 13:07:22,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:22,143 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-10-15 13:07:22,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-15 13:07:22,144 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 75 [2018-10-15 13:07:22,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:22,145 INFO L225 Difference]: With dead ends: 84 [2018-10-15 13:07:22,145 INFO L226 Difference]: Without dead ends: 84 [2018-10-15 13:07:22,147 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=159, Invalid=2811, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 13:07:22,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-10-15 13:07:22,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2018-10-15 13:07:22,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-10-15 13:07:22,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-10-15 13:07:22,152 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 75 [2018-10-15 13:07:22,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:22,152 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-10-15 13:07:22,152 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 13:07:22,152 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-10-15 13:07:22,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-15 13:07:22,154 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:22,154 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:22,154 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:22,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:22,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1687564072, now seen corresponding path program 14 times [2018-10-15 13:07:22,155 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:22,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:22,900 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 0 proven. 469 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:22,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:22,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 13:07:22,901 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 13:07:22,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 13:07:22,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-10-15 13:07:22,902 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 31 states. [2018-10-15 13:07:25,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:25,094 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-10-15 13:07:25,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-15 13:07:25,094 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 80 [2018-10-15 13:07:25,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:25,095 INFO L225 Difference]: With dead ends: 89 [2018-10-15 13:07:25,096 INFO L226 Difference]: Without dead ends: 89 [2018-10-15 13:07:25,098 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=171, Invalid=3251, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 13:07:25,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-10-15 13:07:25,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2018-10-15 13:07:25,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-10-15 13:07:25,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-10-15 13:07:25,102 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 80 [2018-10-15 13:07:25,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:25,102 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-10-15 13:07:25,103 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 13:07:25,103 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-10-15 13:07:25,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-15 13:07:25,104 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:25,104 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:25,104 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:25,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:25,105 INFO L82 PathProgramCache]: Analyzing trace with hash -275623433, now seen corresponding path program 15 times [2018-10-15 13:07:25,105 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:25,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:25,983 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 0 proven. 540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:25,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:25,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 13:07:25,984 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 13:07:25,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 13:07:25,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 13:07:25,985 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 33 states. [2018-10-15 13:07:28,015 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-15 13:07:28,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:28,432 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-10-15 13:07:28,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-15 13:07:28,436 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 85 [2018-10-15 13:07:28,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:28,437 INFO L225 Difference]: With dead ends: 94 [2018-10-15 13:07:28,437 INFO L226 Difference]: Without dead ends: 94 [2018-10-15 13:07:28,438 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=183, Invalid=3723, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 13:07:28,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-10-15 13:07:28,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2018-10-15 13:07:28,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-15 13:07:28,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-10-15 13:07:28,449 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 85 [2018-10-15 13:07:28,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:28,450 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-10-15 13:07:28,450 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 13:07:28,450 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-10-15 13:07:28,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-15 13:07:28,454 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:28,454 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:28,455 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:28,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:28,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1209440392, now seen corresponding path program 16 times [2018-10-15 13:07:28,456 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:28,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:30,055 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 0 proven. 616 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:30,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:30,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 13:07:30,056 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 13:07:30,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 13:07:30,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 13:07:30,057 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 35 states. [2018-10-15 13:07:32,191 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-15 13:07:32,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:32,968 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-10-15 13:07:32,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-15 13:07:32,971 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 90 [2018-10-15 13:07:32,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:32,972 INFO L225 Difference]: With dead ends: 99 [2018-10-15 13:07:32,972 INFO L226 Difference]: Without dead ends: 99 [2018-10-15 13:07:32,975 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=195, Invalid=4227, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 13:07:32,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-10-15 13:07:32,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2018-10-15 13:07:32,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-10-15 13:07:32,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-10-15 13:07:32,978 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 90 [2018-10-15 13:07:32,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:32,978 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-10-15 13:07:32,978 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 13:07:32,978 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-10-15 13:07:32,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-15 13:07:32,979 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:32,980 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:32,980 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:32,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:32,980 INFO L82 PathProgramCache]: Analyzing trace with hash 213697687, now seen corresponding path program 17 times [2018-10-15 13:07:32,981 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:32,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:34,100 INFO L134 CoverageAnalysis]: Checked inductivity of 697 backedges. 0 proven. 697 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:34,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:34,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 13:07:34,101 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 13:07:34,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 13:07:34,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 13:07:34,102 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 37 states. [2018-10-15 13:07:36,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:36,863 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-10-15 13:07:36,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-15 13:07:36,864 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 95 [2018-10-15 13:07:36,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:36,865 INFO L225 Difference]: With dead ends: 104 [2018-10-15 13:07:36,865 INFO L226 Difference]: Without dead ends: 104 [2018-10-15 13:07:36,868 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=207, Invalid=4763, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 13:07:36,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-10-15 13:07:36,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2018-10-15 13:07:36,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-10-15 13:07:36,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-10-15 13:07:36,870 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 95 [2018-10-15 13:07:36,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:36,871 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-10-15 13:07:36,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 13:07:36,871 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-10-15 13:07:36,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-15 13:07:36,871 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:36,871 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:36,872 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:36,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:36,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1856686568, now seen corresponding path program 18 times [2018-10-15 13:07:36,873 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:36,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:37,824 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 0 proven. 783 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:37,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:37,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 13:07:37,825 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 13:07:37,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 13:07:37,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 13:07:37,826 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 39 states. [2018-10-15 13:07:41,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:41,363 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-10-15 13:07:41,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-15 13:07:41,363 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 100 [2018-10-15 13:07:41,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:41,365 INFO L225 Difference]: With dead ends: 109 [2018-10-15 13:07:41,365 INFO L226 Difference]: Without dead ends: 109 [2018-10-15 13:07:41,368 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=219, Invalid=5331, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 13:07:41,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-10-15 13:07:41,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2018-10-15 13:07:41,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-10-15 13:07:41,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-10-15 13:07:41,371 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 100 [2018-10-15 13:07:41,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:41,371 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-10-15 13:07:41,371 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 13:07:41,372 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-10-15 13:07:41,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-10-15 13:07:41,372 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:41,373 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:41,373 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:41,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:41,373 INFO L82 PathProgramCache]: Analyzing trace with hash 602959671, now seen corresponding path program 19 times [2018-10-15 13:07:41,374 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:41,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:42,328 INFO L134 CoverageAnalysis]: Checked inductivity of 874 backedges. 0 proven. 874 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:42,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:42,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 13:07:42,329 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 13:07:42,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 13:07:42,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 13:07:42,330 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 41 states. [2018-10-15 13:07:45,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:45,938 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-10-15 13:07:45,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-15 13:07:45,939 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 105 [2018-10-15 13:07:45,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:45,940 INFO L225 Difference]: With dead ends: 114 [2018-10-15 13:07:45,940 INFO L226 Difference]: Without dead ends: 114 [2018-10-15 13:07:45,943 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=231, Invalid=5931, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 13:07:45,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-10-15 13:07:45,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2018-10-15 13:07:45,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-10-15 13:07:45,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-10-15 13:07:45,946 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 105 [2018-10-15 13:07:45,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:45,946 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-10-15 13:07:45,946 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 13:07:45,946 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-10-15 13:07:45,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-15 13:07:45,947 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:45,947 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:45,947 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:45,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:45,948 INFO L82 PathProgramCache]: Analyzing trace with hash 137937736, now seen corresponding path program 20 times [2018-10-15 13:07:45,948 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:45,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:47,072 INFO L134 CoverageAnalysis]: Checked inductivity of 970 backedges. 0 proven. 970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:47,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:47,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 13:07:47,073 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 13:07:47,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 13:07:47,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 13:07:47,074 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 43 states. [2018-10-15 13:07:51,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:51,067 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-10-15 13:07:51,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-15 13:07:51,068 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 110 [2018-10-15 13:07:51,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:51,069 INFO L225 Difference]: With dead ends: 119 [2018-10-15 13:07:51,069 INFO L226 Difference]: Without dead ends: 119 [2018-10-15 13:07:51,072 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=243, Invalid=6563, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 13:07:51,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-10-15 13:07:51,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2018-10-15 13:07:51,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-10-15 13:07:51,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-10-15 13:07:51,075 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 110 [2018-10-15 13:07:51,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:51,076 INFO L481 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-10-15 13:07:51,076 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 13:07:51,076 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-10-15 13:07:51,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-15 13:07:51,076 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:51,077 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:51,077 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:51,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:51,077 INFO L82 PathProgramCache]: Analyzing trace with hash 84365783, now seen corresponding path program 21 times [2018-10-15 13:07:51,078 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:51,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:52,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1071 backedges. 0 proven. 1071 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:52,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:52,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 13:07:52,753 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 13:07:52,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 13:07:52,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 13:07:52,754 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 45 states. [2018-10-15 13:07:57,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:57,119 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2018-10-15 13:07:57,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-15 13:07:57,122 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 115 [2018-10-15 13:07:57,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:57,123 INFO L225 Difference]: With dead ends: 124 [2018-10-15 13:07:57,123 INFO L226 Difference]: Without dead ends: 124 [2018-10-15 13:07:57,124 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=255, Invalid=7227, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 13:07:57,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-10-15 13:07:57,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 121. [2018-10-15 13:07:57,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-10-15 13:07:57,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-10-15 13:07:57,126 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 115 [2018-10-15 13:07:57,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:57,126 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-10-15 13:07:57,126 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 13:07:57,126 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-10-15 13:07:57,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-15 13:07:57,127 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:57,127 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:57,127 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:57,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:57,128 INFO L82 PathProgramCache]: Analyzing trace with hash 489063592, now seen corresponding path program 22 times [2018-10-15 13:07:57,128 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:57,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:58,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1177 backedges. 0 proven. 1177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:58,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:58,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 13:07:58,281 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 13:07:58,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 13:07:58,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 13:07:58,281 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 47 states. [2018-10-15 13:08:03,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:08:03,065 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-10-15 13:08:03,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-15 13:08:03,066 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 120 [2018-10-15 13:08:03,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:08:03,067 INFO L225 Difference]: With dead ends: 129 [2018-10-15 13:08:03,067 INFO L226 Difference]: Without dead ends: 129 [2018-10-15 13:08:03,069 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=267, Invalid=7923, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 13:08:03,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-10-15 13:08:03,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2018-10-15 13:08:03,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-10-15 13:08:03,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2018-10-15 13:08:03,072 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 120 [2018-10-15 13:08:03,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:08:03,073 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2018-10-15 13:08:03,073 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 13:08:03,073 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2018-10-15 13:08:03,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-15 13:08:03,074 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:08:03,074 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:08:03,074 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:08:03,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:08:03,074 INFO L82 PathProgramCache]: Analyzing trace with hash -145003401, now seen corresponding path program 23 times [2018-10-15 13:08:03,075 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:08:03,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:08:05,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1288 backedges. 0 proven. 1288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:08:05,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:08:05,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 13:08:05,495 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 13:08:05,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 13:08:05,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 13:08:05,496 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 49 states. [2018-10-15 13:08:10,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:08:10,473 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2018-10-15 13:08:10,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-15 13:08:10,473 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 125 [2018-10-15 13:08:10,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:08:10,475 INFO L225 Difference]: With dead ends: 134 [2018-10-15 13:08:10,475 INFO L226 Difference]: Without dead ends: 134 [2018-10-15 13:08:10,476 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=279, Invalid=8651, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 13:08:10,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-10-15 13:08:10,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 131. [2018-10-15 13:08:10,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-10-15 13:08:10,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-10-15 13:08:10,480 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 125 [2018-10-15 13:08:10,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:08:10,480 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-10-15 13:08:10,480 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 13:08:10,481 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-10-15 13:08:10,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-15 13:08:10,481 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:08:10,481 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:08:10,482 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:08:10,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:08:10,482 INFO L82 PathProgramCache]: Analyzing trace with hash -296088056, now seen corresponding path program 24 times [2018-10-15 13:08:10,483 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:08:10,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:08:11,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 1404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:08:11,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:08:11,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 13:08:11,810 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 13:08:11,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 13:08:11,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 13:08:11,811 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 51 states. [2018-10-15 13:08:17,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:08:17,236 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-10-15 13:08:17,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-15 13:08:17,237 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 130 [2018-10-15 13:08:17,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:08:17,239 INFO L225 Difference]: With dead ends: 139 [2018-10-15 13:08:17,239 INFO L226 Difference]: Without dead ends: 139 [2018-10-15 13:08:17,241 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=291, Invalid=9411, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 13:08:17,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-10-15 13:08:17,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2018-10-15 13:08:17,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-10-15 13:08:17,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2018-10-15 13:08:17,244 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 130 [2018-10-15 13:08:17,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:08:17,245 INFO L481 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2018-10-15 13:08:17,245 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 13:08:17,245 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2018-10-15 13:08:17,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-15 13:08:17,245 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:08:17,246 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:08:17,246 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:08:17,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:08:17,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1506197271, now seen corresponding path program 25 times [2018-10-15 13:08:17,247 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:08:17,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:08:18,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1525 backedges. 0 proven. 1525 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:08:18,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:08:18,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 13:08:18,727 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 13:08:18,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 13:08:18,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 13:08:18,728 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 53 states. [2018-10-15 13:08:24,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:08:24,533 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2018-10-15 13:08:24,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-15 13:08:24,536 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 135 [2018-10-15 13:08:24,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:08:24,537 INFO L225 Difference]: With dead ends: 144 [2018-10-15 13:08:24,538 INFO L226 Difference]: Without dead ends: 144 [2018-10-15 13:08:24,539 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=303, Invalid=10203, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 13:08:24,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-10-15 13:08:24,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2018-10-15 13:08:24,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-10-15 13:08:24,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-10-15 13:08:24,542 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 135 [2018-10-15 13:08:24,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:08:24,542 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-10-15 13:08:24,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 13:08:24,542 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-10-15 13:08:24,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-15 13:08:24,543 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:08:24,543 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:08:24,544 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:08:24,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:08:24,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1429823336, now seen corresponding path program 26 times [2018-10-15 13:08:24,545 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:08:24,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:08:26,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1651 backedges. 0 proven. 1651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:08:26,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:08:26,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 13:08:26,479 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 13:08:26,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 13:08:26,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 13:08:26,480 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 55 states. [2018-10-15 13:08:32,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:08:32,793 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-10-15 13:08:32,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-15 13:08:32,794 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 140 [2018-10-15 13:08:32,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:08:32,795 INFO L225 Difference]: With dead ends: 149 [2018-10-15 13:08:32,795 INFO L226 Difference]: Without dead ends: 149 [2018-10-15 13:08:32,796 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1326 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=315, Invalid=11027, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 13:08:32,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-10-15 13:08:32,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2018-10-15 13:08:32,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-10-15 13:08:32,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2018-10-15 13:08:32,799 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 140 [2018-10-15 13:08:32,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:08:32,800 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2018-10-15 13:08:32,800 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 13:08:32,800 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2018-10-15 13:08:32,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-15 13:08:32,801 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:08:32,801 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:08:32,801 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:08:32,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:08:32,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1117997495, now seen corresponding path program 27 times [2018-10-15 13:08:32,802 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:08:32,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:08:35,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1782 backedges. 0 proven. 1782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:08:35,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:08:35,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 13:08:35,541 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 13:08:35,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 13:08:35,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 13:08:35,542 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 57 states. [2018-10-15 13:08:42,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:08:42,201 INFO L93 Difference]: Finished difference Result 154 states and 154 transitions. [2018-10-15 13:08:42,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-15 13:08:42,202 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 145 [2018-10-15 13:08:42,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:08:42,203 INFO L225 Difference]: With dead ends: 154 [2018-10-15 13:08:42,203 INFO L226 Difference]: Without dead ends: 154 [2018-10-15 13:08:42,204 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1431 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=327, Invalid=11883, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 13:08:42,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-10-15 13:08:42,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2018-10-15 13:08:42,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-10-15 13:08:42,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-10-15 13:08:42,207 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 145 [2018-10-15 13:08:42,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:08:42,207 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-10-15 13:08:42,207 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 13:08:42,207 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-10-15 13:08:42,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-15 13:08:42,208 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:08:42,208 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:08:42,208 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:08:42,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:08:42,208 INFO L82 PathProgramCache]: Analyzing trace with hash 598374600, now seen corresponding path program 28 times [2018-10-15 13:08:42,209 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:08:42,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:08:44,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1918 backedges. 0 proven. 1918 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:08:44,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:08:44,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-15 13:08:44,108 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-15 13:08:44,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-15 13:08:44,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 13:08:44,108 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 59 states. [2018-10-15 13:08:51,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:08:51,540 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-10-15 13:08:51,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-15 13:08:51,545 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 150 [2018-10-15 13:08:51,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:08:51,546 INFO L225 Difference]: With dead ends: 159 [2018-10-15 13:08:51,546 INFO L226 Difference]: Without dead ends: 159 [2018-10-15 13:08:51,547 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1540 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=339, Invalid=12771, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 13:08:51,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-10-15 13:08:51,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 156. [2018-10-15 13:08:51,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-10-15 13:08:51,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2018-10-15 13:08:51,550 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 150 [2018-10-15 13:08:51,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:08:51,551 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2018-10-15 13:08:51,551 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-15 13:08:51,551 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2018-10-15 13:08:51,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-15 13:08:51,552 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:08:51,552 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:08:51,552 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:08:51,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:08:51,552 INFO L82 PathProgramCache]: Analyzing trace with hash 533400663, now seen corresponding path program 29 times [2018-10-15 13:08:51,553 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:08:51,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:08:53,412 INFO L134 CoverageAnalysis]: Checked inductivity of 2059 backedges. 0 proven. 2059 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:08:53,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:08:53,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-15 13:08:53,413 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-15 13:08:53,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-15 13:08:53,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 13:08:53,414 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 61 states. [2018-10-15 13:09:01,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:09:01,256 INFO L93 Difference]: Finished difference Result 164 states and 164 transitions. [2018-10-15 13:09:01,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-15 13:09:01,257 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 155 [2018-10-15 13:09:01,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:09:01,258 INFO L225 Difference]: With dead ends: 164 [2018-10-15 13:09:01,259 INFO L226 Difference]: Without dead ends: 164 [2018-10-15 13:09:01,260 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1653 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=351, Invalid=13691, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 13:09:01,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-10-15 13:09:01,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 161. [2018-10-15 13:09:01,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-10-15 13:09:01,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-10-15 13:09:01,263 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 155 [2018-10-15 13:09:01,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:09:01,264 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-10-15 13:09:01,264 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-15 13:09:01,264 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-10-15 13:09:01,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-15 13:09:01,265 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:09:01,265 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:09:01,265 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:09:01,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:09:01,265 INFO L82 PathProgramCache]: Analyzing trace with hash -2079106520, now seen corresponding path program 30 times [2018-10-15 13:09:01,266 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:09:01,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:09:03,629 INFO L134 CoverageAnalysis]: Checked inductivity of 2205 backedges. 0 proven. 2205 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:09:03,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:09:03,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-15 13:09:03,629 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-15 13:09:03,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-15 13:09:03,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 13:09:03,630 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 63 states. [2018-10-15 13:09:12,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:09:12,027 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2018-10-15 13:09:12,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-15 13:09:12,033 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 160 [2018-10-15 13:09:12,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:09:12,034 INFO L225 Difference]: With dead ends: 169 [2018-10-15 13:09:12,034 INFO L226 Difference]: Without dead ends: 169 [2018-10-15 13:09:12,035 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1770 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=363, Invalid=14643, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 13:09:12,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-10-15 13:09:12,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 166. [2018-10-15 13:09:12,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-10-15 13:09:12,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2018-10-15 13:09:12,038 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 160 [2018-10-15 13:09:12,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:09:12,038 INFO L481 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2018-10-15 13:09:12,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-15 13:09:12,039 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2018-10-15 13:09:12,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-10-15 13:09:12,040 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:09:12,040 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:09:12,040 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:09:12,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:09:12,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1452803831, now seen corresponding path program 31 times [2018-10-15 13:09:12,042 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:09:12,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:09:14,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2356 backedges. 0 proven. 2356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:09:14,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:09:14,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-15 13:09:14,150 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-15 13:09:14,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-15 13:09:14,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-10-15 13:09:14,151 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 65 states. [2018-10-15 13:09:23,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:09:23,050 INFO L93 Difference]: Finished difference Result 174 states and 174 transitions. [2018-10-15 13:09:23,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-15 13:09:23,050 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 165 [2018-10-15 13:09:23,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:09:23,052 INFO L225 Difference]: With dead ends: 174 [2018-10-15 13:09:23,052 INFO L226 Difference]: Without dead ends: 174 [2018-10-15 13:09:23,053 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1891 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=375, Invalid=15627, Unknown=0, NotChecked=0, Total=16002 [2018-10-15 13:09:23,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-10-15 13:09:23,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 171. [2018-10-15 13:09:23,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-10-15 13:09:23,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-10-15 13:09:23,057 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 165 [2018-10-15 13:09:23,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:09:23,057 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-10-15 13:09:23,057 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-15 13:09:23,058 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-10-15 13:09:23,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-15 13:09:23,058 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:09:23,059 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:09:23,059 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:09:23,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:09:23,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1499071368, now seen corresponding path program 32 times [2018-10-15 13:09:23,060 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:09:23,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:09:26,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2512 backedges. 0 proven. 2512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:09:26,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:09:26,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-15 13:09:26,524 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-15 13:09:26,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-15 13:09:26,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 13:09:26,524 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 67 states. [2018-10-15 13:09:35,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:09:35,693 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-10-15 13:09:35,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-10-15 13:09:35,693 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 170 [2018-10-15 13:09:35,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:09:35,695 INFO L225 Difference]: With dead ends: 179 [2018-10-15 13:09:35,695 INFO L226 Difference]: Without dead ends: 179 [2018-10-15 13:09:35,696 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=387, Invalid=16643, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 13:09:35,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-10-15 13:09:35,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 176. [2018-10-15 13:09:35,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-10-15 13:09:35,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2018-10-15 13:09:35,699 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 170 [2018-10-15 13:09:35,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:09:35,700 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2018-10-15 13:09:35,700 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-15 13:09:35,700 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2018-10-15 13:09:35,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-15 13:09:35,701 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:09:35,701 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:09:35,701 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:09:35,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:09:35,702 INFO L82 PathProgramCache]: Analyzing trace with hash -471582313, now seen corresponding path program 33 times [2018-10-15 13:09:35,702 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:09:35,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:09:39,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2673 backedges. 0 proven. 2673 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:09:39,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:09:39,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-15 13:09:39,254 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-15 13:09:39,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-15 13:09:39,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 13:09:39,255 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 69 states. [2018-10-15 13:09:49,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:09:49,078 INFO L93 Difference]: Finished difference Result 184 states and 184 transitions. [2018-10-15 13:09:49,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-10-15 13:09:49,079 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 175 [2018-10-15 13:09:49,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:09:49,081 INFO L225 Difference]: With dead ends: 184 [2018-10-15 13:09:49,081 INFO L226 Difference]: Without dead ends: 184 [2018-10-15 13:09:49,082 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2145 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=399, Invalid=17691, Unknown=0, NotChecked=0, Total=18090 [2018-10-15 13:09:49,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-10-15 13:09:49,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 181. [2018-10-15 13:09:49,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-10-15 13:09:49,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-10-15 13:09:49,086 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 175 [2018-10-15 13:09:49,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:09:49,087 INFO L481 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-10-15 13:09:49,087 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-15 13:09:49,087 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-10-15 13:09:49,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-15 13:09:49,088 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:09:49,088 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:09:49,088 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:09:49,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:09:49,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1629195032, now seen corresponding path program 34 times [2018-10-15 13:09:49,089 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:09:49,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:09:52,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2839 backedges. 0 proven. 2839 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:09:52,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:09:52,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-15 13:09:52,711 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-15 13:09:52,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-15 13:09:52,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 13:09:52,711 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 71 states. [2018-10-15 13:10:03,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:10:03,081 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2018-10-15 13:10:03,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-10-15 13:10:03,082 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 180 [2018-10-15 13:10:03,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:10:03,083 INFO L225 Difference]: With dead ends: 189 [2018-10-15 13:10:03,083 INFO L226 Difference]: Without dead ends: 189 [2018-10-15 13:10:03,084 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2278 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=411, Invalid=18771, Unknown=0, NotChecked=0, Total=19182 [2018-10-15 13:10:03,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-10-15 13:10:03,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 186. [2018-10-15 13:10:03,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-10-15 13:10:03,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2018-10-15 13:10:03,088 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 180 [2018-10-15 13:10:03,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:10:03,089 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2018-10-15 13:10:03,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-15 13:10:03,089 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2018-10-15 13:10:03,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-10-15 13:10:03,090 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:10:03,090 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:10:03,090 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:10:03,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:10:03,091 INFO L82 PathProgramCache]: Analyzing trace with hash -66477001, now seen corresponding path program 35 times [2018-10-15 13:10:03,091 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:10:03,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:10:06,232 INFO L134 CoverageAnalysis]: Checked inductivity of 3010 backedges. 0 proven. 3010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:10:06,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:10:06,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-15 13:10:06,233 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-15 13:10:06,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-15 13:10:06,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-10-15 13:10:06,234 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 73 states. [2018-10-15 13:10:17,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:10:17,121 INFO L93 Difference]: Finished difference Result 194 states and 194 transitions. [2018-10-15 13:10:17,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-10-15 13:10:17,122 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 185 [2018-10-15 13:10:17,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:10:17,123 INFO L225 Difference]: With dead ends: 194 [2018-10-15 13:10:17,124 INFO L226 Difference]: Without dead ends: 194 [2018-10-15 13:10:17,125 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2415 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=423, Invalid=19883, Unknown=0, NotChecked=0, Total=20306 [2018-10-15 13:10:17,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-10-15 13:10:17,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2018-10-15 13:10:17,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-10-15 13:10:17,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-10-15 13:10:17,128 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 185 [2018-10-15 13:10:17,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:10:17,128 INFO L481 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2018-10-15 13:10:17,128 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-15 13:10:17,128 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-10-15 13:10:17,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-15 13:10:17,129 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:10:17,129 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:10:17,130 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:10:17,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:10:17,130 INFO L82 PathProgramCache]: Analyzing trace with hash -929518008, now seen corresponding path program 36 times [2018-10-15 13:10:17,131 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:10:17,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:10:20,061 INFO L134 CoverageAnalysis]: Checked inductivity of 3186 backedges. 0 proven. 3186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:10:20,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:10:20,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-15 13:10:20,062 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-15 13:10:20,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-15 13:10:20,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 13:10:20,063 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 75 states. [2018-10-15 13:10:31,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:10:31,612 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2018-10-15 13:10:31,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-10-15 13:10:31,612 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 190 [2018-10-15 13:10:31,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:10:31,614 INFO L225 Difference]: With dead ends: 199 [2018-10-15 13:10:31,614 INFO L226 Difference]: Without dead ends: 199 [2018-10-15 13:10:31,616 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2556 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=435, Invalid=21027, Unknown=0, NotChecked=0, Total=21462 [2018-10-15 13:10:31,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-10-15 13:10:31,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 196. [2018-10-15 13:10:31,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-10-15 13:10:31,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2018-10-15 13:10:31,620 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 190 [2018-10-15 13:10:31,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:10:31,620 INFO L481 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2018-10-15 13:10:31,620 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-15 13:10:31,620 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2018-10-15 13:10:31,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-10-15 13:10:31,621 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:10:31,622 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:10:31,622 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:10:31,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:10:31,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1428011305, now seen corresponding path program 37 times [2018-10-15 13:10:31,623 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:10:31,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:10:35,127 INFO L134 CoverageAnalysis]: Checked inductivity of 3367 backedges. 0 proven. 3367 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:10:35,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:10:35,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-15 13:10:35,128 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-15 13:10:35,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-15 13:10:35,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 13:10:35,128 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 77 states. [2018-10-15 13:10:47,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:10:47,287 INFO L93 Difference]: Finished difference Result 204 states and 204 transitions. [2018-10-15 13:10:47,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-10-15 13:10:47,287 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 195 [2018-10-15 13:10:47,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:10:47,289 INFO L225 Difference]: With dead ends: 204 [2018-10-15 13:10:47,289 INFO L226 Difference]: Without dead ends: 204 [2018-10-15 13:10:47,290 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2701 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=447, Invalid=22203, Unknown=0, NotChecked=0, Total=22650 [2018-10-15 13:10:47,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-10-15 13:10:47,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 201. [2018-10-15 13:10:47,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-10-15 13:10:47,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-10-15 13:10:47,294 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 195 [2018-10-15 13:10:47,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:10:47,294 INFO L481 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-10-15 13:10:47,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-15 13:10:47,294 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-10-15 13:10:47,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-10-15 13:10:47,295 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:10:47,295 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:10:47,296 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:10:47,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:10:47,296 INFO L82 PathProgramCache]: Analyzing trace with hash 584888232, now seen corresponding path program 38 times [2018-10-15 13:10:47,297 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:10:47,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:10:50,859 INFO L134 CoverageAnalysis]: Checked inductivity of 3553 backedges. 0 proven. 3553 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:10:50,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:10:50,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-15 13:10:50,860 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-15 13:10:50,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-15 13:10:50,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 13:10:50,861 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 79 states. [2018-10-15 13:11:03,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:11:03,601 INFO L93 Difference]: Finished difference Result 209 states and 209 transitions. [2018-10-15 13:11:03,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-10-15 13:11:03,601 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 200 [2018-10-15 13:11:03,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:11:03,603 INFO L225 Difference]: With dead ends: 209 [2018-10-15 13:11:03,603 INFO L226 Difference]: Without dead ends: 209 [2018-10-15 13:11:03,604 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2850 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=459, Invalid=23411, Unknown=0, NotChecked=0, Total=23870 [2018-10-15 13:11:03,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-10-15 13:11:03,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2018-10-15 13:11:03,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-10-15 13:11:03,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2018-10-15 13:11:03,608 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 200 [2018-10-15 13:11:03,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:11:03,608 INFO L481 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2018-10-15 13:11:03,608 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-15 13:11:03,608 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2018-10-15 13:11:03,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-10-15 13:11:03,609 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:11:03,609 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:11:03,610 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:11:03,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:11:03,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1942495607, now seen corresponding path program 39 times [2018-10-15 13:11:03,611 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:11:03,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:11:06,966 INFO L134 CoverageAnalysis]: Checked inductivity of 3744 backedges. 0 proven. 3744 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:11:06,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:11:06,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-15 13:11:06,966 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-15 13:11:06,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-15 13:11:06,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 13:11:06,967 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand 81 states. [2018-10-15 13:11:20,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:11:20,358 INFO L93 Difference]: Finished difference Result 214 states and 214 transitions. [2018-10-15 13:11:20,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-10-15 13:11:20,359 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 205 [2018-10-15 13:11:20,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:11:20,360 INFO L225 Difference]: With dead ends: 214 [2018-10-15 13:11:20,360 INFO L226 Difference]: Without dead ends: 214 [2018-10-15 13:11:20,361 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3003 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=471, Invalid=24651, Unknown=0, NotChecked=0, Total=25122 [2018-10-15 13:11:20,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-10-15 13:11:20,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 211. [2018-10-15 13:11:20,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-10-15 13:11:20,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2018-10-15 13:11:20,365 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 205 [2018-10-15 13:11:20,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:11:20,365 INFO L481 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2018-10-15 13:11:20,365 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-15 13:11:20,366 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2018-10-15 13:11:20,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-10-15 13:11:20,366 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:11:20,367 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:11:20,367 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:11:20,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:11:20,367 INFO L82 PathProgramCache]: Analyzing trace with hash 848722184, now seen corresponding path program 40 times [2018-10-15 13:11:20,368 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:11:20,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:11:24,905 INFO L134 CoverageAnalysis]: Checked inductivity of 3940 backedges. 0 proven. 3940 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:11:24,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:11:24,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-15 13:11:24,906 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-15 13:11:24,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-15 13:11:24,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 13:11:24,907 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 83 states. [2018-10-15 13:11:39,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:11:39,213 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2018-10-15 13:11:39,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-10-15 13:11:39,213 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 210 [2018-10-15 13:11:39,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:11:39,215 INFO L225 Difference]: With dead ends: 219 [2018-10-15 13:11:39,215 INFO L226 Difference]: Without dead ends: 219 [2018-10-15 13:11:39,216 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3160 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=483, Invalid=25923, Unknown=0, NotChecked=0, Total=26406 [2018-10-15 13:11:39,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-10-15 13:11:39,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 216. [2018-10-15 13:11:39,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-10-15 13:11:39,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 216 transitions. [2018-10-15 13:11:39,220 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 216 transitions. Word has length 210 [2018-10-15 13:11:39,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:11:39,221 INFO L481 AbstractCegarLoop]: Abstraction has 216 states and 216 transitions. [2018-10-15 13:11:39,221 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-15 13:11:39,221 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 216 transitions. [2018-10-15 13:11:39,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-10-15 13:11:39,222 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:11:39,222 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:11:39,222 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:11:39,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:11:39,223 INFO L82 PathProgramCache]: Analyzing trace with hash -241880041, now seen corresponding path program 41 times [2018-10-15 13:11:39,223 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:11:39,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:11:42,926 INFO L134 CoverageAnalysis]: Checked inductivity of 4141 backedges. 0 proven. 4141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:11:42,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:11:42,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-15 13:11:42,927 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-15 13:11:42,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-15 13:11:42,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2018-10-15 13:11:42,928 INFO L87 Difference]: Start difference. First operand 216 states and 216 transitions. Second operand 85 states. [2018-10-15 13:11:57,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:11:57,755 INFO L93 Difference]: Finished difference Result 224 states and 224 transitions. [2018-10-15 13:11:57,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-10-15 13:11:57,756 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 215 [2018-10-15 13:11:57,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:11:57,757 INFO L225 Difference]: With dead ends: 224 [2018-10-15 13:11:57,758 INFO L226 Difference]: Without dead ends: 224 [2018-10-15 13:11:57,759 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3321 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=495, Invalid=27227, Unknown=0, NotChecked=0, Total=27722 [2018-10-15 13:11:57,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-10-15 13:11:57,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 221. [2018-10-15 13:11:57,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-10-15 13:11:57,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2018-10-15 13:11:57,763 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 215 [2018-10-15 13:11:57,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:11:57,763 INFO L481 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2018-10-15 13:11:57,763 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-15 13:11:57,763 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2018-10-15 13:11:57,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-10-15 13:11:57,765 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:11:57,765 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:11:57,765 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:11:57,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:11:57,765 INFO L82 PathProgramCache]: Analyzing trace with hash 355207784, now seen corresponding path program 42 times [2018-10-15 13:11:57,766 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:11:57,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:01,603 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 0 proven. 4347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:01,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:01,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-15 13:12:01,604 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-15 13:12:01,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-15 13:12:01,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 13:12:01,604 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 87 states. [2018-10-15 13:12:17,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:17,975 INFO L93 Difference]: Finished difference Result 229 states and 229 transitions. [2018-10-15 13:12:17,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-10-15 13:12:17,976 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 220 [2018-10-15 13:12:17,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:17,977 INFO L225 Difference]: With dead ends: 229 [2018-10-15 13:12:17,978 INFO L226 Difference]: Without dead ends: 229 [2018-10-15 13:12:17,979 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3486 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=507, Invalid=28563, Unknown=0, NotChecked=0, Total=29070 [2018-10-15 13:12:17,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-10-15 13:12:17,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226. [2018-10-15 13:12:17,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-10-15 13:12:17,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 226 transitions. [2018-10-15 13:12:17,983 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 226 transitions. Word has length 220 [2018-10-15 13:12:17,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:17,983 INFO L481 AbstractCegarLoop]: Abstraction has 226 states and 226 transitions. [2018-10-15 13:12:17,983 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-15 13:12:17,983 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 226 transitions. [2018-10-15 13:12:17,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-10-15 13:12:17,984 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:17,984 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:17,985 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:17,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:17,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1990426295, now seen corresponding path program 43 times [2018-10-15 13:12:17,986 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:17,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:22,073 INFO L134 CoverageAnalysis]: Checked inductivity of 4558 backedges. 0 proven. 4558 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:22,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:22,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-15 13:12:22,074 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-15 13:12:22,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-15 13:12:22,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2018-10-15 13:12:22,075 INFO L87 Difference]: Start difference. First operand 226 states and 226 transitions. Second operand 89 states. [2018-10-15 13:12:38,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:38,776 INFO L93 Difference]: Finished difference Result 234 states and 234 transitions. [2018-10-15 13:12:38,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-10-15 13:12:38,777 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 225 [2018-10-15 13:12:38,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:38,778 INFO L225 Difference]: With dead ends: 234 [2018-10-15 13:12:38,778 INFO L226 Difference]: Without dead ends: 234 [2018-10-15 13:12:38,779 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3655 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=519, Invalid=29931, Unknown=0, NotChecked=0, Total=30450 [2018-10-15 13:12:38,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-10-15 13:12:38,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 231. [2018-10-15 13:12:38,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-10-15 13:12:38,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2018-10-15 13:12:38,782 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 225 [2018-10-15 13:12:38,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:38,783 INFO L481 AbstractCegarLoop]: Abstraction has 231 states and 231 transitions. [2018-10-15 13:12:38,783 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-15 13:12:38,783 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 231 transitions. [2018-10-15 13:12:38,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-15 13:12:38,784 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:38,784 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:38,785 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:38,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:38,785 INFO L82 PathProgramCache]: Analyzing trace with hash -528260152, now seen corresponding path program 44 times [2018-10-15 13:12:38,785 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:38,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:42,936 INFO L134 CoverageAnalysis]: Checked inductivity of 4774 backedges. 0 proven. 4774 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:42,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:42,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-15 13:12:42,937 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-15 13:12:42,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-15 13:12:42,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=8011, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 13:12:42,938 INFO L87 Difference]: Start difference. First operand 231 states and 231 transitions. Second operand 91 states. [2018-10-15 13:12:59,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:59,925 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2018-10-15 13:12:59,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-10-15 13:12:59,926 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 230 [2018-10-15 13:12:59,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:59,927 INFO L225 Difference]: With dead ends: 239 [2018-10-15 13:12:59,928 INFO L226 Difference]: Without dead ends: 239 [2018-10-15 13:12:59,929 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3828 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=531, Invalid=31331, Unknown=0, NotChecked=0, Total=31862 [2018-10-15 13:12:59,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-10-15 13:12:59,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 236. [2018-10-15 13:12:59,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-10-15 13:12:59,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 236 transitions. [2018-10-15 13:12:59,932 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 236 transitions. Word has length 230 [2018-10-15 13:12:59,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:59,933 INFO L481 AbstractCegarLoop]: Abstraction has 236 states and 236 transitions. [2018-10-15 13:12:59,933 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-15 13:12:59,933 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 236 transitions. [2018-10-15 13:12:59,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-10-15 13:12:59,934 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:59,934 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:59,934 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:59,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:59,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1395850921, now seen corresponding path program 45 times [2018-10-15 13:12:59,935 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:59,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:04,350 INFO L134 CoverageAnalysis]: Checked inductivity of 4995 backedges. 0 proven. 4995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:04,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:04,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-15 13:13:04,351 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-15 13:13:04,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-15 13:13:04,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=8373, Unknown=0, NotChecked=0, Total=8556 [2018-10-15 13:13:04,351 INFO L87 Difference]: Start difference. First operand 236 states and 236 transitions. Second operand 93 states. [2018-10-15 13:13:23,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:23,507 INFO L93 Difference]: Finished difference Result 244 states and 244 transitions. [2018-10-15 13:13:23,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-10-15 13:13:23,508 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 235 [2018-10-15 13:13:23,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:23,509 INFO L225 Difference]: With dead ends: 244 [2018-10-15 13:13:23,509 INFO L226 Difference]: Without dead ends: 244 [2018-10-15 13:13:23,510 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4005 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=543, Invalid=32763, Unknown=0, NotChecked=0, Total=33306 [2018-10-15 13:13:23,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-10-15 13:13:23,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 241. [2018-10-15 13:13:23,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-10-15 13:13:23,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2018-10-15 13:13:23,514 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 235 [2018-10-15 13:13:23,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:23,515 INFO L481 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2018-10-15 13:13:23,515 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-15 13:13:23,515 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2018-10-15 13:13:23,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-10-15 13:13:23,516 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:23,516 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:23,517 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:23,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:23,517 INFO L82 PathProgramCache]: Analyzing trace with hash 50496808, now seen corresponding path program 46 times [2018-10-15 13:13:23,517 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:23,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:27,983 INFO L134 CoverageAnalysis]: Checked inductivity of 5221 backedges. 0 proven. 5221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:27,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:27,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-10-15 13:13:27,984 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-15 13:13:27,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-15 13:13:27,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=8743, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 13:13:27,984 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 95 states. [2018-10-15 13:13:42,344 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-15 13:13:46,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:46,703 INFO L93 Difference]: Finished difference Result 249 states and 249 transitions. [2018-10-15 13:13:46,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-10-15 13:13:46,703 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 240 [2018-10-15 13:13:46,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:46,705 INFO L225 Difference]: With dead ends: 249 [2018-10-15 13:13:46,705 INFO L226 Difference]: Without dead ends: 249 [2018-10-15 13:13:46,706 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4186 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=555, Invalid=34227, Unknown=0, NotChecked=0, Total=34782 [2018-10-15 13:13:46,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-10-15 13:13:46,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 246. [2018-10-15 13:13:46,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-10-15 13:13:46,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 246 transitions. [2018-10-15 13:13:46,710 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 246 transitions. Word has length 240 [2018-10-15 13:13:46,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:46,710 INFO L481 AbstractCegarLoop]: Abstraction has 246 states and 246 transitions. [2018-10-15 13:13:46,710 INFO L482 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-15 13:13:46,710 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 246 transitions. [2018-10-15 13:13:46,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-10-15 13:13:46,711 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:46,712 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:46,712 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:46,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:46,712 INFO L82 PathProgramCache]: Analyzing trace with hash 896252919, now seen corresponding path program 47 times [2018-10-15 13:13:46,713 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:46,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:51,251 INFO L134 CoverageAnalysis]: Checked inductivity of 5452 backedges. 0 proven. 5452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:51,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:51,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-10-15 13:13:51,252 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-15 13:13:51,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-15 13:13:51,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=9121, Unknown=0, NotChecked=0, Total=9312 [2018-10-15 13:13:51,253 INFO L87 Difference]: Start difference. First operand 246 states and 246 transitions. Second operand 97 states. [2018-10-15 13:14:10,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:10,479 INFO L93 Difference]: Finished difference Result 254 states and 254 transitions. [2018-10-15 13:14:10,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-10-15 13:14:10,480 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 245 [2018-10-15 13:14:10,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:10,481 INFO L225 Difference]: With dead ends: 254 [2018-10-15 13:14:10,481 INFO L226 Difference]: Without dead ends: 254 [2018-10-15 13:14:10,483 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4371 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=567, Invalid=35723, Unknown=0, NotChecked=0, Total=36290 [2018-10-15 13:14:10,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-10-15 13:14:10,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 251. [2018-10-15 13:14:10,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-10-15 13:14:10,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2018-10-15 13:14:10,486 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 245 [2018-10-15 13:14:10,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:10,486 INFO L481 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2018-10-15 13:14:10,487 INFO L482 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-15 13:14:10,487 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2018-10-15 13:14:10,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-10-15 13:14:10,487 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:10,488 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:10,488 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:10,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:10,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1550881144, now seen corresponding path program 48 times [2018-10-15 13:14:10,489 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:10,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:15,381 INFO L134 CoverageAnalysis]: Checked inductivity of 5688 backedges. 0 proven. 5688 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:15,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:15,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-10-15 13:14:15,382 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-15 13:14:15,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-15 13:14:15,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=9507, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 13:14:15,382 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 99 states. [2018-10-15 13:14:35,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:35,381 INFO L93 Difference]: Finished difference Result 259 states and 259 transitions. [2018-10-15 13:14:35,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-10-15 13:14:35,382 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 250 [2018-10-15 13:14:35,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:35,384 INFO L225 Difference]: With dead ends: 259 [2018-10-15 13:14:35,384 INFO L226 Difference]: Without dead ends: 259 [2018-10-15 13:14:35,386 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4560 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=579, Invalid=37251, Unknown=0, NotChecked=0, Total=37830 [2018-10-15 13:14:35,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-10-15 13:14:35,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 256. [2018-10-15 13:14:35,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-10-15 13:14:35,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 256 transitions. [2018-10-15 13:14:35,390 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 256 transitions. Word has length 250 [2018-10-15 13:14:35,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:35,390 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 256 transitions. [2018-10-15 13:14:35,390 INFO L482 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-15 13:14:35,390 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 256 transitions. [2018-10-15 13:14:35,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-10-15 13:14:35,391 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:35,392 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:35,392 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:35,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:35,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1230614167, now seen corresponding path program 49 times [2018-10-15 13:14:35,393 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:35,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:40,459 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 0 proven. 5929 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:40,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:40,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-10-15 13:14:40,460 INFO L460 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-10-15 13:14:40,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-10-15 13:14:40,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=9901, Unknown=0, NotChecked=0, Total=10100 [2018-10-15 13:14:40,461 INFO L87 Difference]: Start difference. First operand 256 states and 256 transitions. Second operand 101 states. [2018-10-15 13:15:01,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:01,572 INFO L93 Difference]: Finished difference Result 264 states and 264 transitions. [2018-10-15 13:15:01,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-10-15 13:15:01,573 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 255 [2018-10-15 13:15:01,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:01,574 INFO L225 Difference]: With dead ends: 264 [2018-10-15 13:15:01,575 INFO L226 Difference]: Without dead ends: 264 [2018-10-15 13:15:01,576 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4753 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=591, Invalid=38811, Unknown=0, NotChecked=0, Total=39402 [2018-10-15 13:15:01,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-10-15 13:15:01,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 261. [2018-10-15 13:15:01,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-10-15 13:15:01,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2018-10-15 13:15:01,580 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 255 [2018-10-15 13:15:01,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:01,580 INFO L481 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2018-10-15 13:15:01,580 INFO L482 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-10-15 13:15:01,580 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2018-10-15 13:15:01,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-10-15 13:15:01,582 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:01,582 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:15:01,582 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:01,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:01,582 INFO L82 PathProgramCache]: Analyzing trace with hash 26222568, now seen corresponding path program 50 times [2018-10-15 13:15:01,583 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:01,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:06,709 INFO L134 CoverageAnalysis]: Checked inductivity of 6175 backedges. 0 proven. 6175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:06,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:06,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-10-15 13:15:06,710 INFO L460 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-10-15 13:15:06,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-10-15 13:15:06,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 13:15:06,711 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 103 states. [2018-10-15 13:15:28,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:28,424 INFO L93 Difference]: Finished difference Result 269 states and 269 transitions. [2018-10-15 13:15:28,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-10-15 13:15:28,424 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 260 [2018-10-15 13:15:28,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:28,426 INFO L225 Difference]: With dead ends: 269 [2018-10-15 13:15:28,427 INFO L226 Difference]: Without dead ends: 269 [2018-10-15 13:15:28,428 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4950 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=603, Invalid=40403, Unknown=0, NotChecked=0, Total=41006 [2018-10-15 13:15:28,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-10-15 13:15:28,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 266. [2018-10-15 13:15:28,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-10-15 13:15:28,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 266 transitions. [2018-10-15 13:15:28,431 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 266 transitions. Word has length 260 [2018-10-15 13:15:28,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:28,431 INFO L481 AbstractCegarLoop]: Abstraction has 266 states and 266 transitions. [2018-10-15 13:15:28,431 INFO L482 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-10-15 13:15:28,431 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 266 transitions. [2018-10-15 13:15:28,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-10-15 13:15:28,433 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:28,433 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:15:28,433 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:28,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:28,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1492179255, now seen corresponding path program 51 times [2018-10-15 13:15:28,434 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:28,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:33,917 INFO L134 CoverageAnalysis]: Checked inductivity of 6426 backedges. 0 proven. 6426 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:33,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:33,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-10-15 13:15:33,918 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-10-15 13:15:33,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-10-15 13:15:33,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=10713, Unknown=0, NotChecked=0, Total=10920 [2018-10-15 13:15:33,919 INFO L87 Difference]: Start difference. First operand 266 states and 266 transitions. Second operand 105 states.