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/seq.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d769cf3 [2018-10-15 15:34:57,807 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 15:34:57,809 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 15:34:57,821 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 15:34:57,822 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 15:34:57,823 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 15:34:57,824 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 15:34:57,826 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 15:34:57,828 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 15:34:57,829 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 15:34:57,830 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 15:34:57,830 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 15:34:57,831 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 15:34:57,832 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 15:34:57,833 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 15:34:57,834 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 15:34:57,835 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 15:34:57,837 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 15:34:57,839 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 15:34:57,840 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 15:34:57,842 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 15:34:57,843 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 15:34:57,846 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 15:34:57,846 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 15:34:57,846 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 15:34:57,847 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 15:34:57,848 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 15:34:57,849 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 15:34:57,850 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 15:34:57,851 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 15:34:57,851 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 15:34:57,852 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 15:34:57,852 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 15:34:57,853 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 15:34:57,854 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 15:34:57,854 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 15:34:57,855 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:34:57,871 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 15:34:57,872 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 15:34:57,873 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 15:34:57,873 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 15:34:57,873 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 15:34:57,873 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 15:34:57,874 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 15:34:57,874 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 15:34:57,874 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 15:34:57,875 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 15:34:57,875 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 15:34:57,875 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 15:34:57,875 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 15:34:57,876 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 15:34:57,876 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 15:34:57,919 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 15:34:57,933 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 15:34:57,940 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 15:34:57,942 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 15:34:57,943 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 15:34:57,944 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/seq.i_4.bpl [2018-10-15 15:34:57,944 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/seq.i_4.bpl' [2018-10-15 15:34:58,002 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 15:34:58,003 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-15 15:34:58,004 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 15:34:58,004 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 15:34:58,004 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 15:34:58,028 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "seq.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:34:57" (1/1) ... [2018-10-15 15:34:58,030 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "seq.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:34:57" (1/1) ... [2018-10-15 15:34:58,040 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "seq.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:34:57" (1/1) ... [2018-10-15 15:34:58,040 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "seq.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:34:57" (1/1) ... [2018-10-15 15:34:58,043 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "seq.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:34:57" (1/1) ... [2018-10-15 15:34:58,045 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "seq.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:34:57" (1/1) ... [2018-10-15 15:34:58,046 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "seq.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:34:57" (1/1) ... [2018-10-15 15:34:58,048 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 15:34:58,050 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 15:34:58,050 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 15:34:58,051 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 15:34:58,052 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "seq.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:34:57" (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:34:58,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 15:34:58,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 15:34:58,646 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 15:34:58,647 INFO L202 PluginConnector]: Adding new model seq.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:34:58 BoogieIcfgContainer [2018-10-15 15:34:58,647 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 15:34:58,647 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-15 15:34:58,648 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-15 15:34:58,648 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-15 15:34:58,651 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "seq.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:34:58" (1/1) ... [2018-10-15 15:34:58,656 WARN L219 ansformationObserver]: HeapSeparator: input icfg has no '#valid' array -- returning unchanged Icfg! [2018-10-15 15:34:58,671 INFO L202 PluginConnector]: Adding new model seq.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 03:34:58 BasicIcfg [2018-10-15 15:34:58,672 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-15 15:34:58,673 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 15:34:58,673 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 15:34:58,676 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 15:34:58,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "seq.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:34:57" (1/3) ... [2018-10-15 15:34:58,678 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34e5700c and model type seq.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:34:58, skipping insertion in model container [2018-10-15 15:34:58,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "seq.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:34:58" (2/3) ... [2018-10-15 15:34:58,678 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34e5700c and model type seq.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:34:58, skipping insertion in model container [2018-10-15 15:34:58,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "seq.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 03:34:58" (3/3) ... [2018-10-15 15:34:58,680 INFO L112 eAbstractionObserver]: Analyzing ICFG seq.i_4.bplleft_unchanged_by_heapseparator [2018-10-15 15:34:58,690 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 15:34:58,700 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 15:34:58,717 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 15:34:58,746 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 15:34:58,747 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 15:34:58,747 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 15:34:58,747 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 15:34:58,748 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 15:34:58,748 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 15:34:58,748 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 15:34:58,748 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 15:34:58,748 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 15:34:58,763 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2018-10-15 15:34:58,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-15 15:34:58,777 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:34:58,778 INFO L375 BasicCegarLoop]: trace histogram [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, 1] [2018-10-15 15:34:58,779 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:34:58,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:34:58,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1144131372, now seen corresponding path program 1 times [2018-10-15 15:34:58,847 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:34:58,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:34:59,074 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:34:59,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:34:59,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-15 15:34:59,082 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 15:34:59,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 15:34:59,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-15 15:34:59,099 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 7 states. [2018-10-15 15:34:59,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:34:59,723 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2018-10-15 15:34:59,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-15 15:34:59,725 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-10-15 15:34:59,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:34:59,737 INFO L225 Difference]: With dead ends: 48 [2018-10-15 15:34:59,737 INFO L226 Difference]: Without dead ends: 45 [2018-10-15 15:34:59,740 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-10-15 15:34:59,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-15 15:34:59,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-10-15 15:34:59,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-15 15:34:59,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-10-15 15:34:59,780 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 28 [2018-10-15 15:34:59,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:34:59,780 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-10-15 15:34:59,781 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 15:34:59,781 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-10-15 15:34:59,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-15 15:34:59,782 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:34:59,783 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:34:59,783 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:34:59,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:34:59,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1766210100, now seen corresponding path program 1 times [2018-10-15 15:34:59,785 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:34:59,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:00,101 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:00,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:35:00,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-15 15:35:00,104 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 15:35:00,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 15:35:00,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-15 15:35:00,105 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 7 states. [2018-10-15 15:35:00,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:00,461 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2018-10-15 15:35:00,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-15 15:35:00,462 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-10-15 15:35:00,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:00,464 INFO L225 Difference]: With dead ends: 64 [2018-10-15 15:35:00,464 INFO L226 Difference]: Without dead ends: 64 [2018-10-15 15:35:00,465 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:00,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-10-15 15:35:00,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 49. [2018-10-15 15:35:00,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-15 15:35:00,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-10-15 15:35:00,472 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 36 [2018-10-15 15:35:00,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:00,473 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-10-15 15:35:00,474 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 15:35:00,474 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-10-15 15:35:00,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-15 15:35:00,475 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:00,476 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:00,476 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:00,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:00,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1775328504, now seen corresponding path program 1 times [2018-10-15 15:35:00,478 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:00,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:00,835 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:00,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:00,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 15:35:00,836 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 15:35:00,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 15:35:00,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-10-15 15:35:00,838 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 11 states. [2018-10-15 15:35:01,348 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-15 15:35:01,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:01,633 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2018-10-15 15:35:01,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-15 15:35:01,634 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2018-10-15 15:35:01,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:01,636 INFO L225 Difference]: With dead ends: 74 [2018-10-15 15:35:01,636 INFO L226 Difference]: Without dead ends: 59 [2018-10-15 15:35:01,637 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2018-10-15 15:35:01,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-15 15:35:01,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2018-10-15 15:35:01,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-15 15:35:01,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-10-15 15:35:01,643 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 48 [2018-10-15 15:35:01,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:01,644 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-10-15 15:35:01,644 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 15:35:01,644 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-10-15 15:35:01,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-15 15:35:01,646 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:01,646 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:01,647 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:01,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:01,647 INFO L82 PathProgramCache]: Analyzing trace with hash -2135357968, now seen corresponding path program 2 times [2018-10-15 15:35:01,648 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:01,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:01,923 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:01,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:01,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-15 15:35:01,925 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-15 15:35:01,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-15 15:35:01,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-10-15 15:35:01,926 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 12 states. [2018-10-15 15:35:02,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:02,651 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2018-10-15 15:35:02,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-15 15:35:02,651 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2018-10-15 15:35:02,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:02,653 INFO L225 Difference]: With dead ends: 83 [2018-10-15 15:35:02,653 INFO L226 Difference]: Without dead ends: 83 [2018-10-15 15:35:02,655 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:02,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-10-15 15:35:02,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 69. [2018-10-15 15:35:02,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-10-15 15:35:02,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2018-10-15 15:35:02,663 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 56 [2018-10-15 15:35:02,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:02,663 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2018-10-15 15:35:02,664 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-15 15:35:02,664 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2018-10-15 15:35:02,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-15 15:35:02,666 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:02,666 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:02,666 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:02,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:02,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1721923812, now seen corresponding path program 3 times [2018-10-15 15:35:02,668 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:02,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:02,967 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:02,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:02,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 15:35:02,969 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 15:35:02,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 15:35:02,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-10-15 15:35:02,970 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 15 states. [2018-10-15 15:35:03,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:03,549 INFO L93 Difference]: Finished difference Result 106 states and 107 transitions. [2018-10-15 15:35:03,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-15 15:35:03,550 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 68 [2018-10-15 15:35:03,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:03,551 INFO L225 Difference]: With dead ends: 106 [2018-10-15 15:35:03,552 INFO L226 Difference]: Without dead ends: 79 [2018-10-15 15:35:03,553 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=219, Invalid=711, Unknown=0, NotChecked=0, Total=930 [2018-10-15 15:35:03,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-15 15:35:03,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2018-10-15 15:35:03,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-10-15 15:35:03,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2018-10-15 15:35:03,559 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 68 [2018-10-15 15:35:03,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:03,560 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2018-10-15 15:35:03,560 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 15:35:03,560 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2018-10-15 15:35:03,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-15 15:35:03,562 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:03,562 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:03,562 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:03,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:03,563 INFO L82 PathProgramCache]: Analyzing trace with hash -871431148, now seen corresponding path program 4 times [2018-10-15 15:35:03,564 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:03,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:03,905 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:03,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:03,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 15:35:03,906 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 15:35:03,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 15:35:03,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2018-10-15 15:35:03,907 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 15 states. [2018-10-15 15:35:04,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:04,501 INFO L93 Difference]: Finished difference Result 103 states and 104 transitions. [2018-10-15 15:35:04,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-15 15:35:04,502 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 76 [2018-10-15 15:35:04,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:04,504 INFO L225 Difference]: With dead ends: 103 [2018-10-15 15:35:04,504 INFO L226 Difference]: Without dead ends: 103 [2018-10-15 15:35:04,505 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=222, Invalid=770, Unknown=0, NotChecked=0, Total=992 [2018-10-15 15:35:04,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-10-15 15:35:04,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 89. [2018-10-15 15:35:04,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-10-15 15:35:04,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2018-10-15 15:35:04,513 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 76 [2018-10-15 15:35:04,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:04,513 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2018-10-15 15:35:04,513 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 15:35:04,513 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2018-10-15 15:35:04,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-15 15:35:04,515 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:04,515 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:04,516 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:04,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:04,516 INFO L82 PathProgramCache]: Analyzing trace with hash 403926848, now seen corresponding path program 5 times [2018-10-15 15:35:04,517 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:04,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:04,783 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:04,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:04,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 15:35:04,784 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 15:35:04,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 15:35:04,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2018-10-15 15:35:04,785 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 19 states. [2018-10-15 15:35:05,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:05,714 INFO L93 Difference]: Finished difference Result 138 states and 139 transitions. [2018-10-15 15:35:05,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-15 15:35:05,714 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 88 [2018-10-15 15:35:05,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:05,716 INFO L225 Difference]: With dead ends: 138 [2018-10-15 15:35:05,716 INFO L226 Difference]: Without dead ends: 99 [2018-10-15 15:35:05,717 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=351, Invalid=1289, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 15:35:05,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-10-15 15:35:05,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2018-10-15 15:35:05,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-10-15 15:35:05,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2018-10-15 15:35:05,724 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 88 [2018-10-15 15:35:05,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:05,724 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2018-10-15 15:35:05,724 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 15:35:05,724 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2018-10-15 15:35:05,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-15 15:35:05,726 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:05,726 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:05,727 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:05,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:05,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1398587448, now seen corresponding path program 6 times [2018-10-15 15:35:05,728 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:05,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:06,648 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:06,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:06,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-15 15:35:06,649 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-15 15:35:06,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-15 15:35:06,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2018-10-15 15:35:06,650 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 18 states. [2018-10-15 15:35:07,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:07,461 INFO L93 Difference]: Finished difference Result 123 states and 124 transitions. [2018-10-15 15:35:07,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-15 15:35:07,461 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 96 [2018-10-15 15:35:07,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:07,463 INFO L225 Difference]: With dead ends: 123 [2018-10-15 15:35:07,463 INFO L226 Difference]: Without dead ends: 123 [2018-10-15 15:35:07,465 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=349, Invalid=1291, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 15:35:07,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-10-15 15:35:07,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 109. [2018-10-15 15:35:07,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-15 15:35:07,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2018-10-15 15:35:07,472 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 96 [2018-10-15 15:35:07,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:07,472 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2018-10-15 15:35:07,472 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-15 15:35:07,473 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2018-10-15 15:35:07,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-15 15:35:07,474 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:07,474 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:07,475 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:07,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:07,475 INFO L82 PathProgramCache]: Analyzing trace with hash -686549660, now seen corresponding path program 7 times [2018-10-15 15:35:07,476 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:07,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:07,845 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:07,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:07,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 15:35:07,846 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 15:35:07,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 15:35:07,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2018-10-15 15:35:07,847 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 23 states. [2018-10-15 15:35:08,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:08,726 INFO L93 Difference]: Finished difference Result 170 states and 171 transitions. [2018-10-15 15:35:08,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-15 15:35:08,726 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 108 [2018-10-15 15:35:08,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:08,728 INFO L225 Difference]: With dead ends: 170 [2018-10-15 15:35:08,728 INFO L226 Difference]: Without dead ends: 119 [2018-10-15 15:35:08,729 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=511, Invalid=2039, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 15:35:08,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-10-15 15:35:08,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2018-10-15 15:35:08,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-10-15 15:35:08,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2018-10-15 15:35:08,737 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 108 [2018-10-15 15:35:08,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:08,737 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2018-10-15 15:35:08,737 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 15:35:08,738 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2018-10-15 15:35:08,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-15 15:35:08,739 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:08,739 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:08,740 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:08,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:08,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1799144868, now seen corresponding path program 8 times [2018-10-15 15:35:08,741 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:08,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:09,064 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:35:09,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:09,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 15:35:09,065 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 15:35:09,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 15:35:09,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2018-10-15 15:35:09,065 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 21 states. [2018-10-15 15:35:09,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:09,675 INFO L93 Difference]: Finished difference Result 143 states and 144 transitions. [2018-10-15 15:35:09,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-15 15:35:09,676 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 116 [2018-10-15 15:35:09,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:09,677 INFO L225 Difference]: With dead ends: 143 [2018-10-15 15:35:09,677 INFO L226 Difference]: Without dead ends: 143 [2018-10-15 15:35:09,679 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:35:09,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-10-15 15:35:09,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 129. [2018-10-15 15:35:09,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-10-15 15:35:09,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2018-10-15 15:35:09,685 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 116 [2018-10-15 15:35:09,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:09,685 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2018-10-15 15:35:09,685 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 15:35:09,686 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2018-10-15 15:35:09,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-15 15:35:09,687 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:09,688 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:09,688 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:09,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:09,688 INFO L82 PathProgramCache]: Analyzing trace with hash 721451400, now seen corresponding path program 9 times [2018-10-15 15:35:09,689 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:09,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:10,200 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:35:10,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:10,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 15:35:10,201 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 15:35:10,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 15:35:10,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=601, Unknown=0, NotChecked=0, Total=702 [2018-10-15 15:35:10,202 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 27 states. [2018-10-15 15:35:11,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:11,446 INFO L93 Difference]: Finished difference Result 202 states and 203 transitions. [2018-10-15 15:35:11,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-15 15:35:11,447 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 128 [2018-10-15 15:35:11,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:11,448 INFO L225 Difference]: With dead ends: 202 [2018-10-15 15:35:11,448 INFO L226 Difference]: Without dead ends: 139 [2018-10-15 15:35:11,450 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 807 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=699, Invalid=2961, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 15:35:11,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-10-15 15:35:11,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2018-10-15 15:35:11,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-10-15 15:35:11,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2018-10-15 15:35:11,455 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 128 [2018-10-15 15:35:11,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:11,455 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2018-10-15 15:35:11,455 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 15:35:11,455 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2018-10-15 15:35:11,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-15 15:35:11,457 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:11,457 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:11,458 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:11,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:11,458 INFO L82 PathProgramCache]: Analyzing trace with hash -236752256, now seen corresponding path program 10 times [2018-10-15 15:35:11,459 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:11,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:11,744 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:35:11,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:11,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-15 15:35:11,745 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-15 15:35:11,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-15 15:35:11,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2018-10-15 15:35:11,745 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand 24 states. [2018-10-15 15:35:12,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:12,514 INFO L93 Difference]: Finished difference Result 163 states and 164 transitions. [2018-10-15 15:35:12,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-15 15:35:12,514 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 136 [2018-10-15 15:35:12,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:12,515 INFO L225 Difference]: With dead ends: 163 [2018-10-15 15:35:12,516 INFO L226 Difference]: Without dead ends: 163 [2018-10-15 15:35:12,517 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 965 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=687, Invalid=2735, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 15:35:12,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-10-15 15:35:12,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 149. [2018-10-15 15:35:12,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-10-15 15:35:12,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 150 transitions. [2018-10-15 15:35:12,522 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 150 transitions. Word has length 136 [2018-10-15 15:35:12,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:12,522 INFO L481 AbstractCegarLoop]: Abstraction has 149 states and 150 transitions. [2018-10-15 15:35:12,522 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-15 15:35:12,522 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 150 transitions. [2018-10-15 15:35:12,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-15 15:35:12,524 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:12,524 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:12,525 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:12,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:12,525 INFO L82 PathProgramCache]: Analyzing trace with hash 200907692, now seen corresponding path program 11 times [2018-10-15 15:35:12,526 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:12,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:13,018 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:35:13,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:13,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 15:35:13,019 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 15:35:13,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 15:35:13,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=799, Unknown=0, NotChecked=0, Total=930 [2018-10-15 15:35:13,020 INFO L87 Difference]: Start difference. First operand 149 states and 150 transitions. Second operand 31 states. [2018-10-15 15:35:14,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:14,457 INFO L93 Difference]: Finished difference Result 234 states and 235 transitions. [2018-10-15 15:35:14,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-15 15:35:14,458 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 148 [2018-10-15 15:35:14,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:14,460 INFO L225 Difference]: With dead ends: 234 [2018-10-15 15:35:14,460 INFO L226 Difference]: Without dead ends: 159 [2018-10-15 15:35:14,462 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1158 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=915, Invalid=4055, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 15:35:14,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-10-15 15:35:14,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2018-10-15 15:35:14,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-10-15 15:35:14,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2018-10-15 15:35:14,466 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 148 [2018-10-15 15:35:14,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:14,466 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2018-10-15 15:35:14,466 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 15:35:14,466 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2018-10-15 15:35:14,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-15 15:35:14,468 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:14,468 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:14,468 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:14,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:14,468 INFO L82 PathProgramCache]: Analyzing trace with hash -270636892, now seen corresponding path program 12 times [2018-10-15 15:35:14,469 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:14,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:14,951 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:35:14,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:14,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 15:35:14,953 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 15:35:14,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 15:35:14,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=571, Unknown=0, NotChecked=0, Total=702 [2018-10-15 15:35:14,954 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 27 states. [2018-10-15 15:35:15,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:15,980 INFO L93 Difference]: Finished difference Result 183 states and 184 transitions. [2018-10-15 15:35:15,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-15 15:35:15,980 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 156 [2018-10-15 15:35:15,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:15,982 INFO L225 Difference]: With dead ends: 183 [2018-10-15 15:35:15,982 INFO L226 Difference]: Without dead ends: 183 [2018-10-15 15:35:15,984 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1323 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=898, Invalid=3658, Unknown=0, NotChecked=0, Total=4556 [2018-10-15 15:35:15,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-10-15 15:35:15,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 169. [2018-10-15 15:35:15,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-10-15 15:35:15,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2018-10-15 15:35:15,991 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 156 [2018-10-15 15:35:15,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:15,991 INFO L481 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2018-10-15 15:35:15,991 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 15:35:15,992 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2018-10-15 15:35:15,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-10-15 15:35:15,992 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:15,993 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:15,993 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:15,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:15,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1436580816, now seen corresponding path program 13 times [2018-10-15 15:35:15,994 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:16,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:16,553 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:35:16,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:16,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 15:35:16,554 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 15:35:16,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 15:35:16,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1025, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 15:35:16,555 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand 35 states. [2018-10-15 15:35:18,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:18,045 INFO L93 Difference]: Finished difference Result 266 states and 267 transitions. [2018-10-15 15:35:18,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-15 15:35:18,045 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 168 [2018-10-15 15:35:18,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:18,047 INFO L225 Difference]: With dead ends: 266 [2018-10-15 15:35:18,047 INFO L226 Difference]: Without dead ends: 179 [2018-10-15 15:35:18,050 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1572 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1159, Invalid=5321, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 15:35:18,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-10-15 15:35:18,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2018-10-15 15:35:18,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-10-15 15:35:18,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2018-10-15 15:35:18,054 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 168 [2018-10-15 15:35:18,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:18,054 INFO L481 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2018-10-15 15:35:18,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 15:35:18,054 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2018-10-15 15:35:18,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-10-15 15:35:18,055 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:18,055 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:18,056 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:18,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:18,056 INFO L82 PathProgramCache]: Analyzing trace with hash 2002066632, now seen corresponding path program 14 times [2018-10-15 15:35:18,057 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:18,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:18,883 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:35:18,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:18,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-15 15:35:18,884 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-15 15:35:18,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-15 15:35:18,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=710, Unknown=0, NotChecked=0, Total=870 [2018-10-15 15:35:18,885 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand 30 states. [2018-10-15 15:35:20,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:20,161 INFO L93 Difference]: Finished difference Result 203 states and 204 transitions. [2018-10-15 15:35:20,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-15 15:35:20,161 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 176 [2018-10-15 15:35:20,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:20,163 INFO L225 Difference]: With dead ends: 203 [2018-10-15 15:35:20,163 INFO L226 Difference]: Without dead ends: 203 [2018-10-15 15:35:20,166 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1737 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1137, Invalid=4715, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 15:35:20,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-10-15 15:35:20,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 189. [2018-10-15 15:35:20,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-10-15 15:35:20,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 190 transitions. [2018-10-15 15:35:20,182 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 190 transitions. Word has length 176 [2018-10-15 15:35:20,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:20,183 INFO L481 AbstractCegarLoop]: Abstraction has 189 states and 190 transitions. [2018-10-15 15:35:20,183 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-15 15:35:20,183 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 190 transitions. [2018-10-15 15:35:20,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-15 15:35:20,184 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:20,184 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:20,184 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:20,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:20,185 INFO L82 PathProgramCache]: Analyzing trace with hash 118888948, now seen corresponding path program 15 times [2018-10-15 15:35:20,185 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:20,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:21,050 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:35:21,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:21,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 15:35:21,051 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 15:35:21,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 15:35:21,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1279, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 15:35:21,052 INFO L87 Difference]: Start difference. First operand 189 states and 190 transitions. Second operand 39 states. [2018-10-15 15:35:22,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:22,774 INFO L93 Difference]: Finished difference Result 298 states and 299 transitions. [2018-10-15 15:35:22,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-15 15:35:22,774 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 188 [2018-10-15 15:35:22,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:22,776 INFO L225 Difference]: With dead ends: 298 [2018-10-15 15:35:22,776 INFO L226 Difference]: Without dead ends: 199 [2018-10-15 15:35:22,779 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2049 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1431, Invalid=6759, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 15:35:22,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-10-15 15:35:22,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 197. [2018-10-15 15:35:22,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-10-15 15:35:22,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 198 transitions. [2018-10-15 15:35:22,783 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 198 transitions. Word has length 188 [2018-10-15 15:35:22,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:22,784 INFO L481 AbstractCegarLoop]: Abstraction has 197 states and 198 transitions. [2018-10-15 15:35:22,784 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 15:35:22,784 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 198 transitions. [2018-10-15 15:35:22,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-10-15 15:35:22,785 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:22,785 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:22,785 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:22,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:22,786 INFO L82 PathProgramCache]: Analyzing trace with hash 342396652, now seen corresponding path program 16 times [2018-10-15 15:35:22,786 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:22,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:23,590 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:35:23,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:23,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 15:35:23,591 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 15:35:23,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 15:35:23,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=864, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 15:35:23,592 INFO L87 Difference]: Start difference. First operand 197 states and 198 transitions. Second operand 33 states. [2018-10-15 15:35:25,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:25,250 INFO L93 Difference]: Finished difference Result 223 states and 224 transitions. [2018-10-15 15:35:25,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-15 15:35:25,251 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 196 [2018-10-15 15:35:25,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:25,253 INFO L225 Difference]: With dead ends: 223 [2018-10-15 15:35:25,254 INFO L226 Difference]: Without dead ends: 223 [2018-10-15 15:35:25,257 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2207 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1404, Invalid=5906, Unknown=0, NotChecked=0, Total=7310 [2018-10-15 15:35:25,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-10-15 15:35:25,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 209. [2018-10-15 15:35:25,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-10-15 15:35:25,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 210 transitions. [2018-10-15 15:35:25,262 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 210 transitions. Word has length 196 [2018-10-15 15:35:25,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:25,262 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 210 transitions. [2018-10-15 15:35:25,262 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 15:35:25,263 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 210 transitions. [2018-10-15 15:35:25,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-10-15 15:35:25,264 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:25,264 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:25,265 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:25,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:25,265 INFO L82 PathProgramCache]: Analyzing trace with hash -2097449448, now seen corresponding path program 17 times [2018-10-15 15:35:25,266 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:25,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:26,160 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:35:26,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:26,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 15:35:26,161 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 15:35:26,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 15:35:26,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=1561, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 15:35:26,162 INFO L87 Difference]: Start difference. First operand 209 states and 210 transitions. Second operand 43 states. [2018-10-15 15:35:28,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:28,004 INFO L93 Difference]: Finished difference Result 330 states and 331 transitions. [2018-10-15 15:35:28,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-15 15:35:28,005 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 208 [2018-10-15 15:35:28,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:28,006 INFO L225 Difference]: With dead ends: 330 [2018-10-15 15:35:28,007 INFO L226 Difference]: Without dead ends: 219 [2018-10-15 15:35:28,008 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2589 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1731, Invalid=8369, Unknown=0, NotChecked=0, Total=10100 [2018-10-15 15:35:28,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-10-15 15:35:28,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 217. [2018-10-15 15:35:28,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-10-15 15:35:28,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 218 transitions. [2018-10-15 15:35:28,012 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 218 transitions. Word has length 208 [2018-10-15 15:35:28,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:28,012 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 218 transitions. [2018-10-15 15:35:28,012 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 15:35:28,012 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 218 transitions. [2018-10-15 15:35:28,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-10-15 15:35:28,013 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:28,013 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:28,014 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:28,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:28,014 INFO L82 PathProgramCache]: Analyzing trace with hash 918142736, now seen corresponding path program 18 times [2018-10-15 15:35:28,015 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:28,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:29,586 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:35:29,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:29,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-15 15:35:29,587 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-15 15:35:29,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-15 15:35:29,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=1033, Unknown=0, NotChecked=0, Total=1260 [2018-10-15 15:35:29,587 INFO L87 Difference]: Start difference. First operand 217 states and 218 transitions. Second operand 36 states. [2018-10-15 15:35:32,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:32,351 INFO L93 Difference]: Finished difference Result 243 states and 244 transitions. [2018-10-15 15:35:32,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-15 15:35:32,351 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 216 [2018-10-15 15:35:32,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:32,354 INFO L225 Difference]: With dead ends: 243 [2018-10-15 15:35:32,354 INFO L226 Difference]: Without dead ends: 243 [2018-10-15 15:35:32,356 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2733 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1699, Invalid=7231, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 15:35:32,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-10-15 15:35:32,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 229. [2018-10-15 15:35:32,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-10-15 15:35:32,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 230 transitions. [2018-10-15 15:35:32,361 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 230 transitions. Word has length 216 [2018-10-15 15:35:32,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:32,361 INFO L481 AbstractCegarLoop]: Abstraction has 229 states and 230 transitions. [2018-10-15 15:35:32,362 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-15 15:35:32,362 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 230 transitions. [2018-10-15 15:35:32,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-10-15 15:35:32,363 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:32,363 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:32,363 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:32,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:32,364 INFO L82 PathProgramCache]: Analyzing trace with hash -814641092, now seen corresponding path program 19 times [2018-10-15 15:35:32,364 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:32,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:33,831 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:35:33,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:33,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 15:35:33,832 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 15:35:33,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 15:35:33,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=1871, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 15:35:33,832 INFO L87 Difference]: Start difference. First operand 229 states and 230 transitions. Second operand 47 states. [2018-10-15 15:35:36,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:36,677 INFO L93 Difference]: Finished difference Result 362 states and 363 transitions. [2018-10-15 15:35:36,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-15 15:35:36,677 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 228 [2018-10-15 15:35:36,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:36,679 INFO L225 Difference]: With dead ends: 362 [2018-10-15 15:35:36,679 INFO L226 Difference]: Without dead ends: 239 [2018-10-15 15:35:36,681 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3192 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2059, Invalid=10151, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 15:35:36,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-10-15 15:35:36,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 237. [2018-10-15 15:35:36,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-10-15 15:35:36,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 238 transitions. [2018-10-15 15:35:36,685 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 238 transitions. Word has length 228 [2018-10-15 15:35:36,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:36,685 INFO L481 AbstractCegarLoop]: Abstraction has 237 states and 238 transitions. [2018-10-15 15:35:36,685 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 15:35:36,685 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 238 transitions. [2018-10-15 15:35:36,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-10-15 15:35:36,687 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:36,687 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:36,687 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:36,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:36,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1902751028, now seen corresponding path program 20 times [2018-10-15 15:35:36,688 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:36,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:37,366 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:35:37,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:37,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 15:35:37,367 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 15:35:37,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 15:35:37,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=1217, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 15:35:37,368 INFO L87 Difference]: Start difference. First operand 237 states and 238 transitions. Second operand 39 states. [2018-10-15 15:35:39,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:39,111 INFO L93 Difference]: Finished difference Result 263 states and 264 transitions. [2018-10-15 15:35:39,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-15 15:35:39,114 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 236 [2018-10-15 15:35:39,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:39,116 INFO L225 Difference]: With dead ends: 263 [2018-10-15 15:35:39,116 INFO L226 Difference]: Without dead ends: 263 [2018-10-15 15:35:39,117 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3315 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2022, Invalid=8690, Unknown=0, NotChecked=0, Total=10712 [2018-10-15 15:35:39,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-10-15 15:35:39,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 249. [2018-10-15 15:35:39,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-10-15 15:35:39,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 250 transitions. [2018-10-15 15:35:39,123 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 250 transitions. Word has length 236 [2018-10-15 15:35:39,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:39,124 INFO L481 AbstractCegarLoop]: Abstraction has 249 states and 250 transitions. [2018-10-15 15:35:39,124 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 15:35:39,124 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 250 transitions. [2018-10-15 15:35:39,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-10-15 15:35:39,125 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:39,125 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:39,126 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:39,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:39,126 INFO L82 PathProgramCache]: Analyzing trace with hash -702977952, now seen corresponding path program 21 times [2018-10-15 15:35:39,127 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:39,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:40,480 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:35:40,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:40,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 15:35:40,480 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 15:35:40,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 15:35:40,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=2209, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 15:35:40,482 INFO L87 Difference]: Start difference. First operand 249 states and 250 transitions. Second operand 51 states. [2018-10-15 15:35:43,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:43,376 INFO L93 Difference]: Finished difference Result 394 states and 395 transitions. [2018-10-15 15:35:43,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-15 15:35:43,376 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 248 [2018-10-15 15:35:43,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:43,378 INFO L225 Difference]: With dead ends: 394 [2018-10-15 15:35:43,378 INFO L226 Difference]: Without dead ends: 259 [2018-10-15 15:35:43,380 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3858 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2415, Invalid=12105, Unknown=0, NotChecked=0, Total=14520 [2018-10-15 15:35:43,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-10-15 15:35:43,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 257. [2018-10-15 15:35:43,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-10-15 15:35:43,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 258 transitions. [2018-10-15 15:35:43,384 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 258 transitions. Word has length 248 [2018-10-15 15:35:43,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:43,384 INFO L481 AbstractCegarLoop]: Abstraction has 257 states and 258 transitions. [2018-10-15 15:35:43,385 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 15:35:43,385 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 258 transitions. [2018-10-15 15:35:43,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-10-15 15:35:43,386 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:43,386 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:43,386 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:43,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:43,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1155966632, now seen corresponding path program 22 times [2018-10-15 15:35:43,387 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:43,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:44,219 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:35:44,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:44,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-15 15:35:44,220 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-15 15:35:44,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-15 15:35:44,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=1416, Unknown=0, NotChecked=0, Total=1722 [2018-10-15 15:35:44,221 INFO L87 Difference]: Start difference. First operand 257 states and 258 transitions. Second operand 42 states. [2018-10-15 15:35:46,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:46,157 INFO L93 Difference]: Finished difference Result 283 states and 284 transitions. [2018-10-15 15:35:46,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-15 15:35:46,159 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 256 [2018-10-15 15:35:46,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:46,160 INFO L225 Difference]: With dead ends: 283 [2018-10-15 15:35:46,161 INFO L226 Difference]: Without dead ends: 283 [2018-10-15 15:35:46,162 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3953 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2373, Invalid=10283, Unknown=0, NotChecked=0, Total=12656 [2018-10-15 15:35:46,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-10-15 15:35:46,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 269. [2018-10-15 15:35:46,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-10-15 15:35:46,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 270 transitions. [2018-10-15 15:35:46,166 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 270 transitions. Word has length 256 [2018-10-15 15:35:46,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:46,167 INFO L481 AbstractCegarLoop]: Abstraction has 269 states and 270 transitions. [2018-10-15 15:35:46,167 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-15 15:35:46,167 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 270 transitions. [2018-10-15 15:35:46,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-10-15 15:35:46,168 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:46,168 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:46,169 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:46,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:46,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1542193532, now seen corresponding path program 23 times [2018-10-15 15:35:46,170 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:46,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:47,240 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:35:47,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:47,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 15:35:47,241 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 15:35:47,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 15:35:47,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=2575, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 15:35:47,242 INFO L87 Difference]: Start difference. First operand 269 states and 270 transitions. Second operand 55 states. [2018-10-15 15:35:50,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:50,535 INFO L93 Difference]: Finished difference Result 426 states and 427 transitions. [2018-10-15 15:35:50,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-15 15:35:50,535 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 268 [2018-10-15 15:35:50,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:50,537 INFO L225 Difference]: With dead ends: 426 [2018-10-15 15:35:50,537 INFO L226 Difference]: Without dead ends: 279 [2018-10-15 15:35:50,538 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4587 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2799, Invalid=14231, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 15:35:50,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-10-15 15:35:50,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 277. [2018-10-15 15:35:50,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-10-15 15:35:50,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 278 transitions. [2018-10-15 15:35:50,542 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 278 transitions. Word has length 268 [2018-10-15 15:35:50,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:50,542 INFO L481 AbstractCegarLoop]: Abstraction has 277 states and 278 transitions. [2018-10-15 15:35:50,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 15:35:50,542 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 278 transitions. [2018-10-15 15:35:50,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-10-15 15:35:50,544 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:50,544 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:50,544 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:50,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:50,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1377188996, now seen corresponding path program 24 times [2018-10-15 15:35:50,545 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:50,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:52,092 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:35:52,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:52,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 15:35:52,093 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 15:35:52,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 15:35:52,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=350, Invalid=1630, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 15:35:52,094 INFO L87 Difference]: Start difference. First operand 277 states and 278 transitions. Second operand 45 states. [2018-10-15 15:35:54,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:54,124 INFO L93 Difference]: Finished difference Result 303 states and 304 transitions. [2018-10-15 15:35:54,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-10-15 15:35:54,125 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 276 [2018-10-15 15:35:54,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:54,127 INFO L225 Difference]: With dead ends: 303 [2018-10-15 15:35:54,127 INFO L226 Difference]: Without dead ends: 303 [2018-10-15 15:35:54,129 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4647 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2752, Invalid=12010, Unknown=0, NotChecked=0, Total=14762 [2018-10-15 15:35:54,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-10-15 15:35:54,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 289. [2018-10-15 15:35:54,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-10-15 15:35:54,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 290 transitions. [2018-10-15 15:35:54,133 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 290 transitions. Word has length 276 [2018-10-15 15:35:54,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:54,134 INFO L481 AbstractCegarLoop]: Abstraction has 289 states and 290 transitions. [2018-10-15 15:35:54,134 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 15:35:54,134 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 290 transitions. [2018-10-15 15:35:54,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-10-15 15:35:54,135 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:54,136 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:54,136 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:54,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:54,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1442688344, now seen corresponding path program 25 times [2018-10-15 15:35:54,137 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:54,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:56,328 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:35:56,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:56,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-15 15:35:56,329 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-15 15:35:56,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-15 15:35:56,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=453, Invalid=2969, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 15:35:56,329 INFO L87 Difference]: Start difference. First operand 289 states and 290 transitions. Second operand 59 states. [2018-10-15 15:36:00,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:00,102 INFO L93 Difference]: Finished difference Result 458 states and 459 transitions. [2018-10-15 15:36:00,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-15 15:36:00,102 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 288 [2018-10-15 15:36:00,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:00,104 INFO L225 Difference]: With dead ends: 458 [2018-10-15 15:36:00,104 INFO L226 Difference]: Without dead ends: 299 [2018-10-15 15:36:00,106 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5379 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=3211, Invalid=16529, Unknown=0, NotChecked=0, Total=19740 [2018-10-15 15:36:00,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-10-15 15:36:00,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 297. [2018-10-15 15:36:00,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-10-15 15:36:00,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 298 transitions. [2018-10-15 15:36:00,110 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 298 transitions. Word has length 288 [2018-10-15 15:36:00,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:00,110 INFO L481 AbstractCegarLoop]: Abstraction has 297 states and 298 transitions. [2018-10-15 15:36:00,110 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-15 15:36:00,110 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 298 transitions. [2018-10-15 15:36:00,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-10-15 15:36:00,112 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:00,112 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:00,112 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:00,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:00,113 INFO L82 PathProgramCache]: Analyzing trace with hash -948180064, now seen corresponding path program 26 times [2018-10-15 15:36:00,114 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:00,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:01,428 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:01,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:01,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-15 15:36:01,429 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-15 15:36:01,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-15 15:36:01,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=397, Invalid=1859, Unknown=0, NotChecked=0, Total=2256 [2018-10-15 15:36:01,429 INFO L87 Difference]: Start difference. First operand 297 states and 298 transitions. Second operand 48 states. [2018-10-15 15:36:03,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:03,725 INFO L93 Difference]: Finished difference Result 323 states and 324 transitions. [2018-10-15 15:36:03,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-10-15 15:36:03,726 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 296 [2018-10-15 15:36:03,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:03,728 INFO L225 Difference]: With dead ends: 323 [2018-10-15 15:36:03,728 INFO L226 Difference]: Without dead ends: 323 [2018-10-15 15:36:03,730 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5397 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3159, Invalid=13871, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 15:36:03,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-10-15 15:36:03,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 309. [2018-10-15 15:36:03,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-10-15 15:36:03,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 310 transitions. [2018-10-15 15:36:03,734 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 310 transitions. Word has length 296 [2018-10-15 15:36:03,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:03,735 INFO L481 AbstractCegarLoop]: Abstraction has 309 states and 310 transitions. [2018-10-15 15:36:03,735 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-15 15:36:03,735 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 310 transitions. [2018-10-15 15:36:03,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-10-15 15:36:03,737 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:03,737 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:03,737 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:03,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:03,738 INFO L82 PathProgramCache]: Analyzing trace with hash -66755380, now seen corresponding path program 27 times [2018-10-15 15:36:03,738 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:03,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:05,490 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:05,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:05,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-15 15:36:05,491 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-15 15:36:05,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-15 15:36:05,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=515, Invalid=3391, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 15:36:05,492 INFO L87 Difference]: Start difference. First operand 309 states and 310 transitions. Second operand 63 states. [2018-10-15 15:36:09,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:09,465 INFO L93 Difference]: Finished difference Result 490 states and 491 transitions. [2018-10-15 15:36:09,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-10-15 15:36:09,466 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 308 [2018-10-15 15:36:09,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:09,467 INFO L225 Difference]: With dead ends: 490 [2018-10-15 15:36:09,467 INFO L226 Difference]: Without dead ends: 319 [2018-10-15 15:36:09,468 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6234 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=3651, Invalid=18999, Unknown=0, NotChecked=0, Total=22650 [2018-10-15 15:36:09,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-10-15 15:36:09,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 317. [2018-10-15 15:36:09,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-10-15 15:36:09,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 318 transitions. [2018-10-15 15:36:09,471 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 318 transitions. Word has length 308 [2018-10-15 15:36:09,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:09,472 INFO L481 AbstractCegarLoop]: Abstraction has 317 states and 318 transitions. [2018-10-15 15:36:09,472 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-15 15:36:09,472 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 318 transitions. [2018-10-15 15:36:09,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2018-10-15 15:36:09,474 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:09,474 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:09,474 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:09,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:09,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1460612668, now seen corresponding path program 28 times [2018-10-15 15:36:09,475 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:09,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:10,785 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:10,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:10,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 15:36:10,785 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 15:36:10,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 15:36:10,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=2103, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 15:36:10,786 INFO L87 Difference]: Start difference. First operand 317 states and 318 transitions. Second operand 51 states. [2018-10-15 15:36:13,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:13,143 INFO L93 Difference]: Finished difference Result 343 states and 344 transitions. [2018-10-15 15:36:13,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-10-15 15:36:13,144 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 316 [2018-10-15 15:36:13,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:13,147 INFO L225 Difference]: With dead ends: 343 [2018-10-15 15:36:13,147 INFO L226 Difference]: Without dead ends: 343 [2018-10-15 15:36:13,149 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6203 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3594, Invalid=15866, Unknown=0, NotChecked=0, Total=19460 [2018-10-15 15:36:13,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-10-15 15:36:13,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 329. [2018-10-15 15:36:13,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-10-15 15:36:13,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 330 transitions. [2018-10-15 15:36:13,153 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 330 transitions. Word has length 316 [2018-10-15 15:36:13,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:13,153 INFO L481 AbstractCegarLoop]: Abstraction has 329 states and 330 transitions. [2018-10-15 15:36:13,154 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 15:36:13,154 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 330 transitions. [2018-10-15 15:36:13,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-10-15 15:36:13,155 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:13,155 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:13,155 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:13,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:13,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1849805584, now seen corresponding path program 29 times [2018-10-15 15:36:13,156 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:13,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:15,773 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:36:15,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:15,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-15 15:36:15,774 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-15 15:36:15,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-15 15:36:15,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=581, Invalid=3841, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 15:36:15,774 INFO L87 Difference]: Start difference. First operand 329 states and 330 transitions. Second operand 67 states. [2018-10-15 15:36:20,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:20,168 INFO L93 Difference]: Finished difference Result 522 states and 523 transitions. [2018-10-15 15:36:20,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-10-15 15:36:20,168 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 328 [2018-10-15 15:36:20,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:20,170 INFO L225 Difference]: With dead ends: 522 [2018-10-15 15:36:20,170 INFO L226 Difference]: Without dead ends: 339 [2018-10-15 15:36:20,172 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7152 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=4119, Invalid=21641, Unknown=0, NotChecked=0, Total=25760 [2018-10-15 15:36:20,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-10-15 15:36:20,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 337. [2018-10-15 15:36:20,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-10-15 15:36:20,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 338 transitions. [2018-10-15 15:36:20,176 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 338 transitions. Word has length 328 [2018-10-15 15:36:20,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:20,176 INFO L481 AbstractCegarLoop]: Abstraction has 337 states and 338 transitions. [2018-10-15 15:36:20,176 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-15 15:36:20,176 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 338 transitions. [2018-10-15 15:36:20,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-10-15 15:36:20,178 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:20,178 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:20,179 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:20,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:20,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1458140648, now seen corresponding path program 30 times [2018-10-15 15:36:20,180 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:20,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:21,416 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:36:21,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:21,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-15 15:36:21,417 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-15 15:36:21,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-15 15:36:21,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=500, Invalid=2362, Unknown=0, NotChecked=0, Total=2862 [2018-10-15 15:36:21,418 INFO L87 Difference]: Start difference. First operand 337 states and 338 transitions. Second operand 54 states. [2018-10-15 15:36:24,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:24,143 INFO L93 Difference]: Finished difference Result 363 states and 364 transitions. [2018-10-15 15:36:24,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-10-15 15:36:24,144 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 336 [2018-10-15 15:36:24,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:24,146 INFO L225 Difference]: With dead ends: 363 [2018-10-15 15:36:24,147 INFO L226 Difference]: Without dead ends: 363 [2018-10-15 15:36:24,148 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7065 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4057, Invalid=17995, Unknown=0, NotChecked=0, Total=22052 [2018-10-15 15:36:24,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-10-15 15:36:24,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 349. [2018-10-15 15:36:24,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-10-15 15:36:24,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 350 transitions. [2018-10-15 15:36:24,153 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 350 transitions. Word has length 336 [2018-10-15 15:36:24,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:24,154 INFO L481 AbstractCegarLoop]: Abstraction has 349 states and 350 transitions. [2018-10-15 15:36:24,154 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-15 15:36:24,154 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 350 transitions. [2018-10-15 15:36:24,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-10-15 15:36:24,156 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:24,156 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:24,156 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:24,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:24,157 INFO L82 PathProgramCache]: Analyzing trace with hash -2041724140, now seen corresponding path program 31 times [2018-10-15 15:36:24,157 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:24,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:26,405 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:36:26,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:26,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-15 15:36:26,406 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-15 15:36:26,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-15 15:36:26,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=651, Invalid=4319, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 15:36:26,407 INFO L87 Difference]: Start difference. First operand 349 states and 350 transitions. Second operand 71 states. [2018-10-15 15:36:31,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:31,059 INFO L93 Difference]: Finished difference Result 554 states and 555 transitions. [2018-10-15 15:36:31,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-10-15 15:36:31,060 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 348 [2018-10-15 15:36:31,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:31,061 INFO L225 Difference]: With dead ends: 554 [2018-10-15 15:36:31,061 INFO L226 Difference]: Without dead ends: 359 [2018-10-15 15:36:31,063 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8133 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=4615, Invalid=24455, Unknown=0, NotChecked=0, Total=29070 [2018-10-15 15:36:31,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-10-15 15:36:31,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 357. [2018-10-15 15:36:31,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2018-10-15 15:36:31,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 358 transitions. [2018-10-15 15:36:31,068 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 358 transitions. Word has length 348 [2018-10-15 15:36:31,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:31,068 INFO L481 AbstractCegarLoop]: Abstraction has 357 states and 358 transitions. [2018-10-15 15:36:31,068 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-15 15:36:31,068 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 358 transitions. [2018-10-15 15:36:31,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2018-10-15 15:36:31,070 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:31,070 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:31,071 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:31,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:31,071 INFO L82 PathProgramCache]: Analyzing trace with hash 2038880268, now seen corresponding path program 32 times [2018-10-15 15:36:31,072 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:31,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:32,875 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:36:32,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:32,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 15:36:32,876 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 15:36:32,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 15:36:32,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=556, Invalid=2636, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 15:36:32,877 INFO L87 Difference]: Start difference. First operand 357 states and 358 transitions. Second operand 57 states. [2018-10-15 15:36:36,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:36,138 INFO L93 Difference]: Finished difference Result 383 states and 384 transitions. [2018-10-15 15:36:36,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-10-15 15:36:36,138 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 356 [2018-10-15 15:36:36,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:36,141 INFO L225 Difference]: With dead ends: 383 [2018-10-15 15:36:36,141 INFO L226 Difference]: Without dead ends: 383 [2018-10-15 15:36:36,143 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7983 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4548, Invalid=20258, Unknown=0, NotChecked=0, Total=24806 [2018-10-15 15:36:36,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-10-15 15:36:36,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 369. [2018-10-15 15:36:36,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-10-15 15:36:36,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 370 transitions. [2018-10-15 15:36:36,147 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 370 transitions. Word has length 356 [2018-10-15 15:36:36,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:36,148 INFO L481 AbstractCegarLoop]: Abstraction has 369 states and 370 transitions. [2018-10-15 15:36:36,148 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 15:36:36,148 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 370 transitions. [2018-10-15 15:36:36,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2018-10-15 15:36:36,150 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:36,150 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:36,150 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:36,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:36,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1481969464, now seen corresponding path program 33 times [2018-10-15 15:36:36,151 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:36,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:38,023 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:36:38,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:38,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-15 15:36:38,024 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-15 15:36:38,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-15 15:36:38,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=725, Invalid=4825, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 15:36:38,024 INFO L87 Difference]: Start difference. First operand 369 states and 370 transitions. Second operand 75 states. [2018-10-15 15:36:43,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:43,593 INFO L93 Difference]: Finished difference Result 586 states and 587 transitions. [2018-10-15 15:36:43,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-10-15 15:36:43,593 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 368 [2018-10-15 15:36:43,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:43,594 INFO L225 Difference]: With dead ends: 586 [2018-10-15 15:36:43,594 INFO L226 Difference]: Without dead ends: 379 [2018-10-15 15:36:43,596 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9177 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=5139, Invalid=27441, Unknown=0, NotChecked=0, Total=32580 [2018-10-15 15:36:43,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-10-15 15:36:43,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 377. [2018-10-15 15:36:43,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2018-10-15 15:36:43,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 378 transitions. [2018-10-15 15:36:43,599 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 378 transitions. Word has length 368 [2018-10-15 15:36:43,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:43,600 INFO L481 AbstractCegarLoop]: Abstraction has 377 states and 378 transitions. [2018-10-15 15:36:43,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-15 15:36:43,600 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 378 transitions. [2018-10-15 15:36:43,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2018-10-15 15:36:43,601 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:43,601 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:43,602 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:43,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:43,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1670776784, now seen corresponding path program 34 times [2018-10-15 15:36:43,603 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:43,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:45,117 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:36:45,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:45,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-10-15 15:36:45,118 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-15 15:36:45,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-15 15:36:45,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=615, Invalid=2925, Unknown=0, NotChecked=0, Total=3540 [2018-10-15 15:36:45,119 INFO L87 Difference]: Start difference. First operand 377 states and 378 transitions. Second operand 60 states. [2018-10-15 15:36:48,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:48,816 INFO L93 Difference]: Finished difference Result 403 states and 404 transitions. [2018-10-15 15:36:48,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-10-15 15:36:48,816 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 376 [2018-10-15 15:36:48,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:48,819 INFO L225 Difference]: With dead ends: 403 [2018-10-15 15:36:48,819 INFO L226 Difference]: Without dead ends: 403 [2018-10-15 15:36:48,821 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8957 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5067, Invalid=22655, Unknown=0, NotChecked=0, Total=27722 [2018-10-15 15:36:48,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-10-15 15:36:48,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 389. [2018-10-15 15:36:48,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2018-10-15 15:36:48,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 390 transitions. [2018-10-15 15:36:48,826 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 390 transitions. Word has length 376 [2018-10-15 15:36:48,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:48,826 INFO L481 AbstractCegarLoop]: Abstraction has 389 states and 390 transitions. [2018-10-15 15:36:48,826 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-15 15:36:48,826 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 390 transitions. [2018-10-15 15:36:48,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2018-10-15 15:36:48,828 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:48,829 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:48,829 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:48,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:48,829 INFO L82 PathProgramCache]: Analyzing trace with hash 703928668, now seen corresponding path program 35 times [2018-10-15 15:36:48,830 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:48,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:51,663 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:36:51,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:51,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-15 15:36:51,665 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-15 15:36:51,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-15 15:36:51,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=803, Invalid=5359, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 15:36:51,666 INFO L87 Difference]: Start difference. First operand 389 states and 390 transitions. Second operand 79 states. [2018-10-15 15:36:57,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:57,848 INFO L93 Difference]: Finished difference Result 618 states and 619 transitions. [2018-10-15 15:36:57,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-10-15 15:36:57,848 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 388 [2018-10-15 15:36:57,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:57,850 INFO L225 Difference]: With dead ends: 618 [2018-10-15 15:36:57,850 INFO L226 Difference]: Without dead ends: 399 [2018-10-15 15:36:57,852 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10284 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=5691, Invalid=30599, Unknown=0, NotChecked=0, Total=36290 [2018-10-15 15:36:57,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-10-15 15:36:57,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 397. [2018-10-15 15:36:57,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-10-15 15:36:57,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 398 transitions. [2018-10-15 15:36:57,857 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 398 transitions. Word has length 388 [2018-10-15 15:36:57,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:57,858 INFO L481 AbstractCegarLoop]: Abstraction has 397 states and 398 transitions. [2018-10-15 15:36:57,858 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-15 15:36:57,858 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 398 transitions. [2018-10-15 15:36:57,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2018-10-15 15:36:57,860 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:57,860 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:57,860 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:57,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:57,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1857279572, now seen corresponding path program 36 times [2018-10-15 15:36:57,861 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:57,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:59,117 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:36:59,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:59,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-15 15:36:59,118 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-15 15:36:59,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-15 15:36:59,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=677, Invalid=3229, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 15:36:59,119 INFO L87 Difference]: Start difference. First operand 397 states and 398 transitions. Second operand 63 states. [2018-10-15 15:37:03,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:37:03,122 INFO L93 Difference]: Finished difference Result 423 states and 424 transitions. [2018-10-15 15:37:03,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-10-15 15:37:03,123 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 396 [2018-10-15 15:37:03,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:37:03,125 INFO L225 Difference]: With dead ends: 423 [2018-10-15 15:37:03,125 INFO L226 Difference]: Without dead ends: 423 [2018-10-15 15:37:03,127 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9987 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5614, Invalid=25186, Unknown=0, NotChecked=0, Total=30800 [2018-10-15 15:37:03,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-10-15 15:37:03,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 409. [2018-10-15 15:37:03,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-10-15 15:37:03,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 410 transitions. [2018-10-15 15:37:03,132 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 410 transitions. Word has length 396 [2018-10-15 15:37:03,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:37:03,132 INFO L481 AbstractCegarLoop]: Abstraction has 409 states and 410 transitions. [2018-10-15 15:37:03,132 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-15 15:37:03,132 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 410 transitions. [2018-10-15 15:37:03,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2018-10-15 15:37:03,134 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:37:03,135 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:37:03,135 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:37:03,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:37:03,135 INFO L82 PathProgramCache]: Analyzing trace with hash 13558144, now seen corresponding path program 37 times [2018-10-15 15:37:03,136 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:37:03,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:37:05,386 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:05,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:37:05,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-15 15:37:05,387 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-15 15:37:05,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-15 15:37:05,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=885, Invalid=5921, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 15:37:05,388 INFO L87 Difference]: Start difference. First operand 409 states and 410 transitions. Second operand 83 states. [2018-10-15 15:37:12,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:37:12,355 INFO L93 Difference]: Finished difference Result 650 states and 651 transitions. [2018-10-15 15:37:12,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-10-15 15:37:12,355 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 408 [2018-10-15 15:37:12,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:37:12,357 INFO L225 Difference]: With dead ends: 650 [2018-10-15 15:37:12,357 INFO L226 Difference]: Without dead ends: 419 [2018-10-15 15:37:12,359 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11454 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=6271, Invalid=33929, Unknown=0, NotChecked=0, Total=40200 [2018-10-15 15:37:12,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-10-15 15:37:12,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 417. [2018-10-15 15:37:12,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-10-15 15:37:12,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 418 transitions. [2018-10-15 15:37:12,363 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 418 transitions. Word has length 408 [2018-10-15 15:37:12,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:37:12,363 INFO L481 AbstractCegarLoop]: Abstraction has 417 states and 418 transitions. [2018-10-15 15:37:12,363 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-15 15:37:12,364 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 418 transitions. [2018-10-15 15:37:12,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2018-10-15 15:37:12,366 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:37:12,366 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:37:12,366 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:37:12,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:37:12,367 INFO L82 PathProgramCache]: Analyzing trace with hash 50688632, now seen corresponding path program 38 times [2018-10-15 15:37:12,367 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:37:12,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:37:13,858 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:13,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:37:13,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-10-15 15:37:13,858 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-15 15:37:13,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-15 15:37:13,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=742, Invalid=3548, Unknown=0, NotChecked=0, Total=4290 [2018-10-15 15:37:13,859 INFO L87 Difference]: Start difference. First operand 417 states and 418 transitions. Second operand 66 states. [2018-10-15 15:37:18,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:37:18,166 INFO L93 Difference]: Finished difference Result 443 states and 444 transitions. [2018-10-15 15:37:18,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-10-15 15:37:18,166 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 416 [2018-10-15 15:37:18,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:37:18,169 INFO L225 Difference]: With dead ends: 443 [2018-10-15 15:37:18,169 INFO L226 Difference]: Without dead ends: 443 [2018-10-15 15:37:18,171 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11073 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6189, Invalid=27851, Unknown=0, NotChecked=0, Total=34040 [2018-10-15 15:37:18,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-10-15 15:37:18,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 429. [2018-10-15 15:37:18,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2018-10-15 15:37:18,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 430 transitions. [2018-10-15 15:37:18,176 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 430 transitions. Word has length 416 [2018-10-15 15:37:18,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:37:18,176 INFO L481 AbstractCegarLoop]: Abstraction has 429 states and 430 transitions. [2018-10-15 15:37:18,176 INFO L482 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-15 15:37:18,176 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 430 transitions. [2018-10-15 15:37:18,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2018-10-15 15:37:18,179 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:37:18,179 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:37:18,179 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:37:18,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:37:18,180 INFO L82 PathProgramCache]: Analyzing trace with hash 100886436, now seen corresponding path program 39 times [2018-10-15 15:37:18,180 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:37:18,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:37:20,800 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:20,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:37:20,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-15 15:37:20,801 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-15 15:37:20,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-15 15:37:20,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=971, Invalid=6511, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 15:37:20,802 INFO L87 Difference]: Start difference. First operand 429 states and 430 transitions. Second operand 87 states. [2018-10-15 15:37:28,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:37:28,323 INFO L93 Difference]: Finished difference Result 682 states and 683 transitions. [2018-10-15 15:37:28,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-10-15 15:37:28,323 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 428 [2018-10-15 15:37:28,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:37:28,324 INFO L225 Difference]: With dead ends: 682 [2018-10-15 15:37:28,325 INFO L226 Difference]: Without dead ends: 439 [2018-10-15 15:37:28,326 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12687 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=6879, Invalid=37431, Unknown=0, NotChecked=0, Total=44310 [2018-10-15 15:37:28,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2018-10-15 15:37:28,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 437. [2018-10-15 15:37:28,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2018-10-15 15:37:28,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 438 transitions. [2018-10-15 15:37:28,331 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 438 transitions. Word has length 428 [2018-10-15 15:37:28,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:37:28,331 INFO L481 AbstractCegarLoop]: Abstraction has 437 states and 438 transitions. [2018-10-15 15:37:28,331 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-15 15:37:28,331 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 438 transitions. [2018-10-15 15:37:28,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2018-10-15 15:37:28,333 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:37:28,334 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:37:28,334 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:37:28,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:37:28,334 INFO L82 PathProgramCache]: Analyzing trace with hash 260033692, now seen corresponding path program 40 times [2018-10-15 15:37:28,335 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:37:28,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:37:29,825 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:37:29,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:37:29,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-15 15:37:29,826 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-15 15:37:29,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-15 15:37:29,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=810, Invalid=3882, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 15:37:29,827 INFO L87 Difference]: Start difference. First operand 437 states and 438 transitions. Second operand 69 states. [2018-10-15 15:37:34,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:37:34,084 INFO L93 Difference]: Finished difference Result 463 states and 464 transitions. [2018-10-15 15:37:34,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-10-15 15:37:34,084 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 436 [2018-10-15 15:37:34,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:37:34,087 INFO L225 Difference]: With dead ends: 463 [2018-10-15 15:37:34,087 INFO L226 Difference]: Without dead ends: 463 [2018-10-15 15:37:34,090 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12215 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6792, Invalid=30650, Unknown=0, NotChecked=0, Total=37442 [2018-10-15 15:37:34,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-10-15 15:37:34,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 449. [2018-10-15 15:37:34,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2018-10-15 15:37:34,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 450 transitions. [2018-10-15 15:37:34,094 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 450 transitions. Word has length 436 [2018-10-15 15:37:34,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:37:34,094 INFO L481 AbstractCegarLoop]: Abstraction has 449 states and 450 transitions. [2018-10-15 15:37:34,094 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-15 15:37:34,094 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 450 transitions. [2018-10-15 15:37:34,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2018-10-15 15:37:34,096 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:37:34,096 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:37:34,096 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:37:34,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:37:34,097 INFO L82 PathProgramCache]: Analyzing trace with hash -969692216, now seen corresponding path program 41 times [2018-10-15 15:37:34,097 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:37:34,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:37:36,832 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:37:36,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:37:36,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-15 15:37:36,833 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-15 15:37:36,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-15 15:37:36,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1061, Invalid=7129, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 15:37:36,833 INFO L87 Difference]: Start difference. First operand 449 states and 450 transitions. Second operand 91 states. [2018-10-15 15:37:45,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:37:45,086 INFO L93 Difference]: Finished difference Result 714 states and 715 transitions. [2018-10-15 15:37:45,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-10-15 15:37:45,087 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 448 [2018-10-15 15:37:45,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:37:45,088 INFO L225 Difference]: With dead ends: 714 [2018-10-15 15:37:45,088 INFO L226 Difference]: Without dead ends: 459 [2018-10-15 15:37:45,091 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13983 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=7515, Invalid=41105, Unknown=0, NotChecked=0, Total=48620 [2018-10-15 15:37:45,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-10-15 15:37:45,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 457. [2018-10-15 15:37:45,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2018-10-15 15:37:45,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 458 transitions. [2018-10-15 15:37:45,095 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 458 transitions. Word has length 448 [2018-10-15 15:37:45,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:37:45,095 INFO L481 AbstractCegarLoop]: Abstraction has 457 states and 458 transitions. [2018-10-15 15:37:45,095 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-15 15:37:45,096 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 458 transitions. [2018-10-15 15:37:45,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2018-10-15 15:37:45,098 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:37:45,098 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:37:45,098 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:37:45,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:37:45,099 INFO L82 PathProgramCache]: Analyzing trace with hash 767812800, now seen corresponding path program 42 times [2018-10-15 15:37:45,099 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:37:45,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:37:46,726 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:37:46,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:37:46,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-10-15 15:37:46,727 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-15 15:37:46,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-15 15:37:46,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=881, Invalid=4231, Unknown=0, NotChecked=0, Total=5112 [2018-10-15 15:37:46,728 INFO L87 Difference]: Start difference. First operand 457 states and 458 transitions. Second operand 72 states. [2018-10-15 15:37:51,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:37:51,632 INFO L93 Difference]: Finished difference Result 483 states and 484 transitions. [2018-10-15 15:37:51,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2018-10-15 15:37:51,634 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 456 [2018-10-15 15:37:51,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:37:51,637 INFO L225 Difference]: With dead ends: 483 [2018-10-15 15:37:51,637 INFO L226 Difference]: Without dead ends: 483 [2018-10-15 15:37:51,639 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13413 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7423, Invalid=33583, Unknown=0, NotChecked=0, Total=41006 [2018-10-15 15:37:51,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2018-10-15 15:37:51,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 469. [2018-10-15 15:37:51,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2018-10-15 15:37:51,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 470 transitions. [2018-10-15 15:37:51,644 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 470 transitions. Word has length 456 [2018-10-15 15:37:51,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:37:51,644 INFO L481 AbstractCegarLoop]: Abstraction has 469 states and 470 transitions. [2018-10-15 15:37:51,645 INFO L482 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-15 15:37:51,645 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 470 transitions. [2018-10-15 15:37:51,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2018-10-15 15:37:51,647 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:37:51,647 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:37:51,648 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:37:51,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:37:51,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1904258540, now seen corresponding path program 43 times [2018-10-15 15:37:51,649 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:37:51,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:37:54,864 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:37:54,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:37:54,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-10-15 15:37:54,865 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-15 15:37:54,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-15 15:37:54,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1155, Invalid=7775, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 15:37:54,866 INFO L87 Difference]: Start difference. First operand 469 states and 470 transitions. Second operand 95 states. [2018-10-15 15:38:03,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:38:03,784 INFO L93 Difference]: Finished difference Result 746 states and 747 transitions. [2018-10-15 15:38:03,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-10-15 15:38:03,784 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 468 [2018-10-15 15:38:03,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:38:03,785 INFO L225 Difference]: With dead ends: 746 [2018-10-15 15:38:03,786 INFO L226 Difference]: Without dead ends: 479 [2018-10-15 15:38:03,788 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15342 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=8179, Invalid=44951, Unknown=0, NotChecked=0, Total=53130 [2018-10-15 15:38:03,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2018-10-15 15:38:03,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 477. [2018-10-15 15:38:03,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2018-10-15 15:38:03,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 478 transitions. [2018-10-15 15:38:03,792 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 478 transitions. Word has length 468 [2018-10-15 15:38:03,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:38:03,792 INFO L481 AbstractCegarLoop]: Abstraction has 477 states and 478 transitions. [2018-10-15 15:38:03,792 INFO L482 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-15 15:38:03,792 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 478 transitions. [2018-10-15 15:38:03,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2018-10-15 15:38:03,794 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:38:03,795 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:38:03,795 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:38:03,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:38:03,795 INFO L82 PathProgramCache]: Analyzing trace with hash 452115172, now seen corresponding path program 44 times [2018-10-15 15:38:03,796 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:38:03,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:38:05,514 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:05,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:38:05,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-15 15:38:05,515 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-15 15:38:05,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-15 15:38:05,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=955, Invalid=4595, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 15:38:05,516 INFO L87 Difference]: Start difference. First operand 477 states and 478 transitions. Second operand 75 states. [2018-10-15 15:38:10,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:38:10,523 INFO L93 Difference]: Finished difference Result 503 states and 504 transitions. [2018-10-15 15:38:10,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2018-10-15 15:38:10,523 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 476 [2018-10-15 15:38:10,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:38:10,526 INFO L225 Difference]: With dead ends: 503 [2018-10-15 15:38:10,526 INFO L226 Difference]: Without dead ends: 503 [2018-10-15 15:38:10,529 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14667 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=8082, Invalid=36650, Unknown=0, NotChecked=0, Total=44732 [2018-10-15 15:38:10,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2018-10-15 15:38:10,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 489. [2018-10-15 15:38:10,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2018-10-15 15:38:10,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 490 transitions. [2018-10-15 15:38:10,533 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 490 transitions. Word has length 476 [2018-10-15 15:38:10,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:38:10,533 INFO L481 AbstractCegarLoop]: Abstraction has 489 states and 490 transitions. [2018-10-15 15:38:10,533 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-15 15:38:10,533 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 490 transitions. [2018-10-15 15:38:10,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2018-10-15 15:38:10,536 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:38:10,536 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:38:10,536 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:38:10,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:38:10,536 INFO L82 PathProgramCache]: Analyzing trace with hash 462122512, now seen corresponding path program 45 times [2018-10-15 15:38:10,537 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:38:10,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:38:13,843 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:13,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:38:13,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-10-15 15:38:13,844 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-15 15:38:13,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-15 15:38:13,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1253, Invalid=8449, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 15:38:13,845 INFO L87 Difference]: Start difference. First operand 489 states and 490 transitions. Second operand 99 states. [2018-10-15 15:38:23,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:38:23,354 INFO L93 Difference]: Finished difference Result 778 states and 779 transitions. [2018-10-15 15:38:23,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2018-10-15 15:38:23,354 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 488 [2018-10-15 15:38:23,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:38:23,356 INFO L225 Difference]: With dead ends: 778 [2018-10-15 15:38:23,356 INFO L226 Difference]: Without dead ends: 499 [2018-10-15 15:38:23,358 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16764 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=8871, Invalid=48969, Unknown=0, NotChecked=0, Total=57840 [2018-10-15 15:38:23,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2018-10-15 15:38:23,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 497. [2018-10-15 15:38:23,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2018-10-15 15:38:23,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 498 transitions. [2018-10-15 15:38:23,362 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 498 transitions. Word has length 488 [2018-10-15 15:38:23,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:38:23,362 INFO L481 AbstractCegarLoop]: Abstraction has 497 states and 498 transitions. [2018-10-15 15:38:23,363 INFO L482 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-15 15:38:23,363 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 498 transitions. [2018-10-15 15:38:23,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2018-10-15 15:38:23,364 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:38:23,365 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:38:23,365 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:38:23,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:38:23,365 INFO L82 PathProgramCache]: Analyzing trace with hash -139636984, now seen corresponding path program 46 times [2018-10-15 15:38:23,366 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:38:23,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:38:25,254 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:25,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:38:25,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-10-15 15:38:25,255 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-15 15:38:25,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-15 15:38:25,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1032, Invalid=4974, Unknown=0, NotChecked=0, Total=6006 [2018-10-15 15:38:25,256 INFO L87 Difference]: Start difference. First operand 497 states and 498 transitions. Second operand 78 states. [2018-10-15 15:38:31,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:38:31,107 INFO L93 Difference]: Finished difference Result 523 states and 524 transitions. [2018-10-15 15:38:31,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2018-10-15 15:38:31,107 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 496 [2018-10-15 15:38:31,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:38:31,110 INFO L225 Difference]: With dead ends: 523 [2018-10-15 15:38:31,110 INFO L226 Difference]: Without dead ends: 523 [2018-10-15 15:38:31,112 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15977 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=8769, Invalid=39851, Unknown=0, NotChecked=0, Total=48620 [2018-10-15 15:38:31,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2018-10-15 15:38:31,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 509. [2018-10-15 15:38:31,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2018-10-15 15:38:31,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 510 transitions. [2018-10-15 15:38:31,117 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 510 transitions. Word has length 496 [2018-10-15 15:38:31,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:38:31,117 INFO L481 AbstractCegarLoop]: Abstraction has 509 states and 510 transitions. [2018-10-15 15:38:31,117 INFO L482 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-15 15:38:31,117 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 510 transitions. [2018-10-15 15:38:31,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2018-10-15 15:38:31,119 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:38:31,119 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:38:31,119 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:38:31,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:38:31,120 INFO L82 PathProgramCache]: Analyzing trace with hash -76223436, now seen corresponding path program 47 times [2018-10-15 15:38:31,120 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:38:31,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:38:34,650 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:34,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:38:34,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-10-15 15:38:34,651 INFO L460 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-10-15 15:38:34,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-10-15 15:38:34,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1355, Invalid=9151, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 15:38:34,652 INFO L87 Difference]: Start difference. First operand 509 states and 510 transitions. Second operand 103 states. [2018-10-15 15:38:44,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:38:44,383 INFO L93 Difference]: Finished difference Result 810 states and 811 transitions. [2018-10-15 15:38:44,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2018-10-15 15:38:44,383 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 508 [2018-10-15 15:38:44,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:38:44,385 INFO L225 Difference]: With dead ends: 810 [2018-10-15 15:38:44,385 INFO L226 Difference]: Without dead ends: 519 [2018-10-15 15:38:44,387 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18249 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=9591, Invalid=53159, Unknown=0, NotChecked=0, Total=62750 [2018-10-15 15:38:44,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2018-10-15 15:38:44,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 517. [2018-10-15 15:38:44,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2018-10-15 15:38:44,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 518 transitions. [2018-10-15 15:38:44,391 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 518 transitions. Word has length 508 [2018-10-15 15:38:44,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:38:44,392 INFO L481 AbstractCegarLoop]: Abstraction has 517 states and 518 transitions. [2018-10-15 15:38:44,392 INFO L482 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-10-15 15:38:44,392 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 518 transitions. [2018-10-15 15:38:44,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2018-10-15 15:38:44,394 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:38:44,394 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:38:44,395 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:38:44,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:38:44,395 INFO L82 PathProgramCache]: Analyzing trace with hash -2011913940, now seen corresponding path program 48 times [2018-10-15 15:38:44,395 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:38:44,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:38:46,562 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:38:46,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:38:46,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-15 15:38:46,563 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-15 15:38:46,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-15 15:38:46,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1112, Invalid=5368, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 15:38:46,564 INFO L87 Difference]: Start difference. First operand 517 states and 518 transitions. Second operand 81 states. [2018-10-15 15:38:52,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:38:52,737 INFO L93 Difference]: Finished difference Result 543 states and 544 transitions. [2018-10-15 15:38:52,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2018-10-15 15:38:52,737 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 516 [2018-10-15 15:38:52,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:38:52,740 INFO L225 Difference]: With dead ends: 543 [2018-10-15 15:38:52,740 INFO L226 Difference]: Without dead ends: 543 [2018-10-15 15:38:52,743 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:38:52,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2018-10-15 15:38:52,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 529. [2018-10-15 15:38:52,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2018-10-15 15:38:52,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 530 transitions. [2018-10-15 15:38:52,749 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 530 transitions. Word has length 516 [2018-10-15 15:38:52,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:38:52,750 INFO L481 AbstractCegarLoop]: Abstraction has 529 states and 530 transitions. [2018-10-15 15:38:52,750 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-15 15:38:52,750 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 530 transitions. [2018-10-15 15:38:52,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2018-10-15 15:38:52,752 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:38:52,753 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:38:52,753 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:38:52,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:38:52,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1411504040, now seen corresponding path program 49 times [2018-10-15 15:38:52,754 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:38:52,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:38:56,563 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:38:56,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:38:56,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-10-15 15:38:56,564 INFO L460 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-10-15 15:38:56,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-10-15 15:38:56,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1461, Invalid=9881, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 15:38:56,565 INFO L87 Difference]: Start difference. First operand 529 states and 530 transitions. Second operand 107 states. [2018-10-15 15:39:07,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:39:07,820 INFO L93 Difference]: Finished difference Result 842 states and 843 transitions. [2018-10-15 15:39:07,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2018-10-15 15:39:07,820 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 528 [2018-10-15 15:39:07,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:39:07,822 INFO L225 Difference]: With dead ends: 842 [2018-10-15 15:39:07,822 INFO L226 Difference]: Without dead ends: 539 [2018-10-15 15:39:07,825 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 259 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19797 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=10339, Invalid=57521, Unknown=0, NotChecked=0, Total=67860 [2018-10-15 15:39:07,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2018-10-15 15:39:07,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 537. [2018-10-15 15:39:07,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2018-10-15 15:39:07,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 538 transitions. [2018-10-15 15:39:07,829 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 538 transitions. Word has length 528 [2018-10-15 15:39:07,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:39:07,830 INFO L481 AbstractCegarLoop]: Abstraction has 537 states and 538 transitions. [2018-10-15 15:39:07,830 INFO L482 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-10-15 15:39:07,830 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 538 transitions. [2018-10-15 15:39:07,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2018-10-15 15:39:07,833 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:39:07,833 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:39:07,833 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:39:07,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:39:07,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1942597968, now seen corresponding path program 50 times [2018-10-15 15:39:07,834 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:39:07,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:39:10,185 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:10,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:39:10,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-10-15 15:39:10,186 INFO L460 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-10-15 15:39:10,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-10-15 15:39:10,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1195, Invalid=5777, Unknown=0, NotChecked=0, Total=6972 [2018-10-15 15:39:10,187 INFO L87 Difference]: Start difference. First operand 537 states and 538 transitions. Second operand 84 states. [2018-10-15 15:39:16,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:39:16,796 INFO L93 Difference]: Finished difference Result 563 states and 564 transitions. [2018-10-15 15:39:16,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2018-10-15 15:39:16,796 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 536 [2018-10-15 15:39:16,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:39:16,800 INFO L225 Difference]: With dead ends: 563 [2018-10-15 15:39:16,800 INFO L226 Difference]: Without dead ends: 563 [2018-10-15 15:39:16,803 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18765 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=10227, Invalid=46655, Unknown=0, NotChecked=0, Total=56882 [2018-10-15 15:39:16,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2018-10-15 15:39:16,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 549. [2018-10-15 15:39:16,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2018-10-15 15:39:16,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 550 transitions. [2018-10-15 15:39:16,808 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 550 transitions. Word has length 536 [2018-10-15 15:39:16,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:39:16,808 INFO L481 AbstractCegarLoop]: Abstraction has 549 states and 550 transitions. [2018-10-15 15:39:16,808 INFO L482 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-10-15 15:39:16,808 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 550 transitions. [2018-10-15 15:39:16,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 549 [2018-10-15 15:39:16,810 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:39:16,810 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:39:16,811 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:39:16,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:39:16,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1793598076, now seen corresponding path program 51 times [2018-10-15 15:39:16,811 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:39:16,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:39:20,868 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:20,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:39:20,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-10-15 15:39:20,869 INFO L460 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-10-15 15:39:20,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-10-15 15:39:20,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1571, Invalid=10639, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 15:39:20,870 INFO L87 Difference]: Start difference. First operand 549 states and 550 transitions. Second operand 111 states. [2018-10-15 15:39:32,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:39:32,849 INFO L93 Difference]: Finished difference Result 874 states and 875 transitions. [2018-10-15 15:39:32,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2018-10-15 15:39:32,849 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 548 [2018-10-15 15:39:32,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:39:32,851 INFO L225 Difference]: With dead ends: 874 [2018-10-15 15:39:32,851 INFO L226 Difference]: Without dead ends: 559 [2018-10-15 15:39:32,853 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21408 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=11115, Invalid=62055, Unknown=0, NotChecked=0, Total=73170 [2018-10-15 15:39:32,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2018-10-15 15:39:32,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 557. [2018-10-15 15:39:32,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2018-10-15 15:39:32,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 558 transitions. [2018-10-15 15:39:32,857 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 558 transitions. Word has length 548 [2018-10-15 15:39:32,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:39:32,857 INFO L481 AbstractCegarLoop]: Abstraction has 557 states and 558 transitions. [2018-10-15 15:39:32,857 INFO L482 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-10-15 15:39:32,857 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 558 transitions. [2018-10-15 15:39:32,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 557 [2018-10-15 15:39:32,859 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:39:32,860 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:39:32,860 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:39:32,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:39:32,860 INFO L82 PathProgramCache]: Analyzing trace with hash -2048032908, now seen corresponding path program 52 times [2018-10-15 15:39:32,860 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:39:32,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:39:35,163 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:35,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:39:35,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-15 15:39:35,164 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-15 15:39:35,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-15 15:39:35,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1281, Invalid=6201, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 15:39:35,165 INFO L87 Difference]: Start difference. First operand 557 states and 558 transitions. Second operand 87 states. [2018-10-15 15:39:42,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:39:42,281 INFO L93 Difference]: Finished difference Result 583 states and 584 transitions. [2018-10-15 15:39:42,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2018-10-15 15:39:42,282 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 556 [2018-10-15 15:39:42,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:39:42,285 INFO L225 Difference]: With dead ends: 583 [2018-10-15 15:39:42,285 INFO L226 Difference]: Without dead ends: 583 [2018-10-15 15:39:42,286 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:42,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2018-10-15 15:39:42,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 569. [2018-10-15 15:39:42,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2018-10-15 15:39:42,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 570 transitions. [2018-10-15 15:39:42,291 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 570 transitions. Word has length 556 [2018-10-15 15:39:42,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:39:42,291 INFO L481 AbstractCegarLoop]: Abstraction has 569 states and 570 transitions. [2018-10-15 15:39:42,291 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-15 15:39:42,291 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 570 transitions. [2018-10-15 15:39:42,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2018-10-15 15:39:42,293 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:39:42,294 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:39:42,294 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:39:42,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:39:42,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1513347744, now seen corresponding path program 53 times [2018-10-15 15:39:42,295 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:39:42,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:39:46,808 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:46,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:39:46,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-10-15 15:39:46,809 INFO L460 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-10-15 15:39:46,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-10-15 15:39:46,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1685, Invalid=11425, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 15:39:46,810 INFO L87 Difference]: Start difference. First operand 569 states and 570 transitions. Second operand 115 states. [2018-10-15 15:39:59,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:39:59,791 INFO L93 Difference]: Finished difference Result 906 states and 907 transitions. [2018-10-15 15:39:59,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2018-10-15 15:39:59,791 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 568 [2018-10-15 15:39:59,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:39:59,793 INFO L225 Difference]: With dead ends: 906 [2018-10-15 15:39:59,793 INFO L226 Difference]: Without dead ends: 579 [2018-10-15 15:39:59,794 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 279 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23082 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=11919, Invalid=66761, Unknown=0, NotChecked=0, Total=78680 [2018-10-15 15:39:59,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2018-10-15 15:39:59,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 577. [2018-10-15 15:39:59,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2018-10-15 15:39:59,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 578 transitions. [2018-10-15 15:39:59,798 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 578 transitions. Word has length 568 [2018-10-15 15:39:59,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:39:59,798 INFO L481 AbstractCegarLoop]: Abstraction has 577 states and 578 transitions. [2018-10-15 15:39:59,798 INFO L482 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-10-15 15:39:59,798 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 578 transitions. [2018-10-15 15:39:59,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2018-10-15 15:39:59,800 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:39:59,801 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:39:59,801 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:39:59,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:39:59,801 INFO L82 PathProgramCache]: Analyzing trace with hash -316601448, now seen corresponding path program 54 times [2018-10-15 15:39:59,802 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:39:59,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:40:02,388 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:02,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:40:02,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-10-15 15:40:02,389 INFO L460 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-10-15 15:40:02,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-10-15 15:40:02,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1370, Invalid=6640, Unknown=0, NotChecked=0, Total=8010 [2018-10-15 15:40:02,390 INFO L87 Difference]: Start difference. First operand 577 states and 578 transitions. Second operand 90 states. [2018-10-15 15:40:09,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:40:09,996 INFO L93 Difference]: Finished difference Result 603 states and 604 transitions. [2018-10-15 15:40:09,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 199 states. [2018-10-15 15:40:09,996 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 576 [2018-10-15 15:40:09,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:40:09,999 INFO L225 Difference]: With dead ends: 603 [2018-10-15 15:40:09,999 INFO L226 Difference]: Without dead ends: 603 [2018-10-15 15:40:10,001 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21777 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=11797, Invalid=53995, Unknown=0, NotChecked=0, Total=65792 [2018-10-15 15:40:10,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2018-10-15 15:40:10,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 589. [2018-10-15 15:40:10,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2018-10-15 15:40:10,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 590 transitions. [2018-10-15 15:40:10,006 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 590 transitions. Word has length 576 [2018-10-15 15:40:10,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:40:10,006 INFO L481 AbstractCegarLoop]: Abstraction has 589 states and 590 transitions. [2018-10-15 15:40:10,006 INFO L482 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-10-15 15:40:10,006 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 590 transitions. [2018-10-15 15:40:10,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 589 [2018-10-15 15:40:10,009 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:40:10,009 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:40:10,009 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:40:10,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:40:10,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1092464444, now seen corresponding path program 55 times [2018-10-15 15:40:10,010 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:40:10,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:40:14,643 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:14,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:40:14,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-10-15 15:40:14,644 INFO L460 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-10-15 15:40:14,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-10-15 15:40:14,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1803, Invalid=12239, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 15:40:14,645 INFO L87 Difference]: Start difference. First operand 589 states and 590 transitions. Second operand 119 states. [2018-10-15 15:40:28,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:40:28,400 INFO L93 Difference]: Finished difference Result 938 states and 939 transitions. [2018-10-15 15:40:28,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2018-10-15 15:40:28,400 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 588 [2018-10-15 15:40:28,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:40:28,402 INFO L225 Difference]: With dead ends: 938 [2018-10-15 15:40:28,402 INFO L226 Difference]: Without dead ends: 599 [2018-10-15 15:40:28,404 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 289 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24819 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=12751, Invalid=71639, Unknown=0, NotChecked=0, Total=84390 [2018-10-15 15:40:28,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2018-10-15 15:40:28,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 597. [2018-10-15 15:40:28,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2018-10-15 15:40:28,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 598 transitions. [2018-10-15 15:40:28,409 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 598 transitions. Word has length 588 [2018-10-15 15:40:28,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:40:28,409 INFO L481 AbstractCegarLoop]: Abstraction has 597 states and 598 transitions. [2018-10-15 15:40:28,409 INFO L482 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-10-15 15:40:28,410 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 598 transitions. [2018-10-15 15:40:28,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 597 [2018-10-15 15:40:28,412 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:40:28,412 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:40:28,413 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:40:28,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:40:28,413 INFO L82 PathProgramCache]: Analyzing trace with hash 2072335804, now seen corresponding path program 56 times [2018-10-15 15:40:28,413 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:40:28,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:40:30,904 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:30,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:40:30,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-15 15:40:30,906 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-15 15:40:30,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-15 15:40:30,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1462, Invalid=7094, Unknown=0, NotChecked=0, Total=8556 [2018-10-15 15:40:30,906 INFO L87 Difference]: Start difference. First operand 597 states and 598 transitions. Second operand 93 states. [2018-10-15 15:40:38,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:40:38,646 INFO L93 Difference]: Finished difference Result 623 states and 624 transitions. [2018-10-15 15:40:38,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 206 states. [2018-10-15 15:40:38,646 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 596 [2018-10-15 15:40:38,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:40:38,649 INFO L225 Difference]: With dead ends: 623 [2018-10-15 15:40:38,649 INFO L226 Difference]: Without dead ends: 623 [2018-10-15 15:40:38,653 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23367 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=12624, Invalid=57866, Unknown=0, NotChecked=0, Total=70490 [2018-10-15 15:40:38,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2018-10-15 15:40:38,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 609. [2018-10-15 15:40:38,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 609 states. [2018-10-15 15:40:38,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 610 transitions. [2018-10-15 15:40:38,658 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 610 transitions. Word has length 596 [2018-10-15 15:40:38,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:40:38,658 INFO L481 AbstractCegarLoop]: Abstraction has 609 states and 610 transitions. [2018-10-15 15:40:38,658 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-15 15:40:38,658 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 610 transitions. [2018-10-15 15:40:38,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2018-10-15 15:40:38,661 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:40:38,661 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:40:38,661 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:40:38,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:40:38,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1100252392, now seen corresponding path program 57 times [2018-10-15 15:40:38,662 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:40:38,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:40:43,459 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:43,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:40:43,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-10-15 15:40:43,460 INFO L460 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-10-15 15:40:43,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-10-15 15:40:43,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1925, Invalid=13081, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 15:40:43,461 INFO L87 Difference]: Start difference. First operand 609 states and 610 transitions. Second operand 123 states. [2018-10-15 15:40:53,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:40:53,795 INFO L93 Difference]: Finished difference Result 970 states and 971 transitions. [2018-10-15 15:40:53,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2018-10-15 15:40:53,796 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 608 [2018-10-15 15:40:53,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:40:53,798 INFO L225 Difference]: With dead ends: 970 [2018-10-15 15:40:53,798 INFO L226 Difference]: Without dead ends: 619 [2018-10-15 15:40:53,801 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 299 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26619 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=13611, Invalid=76689, Unknown=0, NotChecked=0, Total=90300 [2018-10-15 15:40:53,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2018-10-15 15:40:53,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 617. [2018-10-15 15:40:53,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2018-10-15 15:40:53,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 618 transitions. [2018-10-15 15:40:53,805 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 618 transitions. Word has length 608 [2018-10-15 15:40:53,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:40:53,805 INFO L481 AbstractCegarLoop]: Abstraction has 617 states and 618 transitions. [2018-10-15 15:40:53,806 INFO L482 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-10-15 15:40:53,806 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 618 transitions. [2018-10-15 15:40:53,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 617 [2018-10-15 15:40:53,808 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:40:53,809 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:40:53,809 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:40:53,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:40:53,809 INFO L82 PathProgramCache]: Analyzing trace with hash -423928352, now seen corresponding path program 58 times [2018-10-15 15:40:53,809 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:40:53,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:40:56,454 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:56,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:40:56,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-10-15 15:40:56,455 INFO L460 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-10-15 15:40:56,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-10-15 15:40:56,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1557, Invalid=7563, Unknown=0, NotChecked=0, Total=9120 [2018-10-15 15:40:56,456 INFO L87 Difference]: Start difference. First operand 617 states and 618 transitions. Second operand 96 states. [2018-10-15 15:41:04,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:41:04,691 INFO L93 Difference]: Finished difference Result 643 states and 644 transitions. [2018-10-15 15:41:04,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 213 states. [2018-10-15 15:41:04,691 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 616 [2018-10-15 15:41:04,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:41:04,694 INFO L225 Difference]: With dead ends: 643 [2018-10-15 15:41:04,694 INFO L226 Difference]: Without dead ends: 643 [2018-10-15 15:41:04,697 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25013 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=13479, Invalid=61871, Unknown=0, NotChecked=0, Total=75350 [2018-10-15 15:41:04,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2018-10-15 15:41:04,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 629. [2018-10-15 15:41:04,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2018-10-15 15:41:04,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 630 transitions. [2018-10-15 15:41:04,702 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 630 transitions. Word has length 616 [2018-10-15 15:41:04,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:41:04,703 INFO L481 AbstractCegarLoop]: Abstraction has 629 states and 630 transitions. [2018-10-15 15:41:04,703 INFO L482 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-10-15 15:41:04,703 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 630 transitions. [2018-10-15 15:41:04,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 629 [2018-10-15 15:41:04,705 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:41:04,706 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:41:04,706 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:41:04,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:41:04,706 INFO L82 PathProgramCache]: Analyzing trace with hash 778794764, now seen corresponding path program 59 times [2018-10-15 15:41:04,707 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:41:04,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:41:09,712 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:09,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:41:09,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-10-15 15:41:09,713 INFO L460 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-10-15 15:41:09,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-10-15 15:41:09,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2051, Invalid=13951, Unknown=0, NotChecked=0, Total=16002 [2018-10-15 15:41:09,714 INFO L87 Difference]: Start difference. First operand 629 states and 630 transitions. Second operand 127 states. [2018-10-15 15:41:24,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:41:24,773 INFO L93 Difference]: Finished difference Result 1002 states and 1003 transitions. [2018-10-15 15:41:24,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2018-10-15 15:41:24,773 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 628 [2018-10-15 15:41:24,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:41:24,775 INFO L225 Difference]: With dead ends: 1002 [2018-10-15 15:41:24,775 INFO L226 Difference]: Without dead ends: 639 [2018-10-15 15:41:24,778 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 309 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28482 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=14499, Invalid=81911, Unknown=0, NotChecked=0, Total=96410 [2018-10-15 15:41:24,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2018-10-15 15:41:24,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 637. [2018-10-15 15:41:24,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 637 states. [2018-10-15 15:41:24,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 638 transitions. [2018-10-15 15:41:24,782 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 638 transitions. Word has length 628 [2018-10-15 15:41:24,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:41:24,782 INFO L481 AbstractCegarLoop]: Abstraction has 637 states and 638 transitions. [2018-10-15 15:41:24,782 INFO L482 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-10-15 15:41:24,783 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 638 transitions. [2018-10-15 15:41:24,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 637 [2018-10-15 15:41:24,785 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:41:24,785 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:41:24,786 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:41:24,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:41:24,786 INFO L82 PathProgramCache]: Analyzing trace with hash 132391940, now seen corresponding path program 60 times [2018-10-15 15:41:24,786 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:41:24,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:41:27,645 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:27,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:41:27,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-10-15 15:41:27,646 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-15 15:41:27,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-15 15:41:27,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1655, Invalid=8047, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 15:41:27,646 INFO L87 Difference]: Start difference. First operand 637 states and 638 transitions. Second operand 99 states. [2018-10-15 15:41:36,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:41:36,145 INFO L93 Difference]: Finished difference Result 663 states and 664 transitions. [2018-10-15 15:41:36,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 220 states. [2018-10-15 15:41:36,145 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 636 [2018-10-15 15:41:36,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:41:36,148 INFO L225 Difference]: With dead ends: 663 [2018-10-15 15:41:36,148 INFO L226 Difference]: Without dead ends: 663 [2018-10-15 15:41:36,150 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 282 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26715 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=14362, Invalid=66010, Unknown=0, NotChecked=0, Total=80372 [2018-10-15 15:41:36,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2018-10-15 15:41:36,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 649. [2018-10-15 15:41:36,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 649 states. [2018-10-15 15:41:36,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 650 transitions. [2018-10-15 15:41:36,155 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 650 transitions. Word has length 636 [2018-10-15 15:41:36,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:41:36,156 INFO L481 AbstractCegarLoop]: Abstraction has 649 states and 650 transitions. [2018-10-15 15:41:36,156 INFO L482 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-15 15:41:36,156 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 650 transitions. [2018-10-15 15:41:36,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 649 [2018-10-15 15:41:36,158 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:41:36,159 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:41:36,159 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:41:36,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:41:36,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1257756880, now seen corresponding path program 61 times [2018-10-15 15:41:36,160 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:41:36,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:41:41,274 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:41,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:41:41,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-10-15 15:41:41,275 INFO L460 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-10-15 15:41:41,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-10-15 15:41:41,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2181, Invalid=14849, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 15:41:41,277 INFO L87 Difference]: Start difference. First operand 649 states and 650 transitions. Second operand 131 states. [2018-10-15 15:41:55,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:41:55,125 INFO L93 Difference]: Finished difference Result 1034 states and 1035 transitions. [2018-10-15 15:41:55,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 193 states. [2018-10-15 15:41:55,125 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 648 [2018-10-15 15:41:55,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:41:55,127 INFO L225 Difference]: With dead ends: 1034 [2018-10-15 15:41:55,127 INFO L226 Difference]: Without dead ends: 659 [2018-10-15 15:41:55,129 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 319 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30408 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=15415, Invalid=87305, Unknown=0, NotChecked=0, Total=102720 [2018-10-15 15:41:55,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2018-10-15 15:41:55,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 657. [2018-10-15 15:41:55,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2018-10-15 15:41:55,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 658 transitions. [2018-10-15 15:41:55,133 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 658 transitions. Word has length 648 [2018-10-15 15:41:55,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:41:55,133 INFO L481 AbstractCegarLoop]: Abstraction has 657 states and 658 transitions. [2018-10-15 15:41:55,133 INFO L482 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-10-15 15:41:55,133 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 658 transitions. [2018-10-15 15:41:55,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 657 [2018-10-15 15:41:55,136 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:41:55,136 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:41:55,136 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:41:55,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:41:55,137 INFO L82 PathProgramCache]: Analyzing trace with hash 463513640, now seen corresponding path program 62 times [2018-10-15 15:41:55,137 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:41:55,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:41:58,098 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:58,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:41:58,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-10-15 15:41:58,099 INFO L460 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-10-15 15:41:58,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-10-15 15:41:58,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1756, Invalid=8546, Unknown=0, NotChecked=0, Total=10302 [2018-10-15 15:41:58,100 INFO L87 Difference]: Start difference. First operand 657 states and 658 transitions. Second operand 102 states. [2018-10-15 15:42:06,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:42:06,420 INFO L93 Difference]: Finished difference Result 683 states and 684 transitions. [2018-10-15 15:42:06,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 227 states. [2018-10-15 15:42:06,421 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 656 [2018-10-15 15:42:06,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:42:06,423 INFO L225 Difference]: With dead ends: 683 [2018-10-15 15:42:06,423 INFO L226 Difference]: Without dead ends: 683 [2018-10-15 15:42:06,426 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 291 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28473 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=15273, Invalid=70283, Unknown=0, NotChecked=0, Total=85556 [2018-10-15 15:42:06,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2018-10-15 15:42:06,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 669. [2018-10-15 15:42:06,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 669 states. [2018-10-15 15:42:06,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 670 transitions. [2018-10-15 15:42:06,431 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 670 transitions. Word has length 656 [2018-10-15 15:42:06,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:42:06,432 INFO L481 AbstractCegarLoop]: Abstraction has 669 states and 670 transitions. [2018-10-15 15:42:06,432 INFO L482 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-10-15 15:42:06,432 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 670 transitions. [2018-10-15 15:42:06,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 669 [2018-10-15 15:42:06,435 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:42:06,436 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:42:06,436 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:42:06,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:42:06,436 INFO L82 PathProgramCache]: Analyzing trace with hash 680236372, now seen corresponding path program 63 times [2018-10-15 15:42:06,437 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:42:06,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:42:11,895 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:11,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:42:11,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-10-15 15:42:11,896 INFO L460 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-10-15 15:42:11,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-10-15 15:42:11,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2315, Invalid=15775, Unknown=0, NotChecked=0, Total=18090 [2018-10-15 15:42:11,897 INFO L87 Difference]: Start difference. First operand 669 states and 670 transitions. Second operand 135 states. [2018-10-15 15:42:28,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:42:28,608 INFO L93 Difference]: Finished difference Result 1066 states and 1067 transitions. [2018-10-15 15:42:28,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 199 states. [2018-10-15 15:42:28,609 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 668 [2018-10-15 15:42:28,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:42:28,611 INFO L225 Difference]: With dead ends: 1066 [2018-10-15 15:42:28,611 INFO L226 Difference]: Without dead ends: 679 [2018-10-15 15:42:28,614 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 329 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32397 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=16359, Invalid=92871, Unknown=0, NotChecked=0, Total=109230 [2018-10-15 15:42:28,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2018-10-15 15:42:28,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 677. [2018-10-15 15:42:28,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2018-10-15 15:42:28,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 678 transitions. [2018-10-15 15:42:28,619 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 678 transitions. Word has length 668 [2018-10-15 15:42:28,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:42:28,619 INFO L481 AbstractCegarLoop]: Abstraction has 677 states and 678 transitions. [2018-10-15 15:42:28,619 INFO L482 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-10-15 15:42:28,619 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 678 transitions. [2018-10-15 15:42:28,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 677 [2018-10-15 15:42:28,622 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:42:28,623 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:42:28,623 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:42:28,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:42:28,623 INFO L82 PathProgramCache]: Analyzing trace with hash 34728524, now seen corresponding path program 64 times [2018-10-15 15:42:28,624 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:42:28,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:42:31,760 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:31,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:42:31,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-10-15 15:42:31,761 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-10-15 15:42:31,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-10-15 15:42:31,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1860, Invalid=9060, Unknown=0, NotChecked=0, Total=10920 [2018-10-15 15:42:31,762 INFO L87 Difference]: Start difference. First operand 677 states and 678 transitions. Second operand 105 states. [2018-10-15 15:42:40,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:42:40,503 INFO L93 Difference]: Finished difference Result 703 states and 704 transitions. [2018-10-15 15:42:40,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 234 states. [2018-10-15 15:42:40,504 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 676 [2018-10-15 15:42:40,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:42:40,507 INFO L225 Difference]: With dead ends: 703 [2018-10-15 15:42:40,507 INFO L226 Difference]: Without dead ends: 703 [2018-10-15 15:42:40,510 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 300 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30287 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=16212, Invalid=74690, Unknown=0, NotChecked=0, Total=90902 [2018-10-15 15:42:40,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2018-10-15 15:42:40,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 689. [2018-10-15 15:42:40,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 689 states. [2018-10-15 15:42:40,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 690 transitions. [2018-10-15 15:42:40,515 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 690 transitions. Word has length 676 [2018-10-15 15:42:40,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:42:40,515 INFO L481 AbstractCegarLoop]: Abstraction has 689 states and 690 transitions. [2018-10-15 15:42:40,515 INFO L482 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-10-15 15:42:40,515 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 690 transitions. [2018-10-15 15:42:40,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2018-10-15 15:42:40,518 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:42:40,519 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:42:40,519 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:42:40,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:42:40,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1066844536, now seen corresponding path program 65 times [2018-10-15 15:42:40,520 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:42:40,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:42:46,341 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:46,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:42:46,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-10-15 15:42:46,342 INFO L460 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-10-15 15:42:46,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-10-15 15:42:46,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2453, Invalid=16729, Unknown=0, NotChecked=0, Total=19182 [2018-10-15 15:42:46,343 INFO L87 Difference]: Start difference. First operand 689 states and 690 transitions. Second operand 139 states. [2018-10-15 15:43:02,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:43:02,666 INFO L93 Difference]: Finished difference Result 1098 states and 1099 transitions. [2018-10-15 15:43:02,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 205 states. [2018-10-15 15:43:02,666 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 688 [2018-10-15 15:43:02,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:43:02,668 INFO L225 Difference]: With dead ends: 1098 [2018-10-15 15:43:02,668 INFO L226 Difference]: Without dead ends: 699 [2018-10-15 15:43:02,670 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 339 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34449 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=17331, Invalid=98609, Unknown=0, NotChecked=0, Total=115940 [2018-10-15 15:43:02,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2018-10-15 15:43:02,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 697. [2018-10-15 15:43:02,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2018-10-15 15:43:02,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 698 transitions. [2018-10-15 15:43:02,674 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 698 transitions. Word has length 688 [2018-10-15 15:43:02,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:43:02,675 INFO L481 AbstractCegarLoop]: Abstraction has 697 states and 698 transitions. [2018-10-15 15:43:02,675 INFO L482 AbstractCegarLoop]: Interpolant automaton has 139 states. [2018-10-15 15:43:02,675 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 698 transitions. [2018-10-15 15:43:02,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 697 [2018-10-15 15:43:02,678 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:43:02,678 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:43:02,678 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:43:02,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:43:02,679 INFO L82 PathProgramCache]: Analyzing trace with hash 2128145008, now seen corresponding path program 66 times [2018-10-15 15:43:02,679 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:43:02,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:43:05,965 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:43:05,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:43:05,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-10-15 15:43:05,966 INFO L460 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-10-15 15:43:05,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-10-15 15:43:05,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1967, Invalid=9589, Unknown=0, NotChecked=0, Total=11556 [2018-10-15 15:43:05,967 INFO L87 Difference]: Start difference. First operand 697 states and 698 transitions. Second operand 108 states. [2018-10-15 15:43:15,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:43:15,237 INFO L93 Difference]: Finished difference Result 723 states and 724 transitions. [2018-10-15 15:43:15,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 241 states. [2018-10-15 15:43:15,238 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 696 [2018-10-15 15:43:15,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:43:15,241 INFO L225 Difference]: With dead ends: 723 [2018-10-15 15:43:15,241 INFO L226 Difference]: Without dead ends: 723 [2018-10-15 15:43:15,244 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 309 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32157 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=17179, Invalid=79231, Unknown=0, NotChecked=0, Total=96410 [2018-10-15 15:43:15,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2018-10-15 15:43:15,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 709. [2018-10-15 15:43:15,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 709 states. [2018-10-15 15:43:15,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 710 transitions. [2018-10-15 15:43:15,249 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 710 transitions. Word has length 696 [2018-10-15 15:43:15,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:43:15,250 INFO L481 AbstractCegarLoop]: Abstraction has 709 states and 710 transitions. [2018-10-15 15:43:15,250 INFO L482 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-10-15 15:43:15,250 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 710 transitions. [2018-10-15 15:43:15,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 709 [2018-10-15 15:43:15,253 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:43:15,253 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:43:15,254 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:43:15,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:43:15,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1414179740, now seen corresponding path program 67 times [2018-10-15 15:43:15,254 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:43:15,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:43:21,414 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:21,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:43:21,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2018-10-15 15:43:21,415 INFO L460 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-10-15 15:43:21,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-10-15 15:43:21,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2595, Invalid=17711, Unknown=0, NotChecked=0, Total=20306 [2018-10-15 15:43:21,416 INFO L87 Difference]: Start difference. First operand 709 states and 710 transitions. Second operand 143 states.