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/20170304-DifficultPathPrograms/up.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d769cf3 [2018-10-15 15:35:51,720 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 15:35:51,722 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 15:35:51,740 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 15:35:51,740 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 15:35:51,741 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 15:35:51,743 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 15:35:51,744 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 15:35:51,746 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 15:35:51,747 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 15:35:51,747 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 15:35:51,748 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 15:35:51,749 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 15:35:51,750 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 15:35:51,751 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 15:35:51,752 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 15:35:51,753 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 15:35:51,759 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 15:35:51,763 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 15:35:51,767 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 15:35:51,769 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 15:35:51,770 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 15:35:51,772 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 15:35:51,772 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 15:35:51,773 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 15:35:51,776 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 15:35:51,777 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 15:35:51,779 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 15:35:51,780 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 15:35:51,782 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 15:35:51,782 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 15:35:51,783 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 15:35:51,784 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 15:35:51,784 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 15:35:51,785 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 15:35:51,786 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 15:35:51,786 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 15:35:51,795 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 15:35:51,796 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 15:35:51,797 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 15:35:51,797 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 15:35:51,797 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 15:35:51,797 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 15:35:51,798 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 15:35:51,798 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 15:35:51,798 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 15:35:51,799 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 15:35:51,799 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 15:35:51,799 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 15:35:51,799 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 15:35:51,800 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 15:35:51,800 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 15:35:51,856 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 15:35:51,872 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 15:35:51,880 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 15:35:51,882 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 15:35:51,882 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 15:35:51,883 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/up.i_4.bpl [2018-10-15 15:35:51,883 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/up.i_4.bpl' [2018-10-15 15:35:51,929 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 15:35:51,930 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-15 15:35:51,931 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 15:35:51,931 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 15:35:51,931 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 15:35:51,958 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "up.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:35:51" (1/1) ... [2018-10-15 15:35:51,960 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "up.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:35:51" (1/1) ... [2018-10-15 15:35:51,969 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "up.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:35:51" (1/1) ... [2018-10-15 15:35:51,970 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "up.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:35:51" (1/1) ... [2018-10-15 15:35:51,974 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "up.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:35:51" (1/1) ... [2018-10-15 15:35:51,977 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "up.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:35:51" (1/1) ... [2018-10-15 15:35:51,978 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "up.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:35:51" (1/1) ... [2018-10-15 15:35:51,979 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 15:35:51,980 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 15:35:51,980 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 15:35:51,981 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 15:35:51,982 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "up.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:35:51" (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 15:35:52,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 15:35:52,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 15:35:52,389 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 15:35:52,390 INFO L202 PluginConnector]: Adding new model up.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:35:52 BoogieIcfgContainer [2018-10-15 15:35:52,390 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 15:35:52,390 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-15 15:35:52,391 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-15 15:35:52,391 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-15 15:35:52,394 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "up.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:35:52" (1/1) ... [2018-10-15 15:35:52,399 WARN L219 ansformationObserver]: HeapSeparator: input icfg has no '#valid' array -- returning unchanged Icfg! [2018-10-15 15:35:52,414 INFO L202 PluginConnector]: Adding new model up.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 03:35:52 BasicIcfg [2018-10-15 15:35:52,414 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-15 15:35:52,415 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 15:35:52,415 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 15:35:52,419 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 15:35:52,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "up.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:35:51" (1/3) ... [2018-10-15 15:35:52,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a406437 and model type up.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:35:52, skipping insertion in model container [2018-10-15 15:35:52,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "up.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:35:52" (2/3) ... [2018-10-15 15:35:52,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a406437 and model type up.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:35:52, skipping insertion in model container [2018-10-15 15:35:52,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "up.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 03:35:52" (3/3) ... [2018-10-15 15:35:52,423 INFO L112 eAbstractionObserver]: Analyzing ICFG up.i_4.bplleft_unchanged_by_heapseparator [2018-10-15 15:35:52,432 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 15:35:52,440 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 15:35:52,458 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 15:35:52,484 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 15:35:52,484 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 15:35:52,484 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 15:35:52,485 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 15:35:52,485 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 15:35:52,485 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 15:35:52,485 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 15:35:52,485 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 15:35:52,485 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 15:35:52,500 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-10-15 15:35:52,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-15 15:35:52,509 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:52,510 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:52,512 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:52,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:52,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1200392228, now seen corresponding path program 1 times [2018-10-15 15:35:52,570 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:52,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:52,724 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 15:35:52,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:35:52,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-15 15:35:52,731 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 15:35:52,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 15:35:52,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-15 15:35:52,747 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 5 states. [2018-10-15 15:35:52,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:52,923 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-10-15 15:35:52,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-15 15:35:52,925 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-10-15 15:35:52,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:52,937 INFO L225 Difference]: With dead ends: 39 [2018-10-15 15:35:52,937 INFO L226 Difference]: Without dead ends: 36 [2018-10-15 15:35:52,939 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-15 15:35:52,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-15 15:35:52,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-10-15 15:35:52,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-15 15:35:52,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-10-15 15:35:52,978 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 19 [2018-10-15 15:35:52,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:52,978 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2018-10-15 15:35:52,978 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 15:35:52,979 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-10-15 15:35:52,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-15 15:35:52,980 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:52,980 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:52,980 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:52,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:52,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1814655788, now seen corresponding path program 1 times [2018-10-15 15:35:52,982 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:52,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:53,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:35:53,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:35:53,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-15 15:35:53,210 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 15:35:53,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 15:35:53,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-15 15:35:53,211 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 7 states. [2018-10-15 15:35:53,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:53,582 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2018-10-15 15:35:53,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-15 15:35:53,583 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-10-15 15:35:53,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:53,585 INFO L225 Difference]: With dead ends: 55 [2018-10-15 15:35:53,585 INFO L226 Difference]: Without dead ends: 55 [2018-10-15 15:35:53,586 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-10-15 15:35:53,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-15 15:35:53,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 40. [2018-10-15 15:35:53,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-15 15:35:53,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-10-15 15:35:53,593 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 27 [2018-10-15 15:35:53,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:53,593 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2018-10-15 15:35:53,594 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 15:35:53,594 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-10-15 15:35:53,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-15 15:35:53,595 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:53,596 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:53,596 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:53,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:53,597 INFO L82 PathProgramCache]: Analyzing trace with hash -568844865, now seen corresponding path program 1 times [2018-10-15 15:35:53,599 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:53,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:53,856 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:35:53,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:53,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 15:35:53,858 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 15:35:53,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 15:35:53,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-10-15 15:35:53,859 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 9 states. [2018-10-15 15:35:54,230 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-15 15:35:54,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:54,448 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2018-10-15 15:35:54,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-15 15:35:54,450 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-10-15 15:35:54,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:54,451 INFO L225 Difference]: With dead ends: 65 [2018-10-15 15:35:54,452 INFO L226 Difference]: Without dead ends: 50 [2018-10-15 15:35:54,453 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2018-10-15 15:35:54,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-15 15:35:54,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2018-10-15 15:35:54,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-15 15:35:54,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-10-15 15:35:54,460 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 39 [2018-10-15 15:35:54,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:54,461 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2018-10-15 15:35:54,461 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 15:35:54,461 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-10-15 15:35:54,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-15 15:35:54,462 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:54,465 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:54,466 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:54,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:54,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1364657847, now seen corresponding path program 2 times [2018-10-15 15:35:54,468 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:54,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:54,827 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:35:54,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:54,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-15 15:35:54,828 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-15 15:35:54,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-15 15:35:54,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-10-15 15:35:54,829 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 12 states. [2018-10-15 15:35:55,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:55,379 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2018-10-15 15:35:55,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-15 15:35:55,380 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 47 [2018-10-15 15:35:55,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:55,383 INFO L225 Difference]: With dead ends: 74 [2018-10-15 15:35:55,383 INFO L226 Difference]: Without dead ends: 74 [2018-10-15 15:35:55,383 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2018-10-15 15:35:55,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-15 15:35:55,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 60. [2018-10-15 15:35:55,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-15 15:35:55,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2018-10-15 15:35:55,391 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 47 [2018-10-15 15:35:55,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:55,392 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2018-10-15 15:35:55,392 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-15 15:35:55,392 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-10-15 15:35:55,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-10-15 15:35:55,394 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:55,395 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:55,395 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:55,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:55,396 INFO L82 PathProgramCache]: Analyzing trace with hash -942023902, now seen corresponding path program 3 times [2018-10-15 15:35:55,397 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:55,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:55,656 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 24 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:35:55,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:55,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 15:35:55,657 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 15:35:55,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 15:35:55,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-10-15 15:35:55,658 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 13 states. [2018-10-15 15:35:56,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:56,325 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions. [2018-10-15 15:35:56,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-15 15:35:56,326 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 59 [2018-10-15 15:35:56,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:56,327 INFO L225 Difference]: With dead ends: 97 [2018-10-15 15:35:56,327 INFO L226 Difference]: Without dead ends: 70 [2018-10-15 15:35:56,328 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2018-10-15 15:35:56,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-10-15 15:35:56,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2018-10-15 15:35:56,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-10-15 15:35:56,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2018-10-15 15:35:56,335 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 59 [2018-10-15 15:35:56,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:56,336 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2018-10-15 15:35:56,336 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 15:35:56,336 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2018-10-15 15:35:56,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-15 15:35:56,338 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:56,338 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:56,338 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:56,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:56,339 INFO L82 PathProgramCache]: Analyzing trace with hash 46307354, now seen corresponding path program 4 times [2018-10-15 15:35:56,340 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:56,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:56,634 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 30 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:35:56,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:56,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 15:35:56,635 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 15:35:56,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 15:35:56,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2018-10-15 15:35:56,636 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 15 states. [2018-10-15 15:35:57,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:57,073 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2018-10-15 15:35:57,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-15 15:35:57,074 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2018-10-15 15:35:57,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:57,076 INFO L225 Difference]: With dead ends: 94 [2018-10-15 15:35:57,076 INFO L226 Difference]: Without dead ends: 94 [2018-10-15 15:35:57,077 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=222, Invalid=770, Unknown=0, NotChecked=0, Total=992 [2018-10-15 15:35:57,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-10-15 15:35:57,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 80. [2018-10-15 15:35:57,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-15 15:35:57,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2018-10-15 15:35:57,085 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 67 [2018-10-15 15:35:57,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:57,086 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2018-10-15 15:35:57,086 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 15:35:57,086 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2018-10-15 15:35:57,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-15 15:35:57,087 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:57,088 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:57,088 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:57,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:57,089 INFO L82 PathProgramCache]: Analyzing trace with hash 606040069, now seen corresponding path program 5 times [2018-10-15 15:35:57,089 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:57,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:57,326 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 54 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:35:57,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:57,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 15:35:57,327 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 15:35:57,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 15:35:57,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-10-15 15:35:57,328 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 17 states. [2018-10-15 15:35:57,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:57,873 INFO L93 Difference]: Finished difference Result 129 states and 130 transitions. [2018-10-15 15:35:57,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-15 15:35:57,874 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 79 [2018-10-15 15:35:57,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:57,876 INFO L225 Difference]: With dead ends: 129 [2018-10-15 15:35:57,876 INFO L226 Difference]: Without dead ends: 90 [2018-10-15 15:35:57,877 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=230, Invalid=892, Unknown=0, NotChecked=0, Total=1122 [2018-10-15 15:35:57,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-15 15:35:57,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2018-10-15 15:35:57,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-10-15 15:35:57,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2018-10-15 15:35:57,884 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 79 [2018-10-15 15:35:57,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:57,885 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2018-10-15 15:35:57,885 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 15:35:57,885 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2018-10-15 15:35:57,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-15 15:35:57,887 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:57,887 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:57,887 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:57,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:57,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1669333245, now seen corresponding path program 6 times [2018-10-15 15:35:57,889 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:57,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:58,233 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 56 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:35:58,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:58,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-15 15:35:58,235 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-15 15:35:58,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-15 15:35:58,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2018-10-15 15:35:58,236 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand 18 states. [2018-10-15 15:35:58,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:58,936 INFO L93 Difference]: Finished difference Result 114 states and 115 transitions. [2018-10-15 15:35:58,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-15 15:35:58,936 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 87 [2018-10-15 15:35:58,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:58,937 INFO L225 Difference]: With dead ends: 114 [2018-10-15 15:35:58,937 INFO L226 Difference]: Without dead ends: 114 [2018-10-15 15:35:58,938 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=349, Invalid=1291, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 15:35:58,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-10-15 15:35:58,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 100. [2018-10-15 15:35:58,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-10-15 15:35:58,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2018-10-15 15:35:58,947 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 87 [2018-10-15 15:35:58,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:58,947 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2018-10-15 15:35:58,947 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-15 15:35:58,948 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2018-10-15 15:35:58,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-15 15:35:58,949 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:58,950 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:58,950 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:58,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:58,950 INFO L82 PathProgramCache]: Analyzing trace with hash 170892392, now seen corresponding path program 7 times [2018-10-15 15:35:58,951 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:58,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:59,262 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 96 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:35:59,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:59,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 15:35:59,263 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 15:35:59,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 15:35:59,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2018-10-15 15:35:59,264 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 21 states. [2018-10-15 15:35:59,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:59,996 INFO L93 Difference]: Finished difference Result 161 states and 162 transitions. [2018-10-15 15:35:59,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-15 15:35:59,996 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 99 [2018-10-15 15:35:59,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:59,997 INFO L225 Difference]: With dead ends: 161 [2018-10-15 15:35:59,998 INFO L226 Difference]: Without dead ends: 110 [2018-10-15 15:35:59,999 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=349, Invalid=1457, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 15:35:59,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-10-15 15:36:00,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2018-10-15 15:36:00,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-10-15 15:36:00,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 109 transitions. [2018-10-15 15:36:00,005 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 109 transitions. Word has length 99 [2018-10-15 15:36:00,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:00,006 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 109 transitions. [2018-10-15 15:36:00,006 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 15:36:00,006 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 109 transitions. [2018-10-15 15:36:00,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-15 15:36:00,008 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:00,008 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:00,008 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:00,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:00,008 INFO L82 PathProgramCache]: Analyzing trace with hash 399901024, now seen corresponding path program 8 times [2018-10-15 15:36:00,009 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:00,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:00,310 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 90 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:36:00,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:00,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 15:36:00,311 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 15:36:00,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 15:36:00,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2018-10-15 15:36:00,312 INFO L87 Difference]: Start difference. First operand 108 states and 109 transitions. Second operand 21 states. [2018-10-15 15:36:00,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:00,994 INFO L93 Difference]: Finished difference Result 134 states and 135 transitions. [2018-10-15 15:36:00,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-15 15:36:00,995 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 107 [2018-10-15 15:36:00,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:00,996 INFO L225 Difference]: With dead ends: 134 [2018-10-15 15:36:00,997 INFO L226 Difference]: Without dead ends: 134 [2018-10-15 15:36:01,000 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=504, Invalid=1946, Unknown=0, NotChecked=0, Total=2450 [2018-10-15 15:36:01,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-10-15 15:36:01,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 120. [2018-10-15 15:36:01,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-10-15 15:36:01,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 121 transitions. [2018-10-15 15:36:01,007 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 121 transitions. Word has length 107 [2018-10-15 15:36:01,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:01,007 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 121 transitions. [2018-10-15 15:36:01,007 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 15:36:01,007 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2018-10-15 15:36:01,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-15 15:36:01,009 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:01,009 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:01,010 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:01,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:01,010 INFO L82 PathProgramCache]: Analyzing trace with hash 707862603, now seen corresponding path program 9 times [2018-10-15 15:36:01,011 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:01,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:01,351 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 150 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:36:01,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:01,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 15:36:01,352 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 15:36:01,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 15:36:01,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2018-10-15 15:36:01,353 INFO L87 Difference]: Start difference. First operand 120 states and 121 transitions. Second operand 25 states. [2018-10-15 15:36:02,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:02,008 INFO L93 Difference]: Finished difference Result 193 states and 194 transitions. [2018-10-15 15:36:02,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-15 15:36:02,009 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 119 [2018-10-15 15:36:02,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:02,010 INFO L225 Difference]: With dead ends: 193 [2018-10-15 15:36:02,010 INFO L226 Difference]: Without dead ends: 130 [2018-10-15 15:36:02,012 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=492, Invalid=2160, Unknown=0, NotChecked=0, Total=2652 [2018-10-15 15:36:02,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-10-15 15:36:02,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 128. [2018-10-15 15:36:02,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-10-15 15:36:02,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 129 transitions. [2018-10-15 15:36:02,020 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 129 transitions. Word has length 119 [2018-10-15 15:36:02,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:02,021 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 129 transitions. [2018-10-15 15:36:02,021 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 15:36:02,021 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 129 transitions. [2018-10-15 15:36:02,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-15 15:36:02,024 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:02,024 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:02,025 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:02,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:02,025 INFO L82 PathProgramCache]: Analyzing trace with hash -588555965, now seen corresponding path program 10 times [2018-10-15 15:36:02,026 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:02,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:02,602 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 132 proven. 150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:36:02,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:02,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-15 15:36:02,603 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-15 15:36:02,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-15 15:36:02,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2018-10-15 15:36:02,604 INFO L87 Difference]: Start difference. First operand 128 states and 129 transitions. Second operand 24 states. [2018-10-15 15:36:03,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:03,433 INFO L93 Difference]: Finished difference Result 154 states and 155 transitions. [2018-10-15 15:36:03,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-15 15:36:03,436 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 127 [2018-10-15 15:36:03,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:03,437 INFO L225 Difference]: With dead ends: 154 [2018-10-15 15:36:03,437 INFO L226 Difference]: Without dead ends: 154 [2018-10-15 15:36:03,438 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 965 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=687, Invalid=2735, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 15:36:03,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-10-15 15:36:03,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 140. [2018-10-15 15:36:03,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-10-15 15:36:03,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 141 transitions. [2018-10-15 15:36:03,443 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 141 transitions. Word has length 127 [2018-10-15 15:36:03,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:03,444 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 141 transitions. [2018-10-15 15:36:03,444 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-15 15:36:03,444 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 141 transitions. [2018-10-15 15:36:03,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-15 15:36:03,446 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:03,446 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:03,446 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:03,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:03,447 INFO L82 PathProgramCache]: Analyzing trace with hash -47531090, now seen corresponding path program 11 times [2018-10-15 15:36:03,450 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:03,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:04,742 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 216 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:36:04,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:04,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 15:36:04,745 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 15:36:04,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 15:36:04,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812 [2018-10-15 15:36:04,745 INFO L87 Difference]: Start difference. First operand 140 states and 141 transitions. Second operand 29 states. [2018-10-15 15:36:05,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:05,751 INFO L93 Difference]: Finished difference Result 225 states and 226 transitions. [2018-10-15 15:36:05,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-15 15:36:05,752 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 139 [2018-10-15 15:36:05,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:05,753 INFO L225 Difference]: With dead ends: 225 [2018-10-15 15:36:05,753 INFO L226 Difference]: Without dead ends: 150 [2018-10-15 15:36:05,755 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 830 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=659, Invalid=3001, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 15:36:05,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-10-15 15:36:05,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2018-10-15 15:36:05,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-10-15 15:36:05,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 149 transitions. [2018-10-15 15:36:05,758 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 149 transitions. Word has length 139 [2018-10-15 15:36:05,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:05,758 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 149 transitions. [2018-10-15 15:36:05,758 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 15:36:05,759 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 149 transitions. [2018-10-15 15:36:05,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-15 15:36:05,760 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:05,760 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:05,761 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:05,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:05,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1194932058, now seen corresponding path program 12 times [2018-10-15 15:36:05,762 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:05,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:06,575 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 182 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:36:06,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:06,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 15:36:06,576 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 15:36:06,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 15:36:06,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=571, Unknown=0, NotChecked=0, Total=702 [2018-10-15 15:36:06,577 INFO L87 Difference]: Start difference. First operand 148 states and 149 transitions. Second operand 27 states. [2018-10-15 15:36:07,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:07,883 INFO L93 Difference]: Finished difference Result 174 states and 175 transitions. [2018-10-15 15:36:07,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-15 15:36:07,885 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 147 [2018-10-15 15:36:07,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:07,887 INFO L225 Difference]: With dead ends: 174 [2018-10-15 15:36:07,887 INFO L226 Difference]: Without dead ends: 174 [2018-10-15 15:36:07,889 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1323 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=898, Invalid=3658, Unknown=0, NotChecked=0, Total=4556 [2018-10-15 15:36:07,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-10-15 15:36:07,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 160. [2018-10-15 15:36:07,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-10-15 15:36:07,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 161 transitions. [2018-10-15 15:36:07,893 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 161 transitions. Word has length 147 [2018-10-15 15:36:07,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:07,894 INFO L481 AbstractCegarLoop]: Abstraction has 160 states and 161 transitions. [2018-10-15 15:36:07,894 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 15:36:07,894 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 161 transitions. [2018-10-15 15:36:07,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-15 15:36:07,895 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:07,895 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:07,896 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:07,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:07,896 INFO L82 PathProgramCache]: Analyzing trace with hash -184340847, now seen corresponding path program 13 times [2018-10-15 15:36:07,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:07,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:08,393 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 294 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:36:08,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:08,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 15:36:08,395 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 15:36:08,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 15:36:08,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=895, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 15:36:08,396 INFO L87 Difference]: Start difference. First operand 160 states and 161 transitions. Second operand 33 states. [2018-10-15 15:36:09,068 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-15 15:36:10,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:10,128 INFO L93 Difference]: Finished difference Result 257 states and 258 transitions. [2018-10-15 15:36:10,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-15 15:36:10,128 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 159 [2018-10-15 15:36:10,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:10,130 INFO L225 Difference]: With dead ends: 257 [2018-10-15 15:36:10,130 INFO L226 Difference]: Without dead ends: 170 [2018-10-15 15:36:10,132 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1133 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=850, Invalid=3980, Unknown=0, NotChecked=0, Total=4830 [2018-10-15 15:36:10,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-10-15 15:36:10,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 168. [2018-10-15 15:36:10,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-10-15 15:36:10,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 169 transitions. [2018-10-15 15:36:10,136 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 169 transitions. Word has length 159 [2018-10-15 15:36:10,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:10,136 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 169 transitions. [2018-10-15 15:36:10,136 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 15:36:10,136 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 169 transitions. [2018-10-15 15:36:10,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-10-15 15:36:10,137 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:10,137 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:10,138 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:10,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:10,138 INFO L82 PathProgramCache]: Analyzing trace with hash 709824393, now seen corresponding path program 14 times [2018-10-15 15:36:10,139 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:10,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:10,870 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 240 proven. 294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:36:10,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:10,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-15 15:36:10,871 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-15 15:36:10,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-15 15:36:10,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=710, Unknown=0, NotChecked=0, Total=870 [2018-10-15 15:36:10,872 INFO L87 Difference]: Start difference. First operand 168 states and 169 transitions. Second operand 30 states. [2018-10-15 15:36:12,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:12,056 INFO L93 Difference]: Finished difference Result 194 states and 195 transitions. [2018-10-15 15:36:12,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-15 15:36:12,056 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 167 [2018-10-15 15:36:12,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:12,058 INFO L225 Difference]: With dead ends: 194 [2018-10-15 15:36:12,058 INFO L226 Difference]: Without dead ends: 194 [2018-10-15 15:36:12,060 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1737 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1137, Invalid=4715, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 15:36:12,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-10-15 15:36:12,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 180. [2018-10-15 15:36:12,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-10-15 15:36:12,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 181 transitions. [2018-10-15 15:36:12,065 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 181 transitions. Word has length 167 [2018-10-15 15:36:12,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:12,065 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 181 transitions. [2018-10-15 15:36:12,065 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-15 15:36:12,066 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 181 transitions. [2018-10-15 15:36:12,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-15 15:36:12,067 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:12,067 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:12,067 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:12,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:12,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1400817420, now seen corresponding path program 15 times [2018-10-15 15:36:12,068 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:12,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:12,989 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 384 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:36:12,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:12,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 15:36:12,990 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 15:36:12,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 15:36:12,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1133, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 15:36:12,991 INFO L87 Difference]: Start difference. First operand 180 states and 181 transitions. Second operand 37 states. [2018-10-15 15:36:14,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:14,201 INFO L93 Difference]: Finished difference Result 289 states and 290 transitions. [2018-10-15 15:36:14,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-15 15:36:14,201 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 179 [2018-10-15 15:36:14,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:14,202 INFO L225 Difference]: With dead ends: 289 [2018-10-15 15:36:14,203 INFO L226 Difference]: Without dead ends: 190 [2018-10-15 15:36:14,204 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1483 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1065, Invalid=5097, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 15:36:14,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-10-15 15:36:14,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 188. [2018-10-15 15:36:14,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-10-15 15:36:14,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 189 transitions. [2018-10-15 15:36:14,208 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 189 transitions. Word has length 179 [2018-10-15 15:36:14,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:14,209 INFO L481 AbstractCegarLoop]: Abstraction has 188 states and 189 transitions. [2018-10-15 15:36:14,209 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 15:36:14,209 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 189 transitions. [2018-10-15 15:36:14,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-10-15 15:36:14,210 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:14,210 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:14,210 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:14,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:14,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1498082796, now seen corresponding path program 16 times [2018-10-15 15:36:14,211 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:14,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:14,779 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 306 proven. 384 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:36:14,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:14,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 15:36:14,780 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 15:36:14,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 15:36:14,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=864, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 15:36:14,781 INFO L87 Difference]: Start difference. First operand 188 states and 189 transitions. Second operand 33 states. [2018-10-15 15:36:16,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:16,300 INFO L93 Difference]: Finished difference Result 214 states and 215 transitions. [2018-10-15 15:36:16,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-15 15:36:16,301 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 187 [2018-10-15 15:36:16,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:16,303 INFO L225 Difference]: With dead ends: 214 [2018-10-15 15:36:16,303 INFO L226 Difference]: Without dead ends: 214 [2018-10-15 15:36:16,305 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2207 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1404, Invalid=5906, Unknown=0, NotChecked=0, Total=7310 [2018-10-15 15:36:16,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-10-15 15:36:16,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 200. [2018-10-15 15:36:16,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-10-15 15:36:16,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 201 transitions. [2018-10-15 15:36:16,310 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 201 transitions. Word has length 187 [2018-10-15 15:36:16,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:16,310 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 201 transitions. [2018-10-15 15:36:16,311 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 15:36:16,311 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 201 transitions. [2018-10-15 15:36:16,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-15 15:36:16,312 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:16,312 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:16,312 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:16,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:16,313 INFO L82 PathProgramCache]: Analyzing trace with hash 390830807, now seen corresponding path program 17 times [2018-10-15 15:36:16,313 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:16,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:16,999 INFO L134 CoverageAnalysis]: Checked inductivity of 792 backedges. 486 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:36:17,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:17,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 15:36:17,000 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 15:36:17,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 15:36:17,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=1399, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 15:36:17,002 INFO L87 Difference]: Start difference. First operand 200 states and 201 transitions. Second operand 41 states. [2018-10-15 15:36:18,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:18,625 INFO L93 Difference]: Finished difference Result 321 states and 322 transitions. [2018-10-15 15:36:18,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-15 15:36:18,625 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 199 [2018-10-15 15:36:18,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:18,626 INFO L225 Difference]: With dead ends: 321 [2018-10-15 15:36:18,626 INFO L226 Difference]: Without dead ends: 210 [2018-10-15 15:36:18,628 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1880 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1304, Invalid=6352, Unknown=0, NotChecked=0, Total=7656 [2018-10-15 15:36:18,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-10-15 15:36:18,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 208. [2018-10-15 15:36:18,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-10-15 15:36:18,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 209 transitions. [2018-10-15 15:36:18,632 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 209 transitions. Word has length 199 [2018-10-15 15:36:18,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:18,633 INFO L481 AbstractCegarLoop]: Abstraction has 208 states and 209 transitions. [2018-10-15 15:36:18,633 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 15:36:18,633 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 209 transitions. [2018-10-15 15:36:18,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-10-15 15:36:18,634 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:18,634 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:18,634 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:18,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:18,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1180771279, now seen corresponding path program 18 times [2018-10-15 15:36:18,635 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:18,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:19,322 INFO L134 CoverageAnalysis]: Checked inductivity of 866 backedges. 380 proven. 486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:36:19,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:19,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-15 15:36:19,323 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-15 15:36:19,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-15 15:36:19,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=1033, Unknown=0, NotChecked=0, Total=1260 [2018-10-15 15:36:19,324 INFO L87 Difference]: Start difference. First operand 208 states and 209 transitions. Second operand 36 states. [2018-10-15 15:36:21,755 WARN L179 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 11 [2018-10-15 15:36:22,113 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-15 15:36:22,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:22,985 INFO L93 Difference]: Finished difference Result 234 states and 235 transitions. [2018-10-15 15:36:22,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-15 15:36:22,986 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 207 [2018-10-15 15:36:22,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:22,989 INFO L225 Difference]: With dead ends: 234 [2018-10-15 15:36:22,989 INFO L226 Difference]: Without dead ends: 234 [2018-10-15 15:36:22,991 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2733 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1699, Invalid=7231, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 15:36:22,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-10-15 15:36:22,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 220. [2018-10-15 15:36:22,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-10-15 15:36:22,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 221 transitions. [2018-10-15 15:36:22,995 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 221 transitions. Word has length 207 [2018-10-15 15:36:22,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:22,996 INFO L481 AbstractCegarLoop]: Abstraction has 220 states and 221 transitions. [2018-10-15 15:36:22,996 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-15 15:36:22,996 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 221 transitions. [2018-10-15 15:36:22,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-10-15 15:36:22,997 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:22,998 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:22,998 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:22,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:22,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1310124998, now seen corresponding path program 19 times [2018-10-15 15:36:22,999 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:23,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:24,088 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 600 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:36:24,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:24,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 15:36:24,089 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 15:36:24,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 15:36:24,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=1693, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 15:36:24,090 INFO L87 Difference]: Start difference. First operand 220 states and 221 transitions. Second operand 45 states. [2018-10-15 15:36:26,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:26,578 INFO L93 Difference]: Finished difference Result 353 states and 354 transitions. [2018-10-15 15:36:26,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-15 15:36:26,579 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 219 [2018-10-15 15:36:26,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:26,580 INFO L225 Difference]: With dead ends: 353 [2018-10-15 15:36:26,580 INFO L226 Difference]: Without dead ends: 230 [2018-10-15 15:36:26,581 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2324 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1567, Invalid=7745, Unknown=0, NotChecked=0, Total=9312 [2018-10-15 15:36:26,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-10-15 15:36:26,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 228. [2018-10-15 15:36:26,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-10-15 15:36:26,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 229 transitions. [2018-10-15 15:36:26,586 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 229 transitions. Word has length 219 [2018-10-15 15:36:26,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:26,586 INFO L481 AbstractCegarLoop]: Abstraction has 228 states and 229 transitions. [2018-10-15 15:36:26,586 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 15:36:26,586 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 229 transitions. [2018-10-15 15:36:26,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-10-15 15:36:26,588 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:26,588 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:26,588 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:26,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:26,589 INFO L82 PathProgramCache]: Analyzing trace with hash -82284238, now seen corresponding path program 20 times [2018-10-15 15:36:26,589 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:26,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:27,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1062 backedges. 462 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:36:27,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:27,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 15:36:27,643 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 15:36:27,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 15:36:27,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=1217, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 15:36:27,644 INFO L87 Difference]: Start difference. First operand 228 states and 229 transitions. Second operand 39 states. [2018-10-15 15:36:29,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:29,504 INFO L93 Difference]: Finished difference Result 254 states and 255 transitions. [2018-10-15 15:36:29,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-15 15:36:29,512 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 227 [2018-10-15 15:36:29,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:29,513 INFO L225 Difference]: With dead ends: 254 [2018-10-15 15:36:29,513 INFO L226 Difference]: Without dead ends: 254 [2018-10-15 15:36:29,514 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3315 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2022, Invalid=8690, Unknown=0, NotChecked=0, Total=10712 [2018-10-15 15:36:29,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-10-15 15:36:29,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 240. [2018-10-15 15:36:29,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-10-15 15:36:29,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 241 transitions. [2018-10-15 15:36:29,521 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 241 transitions. Word has length 227 [2018-10-15 15:36:29,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:29,521 INFO L481 AbstractCegarLoop]: Abstraction has 240 states and 241 transitions. [2018-10-15 15:36:29,522 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 15:36:29,522 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 241 transitions. [2018-10-15 15:36:29,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-10-15 15:36:29,523 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:29,523 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:29,523 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:29,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:29,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1312791267, now seen corresponding path program 21 times [2018-10-15 15:36:29,524 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:29,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:30,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1188 backedges. 726 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:36:30,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:30,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 15:36:30,753 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 15:36:30,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 15:36:30,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=2015, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 15:36:30,754 INFO L87 Difference]: Start difference. First operand 240 states and 241 transitions. Second operand 49 states. [2018-10-15 15:36:32,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:32,700 INFO L93 Difference]: Finished difference Result 385 states and 386 transitions. [2018-10-15 15:36:32,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-15 15:36:32,700 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 239 [2018-10-15 15:36:32,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:32,702 INFO L225 Difference]: With dead ends: 385 [2018-10-15 15:36:32,702 INFO L226 Difference]: Without dead ends: 250 [2018-10-15 15:36:32,703 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2815 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1854, Invalid=9276, Unknown=0, NotChecked=0, Total=11130 [2018-10-15 15:36:32,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-10-15 15:36:32,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2018-10-15 15:36:32,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-10-15 15:36:32,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 249 transitions. [2018-10-15 15:36:32,708 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 249 transitions. Word has length 239 [2018-10-15 15:36:32,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:32,709 INFO L481 AbstractCegarLoop]: Abstraction has 248 states and 249 transitions. [2018-10-15 15:36:32,709 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 15:36:32,709 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 249 transitions. [2018-10-15 15:36:32,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-10-15 15:36:32,710 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:32,710 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:32,711 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:32,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:32,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1177053675, now seen corresponding path program 22 times [2018-10-15 15:36:32,712 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:32,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:33,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1278 backedges. 552 proven. 726 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:36:33,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:33,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-15 15:36:33,377 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-15 15:36:33,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-15 15:36:33,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=1416, Unknown=0, NotChecked=0, Total=1722 [2018-10-15 15:36:33,378 INFO L87 Difference]: Start difference. First operand 248 states and 249 transitions. Second operand 42 states. [2018-10-15 15:36:35,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:35,284 INFO L93 Difference]: Finished difference Result 274 states and 275 transitions. [2018-10-15 15:36:35,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-15 15:36:35,284 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 247 [2018-10-15 15:36:35,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:35,286 INFO L225 Difference]: With dead ends: 274 [2018-10-15 15:36:35,286 INFO L226 Difference]: Without dead ends: 274 [2018-10-15 15:36:35,288 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3953 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2373, Invalid=10283, Unknown=0, NotChecked=0, Total=12656 [2018-10-15 15:36:35,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-10-15 15:36:35,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 260. [2018-10-15 15:36:35,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-10-15 15:36:35,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 261 transitions. [2018-10-15 15:36:35,293 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 261 transitions. Word has length 247 [2018-10-15 15:36:35,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:35,294 INFO L481 AbstractCegarLoop]: Abstraction has 260 states and 261 transitions. [2018-10-15 15:36:35,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-15 15:36:35,294 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 261 transitions. [2018-10-15 15:36:35,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-10-15 15:36:35,295 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:35,296 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:35,296 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:35,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:35,296 INFO L82 PathProgramCache]: Analyzing trace with hash 890785152, now seen corresponding path program 23 times [2018-10-15 15:36:35,297 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:35,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:36,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 864 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:36:36,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:36,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 15:36:36,550 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 15:36:36,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 15:36:36,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=391, Invalid=2365, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 15:36:36,550 INFO L87 Difference]: Start difference. First operand 260 states and 261 transitions. Second operand 53 states. [2018-10-15 15:36:38,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:38,612 INFO L93 Difference]: Finished difference Result 417 states and 418 transitions. [2018-10-15 15:36:38,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-15 15:36:38,612 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 259 [2018-10-15 15:36:38,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:38,615 INFO L225 Difference]: With dead ends: 417 [2018-10-15 15:36:38,615 INFO L226 Difference]: Without dead ends: 270 [2018-10-15 15:36:38,617 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3353 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2165, Invalid=10945, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 15:36:38,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-10-15 15:36:38,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 268. [2018-10-15 15:36:38,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-10-15 15:36:38,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 269 transitions. [2018-10-15 15:36:38,621 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 269 transitions. Word has length 259 [2018-10-15 15:36:38,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:38,622 INFO L481 AbstractCegarLoop]: Abstraction has 268 states and 269 transitions. [2018-10-15 15:36:38,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 15:36:38,622 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 269 transitions. [2018-10-15 15:36:38,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-10-15 15:36:38,624 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:38,624 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:38,624 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:38,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:38,625 INFO L82 PathProgramCache]: Analyzing trace with hash 770003576, now seen corresponding path program 24 times [2018-10-15 15:36:38,625 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:38,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:39,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1514 backedges. 650 proven. 864 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:36:39,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:39,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 15:36:39,989 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 15:36:39,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 15:36:39,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=350, Invalid=1630, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 15:36:39,990 INFO L87 Difference]: Start difference. First operand 268 states and 269 transitions. Second operand 45 states. [2018-10-15 15:36:42,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:42,639 INFO L93 Difference]: Finished difference Result 294 states and 295 transitions. [2018-10-15 15:36:42,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-10-15 15:36:42,640 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 267 [2018-10-15 15:36:42,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:42,642 INFO L225 Difference]: With dead ends: 294 [2018-10-15 15:36:42,642 INFO L226 Difference]: Without dead ends: 294 [2018-10-15 15:36:42,643 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4647 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2752, Invalid=12010, Unknown=0, NotChecked=0, Total=14762 [2018-10-15 15:36:42,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-10-15 15:36:42,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 280. [2018-10-15 15:36:42,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-10-15 15:36:42,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 281 transitions. [2018-10-15 15:36:42,647 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 281 transitions. Word has length 267 [2018-10-15 15:36:42,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:42,648 INFO L481 AbstractCegarLoop]: Abstraction has 280 states and 281 transitions. [2018-10-15 15:36:42,648 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 15:36:42,648 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 281 transitions. [2018-10-15 15:36:42,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-10-15 15:36:42,650 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:42,650 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:42,650 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:42,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:42,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1930923363, now seen corresponding path program 25 times [2018-10-15 15:36:42,651 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:42,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:44,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1664 backedges. 1014 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:36:44,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:44,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 15:36:44,133 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 15:36:44,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 15:36:44,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=449, Invalid=2743, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 15:36:44,134 INFO L87 Difference]: Start difference. First operand 280 states and 281 transitions. Second operand 57 states. [2018-10-15 15:36:46,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:46,927 INFO L93 Difference]: Finished difference Result 449 states and 450 transitions. [2018-10-15 15:36:46,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-10-15 15:36:46,927 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 279 [2018-10-15 15:36:46,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:46,929 INFO L225 Difference]: With dead ends: 449 [2018-10-15 15:36:46,929 INFO L226 Difference]: Without dead ends: 290 [2018-10-15 15:36:46,930 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3938 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2500, Invalid=12752, Unknown=0, NotChecked=0, Total=15252 [2018-10-15 15:36:46,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-10-15 15:36:46,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 288. [2018-10-15 15:36:46,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-10-15 15:36:46,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 289 transitions. [2018-10-15 15:36:46,935 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 289 transitions. Word has length 279 [2018-10-15 15:36:46,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:46,935 INFO L481 AbstractCegarLoop]: Abstraction has 288 states and 289 transitions. [2018-10-15 15:36:46,935 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 15:36:46,935 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 289 transitions. [2018-10-15 15:36:46,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-10-15 15:36:46,937 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:46,937 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:46,937 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:46,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:46,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1687656869, now seen corresponding path program 26 times [2018-10-15 15:36:46,939 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:46,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:48,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 756 proven. 1014 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:36:48,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:48,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-15 15:36:48,501 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-15 15:36:48,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-15 15:36:48,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=397, Invalid=1859, Unknown=0, NotChecked=0, Total=2256 [2018-10-15 15:36:48,502 INFO L87 Difference]: Start difference. First operand 288 states and 289 transitions. Second operand 48 states. [2018-10-15 15:36:50,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:50,921 INFO L93 Difference]: Finished difference Result 314 states and 315 transitions. [2018-10-15 15:36:50,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-10-15 15:36:50,922 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 287 [2018-10-15 15:36:50,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:50,925 INFO L225 Difference]: With dead ends: 314 [2018-10-15 15:36:50,925 INFO L226 Difference]: Without dead ends: 314 [2018-10-15 15:36:50,927 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5397 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3159, Invalid=13871, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 15:36:50,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-10-15 15:36:50,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 300. [2018-10-15 15:36:50,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-10-15 15:36:50,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 301 transitions. [2018-10-15 15:36:50,932 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 301 transitions. Word has length 287 [2018-10-15 15:36:50,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:50,932 INFO L481 AbstractCegarLoop]: Abstraction has 300 states and 301 transitions. [2018-10-15 15:36:50,932 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-15 15:36:50,933 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 301 transitions. [2018-10-15 15:36:50,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-10-15 15:36:50,934 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:50,934 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:50,935 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:50,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:50,935 INFO L82 PathProgramCache]: Analyzing trace with hash -339417914, now seen corresponding path program 27 times [2018-10-15 15:36:50,936 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:50,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:52,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1932 backedges. 1176 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:36:52,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:52,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-15 15:36:52,425 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-15 15:36:52,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-15 15:36:52,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=511, Invalid=3149, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 15:36:52,425 INFO L87 Difference]: Start difference. First operand 300 states and 301 transitions. Second operand 61 states. [2018-10-15 15:36:55,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:55,235 INFO L93 Difference]: Finished difference Result 481 states and 482 transitions. [2018-10-15 15:36:55,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-10-15 15:36:55,235 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 299 [2018-10-15 15:36:55,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:55,236 INFO L225 Difference]: With dead ends: 481 [2018-10-15 15:36:55,236 INFO L226 Difference]: Without dead ends: 310 [2018-10-15 15:36:55,238 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4570 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2859, Invalid=14697, Unknown=0, NotChecked=0, Total=17556 [2018-10-15 15:36:55,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-10-15 15:36:55,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 308. [2018-10-15 15:36:55,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-10-15 15:36:55,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 309 transitions. [2018-10-15 15:36:55,242 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 309 transitions. Word has length 299 [2018-10-15 15:36:55,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:55,243 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 309 transitions. [2018-10-15 15:36:55,243 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-15 15:36:55,243 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 309 transitions. [2018-10-15 15:36:55,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-10-15 15:36:55,244 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:55,245 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:55,245 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:55,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:55,245 INFO L82 PathProgramCache]: Analyzing trace with hash 258445758, now seen corresponding path program 28 times [2018-10-15 15:36:55,246 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:55,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:56,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2046 backedges. 870 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:36:56,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:56,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 15:36:56,171 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 15:36:56,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 15:36:56,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=2103, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 15:36:56,171 INFO L87 Difference]: Start difference. First operand 308 states and 309 transitions. Second operand 51 states. [2018-10-15 15:36:58,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:58,978 INFO L93 Difference]: Finished difference Result 334 states and 335 transitions. [2018-10-15 15:36:58,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-10-15 15:36:58,979 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 307 [2018-10-15 15:36:58,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:58,981 INFO L225 Difference]: With dead ends: 334 [2018-10-15 15:36:58,981 INFO L226 Difference]: Without dead ends: 334 [2018-10-15 15:36:58,983 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6203 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3594, Invalid=15866, Unknown=0, NotChecked=0, Total=19460 [2018-10-15 15:36:58,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-10-15 15:36:58,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 320. [2018-10-15 15:36:58,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-10-15 15:36:58,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 321 transitions. [2018-10-15 15:36:58,987 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 321 transitions. Word has length 307 [2018-10-15 15:36:58,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:58,988 INFO L481 AbstractCegarLoop]: Abstraction has 320 states and 321 transitions. [2018-10-15 15:36:58,988 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 15:36:58,988 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 321 transitions. [2018-10-15 15:36:58,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2018-10-15 15:36:58,990 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:58,990 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:58,990 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:58,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:58,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1744366679, now seen corresponding path program 29 times [2018-10-15 15:36:58,991 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:59,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:37:00,927 INFO L134 CoverageAnalysis]: Checked inductivity of 2220 backedges. 1350 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:37:00,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:37:00,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-15 15:37:00,928 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-15 15:37:00,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-15 15:37:00,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=577, Invalid=3583, Unknown=0, NotChecked=0, Total=4160 [2018-10-15 15:37:00,929 INFO L87 Difference]: Start difference. First operand 320 states and 321 transitions. Second operand 65 states. [2018-10-15 15:37:04,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:37:04,407 INFO L93 Difference]: Finished difference Result 513 states and 514 transitions. [2018-10-15 15:37:04,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-10-15 15:37:04,407 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 319 [2018-10-15 15:37:04,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:37:04,409 INFO L225 Difference]: With dead ends: 513 [2018-10-15 15:37:04,409 INFO L226 Difference]: Without dead ends: 330 [2018-10-15 15:37:04,410 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5249 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=3242, Invalid=16780, Unknown=0, NotChecked=0, Total=20022 [2018-10-15 15:37:04,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-10-15 15:37:04,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 328. [2018-10-15 15:37:04,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-10-15 15:37:04,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 329 transitions. [2018-10-15 15:37:04,415 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 329 transitions. Word has length 319 [2018-10-15 15:37:04,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:37:04,415 INFO L481 AbstractCegarLoop]: Abstraction has 328 states and 329 transitions. [2018-10-15 15:37:04,415 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-15 15:37:04,415 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 329 transitions. [2018-10-15 15:37:04,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-10-15 15:37:04,417 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:37:04,417 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:37:04,418 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:37:04,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:37:04,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1882614623, now seen corresponding path program 30 times [2018-10-15 15:37:04,419 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:37:04,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:37:05,555 INFO L134 CoverageAnalysis]: Checked inductivity of 2342 backedges. 992 proven. 1350 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:37:05,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:37:05,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-15 15:37:05,556 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-15 15:37:05,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-15 15:37:05,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=500, Invalid=2362, Unknown=0, NotChecked=0, Total=2862 [2018-10-15 15:37:05,557 INFO L87 Difference]: Start difference. First operand 328 states and 329 transitions. Second operand 54 states. [2018-10-15 15:37:08,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:37:08,776 INFO L93 Difference]: Finished difference Result 354 states and 355 transitions. [2018-10-15 15:37:08,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-10-15 15:37:08,776 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 327 [2018-10-15 15:37:08,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:37:08,779 INFO L225 Difference]: With dead ends: 354 [2018-10-15 15:37:08,779 INFO L226 Difference]: Without dead ends: 354 [2018-10-15 15:37:08,781 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7065 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4057, Invalid=17995, Unknown=0, NotChecked=0, Total=22052 [2018-10-15 15:37:08,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-10-15 15:37:08,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 340. [2018-10-15 15:37:08,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-10-15 15:37:08,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 341 transitions. [2018-10-15 15:37:08,784 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 341 transitions. Word has length 327 [2018-10-15 15:37:08,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:37:08,785 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 341 transitions. [2018-10-15 15:37:08,786 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-15 15:37:08,786 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 341 transitions. [2018-10-15 15:37:08,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2018-10-15 15:37:08,791 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:37:08,791 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:37:08,792 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:37:08,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:37:08,792 INFO L82 PathProgramCache]: Analyzing trace with hash 430234124, now seen corresponding path program 31 times [2018-10-15 15:37:08,793 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:37:08,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:37:10,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2528 backedges. 1536 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:37:10,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:37:10,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-15 15:37:10,390 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-15 15:37:10,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-15 15:37:10,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=647, Invalid=4045, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 15:37:10,391 INFO L87 Difference]: Start difference. First operand 340 states and 341 transitions. Second operand 69 states. [2018-10-15 15:37:14,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:37:14,137 INFO L93 Difference]: Finished difference Result 545 states and 546 transitions. [2018-10-15 15:37:14,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-10-15 15:37:14,137 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 339 [2018-10-15 15:37:14,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:37:14,139 INFO L225 Difference]: With dead ends: 545 [2018-10-15 15:37:14,139 INFO L226 Difference]: Without dead ends: 350 [2018-10-15 15:37:14,141 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5975 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=3649, Invalid=19001, Unknown=0, NotChecked=0, Total=22650 [2018-10-15 15:37:14,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-10-15 15:37:14,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 348. [2018-10-15 15:37:14,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-10-15 15:37:14,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 349 transitions. [2018-10-15 15:37:14,146 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 349 transitions. Word has length 339 [2018-10-15 15:37:14,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:37:14,146 INFO L481 AbstractCegarLoop]: Abstraction has 348 states and 349 transitions. [2018-10-15 15:37:14,146 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-15 15:37:14,146 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 349 transitions. [2018-10-15 15:37:14,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2018-10-15 15:37:14,148 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:37:14,149 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:37:14,149 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:37:14,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:37:14,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1263873796, now seen corresponding path program 32 times [2018-10-15 15:37:14,150 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:37:14,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:37:15,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2658 backedges. 1122 proven. 1536 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:37:15,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:37:15,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 15:37:15,285 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 15:37:15,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 15:37:15,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=556, Invalid=2636, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 15:37:15,286 INFO L87 Difference]: Start difference. First operand 348 states and 349 transitions. Second operand 57 states. [2018-10-15 15:37:18,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:37:18,558 INFO L93 Difference]: Finished difference Result 374 states and 375 transitions. [2018-10-15 15:37:18,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-10-15 15:37:18,559 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 347 [2018-10-15 15:37:18,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:37:18,561 INFO L225 Difference]: With dead ends: 374 [2018-10-15 15:37:18,561 INFO L226 Difference]: Without dead ends: 374 [2018-10-15 15:37:18,563 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7983 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4548, Invalid=20258, Unknown=0, NotChecked=0, Total=24806 [2018-10-15 15:37:18,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2018-10-15 15:37:18,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 360. [2018-10-15 15:37:18,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-10-15 15:37:18,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 361 transitions. [2018-10-15 15:37:18,568 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 361 transitions. Word has length 347 [2018-10-15 15:37:18,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:37:18,569 INFO L481 AbstractCegarLoop]: Abstraction has 360 states and 361 transitions. [2018-10-15 15:37:18,569 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 15:37:18,569 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 361 transitions. [2018-10-15 15:37:18,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2018-10-15 15:37:18,571 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:37:18,571 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:37:18,571 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:37:18,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:37:18,572 INFO L82 PathProgramCache]: Analyzing trace with hash -347801617, now seen corresponding path program 33 times [2018-10-15 15:37:18,573 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:37:18,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:37:20,440 INFO L134 CoverageAnalysis]: Checked inductivity of 2856 backedges. 1734 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:37:20,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:37:20,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-15 15:37:20,441 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-15 15:37:20,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-15 15:37:20,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=721, Invalid=4535, Unknown=0, NotChecked=0, Total=5256 [2018-10-15 15:37:20,442 INFO L87 Difference]: Start difference. First operand 360 states and 361 transitions. Second operand 73 states. [2018-10-15 15:37:24,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:37:24,441 INFO L93 Difference]: Finished difference Result 577 states and 578 transitions. [2018-10-15 15:37:24,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-10-15 15:37:24,441 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 359 [2018-10-15 15:37:24,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:37:24,442 INFO L225 Difference]: With dead ends: 577 [2018-10-15 15:37:24,442 INFO L226 Difference]: Without dead ends: 370 [2018-10-15 15:37:24,444 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6748 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4080, Invalid=21360, Unknown=0, NotChecked=0, Total=25440 [2018-10-15 15:37:24,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2018-10-15 15:37:24,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 368. [2018-10-15 15:37:24,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-10-15 15:37:24,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 369 transitions. [2018-10-15 15:37:24,447 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 369 transitions. Word has length 359 [2018-10-15 15:37:24,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:37:24,448 INFO L481 AbstractCegarLoop]: Abstraction has 368 states and 369 transitions. [2018-10-15 15:37:24,448 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-15 15:37:24,448 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 369 transitions. [2018-10-15 15:37:24,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2018-10-15 15:37:24,450 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:37:24,450 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:37:24,450 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:37:24,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:37:24,451 INFO L82 PathProgramCache]: Analyzing trace with hash -911138585, now seen corresponding path program 34 times [2018-10-15 15:37:24,451 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:37:24,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:37:25,885 INFO L134 CoverageAnalysis]: Checked inductivity of 2994 backedges. 1260 proven. 1734 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:37:25,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:37:25,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-10-15 15:37:25,886 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-15 15:37:25,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-15 15:37:25,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=615, Invalid=2925, Unknown=0, NotChecked=0, Total=3540 [2018-10-15 15:37:25,887 INFO L87 Difference]: Start difference. First operand 368 states and 369 transitions. Second operand 60 states. [2018-10-15 15:37:29,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:37:29,035 INFO L93 Difference]: Finished difference Result 394 states and 395 transitions. [2018-10-15 15:37:29,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-10-15 15:37:29,036 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 367 [2018-10-15 15:37:29,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:37:29,038 INFO L225 Difference]: With dead ends: 394 [2018-10-15 15:37:29,038 INFO L226 Difference]: Without dead ends: 394 [2018-10-15 15:37:29,040 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8957 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5067, Invalid=22655, Unknown=0, NotChecked=0, Total=27722 [2018-10-15 15:37:29,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-10-15 15:37:29,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 380. [2018-10-15 15:37:29,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-10-15 15:37:29,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 381 transitions. [2018-10-15 15:37:29,045 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 381 transitions. Word has length 367 [2018-10-15 15:37:29,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:37:29,045 INFO L481 AbstractCegarLoop]: Abstraction has 380 states and 381 transitions. [2018-10-15 15:37:29,046 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-15 15:37:29,046 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 381 transitions. [2018-10-15 15:37:29,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2018-10-15 15:37:29,048 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:37:29,048 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:37:29,048 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:37:29,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:37:29,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1871827630, now seen corresponding path program 35 times [2018-10-15 15:37:29,049 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:37:29,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:37:30,871 INFO L134 CoverageAnalysis]: Checked inductivity of 3204 backedges. 1944 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:37:30,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:37:30,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-15 15:37:30,872 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-15 15:37:30,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-15 15:37:30,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=799, Invalid=5053, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 15:37:30,873 INFO L87 Difference]: Start difference. First operand 380 states and 381 transitions. Second operand 77 states. [2018-10-15 15:37:34,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:37:34,237 INFO L93 Difference]: Finished difference Result 609 states and 610 transitions. [2018-10-15 15:37:34,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-10-15 15:37:34,238 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 379 [2018-10-15 15:37:34,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:37:34,239 INFO L225 Difference]: With dead ends: 609 [2018-10-15 15:37:34,239 INFO L226 Difference]: Without dead ends: 390 [2018-10-15 15:37:34,241 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7568 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=4535, Invalid=23857, Unknown=0, NotChecked=0, Total=28392 [2018-10-15 15:37:34,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2018-10-15 15:37:34,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 388. [2018-10-15 15:37:34,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-10-15 15:37:34,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 389 transitions. [2018-10-15 15:37:34,245 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 389 transitions. Word has length 379 [2018-10-15 15:37:34,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:37:34,245 INFO L481 AbstractCegarLoop]: Abstraction has 388 states and 389 transitions. [2018-10-15 15:37:34,245 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-15 15:37:34,245 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 389 transitions. [2018-10-15 15:37:34,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2018-10-15 15:37:34,247 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:37:34,248 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:37:34,248 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:37:34,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:37:34,248 INFO L82 PathProgramCache]: Analyzing trace with hash 459549258, now seen corresponding path program 36 times [2018-10-15 15:37:34,249 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:37:34,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:37:35,624 INFO L134 CoverageAnalysis]: Checked inductivity of 3350 backedges. 1406 proven. 1944 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:37:35,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:37:35,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-15 15:37:35,625 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-15 15:37:35,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-15 15:37:35,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=677, Invalid=3229, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 15:37:35,626 INFO L87 Difference]: Start difference. First operand 388 states and 389 transitions. Second operand 63 states. [2018-10-15 15:37:39,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:37:39,255 INFO L93 Difference]: Finished difference Result 414 states and 415 transitions. [2018-10-15 15:37:39,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-10-15 15:37:39,255 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 387 [2018-10-15 15:37:39,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:37:39,258 INFO L225 Difference]: With dead ends: 414 [2018-10-15 15:37:39,258 INFO L226 Difference]: Without dead ends: 414 [2018-10-15 15:37:39,260 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9987 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5614, Invalid=25186, Unknown=0, NotChecked=0, Total=30800 [2018-10-15 15:37:39,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2018-10-15 15:37:39,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 400. [2018-10-15 15:37:39,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-10-15 15:37:39,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 401 transitions. [2018-10-15 15:37:39,264 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 401 transitions. Word has length 387 [2018-10-15 15:37:39,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:37:39,265 INFO L481 AbstractCegarLoop]: Abstraction has 400 states and 401 transitions. [2018-10-15 15:37:39,265 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-15 15:37:39,265 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 401 transitions. [2018-10-15 15:37:39,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2018-10-15 15:37:39,268 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:37:39,268 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:37:39,268 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:37:39,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:37:39,269 INFO L82 PathProgramCache]: Analyzing trace with hash -980993483, now seen corresponding path program 37 times [2018-10-15 15:37:39,269 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:37:39,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:37:41,746 INFO L134 CoverageAnalysis]: Checked inductivity of 3572 backedges. 2166 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:37:41,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:37:41,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-15 15:37:41,747 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-15 15:37:41,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-15 15:37:41,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=881, Invalid=5599, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 15:37:41,748 INFO L87 Difference]: Start difference. First operand 400 states and 401 transitions. Second operand 81 states. [2018-10-15 15:37:46,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:37:46,875 INFO L93 Difference]: Finished difference Result 641 states and 642 transitions. [2018-10-15 15:37:46,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-10-15 15:37:46,875 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 399 [2018-10-15 15:37:46,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:37:46,877 INFO L225 Difference]: With dead ends: 641 [2018-10-15 15:37:46,877 INFO L226 Difference]: Without dead ends: 410 [2018-10-15 15:37:46,878 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8435 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=5014, Invalid=26492, Unknown=0, NotChecked=0, Total=31506 [2018-10-15 15:37:46,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-10-15 15:37:46,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 408. [2018-10-15 15:37:46,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2018-10-15 15:37:46,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 409 transitions. [2018-10-15 15:37:46,882 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 409 transitions. Word has length 399 [2018-10-15 15:37:46,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:37:46,883 INFO L481 AbstractCegarLoop]: Abstraction has 408 states and 409 transitions. [2018-10-15 15:37:46,883 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-15 15:37:46,883 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 409 transitions. [2018-10-15 15:37:46,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2018-10-15 15:37:46,885 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:37:46,886 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:37:46,886 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:37:46,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:37:46,886 INFO L82 PathProgramCache]: Analyzing trace with hash 164956973, now seen corresponding path program 38 times [2018-10-15 15:37:46,887 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:37:46,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:37:48,743 INFO L134 CoverageAnalysis]: Checked inductivity of 3726 backedges. 1560 proven. 2166 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:37:48,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:37:48,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-10-15 15:37:48,744 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-15 15:37:48,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-15 15:37:48,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=742, Invalid=3548, Unknown=0, NotChecked=0, Total=4290 [2018-10-15 15:37:48,745 INFO L87 Difference]: Start difference. First operand 408 states and 409 transitions. Second operand 66 states. [2018-10-15 15:37:52,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:37:52,390 INFO L93 Difference]: Finished difference Result 434 states and 435 transitions. [2018-10-15 15:37:52,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-10-15 15:37:52,390 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 407 [2018-10-15 15:37:52,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:37:52,393 INFO L225 Difference]: With dead ends: 434 [2018-10-15 15:37:52,393 INFO L226 Difference]: Without dead ends: 434 [2018-10-15 15:37:52,394 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11073 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6189, Invalid=27851, Unknown=0, NotChecked=0, Total=34040 [2018-10-15 15:37:52,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-10-15 15:37:52,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 420. [2018-10-15 15:37:52,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2018-10-15 15:37:52,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 421 transitions. [2018-10-15 15:37:52,399 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 421 transitions. Word has length 407 [2018-10-15 15:37:52,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:37:52,399 INFO L481 AbstractCegarLoop]: Abstraction has 420 states and 421 transitions. [2018-10-15 15:37:52,400 INFO L482 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-15 15:37:52,400 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 421 transitions. [2018-10-15 15:37:52,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2018-10-15 15:37:52,402 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:37:52,402 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:37:52,402 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:37:52,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:37:52,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1344872808, now seen corresponding path program 39 times [2018-10-15 15:37:52,403 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:37:52,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:37:54,605 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 2400 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:37:54,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:37:54,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-15 15:37:54,606 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-15 15:37:54,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-15 15:37:54,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=967, Invalid=6173, Unknown=0, NotChecked=0, Total=7140 [2018-10-15 15:37:54,607 INFO L87 Difference]: Start difference. First operand 420 states and 421 transitions. Second operand 85 states. [2018-10-15 15:38:00,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:38:00,090 INFO L93 Difference]: Finished difference Result 673 states and 674 transitions. [2018-10-15 15:38:00,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-10-15 15:38:00,090 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 419 [2018-10-15 15:38:00,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:38:00,092 INFO L225 Difference]: With dead ends: 673 [2018-10-15 15:38:00,092 INFO L226 Difference]: Without dead ends: 430 [2018-10-15 15:38:00,093 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9349 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=5517, Invalid=29265, Unknown=0, NotChecked=0, Total=34782 [2018-10-15 15:38:00,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2018-10-15 15:38:00,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 428. [2018-10-15 15:38:00,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-10-15 15:38:00,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 429 transitions. [2018-10-15 15:38:00,098 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 429 transitions. Word has length 419 [2018-10-15 15:38:00,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:38:00,098 INFO L481 AbstractCegarLoop]: Abstraction has 428 states and 429 transitions. [2018-10-15 15:38:00,098 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-15 15:38:00,099 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 429 transitions. [2018-10-15 15:38:00,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2018-10-15 15:38:00,101 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:38:00,101 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:38:00,101 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:38:00,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:38:00,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1196065680, now seen corresponding path program 40 times [2018-10-15 15:38:00,102 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:38:00,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:38:01,612 INFO L134 CoverageAnalysis]: Checked inductivity of 4122 backedges. 1722 proven. 2400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:38:01,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:38:01,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-15 15:38:01,613 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-15 15:38:01,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-15 15:38:01,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=810, Invalid=3882, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 15:38:01,614 INFO L87 Difference]: Start difference. First operand 428 states and 429 transitions. Second operand 69 states. [2018-10-15 15:38:06,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:38:06,259 INFO L93 Difference]: Finished difference Result 454 states and 455 transitions. [2018-10-15 15:38:06,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-10-15 15:38:06,260 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 427 [2018-10-15 15:38:06,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:38:06,262 INFO L225 Difference]: With dead ends: 454 [2018-10-15 15:38:06,262 INFO L226 Difference]: Without dead ends: 454 [2018-10-15 15:38:06,264 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12215 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6792, Invalid=30650, Unknown=0, NotChecked=0, Total=37442 [2018-10-15 15:38:06,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2018-10-15 15:38:06,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 440. [2018-10-15 15:38:06,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2018-10-15 15:38:06,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 441 transitions. [2018-10-15 15:38:06,268 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 441 transitions. Word has length 427 [2018-10-15 15:38:06,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:38:06,269 INFO L481 AbstractCegarLoop]: Abstraction has 440 states and 441 transitions. [2018-10-15 15:38:06,269 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-15 15:38:06,269 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 441 transitions. [2018-10-15 15:38:06,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2018-10-15 15:38:06,271 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:38:06,271 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:38:06,272 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:38:06,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:38:06,272 INFO L82 PathProgramCache]: Analyzing trace with hash 226744955, now seen corresponding path program 41 times [2018-10-15 15:38:06,273 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:38:06,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:38:08,949 INFO L134 CoverageAnalysis]: Checked inductivity of 4368 backedges. 2646 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:38:08,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:38:08,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-15 15:38:08,949 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-15 15:38:08,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-15 15:38:08,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1057, Invalid=6775, Unknown=0, NotChecked=0, Total=7832 [2018-10-15 15:38:08,950 INFO L87 Difference]: Start difference. First operand 440 states and 441 transitions. Second operand 89 states. [2018-10-15 15:38:14,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:38:14,462 INFO L93 Difference]: Finished difference Result 705 states and 706 transitions. [2018-10-15 15:38:14,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-10-15 15:38:14,462 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 439 [2018-10-15 15:38:14,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:38:14,464 INFO L225 Difference]: With dead ends: 705 [2018-10-15 15:38:14,464 INFO L226 Difference]: Without dead ends: 450 [2018-10-15 15:38:14,466 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10310 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=6044, Invalid=32176, Unknown=0, NotChecked=0, Total=38220 [2018-10-15 15:38:14,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2018-10-15 15:38:14,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 448. [2018-10-15 15:38:14,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2018-10-15 15:38:14,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 449 transitions. [2018-10-15 15:38:14,470 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 449 transitions. Word has length 439 [2018-10-15 15:38:14,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:38:14,470 INFO L481 AbstractCegarLoop]: Abstraction has 448 states and 449 transitions. [2018-10-15 15:38:14,470 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-15 15:38:14,470 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 449 transitions. [2018-10-15 15:38:14,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2018-10-15 15:38:14,472 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:38:14,472 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:38:14,472 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:38:14,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:38:14,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1628744845, now seen corresponding path program 42 times [2018-10-15 15:38:14,473 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:38:14,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:38:16,509 INFO L134 CoverageAnalysis]: Checked inductivity of 4538 backedges. 1892 proven. 2646 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:38:16,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:38:16,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-10-15 15:38:16,510 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-15 15:38:16,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-15 15:38:16,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=881, Invalid=4231, Unknown=0, NotChecked=0, Total=5112 [2018-10-15 15:38:16,511 INFO L87 Difference]: Start difference. First operand 448 states and 449 transitions. Second operand 72 states. [2018-10-15 15:38:21,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:38:21,496 INFO L93 Difference]: Finished difference Result 474 states and 475 transitions. [2018-10-15 15:38:21,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2018-10-15 15:38:21,497 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 447 [2018-10-15 15:38:21,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:38:21,500 INFO L225 Difference]: With dead ends: 474 [2018-10-15 15:38:21,500 INFO L226 Difference]: Without dead ends: 474 [2018-10-15 15:38:21,502 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13413 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=7423, Invalid=33583, Unknown=0, NotChecked=0, Total=41006 [2018-10-15 15:38:21,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2018-10-15 15:38:21,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 460. [2018-10-15 15:38:21,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-10-15 15:38:21,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 461 transitions. [2018-10-15 15:38:21,507 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 461 transitions. Word has length 447 [2018-10-15 15:38:21,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:38:21,508 INFO L481 AbstractCegarLoop]: Abstraction has 460 states and 461 transitions. [2018-10-15 15:38:21,508 INFO L482 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-15 15:38:21,508 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 461 transitions. [2018-10-15 15:38:21,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2018-10-15 15:38:21,510 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:38:21,510 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:38:21,511 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:38:21,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:38:21,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1704259038, now seen corresponding path program 43 times [2018-10-15 15:38:21,512 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:38:21,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:38:24,275 INFO L134 CoverageAnalysis]: Checked inductivity of 4796 backedges. 2904 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:38:24,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:38:24,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-15 15:38:24,276 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-15 15:38:24,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-15 15:38:24,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1151, Invalid=7405, Unknown=0, NotChecked=0, Total=8556 [2018-10-15 15:38:24,277 INFO L87 Difference]: Start difference. First operand 460 states and 461 transitions. Second operand 93 states. [2018-10-15 15:38:30,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:38:30,688 INFO L93 Difference]: Finished difference Result 737 states and 738 transitions. [2018-10-15 15:38:30,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-10-15 15:38:30,688 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 459 [2018-10-15 15:38:30,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:38:30,690 INFO L225 Difference]: With dead ends: 737 [2018-10-15 15:38:30,690 INFO L226 Difference]: Without dead ends: 470 [2018-10-15 15:38:30,691 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11318 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=6595, Invalid=35225, Unknown=0, NotChecked=0, Total=41820 [2018-10-15 15:38:30,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-10-15 15:38:30,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 468. [2018-10-15 15:38:30,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2018-10-15 15:38:30,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 469 transitions. [2018-10-15 15:38:30,695 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 469 transitions. Word has length 459 [2018-10-15 15:38:30,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:38:30,695 INFO L481 AbstractCegarLoop]: Abstraction has 468 states and 469 transitions. [2018-10-15 15:38:30,695 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-15 15:38:30,696 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 469 transitions. [2018-10-15 15:38:30,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2018-10-15 15:38:30,698 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:38:30,698 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:38:30,698 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:38:30,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:38:30,699 INFO L82 PathProgramCache]: Analyzing trace with hash 616446678, now seen corresponding path program 44 times [2018-10-15 15:38:30,699 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:38:30,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:38:32,424 INFO L134 CoverageAnalysis]: Checked inductivity of 4974 backedges. 2070 proven. 2904 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:38:32,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:38:32,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-15 15:38:32,425 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-15 15:38:32,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-15 15:38:32,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=955, Invalid=4595, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 15:38:32,425 INFO L87 Difference]: Start difference. First operand 468 states and 469 transitions. Second operand 75 states. [2018-10-15 15:38:37,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:38:37,789 INFO L93 Difference]: Finished difference Result 494 states and 495 transitions. [2018-10-15 15:38:37,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2018-10-15 15:38:37,789 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 467 [2018-10-15 15:38:37,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:38:37,791 INFO L225 Difference]: With dead ends: 494 [2018-10-15 15:38:37,791 INFO L226 Difference]: Without dead ends: 494 [2018-10-15 15:38:37,793 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14667 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8082, Invalid=36650, Unknown=0, NotChecked=0, Total=44732 [2018-10-15 15:38:37,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2018-10-15 15:38:37,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 480. [2018-10-15 15:38:37,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2018-10-15 15:38:37,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 481 transitions. [2018-10-15 15:38:37,798 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 481 transitions. Word has length 467 [2018-10-15 15:38:37,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:38:37,798 INFO L481 AbstractCegarLoop]: Abstraction has 480 states and 481 transitions. [2018-10-15 15:38:37,798 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-15 15:38:37,798 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 481 transitions. [2018-10-15 15:38:37,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2018-10-15 15:38:37,800 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:38:37,800 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:38:37,800 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:38:37,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:38:37,800 INFO L82 PathProgramCache]: Analyzing trace with hash 938531009, now seen corresponding path program 45 times [2018-10-15 15:38:37,801 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:38:37,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:38:40,694 INFO L134 CoverageAnalysis]: Checked inductivity of 5244 backedges. 3174 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:38:40,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:38:40,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-10-15 15:38:40,695 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-15 15:38:40,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-15 15:38:40,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1249, Invalid=8063, Unknown=0, NotChecked=0, Total=9312 [2018-10-15 15:38:40,696 INFO L87 Difference]: Start difference. First operand 480 states and 481 transitions. Second operand 97 states. [2018-10-15 15:38:47,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:38:47,512 INFO L93 Difference]: Finished difference Result 769 states and 770 transitions. [2018-10-15 15:38:47,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-10-15 15:38:47,512 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 479 [2018-10-15 15:38:47,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:38:47,514 INFO L225 Difference]: With dead ends: 769 [2018-10-15 15:38:47,514 INFO L226 Difference]: Without dead ends: 490 [2018-10-15 15:38:47,515 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12373 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=7170, Invalid=38412, Unknown=0, NotChecked=0, Total=45582 [2018-10-15 15:38:47,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2018-10-15 15:38:47,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 488. [2018-10-15 15:38:47,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2018-10-15 15:38:47,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 489 transitions. [2018-10-15 15:38:47,520 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 489 transitions. Word has length 479 [2018-10-15 15:38:47,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:38:47,521 INFO L481 AbstractCegarLoop]: Abstraction has 488 states and 489 transitions. [2018-10-15 15:38:47,521 INFO L482 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-15 15:38:47,521 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 489 transitions. [2018-10-15 15:38:47,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2018-10-15 15:38:47,523 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:38:47,523 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:38:47,524 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:38:47,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:38:47,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1705638329, now seen corresponding path program 46 times [2018-10-15 15:38:47,525 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:38:47,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:38:49,581 INFO L134 CoverageAnalysis]: Checked inductivity of 5430 backedges. 2256 proven. 3174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:38:49,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:38:49,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-10-15 15:38:49,582 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-15 15:38:49,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-15 15:38:49,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1032, Invalid=4974, Unknown=0, NotChecked=0, Total=6006 [2018-10-15 15:38:49,583 INFO L87 Difference]: Start difference. First operand 488 states and 489 transitions. Second operand 78 states. [2018-10-15 15:38:55,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:38:55,524 INFO L93 Difference]: Finished difference Result 514 states and 515 transitions. [2018-10-15 15:38:55,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2018-10-15 15:38:55,525 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 487 [2018-10-15 15:38:55,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:38:55,527 INFO L225 Difference]: With dead ends: 514 [2018-10-15 15:38:55,528 INFO L226 Difference]: Without dead ends: 514 [2018-10-15 15:38:55,529 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15977 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=8769, Invalid=39851, Unknown=0, NotChecked=0, Total=48620 [2018-10-15 15:38:55,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2018-10-15 15:38:55,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 500. [2018-10-15 15:38:55,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2018-10-15 15:38:55,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 501 transitions. [2018-10-15 15:38:55,534 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 501 transitions. Word has length 487 [2018-10-15 15:38:55,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:38:55,534 INFO L481 AbstractCegarLoop]: Abstraction has 500 states and 501 transitions. [2018-10-15 15:38:55,534 INFO L482 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-15 15:38:55,534 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 501 transitions. [2018-10-15 15:38:55,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2018-10-15 15:38:55,536 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:38:55,536 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:38:55,537 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:38:55,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:38:55,537 INFO L82 PathProgramCache]: Analyzing trace with hash 761158436, now seen corresponding path program 47 times [2018-10-15 15:38:55,538 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:38:55,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:38:58,487 INFO L134 CoverageAnalysis]: Checked inductivity of 5712 backedges. 3456 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:38:58,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:38:58,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-10-15 15:38:58,487 INFO L460 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-10-15 15:38:58,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-10-15 15:38:58,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1351, Invalid=8749, Unknown=0, NotChecked=0, Total=10100 [2018-10-15 15:38:58,488 INFO L87 Difference]: Start difference. First operand 500 states and 501 transitions. Second operand 101 states. [2018-10-15 15:39:06,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:39:06,184 INFO L93 Difference]: Finished difference Result 801 states and 802 transitions. [2018-10-15 15:39:06,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2018-10-15 15:39:06,184 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 499 [2018-10-15 15:39:06,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:39:06,186 INFO L225 Difference]: With dead ends: 801 [2018-10-15 15:39:06,186 INFO L226 Difference]: Without dead ends: 510 [2018-10-15 15:39:06,188 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13475 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=7769, Invalid=41737, Unknown=0, NotChecked=0, Total=49506 [2018-10-15 15:39:06,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2018-10-15 15:39:06,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 508. [2018-10-15 15:39:06,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2018-10-15 15:39:06,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 509 transitions. [2018-10-15 15:39:06,192 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 509 transitions. Word has length 499 [2018-10-15 15:39:06,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:39:06,192 INFO L481 AbstractCegarLoop]: Abstraction has 508 states and 509 transitions. [2018-10-15 15:39:06,192 INFO L482 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-10-15 15:39:06,192 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 509 transitions. [2018-10-15 15:39:06,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2018-10-15 15:39:06,194 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:39:06,195 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:39:06,195 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:39:06,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:39:06,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1753919460, now seen corresponding path program 48 times [2018-10-15 15:39:06,196 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:39:06,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:39:08,267 INFO L134 CoverageAnalysis]: Checked inductivity of 5906 backedges. 2450 proven. 3456 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:39:08,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:39:08,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-15 15:39:08,268 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-15 15:39:08,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-15 15:39:08,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1112, Invalid=5368, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 15:39:08,269 INFO L87 Difference]: Start difference. First operand 508 states and 509 transitions. Second operand 81 states. [2018-10-15 15:39:14,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:39:14,311 INFO L93 Difference]: Finished difference Result 534 states and 535 transitions. [2018-10-15 15:39:14,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2018-10-15 15:39:14,312 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 507 [2018-10-15 15:39:14,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:39:14,314 INFO L225 Difference]: With dead ends: 534 [2018-10-15 15:39:14,315 INFO L226 Difference]: Without dead ends: 534 [2018-10-15 15:39:14,317 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17343 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=9484, Invalid=43186, Unknown=0, NotChecked=0, Total=52670 [2018-10-15 15:39:14,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2018-10-15 15:39:14,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 520. [2018-10-15 15:39:14,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-10-15 15:39:14,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 521 transitions. [2018-10-15 15:39:14,323 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 521 transitions. Word has length 507 [2018-10-15 15:39:14,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:39:14,323 INFO L481 AbstractCegarLoop]: Abstraction has 520 states and 521 transitions. [2018-10-15 15:39:14,323 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-15 15:39:14,324 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 521 transitions. [2018-10-15 15:39:14,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2018-10-15 15:39:14,326 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:39:14,326 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:39:14,326 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:39:14,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:39:14,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1199846663, now seen corresponding path program 49 times [2018-10-15 15:39:14,327 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:39:14,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:39:17,576 INFO L134 CoverageAnalysis]: Checked inductivity of 6200 backedges. 3750 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:39:17,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:39:17,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-10-15 15:39:17,577 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-10-15 15:39:17,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-10-15 15:39:17,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1457, Invalid=9463, Unknown=0, NotChecked=0, Total=10920 [2018-10-15 15:39:17,578 INFO L87 Difference]: Start difference. First operand 520 states and 521 transitions. Second operand 105 states. [2018-10-15 15:39:23,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:39:23,811 INFO L93 Difference]: Finished difference Result 833 states and 834 transitions. [2018-10-15 15:39:23,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2018-10-15 15:39:23,811 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 519 [2018-10-15 15:39:23,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:39:23,813 INFO L225 Difference]: With dead ends: 833 [2018-10-15 15:39:23,813 INFO L226 Difference]: Without dead ends: 530 [2018-10-15 15:39:23,815 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14624 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=8392, Invalid=45200, Unknown=0, NotChecked=0, Total=53592 [2018-10-15 15:39:23,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2018-10-15 15:39:23,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 528. [2018-10-15 15:39:23,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2018-10-15 15:39:23,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 529 transitions. [2018-10-15 15:39:23,819 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 529 transitions. Word has length 519 [2018-10-15 15:39:23,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:39:23,819 INFO L481 AbstractCegarLoop]: Abstraction has 528 states and 529 transitions. [2018-10-15 15:39:23,819 INFO L482 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-10-15 15:39:23,819 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 529 transitions. [2018-10-15 15:39:23,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2018-10-15 15:39:23,822 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:39:23,822 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:39:23,823 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:39:23,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:39:23,823 INFO L82 PathProgramCache]: Analyzing trace with hash -926482945, now seen corresponding path program 50 times [2018-10-15 15:39:23,824 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:39:23,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:39:26,331 INFO L134 CoverageAnalysis]: Checked inductivity of 6402 backedges. 2652 proven. 3750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:39:26,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:39:26,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-10-15 15:39:26,332 INFO L460 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-10-15 15:39:26,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-10-15 15:39:26,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1195, Invalid=5777, Unknown=0, NotChecked=0, Total=6972 [2018-10-15 15:39:26,333 INFO L87 Difference]: Start difference. First operand 528 states and 529 transitions. Second operand 84 states. [2018-10-15 15:39:32,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:39:32,896 INFO L93 Difference]: Finished difference Result 554 states and 555 transitions. [2018-10-15 15:39:32,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2018-10-15 15:39:32,896 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 527 [2018-10-15 15:39:32,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:39:32,898 INFO L225 Difference]: With dead ends: 554 [2018-10-15 15:39:32,898 INFO L226 Difference]: Without dead ends: 554 [2018-10-15 15:39:32,900 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18765 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=10227, Invalid=46655, Unknown=0, NotChecked=0, Total=56882 [2018-10-15 15:39:32,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-10-15 15:39:32,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 540. [2018-10-15 15:39:32,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2018-10-15 15:39:32,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 541 transitions. [2018-10-15 15:39:32,905 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 541 transitions. Word has length 527 [2018-10-15 15:39:32,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:39:32,905 INFO L481 AbstractCegarLoop]: Abstraction has 540 states and 541 transitions. [2018-10-15 15:39:32,905 INFO L482 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-10-15 15:39:32,905 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 541 transitions. [2018-10-15 15:39:32,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 540 [2018-10-15 15:39:32,907 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:39:32,908 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:39:32,908 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:39:32,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:39:32,908 INFO L82 PathProgramCache]: Analyzing trace with hash 283715178, now seen corresponding path program 51 times [2018-10-15 15:39:32,909 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:39:32,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:39:36,450 INFO L134 CoverageAnalysis]: Checked inductivity of 6708 backedges. 4056 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:39:36,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:39:36,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-10-15 15:39:36,451 INFO L460 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-10-15 15:39:36,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-10-15 15:39:36,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1567, Invalid=10205, Unknown=0, NotChecked=0, Total=11772 [2018-10-15 15:39:36,452 INFO L87 Difference]: Start difference. First operand 540 states and 541 transitions. Second operand 109 states. [2018-10-15 15:39:45,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:39:45,013 INFO L93 Difference]: Finished difference Result 865 states and 866 transitions. [2018-10-15 15:39:45,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2018-10-15 15:39:45,013 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 539 [2018-10-15 15:39:45,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:39:45,015 INFO L225 Difference]: With dead ends: 865 [2018-10-15 15:39:45,015 INFO L226 Difference]: Without dead ends: 550 [2018-10-15 15:39:45,016 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15820 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=9039, Invalid=48801, Unknown=0, NotChecked=0, Total=57840 [2018-10-15 15:39:45,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2018-10-15 15:39:45,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 548. [2018-10-15 15:39:45,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2018-10-15 15:39:45,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 549 transitions. [2018-10-15 15:39:45,020 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 549 transitions. Word has length 539 [2018-10-15 15:39:45,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:39:45,020 INFO L481 AbstractCegarLoop]: Abstraction has 548 states and 549 transitions. [2018-10-15 15:39:45,020 INFO L482 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-10-15 15:39:45,021 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 549 transitions. [2018-10-15 15:39:45,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 548 [2018-10-15 15:39:45,023 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:39:45,023 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:39:45,023 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:39:45,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:39:45,023 INFO L82 PathProgramCache]: Analyzing trace with hash 287687522, now seen corresponding path program 52 times [2018-10-15 15:39:45,024 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:39:45,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:39:47,512 INFO L134 CoverageAnalysis]: Checked inductivity of 6918 backedges. 2862 proven. 4056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:39:47,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:39:47,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-15 15:39:47,513 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-15 15:39:47,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-15 15:39:47,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1281, Invalid=6201, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 15:39:47,514 INFO L87 Difference]: Start difference. First operand 548 states and 549 transitions. Second operand 87 states. [2018-10-15 15:39:54,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:39:54,611 INFO L93 Difference]: Finished difference Result 574 states and 575 transitions. [2018-10-15 15:39:54,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2018-10-15 15:39:54,611 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 547 [2018-10-15 15:39:54,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:39:54,613 INFO L225 Difference]: With dead ends: 574 [2018-10-15 15:39:54,613 INFO L226 Difference]: Without dead ends: 574 [2018-10-15 15:39:54,616 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20243 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=10998, Invalid=50258, Unknown=0, NotChecked=0, Total=61256 [2018-10-15 15:39:54,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2018-10-15 15:39:54,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 560. [2018-10-15 15:39:54,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2018-10-15 15:39:54,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 561 transitions. [2018-10-15 15:39:54,620 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 561 transitions. Word has length 547 [2018-10-15 15:39:54,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:39:54,621 INFO L481 AbstractCegarLoop]: Abstraction has 560 states and 561 transitions. [2018-10-15 15:39:54,621 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-15 15:39:54,621 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 561 transitions. [2018-10-15 15:39:54,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 560 [2018-10-15 15:39:54,623 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:39:54,623 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 28, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:39:54,623 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:39:54,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:39:54,624 INFO L82 PathProgramCache]: Analyzing trace with hash -856428723, now seen corresponding path program 53 times [2018-10-15 15:39:54,624 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:39:54,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:39:58,420 INFO L134 CoverageAnalysis]: Checked inductivity of 7236 backedges. 4374 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:39:58,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:39:58,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-10-15 15:39:58,421 INFO L460 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-10-15 15:39:58,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-10-15 15:39:58,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1681, Invalid=10975, Unknown=0, NotChecked=0, Total=12656 [2018-10-15 15:39:58,422 INFO L87 Difference]: Start difference. First operand 560 states and 561 transitions. Second operand 113 states. [2018-10-15 15:40:07,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:40:07,944 INFO L93 Difference]: Finished difference Result 897 states and 898 transitions. [2018-10-15 15:40:07,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2018-10-15 15:40:07,944 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 559 [2018-10-15 15:40:07,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:40:07,946 INFO L225 Difference]: With dead ends: 897 [2018-10-15 15:40:07,946 INFO L226 Difference]: Without dead ends: 570 [2018-10-15 15:40:07,948 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17063 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=9710, Invalid=52540, Unknown=0, NotChecked=0, Total=62250 [2018-10-15 15:40:07,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2018-10-15 15:40:07,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 568. [2018-10-15 15:40:07,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2018-10-15 15:40:07,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 569 transitions. [2018-10-15 15:40:07,952 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 569 transitions. Word has length 559 [2018-10-15 15:40:07,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:40:07,952 INFO L481 AbstractCegarLoop]: Abstraction has 568 states and 569 transitions. [2018-10-15 15:40:07,952 INFO L482 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-10-15 15:40:07,952 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 569 transitions. [2018-10-15 15:40:07,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 568 [2018-10-15 15:40:07,954 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:40:07,955 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 27, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:40:07,955 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:40:07,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:40:07,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1057464251, now seen corresponding path program 54 times [2018-10-15 15:40:07,956 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:40:07,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:40:10,456 INFO L134 CoverageAnalysis]: Checked inductivity of 7454 backedges. 3080 proven. 4374 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:40:10,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:40:10,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-10-15 15:40:10,457 INFO L460 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-10-15 15:40:10,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-10-15 15:40:10,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1370, Invalid=6640, Unknown=0, NotChecked=0, Total=8010 [2018-10-15 15:40:10,457 INFO L87 Difference]: Start difference. First operand 568 states and 569 transitions. Second operand 90 states. [2018-10-15 15:40:18,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:40:18,515 INFO L93 Difference]: Finished difference Result 594 states and 595 transitions. [2018-10-15 15:40:18,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 199 states. [2018-10-15 15:40:18,516 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 567 [2018-10-15 15:40:18,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:40:18,518 INFO L225 Difference]: With dead ends: 594 [2018-10-15 15:40:18,518 INFO L226 Difference]: Without dead ends: 594 [2018-10-15 15:40:18,520 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21777 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=11797, Invalid=53995, Unknown=0, NotChecked=0, Total=65792 [2018-10-15 15:40:18,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2018-10-15 15:40:18,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 580. [2018-10-15 15:40:18,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2018-10-15 15:40:18,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 581 transitions. [2018-10-15 15:40:18,525 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 581 transitions. Word has length 567 [2018-10-15 15:40:18,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:40:18,525 INFO L481 AbstractCegarLoop]: Abstraction has 580 states and 581 transitions. [2018-10-15 15:40:18,525 INFO L482 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-10-15 15:40:18,525 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 581 transitions. [2018-10-15 15:40:18,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2018-10-15 15:40:18,528 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:40:18,528 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 29, 29, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:40:18,528 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:40:18,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:40:18,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1477750864, now seen corresponding path program 55 times [2018-10-15 15:40:18,529 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:40:18,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:40:23,279 INFO L134 CoverageAnalysis]: Checked inductivity of 7784 backedges. 4704 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:40:23,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:40:23,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-10-15 15:40:23,280 INFO L460 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-10-15 15:40:23,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-10-15 15:40:23,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1799, Invalid=11773, Unknown=0, NotChecked=0, Total=13572 [2018-10-15 15:40:23,281 INFO L87 Difference]: Start difference. First operand 580 states and 581 transitions. Second operand 117 states. [2018-10-15 15:40:31,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:40:31,756 INFO L93 Difference]: Finished difference Result 929 states and 930 transitions. [2018-10-15 15:40:31,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2018-10-15 15:40:31,756 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 579 [2018-10-15 15:40:31,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:40:31,758 INFO L225 Difference]: With dead ends: 929 [2018-10-15 15:40:31,758 INFO L226 Difference]: Without dead ends: 590 [2018-10-15 15:40:31,760 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18353 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=10405, Invalid=56417, Unknown=0, NotChecked=0, Total=66822 [2018-10-15 15:40:31,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2018-10-15 15:40:31,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 588. [2018-10-15 15:40:31,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2018-10-15 15:40:31,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 589 transitions. [2018-10-15 15:40:31,765 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 589 transitions. Word has length 579 [2018-10-15 15:40:31,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:40:31,765 INFO L481 AbstractCegarLoop]: Abstraction has 588 states and 589 transitions. [2018-10-15 15:40:31,765 INFO L482 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-10-15 15:40:31,765 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 589 transitions. [2018-10-15 15:40:31,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 588 [2018-10-15 15:40:31,768 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:40:31,768 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:40:31,768 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:40:31,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:40:31,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1853516632, now seen corresponding path program 56 times [2018-10-15 15:40:31,769 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:40:31,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:40:34,318 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 3306 proven. 4704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:40:34,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:40:34,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-15 15:40:34,319 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-15 15:40:34,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-15 15:40:34,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1462, Invalid=7094, Unknown=0, NotChecked=0, Total=8556 [2018-10-15 15:40:34,320 INFO L87 Difference]: Start difference. First operand 588 states and 589 transitions. Second operand 93 states. [2018-10-15 15:40:42,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:40:42,574 INFO L93 Difference]: Finished difference Result 614 states and 615 transitions. [2018-10-15 15:40:42,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 206 states. [2018-10-15 15:40:42,574 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 587 [2018-10-15 15:40:42,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:40:42,576 INFO L225 Difference]: With dead ends: 614 [2018-10-15 15:40:42,576 INFO L226 Difference]: Without dead ends: 614 [2018-10-15 15:40:42,580 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23367 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=12624, Invalid=57866, Unknown=0, NotChecked=0, Total=70490 [2018-10-15 15:40:42,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2018-10-15 15:40:42,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 600. [2018-10-15 15:40:42,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2018-10-15 15:40:42,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 601 transitions. [2018-10-15 15:40:42,585 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 601 transitions. Word has length 587 [2018-10-15 15:40:42,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:40:42,585 INFO L481 AbstractCegarLoop]: Abstraction has 600 states and 601 transitions. [2018-10-15 15:40:42,585 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-15 15:40:42,585 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 601 transitions. [2018-10-15 15:40:42,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2018-10-15 15:40:42,588 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:40:42,588 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 30, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:40:42,588 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:40:42,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:40:42,589 INFO L82 PathProgramCache]: Analyzing trace with hash -420083821, now seen corresponding path program 57 times [2018-10-15 15:40:42,589 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:40:42,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:40:46,657 INFO L134 CoverageAnalysis]: Checked inductivity of 8352 backedges. 5046 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:40:46,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:40:46,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-10-15 15:40:46,658 INFO L460 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-10-15 15:40:46,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-10-15 15:40:46,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1921, Invalid=12599, Unknown=0, NotChecked=0, Total=14520 [2018-10-15 15:40:46,658 INFO L87 Difference]: Start difference. First operand 600 states and 601 transitions. Second operand 121 states. [2018-10-15 15:40:54,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:40:54,696 INFO L93 Difference]: Finished difference Result 961 states and 962 transitions. [2018-10-15 15:40:54,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2018-10-15 15:40:54,696 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 599 [2018-10-15 15:40:54,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:40:54,698 INFO L225 Difference]: With dead ends: 961 [2018-10-15 15:40:54,699 INFO L226 Difference]: Without dead ends: 610 [2018-10-15 15:40:54,700 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 266 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19690 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=11124, Invalid=60432, Unknown=0, NotChecked=0, Total=71556 [2018-10-15 15:40:54,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2018-10-15 15:40:54,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 608. [2018-10-15 15:40:54,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2018-10-15 15:40:54,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 609 transitions. [2018-10-15 15:40:54,704 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 609 transitions. Word has length 599 [2018-10-15 15:40:54,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:40:54,704 INFO L481 AbstractCegarLoop]: Abstraction has 608 states and 609 transitions. [2018-10-15 15:40:54,705 INFO L482 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-10-15 15:40:54,705 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 609 transitions. [2018-10-15 15:40:54,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 608 [2018-10-15 15:40:54,707 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:40:54,707 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 29, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:40:54,707 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:40:54,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:40:54,708 INFO L82 PathProgramCache]: Analyzing trace with hash -722198389, now seen corresponding path program 58 times [2018-10-15 15:40:54,708 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:40:54,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:40:57,528 INFO L134 CoverageAnalysis]: Checked inductivity of 8586 backedges. 3540 proven. 5046 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:40:57,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:40:57,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-10-15 15:40:57,529 INFO L460 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-10-15 15:40:57,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-10-15 15:40:57,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1557, Invalid=7563, Unknown=0, NotChecked=0, Total=9120 [2018-10-15 15:40:57,530 INFO L87 Difference]: Start difference. First operand 608 states and 609 transitions. Second operand 96 states. [2018-10-15 15:41:06,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:41:06,226 INFO L93 Difference]: Finished difference Result 634 states and 635 transitions. [2018-10-15 15:41:06,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 213 states. [2018-10-15 15:41:06,227 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 607 [2018-10-15 15:41:06,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:41:06,228 INFO L225 Difference]: With dead ends: 634 [2018-10-15 15:41:06,229 INFO L226 Difference]: Without dead ends: 634 [2018-10-15 15:41:06,230 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25013 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=13479, Invalid=61871, Unknown=0, NotChecked=0, Total=75350 [2018-10-15 15:41:06,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2018-10-15 15:41:06,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 620. [2018-10-15 15:41:06,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2018-10-15 15:41:06,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 621 transitions. [2018-10-15 15:41:06,236 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 621 transitions. Word has length 607 [2018-10-15 15:41:06,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:41:06,236 INFO L481 AbstractCegarLoop]: Abstraction has 620 states and 621 transitions. [2018-10-15 15:41:06,236 INFO L482 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-10-15 15:41:06,236 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 621 transitions. [2018-10-15 15:41:06,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 620 [2018-10-15 15:41:06,239 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:41:06,239 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 31, 31, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:41:06,240 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:41:06,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:41:06,240 INFO L82 PathProgramCache]: Analyzing trace with hash 404412150, now seen corresponding path program 59 times [2018-10-15 15:41:06,240 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:41:06,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:41:10,711 INFO L134 CoverageAnalysis]: Checked inductivity of 8940 backedges. 5400 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:41:10,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:41:10,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-10-15 15:41:10,712 INFO L460 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-10-15 15:41:10,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-10-15 15:41:10,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2047, Invalid=13453, Unknown=0, NotChecked=0, Total=15500 [2018-10-15 15:41:10,713 INFO L87 Difference]: Start difference. First operand 620 states and 621 transitions. Second operand 125 states. [2018-10-15 15:41:21,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:41:21,967 INFO L93 Difference]: Finished difference Result 993 states and 994 transitions. [2018-10-15 15:41:21,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2018-10-15 15:41:21,967 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 619 [2018-10-15 15:41:21,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:41:21,969 INFO L225 Difference]: With dead ends: 993 [2018-10-15 15:41:21,969 INFO L226 Difference]: Without dead ends: 630 [2018-10-15 15:41:21,970 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 275 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21074 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=11867, Invalid=64585, Unknown=0, NotChecked=0, Total=76452 [2018-10-15 15:41:21,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2018-10-15 15:41:21,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 628. [2018-10-15 15:41:21,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2018-10-15 15:41:21,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 629 transitions. [2018-10-15 15:41:21,975 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 629 transitions. Word has length 619 [2018-10-15 15:41:21,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:41:21,975 INFO L481 AbstractCegarLoop]: Abstraction has 628 states and 629 transitions. [2018-10-15 15:41:21,975 INFO L482 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-10-15 15:41:21,975 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 629 transitions. [2018-10-15 15:41:21,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 628 [2018-10-15 15:41:21,978 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:41:21,978 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 30, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:41:21,978 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:41:21,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:41:21,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1505049618, now seen corresponding path program 60 times [2018-10-15 15:41:21,979 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:41:22,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:41:24,798 INFO L134 CoverageAnalysis]: Checked inductivity of 9182 backedges. 3782 proven. 5400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:41:24,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:41:24,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-10-15 15:41:24,799 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-15 15:41:24,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-15 15:41:24,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1655, Invalid=8047, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 15:41:24,800 INFO L87 Difference]: Start difference. First operand 628 states and 629 transitions. Second operand 99 states. [2018-10-15 15:41:33,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:41:33,308 INFO L93 Difference]: Finished difference Result 654 states and 655 transitions. [2018-10-15 15:41:33,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 220 states. [2018-10-15 15:41:33,308 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 627 [2018-10-15 15:41:33,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:41:33,311 INFO L225 Difference]: With dead ends: 654 [2018-10-15 15:41:33,311 INFO L226 Difference]: Without dead ends: 654 [2018-10-15 15:41:33,313 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 282 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26715 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=14362, Invalid=66010, Unknown=0, NotChecked=0, Total=80372 [2018-10-15 15:41:33,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2018-10-15 15:41:33,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 640. [2018-10-15 15:41:33,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2018-10-15 15:41:33,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 641 transitions. [2018-10-15 15:41:33,318 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 641 transitions. Word has length 627 [2018-10-15 15:41:33,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:41:33,318 INFO L481 AbstractCegarLoop]: Abstraction has 640 states and 641 transitions. [2018-10-15 15:41:33,318 INFO L482 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-15 15:41:33,318 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 641 transitions. [2018-10-15 15:41:33,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 640 [2018-10-15 15:41:33,321 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:41:33,321 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 32, 32, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:41:33,321 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:41:33,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:41:33,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1111522777, now seen corresponding path program 61 times [2018-10-15 15:41:33,322 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:41:33,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:41:37,790 INFO L134 CoverageAnalysis]: Checked inductivity of 9548 backedges. 5766 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:41:37,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:41:37,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-10-15 15:41:37,791 INFO L460 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-10-15 15:41:37,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-10-15 15:41:37,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2177, Invalid=14335, Unknown=0, NotChecked=0, Total=16512 [2018-10-15 15:41:37,792 INFO L87 Difference]: Start difference. First operand 640 states and 641 transitions. Second operand 129 states. [2018-10-15 15:41:49,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:41:49,382 INFO L93 Difference]: Finished difference Result 1025 states and 1026 transitions. [2018-10-15 15:41:49,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 191 states. [2018-10-15 15:41:49,382 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 639 [2018-10-15 15:41:49,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:41:49,384 INFO L225 Difference]: With dead ends: 1025 [2018-10-15 15:41:49,384 INFO L226 Difference]: Without dead ends: 650 [2018-10-15 15:41:49,386 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 284 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22505 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=12634, Invalid=68876, Unknown=0, NotChecked=0, Total=81510 [2018-10-15 15:41:49,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2018-10-15 15:41:49,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 648. [2018-10-15 15:41:49,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2018-10-15 15:41:49,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 649 transitions. [2018-10-15 15:41:49,391 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 649 transitions. Word has length 639 [2018-10-15 15:41:49,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:41:49,391 INFO L481 AbstractCegarLoop]: Abstraction has 648 states and 649 transitions. [2018-10-15 15:41:49,391 INFO L482 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-10-15 15:41:49,391 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 649 transitions. [2018-10-15 15:41:49,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 648 [2018-10-15 15:41:49,394 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:41:49,394 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:41:49,394 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:41:49,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:41:49,395 INFO L82 PathProgramCache]: Analyzing trace with hash 426786513, now seen corresponding path program 62 times [2018-10-15 15:41:49,395 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:41:49,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:41:52,348 INFO L134 CoverageAnalysis]: Checked inductivity of 9798 backedges. 4032 proven. 5766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:41:52,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:41:52,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-10-15 15:41:52,350 INFO L460 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-10-15 15:41:52,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-10-15 15:41:52,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1756, Invalid=8546, Unknown=0, NotChecked=0, Total=10302 [2018-10-15 15:41:52,351 INFO L87 Difference]: Start difference. First operand 648 states and 649 transitions. Second operand 102 states. [2018-10-15 15:42:01,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:42:01,275 INFO L93 Difference]: Finished difference Result 674 states and 675 transitions. [2018-10-15 15:42:01,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 227 states. [2018-10-15 15:42:01,276 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 647 [2018-10-15 15:42:01,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:42:01,279 INFO L225 Difference]: With dead ends: 674 [2018-10-15 15:42:01,279 INFO L226 Difference]: Without dead ends: 674 [2018-10-15 15:42:01,283 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 291 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28473 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=15273, Invalid=70283, Unknown=0, NotChecked=0, Total=85556 [2018-10-15 15:42:01,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2018-10-15 15:42:01,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 660. [2018-10-15 15:42:01,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2018-10-15 15:42:01,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 661 transitions. [2018-10-15 15:42:01,288 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 661 transitions. Word has length 647 [2018-10-15 15:42:01,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:42:01,289 INFO L481 AbstractCegarLoop]: Abstraction has 660 states and 661 transitions. [2018-10-15 15:42:01,289 INFO L482 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-10-15 15:42:01,289 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 661 transitions. [2018-10-15 15:42:01,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 660 [2018-10-15 15:42:01,292 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:42:01,292 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 33, 33, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:42:01,292 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:42:01,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:42:01,293 INFO L82 PathProgramCache]: Analyzing trace with hash 355318844, now seen corresponding path program 63 times [2018-10-15 15:42:01,293 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:42:01,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:42:06,022 INFO L134 CoverageAnalysis]: Checked inductivity of 10176 backedges. 6144 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:42:06,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:42:06,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-10-15 15:42:06,023 INFO L460 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-10-15 15:42:06,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-10-15 15:42:06,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2311, Invalid=15245, Unknown=0, NotChecked=0, Total=17556 [2018-10-15 15:42:06,023 INFO L87 Difference]: Start difference. First operand 660 states and 661 transitions. Second operand 133 states. [2018-10-15 15:42:18,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:42:18,452 INFO L93 Difference]: Finished difference Result 1057 states and 1058 transitions. [2018-10-15 15:42:18,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 197 states. [2018-10-15 15:42:18,452 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 659 [2018-10-15 15:42:18,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:42:18,455 INFO L225 Difference]: With dead ends: 1057 [2018-10-15 15:42:18,455 INFO L226 Difference]: Without dead ends: 670 [2018-10-15 15:42:18,457 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 293 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23983 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=13425, Invalid=73305, Unknown=0, NotChecked=0, Total=86730 [2018-10-15 15:42:18,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2018-10-15 15:42:18,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 668. [2018-10-15 15:42:18,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 668 states. [2018-10-15 15:42:18,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 669 transitions. [2018-10-15 15:42:18,462 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 669 transitions. Word has length 659 [2018-10-15 15:42:18,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:42:18,462 INFO L481 AbstractCegarLoop]: Abstraction has 668 states and 669 transitions. [2018-10-15 15:42:18,462 INFO L482 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-10-15 15:42:18,462 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 669 transitions. [2018-10-15 15:42:18,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 668 [2018-10-15 15:42:18,465 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:42:18,466 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 32, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:42:18,466 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:42:18,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:42:18,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1798000948, now seen corresponding path program 64 times [2018-10-15 15:42:18,467 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:42:18,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:42:21,624 INFO L134 CoverageAnalysis]: Checked inductivity of 10434 backedges. 4290 proven. 6144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:42:21,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:42:21,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-10-15 15:42:21,625 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-10-15 15:42:21,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-10-15 15:42:21,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1860, Invalid=9060, Unknown=0, NotChecked=0, Total=10920 [2018-10-15 15:42:21,625 INFO L87 Difference]: Start difference. First operand 668 states and 669 transitions. Second operand 105 states. [2018-10-15 15:42:30,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:42:30,364 INFO L93 Difference]: Finished difference Result 694 states and 695 transitions. [2018-10-15 15:42:30,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 234 states. [2018-10-15 15:42:30,365 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 667 [2018-10-15 15:42:30,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:42:30,367 INFO L225 Difference]: With dead ends: 694 [2018-10-15 15:42:30,367 INFO L226 Difference]: Without dead ends: 694 [2018-10-15 15:42:30,371 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 300 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30287 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=16212, Invalid=74690, Unknown=0, NotChecked=0, Total=90902 [2018-10-15 15:42:30,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2018-10-15 15:42:30,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 680. [2018-10-15 15:42:30,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2018-10-15 15:42:30,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 681 transitions. [2018-10-15 15:42:30,377 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 681 transitions. Word has length 667 [2018-10-15 15:42:30,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:42:30,377 INFO L481 AbstractCegarLoop]: Abstraction has 680 states and 681 transitions. [2018-10-15 15:42:30,377 INFO L482 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-10-15 15:42:30,377 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 681 transitions. [2018-10-15 15:42:30,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 680 [2018-10-15 15:42:30,380 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:42:30,380 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 34, 34, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:42:30,380 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:42:30,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:42:30,381 INFO L82 PathProgramCache]: Analyzing trace with hash 428429855, now seen corresponding path program 65 times [2018-10-15 15:42:30,381 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:42:30,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:42:35,393 INFO L134 CoverageAnalysis]: Checked inductivity of 10824 backedges. 6534 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:42:35,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:42:35,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-10-15 15:42:35,394 INFO L460 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-10-15 15:42:35,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-10-15 15:42:35,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2449, Invalid=16183, Unknown=0, NotChecked=0, Total=18632 [2018-10-15 15:42:35,395 INFO L87 Difference]: Start difference. First operand 680 states and 681 transitions. Second operand 137 states. [2018-10-15 15:42:48,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:42:48,525 INFO L93 Difference]: Finished difference Result 1089 states and 1090 transitions. [2018-10-15 15:42:48,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 203 states. [2018-10-15 15:42:48,525 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 679 [2018-10-15 15:42:48,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:42:48,527 INFO L225 Difference]: With dead ends: 1089 [2018-10-15 15:42:48,527 INFO L226 Difference]: Without dead ends: 690 [2018-10-15 15:42:48,529 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 302 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25508 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=14240, Invalid=77872, Unknown=0, NotChecked=0, Total=92112 [2018-10-15 15:42:48,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2018-10-15 15:42:48,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 688. [2018-10-15 15:42:48,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 688 states. [2018-10-15 15:42:48,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 689 transitions. [2018-10-15 15:42:48,533 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 689 transitions. Word has length 679 [2018-10-15 15:42:48,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:42:48,533 INFO L481 AbstractCegarLoop]: Abstraction has 688 states and 689 transitions. [2018-10-15 15:42:48,533 INFO L482 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-10-15 15:42:48,533 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 689 transitions. [2018-10-15 15:42:48,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 688 [2018-10-15 15:42:48,536 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:42:48,536 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 33, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:42:48,537 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:42:48,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:42:48,537 INFO L82 PathProgramCache]: Analyzing trace with hash 824359703, now seen corresponding path program 66 times [2018-10-15 15:42:48,537 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:42:48,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:42:51,813 INFO L134 CoverageAnalysis]: Checked inductivity of 11090 backedges. 4556 proven. 6534 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:42:51,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:42:51,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-10-15 15:42:51,814 INFO L460 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-10-15 15:42:51,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-10-15 15:42:51,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1967, Invalid=9589, Unknown=0, NotChecked=0, Total=11556 [2018-10-15 15:42:51,815 INFO L87 Difference]: Start difference. First operand 688 states and 689 transitions. Second operand 108 states. [2018-10-15 15:43:01,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:43:01,031 INFO L93 Difference]: Finished difference Result 714 states and 715 transitions. [2018-10-15 15:43:01,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 241 states. [2018-10-15 15:43:01,032 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 687 [2018-10-15 15:43:01,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:43:01,035 INFO L225 Difference]: With dead ends: 714 [2018-10-15 15:43:01,036 INFO L226 Difference]: Without dead ends: 714 [2018-10-15 15:43:01,039 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 309 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32157 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=17179, Invalid=79231, Unknown=0, NotChecked=0, Total=96410 [2018-10-15 15:43:01,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2018-10-15 15:43:01,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 700. [2018-10-15 15:43:01,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2018-10-15 15:43:01,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 701 transitions. [2018-10-15 15:43:01,044 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 701 transitions. Word has length 687 [2018-10-15 15:43:01,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:43:01,044 INFO L481 AbstractCegarLoop]: Abstraction has 700 states and 701 transitions. [2018-10-15 15:43:01,044 INFO L482 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-10-15 15:43:01,045 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 701 transitions. [2018-10-15 15:43:01,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 700 [2018-10-15 15:43:01,048 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:43:01,048 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 35, 35, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:43:01,048 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:43:01,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:43:01,048 INFO L82 PathProgramCache]: Analyzing trace with hash -522584190, now seen corresponding path program 67 times [2018-10-15 15:43:01,049 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:43:01,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:43:06,420 INFO L134 CoverageAnalysis]: Checked inductivity of 11492 backedges. 6936 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:43:06,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:43:06,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2018-10-15 15:43:06,421 INFO L460 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-10-15 15:43:06,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-10-15 15:43:06,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2591, Invalid=17149, Unknown=0, NotChecked=0, Total=19740 [2018-10-15 15:43:06,422 INFO L87 Difference]: Start difference. First operand 700 states and 701 transitions. Second operand 141 states. [2018-10-15 15:43:20,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:43:20,467 INFO L93 Difference]: Finished difference Result 1121 states and 1122 transitions. [2018-10-15 15:43:20,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 209 states. [2018-10-15 15:43:20,467 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 699 [2018-10-15 15:43:20,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:43:20,469 INFO L225 Difference]: With dead ends: 1121 [2018-10-15 15:43:20,470 INFO L226 Difference]: Without dead ends: 710 [2018-10-15 15:43:20,471 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 311 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27080 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=15079, Invalid=82577, Unknown=0, NotChecked=0, Total=97656 [2018-10-15 15:43:20,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2018-10-15 15:43:20,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 708. [2018-10-15 15:43:20,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 708 states. [2018-10-15 15:43:20,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 709 transitions. [2018-10-15 15:43:20,476 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 709 transitions. Word has length 699 [2018-10-15 15:43:20,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:43:20,477 INFO L481 AbstractCegarLoop]: Abstraction has 708 states and 709 transitions. [2018-10-15 15:43:20,477 INFO L482 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-10-15 15:43:20,477 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 709 transitions. [2018-10-15 15:43:20,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 708 [2018-10-15 15:43:20,480 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:43:20,480 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 34, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:43:20,480 INFO L424 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:43:20,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:43:20,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1981989766, now seen corresponding path program 68 times [2018-10-15 15:43:20,481 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:43:20,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:43:23,947 INFO L134 CoverageAnalysis]: Checked inductivity of 11766 backedges. 4830 proven. 6936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:43:23,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:43:23,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-10-15 15:43:23,948 INFO L460 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-10-15 15:43:23,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-10-15 15:43:23,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2077, Invalid=10133, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 15:43:23,949 INFO L87 Difference]: Start difference. First operand 708 states and 709 transitions. Second operand 111 states. [2018-10-15 15:43:33,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:43:33,526 INFO L93 Difference]: Finished difference Result 734 states and 735 transitions. [2018-10-15 15:43:33,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 248 states. [2018-10-15 15:43:33,526 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 707 [2018-10-15 15:43:33,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:43:33,529 INFO L225 Difference]: With dead ends: 734 [2018-10-15 15:43:33,529 INFO L226 Difference]: Without dead ends: 734 [2018-10-15 15:43:33,531 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 318 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34083 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=18174, Invalid=83906, Unknown=0, NotChecked=0, Total=102080 [2018-10-15 15:43:33,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2018-10-15 15:43:33,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 720. [2018-10-15 15:43:33,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2018-10-15 15:43:33,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 721 transitions. [2018-10-15 15:43:33,537 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 721 transitions. Word has length 707 [2018-10-15 15:43:33,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:43:33,538 INFO L481 AbstractCegarLoop]: Abstraction has 720 states and 721 transitions. [2018-10-15 15:43:33,538 INFO L482 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-10-15 15:43:33,538 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 721 transitions. [2018-10-15 15:43:33,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 720 [2018-10-15 15:43:33,541 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:43:33,542 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 36, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:43:33,542 INFO L424 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:43:33,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:43:33,542 INFO L82 PathProgramCache]: Analyzing trace with hash 898008165, now seen corresponding path program 69 times [2018-10-15 15:43:33,543 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:43:33,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:43:39,128 INFO L134 CoverageAnalysis]: Checked inductivity of 12180 backedges. 7350 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:43:39,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:43:39,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2018-10-15 15:43:39,129 INFO L460 AbstractCegarLoop]: Interpolant automaton has 145 states [2018-10-15 15:43:39,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2018-10-15 15:43:39,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2737, Invalid=18143, Unknown=0, NotChecked=0, Total=20880 [2018-10-15 15:43:39,129 INFO L87 Difference]: Start difference. First operand 720 states and 721 transitions. Second operand 145 states. [2018-10-15 15:43:53,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:43:53,733 INFO L93 Difference]: Finished difference Result 1153 states and 1154 transitions. [2018-10-15 15:43:53,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 215 states. [2018-10-15 15:43:53,733 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 719 [2018-10-15 15:43:53,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:43:53,736 INFO L225 Difference]: With dead ends: 1153 [2018-10-15 15:43:53,736 INFO L226 Difference]: Without dead ends: 730 [2018-10-15 15:43:53,737 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 320 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28699 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=15942, Invalid=87420, Unknown=0, NotChecked=0, Total=103362 [2018-10-15 15:43:53,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2018-10-15 15:43:53,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 728. [2018-10-15 15:43:53,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 728 states. [2018-10-15 15:43:53,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 729 transitions. [2018-10-15 15:43:53,744 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 729 transitions. Word has length 719 [2018-10-15 15:43:53,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:43:53,744 INFO L481 AbstractCegarLoop]: Abstraction has 728 states and 729 transitions. [2018-10-15 15:43:53,744 INFO L482 AbstractCegarLoop]: Interpolant automaton has 145 states. [2018-10-15 15:43:53,745 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 729 transitions. [2018-10-15 15:43:53,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 728 [2018-10-15 15:43:53,748 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:43:53,748 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 35, 35, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:43:53,748 INFO L424 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:43:53,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:43:53,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1287755101, now seen corresponding path program 70 times [2018-10-15 15:43:53,749 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:43:53,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:43:57,299 INFO L134 CoverageAnalysis]: Checked inductivity of 12462 backedges. 5112 proven. 7350 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:43:57,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:43:57,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2018-10-15 15:43:57,300 INFO L460 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-10-15 15:43:57,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-10-15 15:43:57,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2190, Invalid=10692, Unknown=0, NotChecked=0, Total=12882 [2018-10-15 15:43:57,301 INFO L87 Difference]: Start difference. First operand 728 states and 729 transitions. Second operand 114 states. [2018-10-15 15:44:07,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:44:07,556 INFO L93 Difference]: Finished difference Result 754 states and 755 transitions. [2018-10-15 15:44:07,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 255 states. [2018-10-15 15:44:07,556 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 727 [2018-10-15 15:44:07,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:44:07,560 INFO L225 Difference]: With dead ends: 754 [2018-10-15 15:44:07,560 INFO L226 Difference]: Without dead ends: 754 [2018-10-15 15:44:07,562 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 327 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36065 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=19197, Invalid=88715, Unknown=0, NotChecked=0, Total=107912 [2018-10-15 15:44:07,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2018-10-15 15:44:07,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 740. [2018-10-15 15:44:07,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740 states. [2018-10-15 15:44:07,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 741 transitions. [2018-10-15 15:44:07,568 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 741 transitions. Word has length 727 [2018-10-15 15:44:07,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:44:07,569 INFO L481 AbstractCegarLoop]: Abstraction has 740 states and 741 transitions. [2018-10-15 15:44:07,569 INFO L482 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-10-15 15:44:07,569 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 741 transitions. [2018-10-15 15:44:07,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 740 [2018-10-15 15:44:07,573 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:44:07,573 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 37, 37, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:44:07,573 INFO L424 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:44:07,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:44:07,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1255514312, now seen corresponding path program 71 times [2018-10-15 15:44:07,574 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:44:07,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:44:13,348 INFO L134 CoverageAnalysis]: Checked inductivity of 12888 backedges. 7776 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:44:13,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:44:13,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149] total 149 [2018-10-15 15:44:13,349 INFO L460 AbstractCegarLoop]: Interpolant automaton has 149 states [2018-10-15 15:44:13,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2018-10-15 15:44:13,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2887, Invalid=19165, Unknown=0, NotChecked=0, Total=22052 [2018-10-15 15:44:13,350 INFO L87 Difference]: Start difference. First operand 740 states and 741 transitions. Second operand 149 states.