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/count_by_nondet.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d769cf3 [2018-10-15 15:23:37,872 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 15:23:37,874 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 15:23:37,886 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 15:23:37,886 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 15:23:37,887 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 15:23:37,889 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 15:23:37,890 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 15:23:37,892 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 15:23:37,893 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 15:23:37,894 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 15:23:37,894 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 15:23:37,898 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 15:23:37,899 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 15:23:37,900 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 15:23:37,901 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 15:23:37,901 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 15:23:37,906 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 15:23:37,908 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 15:23:37,909 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 15:23:37,914 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 15:23:37,915 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 15:23:37,919 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 15:23:37,920 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 15:23:37,920 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 15:23:37,921 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 15:23:37,922 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 15:23:37,924 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 15:23:37,924 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 15:23:37,927 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 15:23:37,929 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 15:23:37,930 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 15:23:37,930 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 15:23:37,931 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 15:23:37,934 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 15:23:37,935 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 15:23:37,935 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:23:37,945 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 15:23:37,946 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 15:23:37,946 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 15:23:37,947 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 15:23:37,950 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 15:23:37,950 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 15:23:37,951 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 15:23:37,951 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 15:23:37,951 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 15:23:37,951 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 15:23:37,951 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 15:23:37,952 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 15:23:37,952 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 15:23:37,953 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 15:23:37,953 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 15:23:38,010 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 15:23:38,029 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 15:23:38,037 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 15:23:38,038 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 15:23:38,039 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 15:23:38,040 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/count_by_nondet.i_3.bpl [2018-10-15 15:23:38,040 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/count_by_nondet.i_3.bpl' [2018-10-15 15:23:38,101 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 15:23:38,103 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-15 15:23:38,103 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 15:23:38,104 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 15:23:38,104 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 15:23:38,133 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:23:38" (1/1) ... [2018-10-15 15:23:38,135 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:23:38" (1/1) ... [2018-10-15 15:23:38,147 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:23:38" (1/1) ... [2018-10-15 15:23:38,147 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:23:38" (1/1) ... [2018-10-15 15:23:38,153 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:23:38" (1/1) ... [2018-10-15 15:23:38,157 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:23:38" (1/1) ... [2018-10-15 15:23:38,158 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:23:38" (1/1) ... [2018-10-15 15:23:38,160 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 15:23:38,161 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 15:23:38,162 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 15:23:38,162 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 15:23:38,164 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:23:38" (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:23:38,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 15:23:38,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 15:23:38,584 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 15:23:38,585 INFO L202 PluginConnector]: Adding new model count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:23:38 BoogieIcfgContainer [2018-10-15 15:23:38,585 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 15:23:38,586 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-15 15:23:38,586 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-15 15:23:38,587 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-15 15:23:38,600 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:23:38" (1/1) ... [2018-10-15 15:23:38,616 WARN L219 ansformationObserver]: HeapSeparator: input icfg has no '#valid' array -- returning unchanged Icfg! [2018-10-15 15:23:38,641 INFO L202 PluginConnector]: Adding new model count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 03:23:38 BasicIcfg [2018-10-15 15:23:38,641 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-15 15:23:38,642 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 15:23:38,642 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 15:23:38,655 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 15:23:38,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:23:38" (1/3) ... [2018-10-15 15:23:38,663 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19d82f61 and model type count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:23:38, skipping insertion in model container [2018-10-15 15:23:38,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:23:38" (2/3) ... [2018-10-15 15:23:38,664 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19d82f61 and model type count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:23:38, skipping insertion in model container [2018-10-15 15:23:38,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 03:23:38" (3/3) ... [2018-10-15 15:23:38,666 INFO L112 eAbstractionObserver]: Analyzing ICFG count_by_nondet.i_3.bplleft_unchanged_by_heapseparator [2018-10-15 15:23:38,677 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 15:23:38,687 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 15:23:38,708 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 15:23:38,743 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 15:23:38,744 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 15:23:38,745 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 15:23:38,745 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 15:23:38,745 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 15:23:38,745 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 15:23:38,745 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 15:23:38,746 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 15:23:38,746 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 15:23:38,763 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-10-15 15:23:38,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-15 15:23:38,782 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:38,785 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:38,786 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:38,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:38,793 INFO L82 PathProgramCache]: Analyzing trace with hash 135640234, now seen corresponding path program 1 times [2018-10-15 15:23:38,846 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:38,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:38,949 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:23:38,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:23:38,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:23:38,956 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:23:38,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:23:38,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:23:38,973 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2018-10-15 15:23:39,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:39,038 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-10-15 15:23:39,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:23:39,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-10-15 15:23:39,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:39,052 INFO L225 Difference]: With dead ends: 28 [2018-10-15 15:23:39,053 INFO L226 Difference]: Without dead ends: 28 [2018-10-15 15:23:39,055 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:23:39,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-10-15 15:23:39,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2018-10-15 15:23:39,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-15 15:23:39,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-10-15 15:23:39,092 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 12 [2018-10-15 15:23:39,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:39,092 INFO L481 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-10-15 15:23:39,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:23:39,093 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-10-15 15:23:39,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-15 15:23:39,094 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:39,094 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] [2018-10-15 15:23:39,094 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:39,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:39,095 INFO L82 PathProgramCache]: Analyzing trace with hash -679212172, now seen corresponding path program 1 times [2018-10-15 15:23:39,096 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:39,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:39,235 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:39,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:39,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-15 15:23:39,238 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 15:23:39,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 15:23:39,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-15 15:23:39,239 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 5 states. [2018-10-15 15:23:39,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:39,344 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-10-15 15:23:39,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-15 15:23:39,344 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-10-15 15:23:39,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:39,345 INFO L225 Difference]: With dead ends: 33 [2018-10-15 15:23:39,345 INFO L226 Difference]: Without dead ends: 33 [2018-10-15 15:23:39,347 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-15 15:23:39,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-15 15:23:39,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-10-15 15:23:39,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-15 15:23:39,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-10-15 15:23:39,353 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 22 [2018-10-15 15:23:39,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:39,353 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-10-15 15:23:39,353 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 15:23:39,353 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-10-15 15:23:39,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-15 15:23:39,355 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:39,355 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:39,355 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:39,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:39,356 INFO L82 PathProgramCache]: Analyzing trace with hash 99872190, now seen corresponding path program 2 times [2018-10-15 15:23:39,357 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:39,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:39,629 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:39,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:39,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 15:23:39,631 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 15:23:39,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 15:23:39,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-10-15 15:23:39,632 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 9 states. [2018-10-15 15:23:40,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:40,076 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-10-15 15:23:40,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-15 15:23:40,079 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-10-15 15:23:40,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:40,081 INFO L225 Difference]: With dead ends: 54 [2018-10-15 15:23:40,081 INFO L226 Difference]: Without dead ends: 50 [2018-10-15 15:23:40,082 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2018-10-15 15:23:40,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-15 15:23:40,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2018-10-15 15:23:40,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-15 15:23:40,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-10-15 15:23:40,092 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 32 [2018-10-15 15:23:40,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:40,093 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-10-15 15:23:40,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 15:23:40,093 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-10-15 15:23:40,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-15 15:23:40,096 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:40,096 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:40,098 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:40,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:40,098 INFO L82 PathProgramCache]: Analyzing trace with hash 629996424, now seen corresponding path program 3 times [2018-10-15 15:23:40,099 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:40,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:40,311 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:40,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:40,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 15:23:40,313 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 15:23:40,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 15:23:40,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-10-15 15:23:40,314 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 11 states. [2018-10-15 15:23:40,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:40,946 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-10-15 15:23:40,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-15 15:23:40,947 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2018-10-15 15:23:40,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:40,949 INFO L225 Difference]: With dead ends: 64 [2018-10-15 15:23:40,949 INFO L226 Difference]: Without dead ends: 60 [2018-10-15 15:23:40,950 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-10-15 15:23:40,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-10-15 15:23:40,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2018-10-15 15:23:40,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-15 15:23:40,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-10-15 15:23:40,958 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 42 [2018-10-15 15:23:40,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:40,958 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-10-15 15:23:40,958 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 15:23:40,958 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-10-15 15:23:40,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-15 15:23:40,960 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:40,960 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:40,961 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:40,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:40,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1936643282, now seen corresponding path program 4 times [2018-10-15 15:23:40,962 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:40,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:41,151 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:41,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:41,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 15:23:41,153 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 15:23:41,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 15:23:41,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-10-15 15:23:41,154 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 13 states. [2018-10-15 15:23:41,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:41,521 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-10-15 15:23:41,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-15 15:23:41,522 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2018-10-15 15:23:41,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:41,524 INFO L225 Difference]: With dead ends: 74 [2018-10-15 15:23:41,524 INFO L226 Difference]: Without dead ends: 70 [2018-10-15 15:23:41,525 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=369, Unknown=0, NotChecked=0, Total=506 [2018-10-15 15:23:41,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-10-15 15:23:41,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 63. [2018-10-15 15:23:41,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-15 15:23:41,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-10-15 15:23:41,531 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 52 [2018-10-15 15:23:41,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:41,532 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-10-15 15:23:41,532 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 15:23:41,532 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-10-15 15:23:41,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-15 15:23:41,534 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:41,534 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:41,535 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:41,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:41,535 INFO L82 PathProgramCache]: Analyzing trace with hash -2119100004, now seen corresponding path program 5 times [2018-10-15 15:23:41,536 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:41,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:41,837 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:41,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:41,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 15:23:41,838 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 15:23:41,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 15:23:41,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-10-15 15:23:41,839 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 15 states. [2018-10-15 15:23:42,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:42,948 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-10-15 15:23:42,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-15 15:23:42,948 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 62 [2018-10-15 15:23:42,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:42,951 INFO L225 Difference]: With dead ends: 84 [2018-10-15 15:23:42,952 INFO L226 Difference]: Without dead ends: 80 [2018-10-15 15:23:42,953 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=192, Invalid=510, Unknown=0, NotChecked=0, Total=702 [2018-10-15 15:23:42,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-10-15 15:23:42,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 73. [2018-10-15 15:23:42,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-15 15:23:42,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-10-15 15:23:42,961 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 62 [2018-10-15 15:23:42,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:42,961 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-10-15 15:23:42,961 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 15:23:42,962 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-10-15 15:23:42,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-15 15:23:42,964 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:42,965 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:42,965 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:42,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:42,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1633905126, now seen corresponding path program 6 times [2018-10-15 15:23:42,967 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:42,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:43,248 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:43,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:43,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 15:23:43,249 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 15:23:43,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 15:23:43,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2018-10-15 15:23:43,250 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 17 states. [2018-10-15 15:23:43,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:43,562 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-10-15 15:23:43,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-15 15:23:43,562 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 72 [2018-10-15 15:23:43,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:43,565 INFO L225 Difference]: With dead ends: 94 [2018-10-15 15:23:43,565 INFO L226 Difference]: Without dead ends: 90 [2018-10-15 15:23:43,566 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=673, Unknown=0, NotChecked=0, Total=930 [2018-10-15 15:23:43,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-15 15:23:43,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 83. [2018-10-15 15:23:43,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-10-15 15:23:43,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-10-15 15:23:43,574 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 72 [2018-10-15 15:23:43,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:43,574 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-10-15 15:23:43,575 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 15:23:43,575 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-10-15 15:23:43,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-15 15:23:43,576 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:43,577 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:43,578 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:43,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:43,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1284335024, now seen corresponding path program 7 times [2018-10-15 15:23:43,579 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:43,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:43,862 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:43,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:43,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 15:23:43,863 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 15:23:43,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 15:23:43,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2018-10-15 15:23:43,864 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 19 states. [2018-10-15 15:23:44,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:44,587 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-10-15 15:23:44,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-15 15:23:44,588 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 82 [2018-10-15 15:23:44,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:44,589 INFO L225 Difference]: With dead ends: 104 [2018-10-15 15:23:44,589 INFO L226 Difference]: Without dead ends: 100 [2018-10-15 15:23:44,590 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=332, Invalid=858, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 15:23:44,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-10-15 15:23:44,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 93. [2018-10-15 15:23:44,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-10-15 15:23:44,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-10-15 15:23:44,598 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 82 [2018-10-15 15:23:44,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:44,598 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-10-15 15:23:44,598 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 15:23:44,599 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-10-15 15:23:44,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-10-15 15:23:44,600 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:44,600 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:44,601 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:44,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:44,601 INFO L82 PathProgramCache]: Analyzing trace with hash -802247430, now seen corresponding path program 8 times [2018-10-15 15:23:44,602 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:44,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:45,173 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 0 proven. 296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:45,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:45,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 15:23:45,174 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 15:23:45,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 15:23:45,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2018-10-15 15:23:45,175 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 21 states. [2018-10-15 15:23:45,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:45,590 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-10-15 15:23:45,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-15 15:23:45,591 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 92 [2018-10-15 15:23:45,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:45,593 INFO L225 Difference]: With dead ends: 114 [2018-10-15 15:23:45,593 INFO L226 Difference]: Without dead ends: 110 [2018-10-15 15:23:45,594 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=417, Invalid=1065, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 15:23:45,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-10-15 15:23:45,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 103. [2018-10-15 15:23:45,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-10-15 15:23:45,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-10-15 15:23:45,601 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 92 [2018-10-15 15:23:45,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:45,602 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-10-15 15:23:45,602 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 15:23:45,602 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-10-15 15:23:45,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-15 15:23:45,604 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:45,604 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:45,604 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:45,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:45,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1983832004, now seen corresponding path program 9 times [2018-10-15 15:23:45,606 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:45,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:45,913 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:45,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:45,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 15:23:45,914 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 15:23:45,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 15:23:45,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506 [2018-10-15 15:23:45,915 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 23 states. [2018-10-15 15:23:46,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:46,312 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2018-10-15 15:23:46,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-15 15:23:46,313 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 102 [2018-10-15 15:23:46,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:46,314 INFO L225 Difference]: With dead ends: 124 [2018-10-15 15:23:46,314 INFO L226 Difference]: Without dead ends: 120 [2018-10-15 15:23:46,316 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=512, Invalid=1294, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 15:23:46,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-10-15 15:23:46,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 113. [2018-10-15 15:23:46,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-10-15 15:23:46,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-10-15 15:23:46,321 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 102 [2018-10-15 15:23:46,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:46,322 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-10-15 15:23:46,322 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 15:23:46,322 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-10-15 15:23:46,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-15 15:23:46,324 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:46,324 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:46,324 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:46,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:46,325 INFO L82 PathProgramCache]: Analyzing trace with hash -273834482, now seen corresponding path program 10 times [2018-10-15 15:23:46,326 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:46,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:46,711 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 0 proven. 470 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:46,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:46,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 15:23:46,712 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 15:23:46,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 15:23:46,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2018-10-15 15:23:46,713 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 25 states. [2018-10-15 15:23:47,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:47,161 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2018-10-15 15:23:47,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-15 15:23:47,162 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 112 [2018-10-15 15:23:47,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:47,163 INFO L225 Difference]: With dead ends: 134 [2018-10-15 15:23:47,163 INFO L226 Difference]: Without dead ends: 130 [2018-10-15 15:23:47,165 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=617, Invalid=1545, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 15:23:47,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-10-15 15:23:47,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 123. [2018-10-15 15:23:47,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-10-15 15:23:47,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-10-15 15:23:47,171 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 112 [2018-10-15 15:23:47,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:47,171 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-10-15 15:23:47,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 15:23:47,171 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-10-15 15:23:47,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-15 15:23:47,173 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:47,173 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:47,174 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:47,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:47,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1100838952, now seen corresponding path program 11 times [2018-10-15 15:23:47,175 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:47,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:47,505 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 0 proven. 572 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:47,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:47,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 15:23:47,506 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 15:23:47,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 15:23:47,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2018-10-15 15:23:47,507 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 27 states. [2018-10-15 15:23:48,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:48,248 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2018-10-15 15:23:48,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-15 15:23:48,249 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 122 [2018-10-15 15:23:48,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:48,250 INFO L225 Difference]: With dead ends: 144 [2018-10-15 15:23:48,250 INFO L226 Difference]: Without dead ends: 140 [2018-10-15 15:23:48,252 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=732, Invalid=1818, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 15:23:48,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-10-15 15:23:48,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 133. [2018-10-15 15:23:48,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-10-15 15:23:48,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-10-15 15:23:48,256 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 122 [2018-10-15 15:23:48,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:48,257 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-10-15 15:23:48,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 15:23:48,257 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-10-15 15:23:48,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-15 15:23:48,259 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:48,259 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:48,260 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:48,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:48,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1597848866, now seen corresponding path program 12 times [2018-10-15 15:23:48,261 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:48,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:48,827 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 684 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:48,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:48,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 15:23:48,828 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 15:23:48,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 15:23:48,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=613, Unknown=0, NotChecked=0, Total=812 [2018-10-15 15:23:48,829 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 29 states. [2018-10-15 15:23:49,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:49,801 INFO L93 Difference]: Finished difference Result 154 states and 154 transitions. [2018-10-15 15:23:49,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-15 15:23:49,802 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 132 [2018-10-15 15:23:49,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:49,803 INFO L225 Difference]: With dead ends: 154 [2018-10-15 15:23:49,803 INFO L226 Difference]: Without dead ends: 150 [2018-10-15 15:23:49,807 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=857, Invalid=2113, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 15:23:49,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-10-15 15:23:49,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 143. [2018-10-15 15:23:49,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-10-15 15:23:49,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-10-15 15:23:49,811 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 132 [2018-10-15 15:23:49,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:49,811 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-10-15 15:23:49,811 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 15:23:49,811 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-10-15 15:23:49,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-15 15:23:49,813 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:49,813 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:49,821 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:49,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:49,822 INFO L82 PathProgramCache]: Analyzing trace with hash -199926292, now seen corresponding path program 13 times [2018-10-15 15:23:49,823 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:49,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:50,731 INFO L134 CoverageAnalysis]: Checked inductivity of 806 backedges. 0 proven. 806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:50,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:50,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 15:23:50,731 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 15:23:50,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 15:23:50,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=702, Unknown=0, NotChecked=0, Total=930 [2018-10-15 15:23:50,732 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 31 states. [2018-10-15 15:23:51,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:51,363 INFO L93 Difference]: Finished difference Result 164 states and 164 transitions. [2018-10-15 15:23:51,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-15 15:23:51,364 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 142 [2018-10-15 15:23:51,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:51,365 INFO L225 Difference]: With dead ends: 164 [2018-10-15 15:23:51,366 INFO L226 Difference]: Without dead ends: 160 [2018-10-15 15:23:51,368 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=992, Invalid=2430, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 15:23:51,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-10-15 15:23:51,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 153. [2018-10-15 15:23:51,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-10-15 15:23:51,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-10-15 15:23:51,371 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 142 [2018-10-15 15:23:51,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:51,372 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-10-15 15:23:51,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 15:23:51,372 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-10-15 15:23:51,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-10-15 15:23:51,373 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:51,374 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:51,374 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:51,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:51,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1840941622, now seen corresponding path program 14 times [2018-10-15 15:23:51,375 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:51,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:51,794 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 0 proven. 938 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:51,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:51,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 15:23:51,795 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 15:23:51,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 15:23:51,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=797, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 15:23:51,796 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 33 states. [2018-10-15 15:23:52,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:52,523 INFO L93 Difference]: Finished difference Result 174 states and 174 transitions. [2018-10-15 15:23:52,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-15 15:23:52,526 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 152 [2018-10-15 15:23:52,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:52,527 INFO L225 Difference]: With dead ends: 174 [2018-10-15 15:23:52,527 INFO L226 Difference]: Without dead ends: 170 [2018-10-15 15:23:52,529 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1137, Invalid=2769, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 15:23:52,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-10-15 15:23:52,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 163. [2018-10-15 15:23:52,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-10-15 15:23:52,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-10-15 15:23:52,533 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 152 [2018-10-15 15:23:52,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:52,534 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-10-15 15:23:52,534 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 15:23:52,534 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-10-15 15:23:52,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-10-15 15:23:52,535 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:52,535 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:52,535 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:52,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:52,535 INFO L82 PathProgramCache]: Analyzing trace with hash 905208320, now seen corresponding path program 15 times [2018-10-15 15:23:52,536 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:52,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:53,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 0 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:53,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:53,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 15:23:53,377 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 15:23:53,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 15:23:53,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=898, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 15:23:53,378 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 35 states. [2018-10-15 15:23:54,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:54,189 INFO L93 Difference]: Finished difference Result 184 states and 184 transitions. [2018-10-15 15:23:54,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-15 15:23:54,189 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 162 [2018-10-15 15:23:54,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:54,191 INFO L225 Difference]: With dead ends: 184 [2018-10-15 15:23:54,191 INFO L226 Difference]: Without dead ends: 180 [2018-10-15 15:23:54,193 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 763 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1292, Invalid=3130, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 15:23:54,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-10-15 15:23:54,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 173. [2018-10-15 15:23:54,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-10-15 15:23:54,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-10-15 15:23:54,197 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 162 [2018-10-15 15:23:54,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:54,197 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-10-15 15:23:54,197 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 15:23:54,197 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-10-15 15:23:54,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-15 15:23:54,198 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:54,198 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:54,199 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:54,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:54,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1501726026, now seen corresponding path program 16 times [2018-10-15 15:23:54,200 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:54,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:55,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1232 backedges. 0 proven. 1232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:55,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:55,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 15:23:55,589 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 15:23:55,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 15:23:55,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=1005, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 15:23:55,589 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 37 states. [2018-10-15 15:23:56,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:56,409 INFO L93 Difference]: Finished difference Result 194 states and 194 transitions. [2018-10-15 15:23:56,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-15 15:23:56,410 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 172 [2018-10-15 15:23:56,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:56,412 INFO L225 Difference]: With dead ends: 194 [2018-10-15 15:23:56,412 INFO L226 Difference]: Without dead ends: 190 [2018-10-15 15:23:56,415 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1457, Invalid=3513, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 15:23:56,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-10-15 15:23:56,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 183. [2018-10-15 15:23:56,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-10-15 15:23:56,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-10-15 15:23:56,418 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 172 [2018-10-15 15:23:56,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:56,418 INFO L481 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-10-15 15:23:56,419 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 15:23:56,419 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-10-15 15:23:56,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-15 15:23:56,420 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:56,420 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:56,420 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:56,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:56,421 INFO L82 PathProgramCache]: Analyzing trace with hash 840733716, now seen corresponding path program 17 times [2018-10-15 15:23:56,421 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:56,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:57,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1394 backedges. 0 proven. 1394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:57,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:57,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 15:23:57,083 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 15:23:57,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 15:23:57,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=364, Invalid=1118, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 15:23:57,084 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 39 states. [2018-10-15 15:23:58,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:58,320 INFO L93 Difference]: Finished difference Result 204 states and 204 transitions. [2018-10-15 15:23:58,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-15 15:23:58,320 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 182 [2018-10-15 15:23:58,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:58,322 INFO L225 Difference]: With dead ends: 204 [2018-10-15 15:23:58,322 INFO L226 Difference]: Without dead ends: 200 [2018-10-15 15:23:58,325 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 967 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1632, Invalid=3918, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 15:23:58,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-10-15 15:23:58,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 193. [2018-10-15 15:23:58,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-10-15 15:23:58,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-10-15 15:23:58,329 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 182 [2018-10-15 15:23:58,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:58,329 INFO L481 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-10-15 15:23:58,329 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 15:23:58,330 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-10-15 15:23:58,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-10-15 15:23:58,330 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:58,331 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:58,331 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:58,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:58,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1871565218, now seen corresponding path program 18 times [2018-10-15 15:23:58,332 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:58,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:59,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1566 backedges. 0 proven. 1566 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:59,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:59,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 15:23:59,027 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 15:23:59,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 15:23:59,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=403, Invalid=1237, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 15:23:59,028 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 41 states. [2018-10-15 15:24:00,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:00,123 INFO L93 Difference]: Finished difference Result 214 states and 214 transitions. [2018-10-15 15:24:00,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-15 15:24:00,124 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 192 [2018-10-15 15:24:00,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:00,126 INFO L225 Difference]: With dead ends: 214 [2018-10-15 15:24:00,126 INFO L226 Difference]: Without dead ends: 210 [2018-10-15 15:24:00,128 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1817, Invalid=4345, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 15:24:00,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-10-15 15:24:00,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 203. [2018-10-15 15:24:00,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-10-15 15:24:00,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2018-10-15 15:24:00,131 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 192 [2018-10-15 15:24:00,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:00,132 INFO L481 AbstractCegarLoop]: Abstraction has 203 states and 203 transitions. [2018-10-15 15:24:00,132 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 15:24:00,132 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2018-10-15 15:24:00,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-15 15:24:00,133 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:00,133 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:00,134 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:00,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:00,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1714091048, now seen corresponding path program 19 times [2018-10-15 15:24:00,135 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:00,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:00,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1748 backedges. 0 proven. 1748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:24:00,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:00,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 15:24:00,770 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 15:24:00,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 15:24:00,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=444, Invalid=1362, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 15:24:00,771 INFO L87 Difference]: Start difference. First operand 203 states and 203 transitions. Second operand 43 states. [2018-10-15 15:24:01,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:01,771 INFO L93 Difference]: Finished difference Result 224 states and 224 transitions. [2018-10-15 15:24:01,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-15 15:24:01,772 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 202 [2018-10-15 15:24:01,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:01,774 INFO L225 Difference]: With dead ends: 224 [2018-10-15 15:24:01,774 INFO L226 Difference]: Without dead ends: 220 [2018-10-15 15:24:01,777 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1195 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2012, Invalid=4794, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 15:24:01,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-10-15 15:24:01,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 213. [2018-10-15 15:24:01,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-15 15:24:01,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2018-10-15 15:24:01,780 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 202 [2018-10-15 15:24:01,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:01,781 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2018-10-15 15:24:01,781 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 15:24:01,781 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2018-10-15 15:24:01,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-10-15 15:24:01,782 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:01,782 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:01,782 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:01,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:01,783 INFO L82 PathProgramCache]: Analyzing trace with hash -270105230, now seen corresponding path program 20 times [2018-10-15 15:24:01,783 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:01,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:02,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1940 backedges. 0 proven. 1940 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:24:02,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:02,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 15:24:02,909 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 15:24:02,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 15:24:02,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=487, Invalid=1493, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 15:24:02,911 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 45 states. [2018-10-15 15:24:04,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:04,326 INFO L93 Difference]: Finished difference Result 234 states and 234 transitions. [2018-10-15 15:24:04,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-15 15:24:04,326 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 212 [2018-10-15 15:24:04,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:04,328 INFO L225 Difference]: With dead ends: 234 [2018-10-15 15:24:04,328 INFO L226 Difference]: Without dead ends: 230 [2018-10-15 15:24:04,329 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1318 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2217, Invalid=5265, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 15:24:04,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-10-15 15:24:04,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 223. [2018-10-15 15:24:04,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-10-15 15:24:04,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 223 transitions. [2018-10-15 15:24:04,333 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 223 transitions. Word has length 212 [2018-10-15 15:24:04,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:04,334 INFO L481 AbstractCegarLoop]: Abstraction has 223 states and 223 transitions. [2018-10-15 15:24:04,334 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 15:24:04,334 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 223 transitions. [2018-10-15 15:24:04,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-10-15 15:24:04,335 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:04,335 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:04,335 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:04,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:04,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1597801020, now seen corresponding path program 21 times [2018-10-15 15:24:04,336 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:04,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:05,234 INFO L134 CoverageAnalysis]: Checked inductivity of 2142 backedges. 0 proven. 2142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:24:05,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:05,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 15:24:05,235 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 15:24:05,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 15:24:05,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=532, Invalid=1630, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 15:24:05,236 INFO L87 Difference]: Start difference. First operand 223 states and 223 transitions. Second operand 47 states. [2018-10-15 15:24:06,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:06,546 INFO L93 Difference]: Finished difference Result 244 states and 244 transitions. [2018-10-15 15:24:06,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-15 15:24:06,549 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 222 [2018-10-15 15:24:06,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:06,551 INFO L225 Difference]: With dead ends: 244 [2018-10-15 15:24:06,551 INFO L226 Difference]: Without dead ends: 240 [2018-10-15 15:24:06,552 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1447 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2432, Invalid=5758, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 15:24:06,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-10-15 15:24:06,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 233. [2018-10-15 15:24:06,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-10-15 15:24:06,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2018-10-15 15:24:06,556 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 222 [2018-10-15 15:24:06,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:06,557 INFO L481 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2018-10-15 15:24:06,557 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 15:24:06,557 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2018-10-15 15:24:06,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-10-15 15:24:06,558 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:06,558 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:06,558 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:06,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:06,559 INFO L82 PathProgramCache]: Analyzing trace with hash 79465094, now seen corresponding path program 22 times [2018-10-15 15:24:06,559 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:06,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:07,846 INFO L134 CoverageAnalysis]: Checked inductivity of 2354 backedges. 0 proven. 2354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:24:07,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:07,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 15:24:07,847 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 15:24:07,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 15:24:07,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=579, Invalid=1773, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 15:24:07,848 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 49 states. [2018-10-15 15:24:09,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:09,414 INFO L93 Difference]: Finished difference Result 254 states and 254 transitions. [2018-10-15 15:24:09,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-15 15:24:09,414 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 232 [2018-10-15 15:24:09,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:09,416 INFO L225 Difference]: With dead ends: 254 [2018-10-15 15:24:09,416 INFO L226 Difference]: Without dead ends: 250 [2018-10-15 15:24:09,418 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1582 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2657, Invalid=6273, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 15:24:09,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-10-15 15:24:09,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 243. [2018-10-15 15:24:09,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-10-15 15:24:09,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 243 transitions. [2018-10-15 15:24:09,423 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 243 transitions. Word has length 232 [2018-10-15 15:24:09,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:09,423 INFO L481 AbstractCegarLoop]: Abstraction has 243 states and 243 transitions. [2018-10-15 15:24:09,423 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 15:24:09,423 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 243 transitions. [2018-10-15 15:24:09,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-10-15 15:24:09,424 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:09,425 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:09,425 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:09,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:09,425 INFO L82 PathProgramCache]: Analyzing trace with hash -101826992, now seen corresponding path program 23 times [2018-10-15 15:24:09,426 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:09,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:10,745 INFO L134 CoverageAnalysis]: Checked inductivity of 2576 backedges. 0 proven. 2576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:24:10,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:10,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 15:24:10,745 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 15:24:10,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 15:24:10,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=628, Invalid=1922, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 15:24:10,746 INFO L87 Difference]: Start difference. First operand 243 states and 243 transitions. Second operand 51 states. [2018-10-15 15:24:12,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:12,379 INFO L93 Difference]: Finished difference Result 264 states and 264 transitions. [2018-10-15 15:24:12,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-15 15:24:12,380 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 242 [2018-10-15 15:24:12,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:12,382 INFO L225 Difference]: With dead ends: 264 [2018-10-15 15:24:12,382 INFO L226 Difference]: Without dead ends: 260 [2018-10-15 15:24:12,384 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1723 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2892, Invalid=6810, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 15:24:12,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-10-15 15:24:12,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 253. [2018-10-15 15:24:12,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-10-15 15:24:12,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2018-10-15 15:24:12,389 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 242 [2018-10-15 15:24:12,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:12,389 INFO L481 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2018-10-15 15:24:12,389 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 15:24:12,390 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2018-10-15 15:24:12,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-10-15 15:24:12,391 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:12,391 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:12,391 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:12,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:12,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1263615386, now seen corresponding path program 24 times [2018-10-15 15:24:12,392 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:12,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:13,585 INFO L134 CoverageAnalysis]: Checked inductivity of 2808 backedges. 0 proven. 2808 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:24:13,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:13,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 15:24:13,586 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 15:24:13,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 15:24:13,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=679, Invalid=2077, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 15:24:13,587 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 53 states. [2018-10-15 15:24:15,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:15,132 INFO L93 Difference]: Finished difference Result 274 states and 274 transitions. [2018-10-15 15:24:15,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-15 15:24:15,132 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 252 [2018-10-15 15:24:15,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:15,134 INFO L225 Difference]: With dead ends: 274 [2018-10-15 15:24:15,134 INFO L226 Difference]: Without dead ends: 270 [2018-10-15 15:24:15,135 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1870 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3137, Invalid=7369, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 15:24:15,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-10-15 15:24:15,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 263. [2018-10-15 15:24:15,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-10-15 15:24:15,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 263 transitions. [2018-10-15 15:24:15,141 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 263 transitions. Word has length 252 [2018-10-15 15:24:15,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:15,141 INFO L481 AbstractCegarLoop]: Abstraction has 263 states and 263 transitions. [2018-10-15 15:24:15,141 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 15:24:15,141 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 263 transitions. [2018-10-15 15:24:15,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-10-15 15:24:15,142 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:15,143 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:15,143 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:15,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:15,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1570953116, now seen corresponding path program 25 times [2018-10-15 15:24:15,144 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:15,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:16,485 INFO L134 CoverageAnalysis]: Checked inductivity of 3050 backedges. 0 proven. 3050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:24:16,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:16,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 15:24:16,486 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 15:24:16,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 15:24:16,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=732, Invalid=2238, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 15:24:16,487 INFO L87 Difference]: Start difference. First operand 263 states and 263 transitions. Second operand 55 states. [2018-10-15 15:24:18,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:18,288 INFO L93 Difference]: Finished difference Result 284 states and 284 transitions. [2018-10-15 15:24:18,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-15 15:24:18,289 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 262 [2018-10-15 15:24:18,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:18,290 INFO L225 Difference]: With dead ends: 284 [2018-10-15 15:24:18,290 INFO L226 Difference]: Without dead ends: 280 [2018-10-15 15:24:18,291 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2023 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3392, Invalid=7950, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 15:24:18,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-10-15 15:24:18,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 273. [2018-10-15 15:24:18,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-10-15 15:24:18,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2018-10-15 15:24:18,295 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 262 [2018-10-15 15:24:18,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:18,296 INFO L481 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2018-10-15 15:24:18,296 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 15:24:18,296 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2018-10-15 15:24:18,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-10-15 15:24:18,297 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:18,298 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:18,298 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:18,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:18,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1870765742, now seen corresponding path program 26 times [2018-10-15 15:24:18,299 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:18,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:19,890 INFO L134 CoverageAnalysis]: Checked inductivity of 3302 backedges. 0 proven. 3302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:24:19,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:19,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 15:24:19,891 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 15:24:19,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 15:24:19,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=787, Invalid=2405, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 15:24:19,892 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 57 states. [2018-10-15 15:24:21,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:21,650 INFO L93 Difference]: Finished difference Result 294 states and 294 transitions. [2018-10-15 15:24:21,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-10-15 15:24:21,650 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 272 [2018-10-15 15:24:21,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:21,653 INFO L225 Difference]: With dead ends: 294 [2018-10-15 15:24:21,653 INFO L226 Difference]: Without dead ends: 290 [2018-10-15 15:24:21,654 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2182 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3657, Invalid=8553, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 15:24:21,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-10-15 15:24:21,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 283. [2018-10-15 15:24:21,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-10-15 15:24:21,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 283 transitions. [2018-10-15 15:24:21,658 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 283 transitions. Word has length 272 [2018-10-15 15:24:21,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:21,658 INFO L481 AbstractCegarLoop]: Abstraction has 283 states and 283 transitions. [2018-10-15 15:24:21,658 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 15:24:21,659 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 283 transitions. [2018-10-15 15:24:21,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-10-15 15:24:21,660 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:21,660 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:21,660 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:21,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:21,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1809432456, now seen corresponding path program 27 times [2018-10-15 15:24:21,661 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:21,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:23,171 INFO L134 CoverageAnalysis]: Checked inductivity of 3564 backedges. 0 proven. 3564 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:24:23,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:23,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-15 15:24:23,172 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-15 15:24:23,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-15 15:24:23,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=844, Invalid=2578, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 15:24:23,173 INFO L87 Difference]: Start difference. First operand 283 states and 283 transitions. Second operand 59 states. [2018-10-15 15:24:25,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:25,211 INFO L93 Difference]: Finished difference Result 304 states and 304 transitions. [2018-10-15 15:24:25,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-10-15 15:24:25,211 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 282 [2018-10-15 15:24:25,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:25,213 INFO L225 Difference]: With dead ends: 304 [2018-10-15 15:24:25,213 INFO L226 Difference]: Without dead ends: 300 [2018-10-15 15:24:25,214 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2347 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3932, Invalid=9178, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 15:24:25,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-10-15 15:24:25,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 293. [2018-10-15 15:24:25,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-10-15 15:24:25,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2018-10-15 15:24:25,218 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 282 [2018-10-15 15:24:25,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:25,218 INFO L481 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2018-10-15 15:24:25,219 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-15 15:24:25,219 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2018-10-15 15:24:25,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-10-15 15:24:25,220 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:25,220 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:25,221 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:25,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:25,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1934971454, now seen corresponding path program 28 times [2018-10-15 15:24:25,222 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:25,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:27,078 INFO L134 CoverageAnalysis]: Checked inductivity of 3836 backedges. 0 proven. 3836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:24:27,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:27,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-15 15:24:27,079 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-15 15:24:27,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-15 15:24:27,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=2757, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 15:24:27,079 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 61 states. [2018-10-15 15:24:29,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:29,128 INFO L93 Difference]: Finished difference Result 314 states and 314 transitions. [2018-10-15 15:24:29,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-10-15 15:24:29,128 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 292 [2018-10-15 15:24:29,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:29,131 INFO L225 Difference]: With dead ends: 314 [2018-10-15 15:24:29,131 INFO L226 Difference]: Without dead ends: 310 [2018-10-15 15:24:29,132 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2518 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4217, Invalid=9825, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 15:24:29,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-10-15 15:24:29,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 303. [2018-10-15 15:24:29,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-10-15 15:24:29,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 303 transitions. [2018-10-15 15:24:29,137 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 303 transitions. Word has length 292 [2018-10-15 15:24:29,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:29,137 INFO L481 AbstractCegarLoop]: Abstraction has 303 states and 303 transitions. [2018-10-15 15:24:29,137 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-15 15:24:29,138 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 303 transitions. [2018-10-15 15:24:29,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-10-15 15:24:29,139 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:29,139 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:29,139 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:29,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:29,140 INFO L82 PathProgramCache]: Analyzing trace with hash 442926732, now seen corresponding path program 29 times [2018-10-15 15:24:29,140 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:29,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:30,712 INFO L134 CoverageAnalysis]: Checked inductivity of 4118 backedges. 0 proven. 4118 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:24:30,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:30,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-15 15:24:30,713 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-15 15:24:30,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-15 15:24:30,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=964, Invalid=2942, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 15:24:30,713 INFO L87 Difference]: Start difference. First operand 303 states and 303 transitions. Second operand 63 states. [2018-10-15 15:24:33,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:33,770 INFO L93 Difference]: Finished difference Result 324 states and 324 transitions. [2018-10-15 15:24:33,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-10-15 15:24:33,770 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 302 [2018-10-15 15:24:33,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:33,772 INFO L225 Difference]: With dead ends: 324 [2018-10-15 15:24:33,772 INFO L226 Difference]: Without dead ends: 320 [2018-10-15 15:24:33,773 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2695 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4512, Invalid=10494, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 15:24:33,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-10-15 15:24:33,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 313. [2018-10-15 15:24:33,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-10-15 15:24:33,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 313 transitions. [2018-10-15 15:24:33,778 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 313 transitions. Word has length 302 [2018-10-15 15:24:33,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:33,778 INFO L481 AbstractCegarLoop]: Abstraction has 313 states and 313 transitions. [2018-10-15 15:24:33,778 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-15 15:24:33,778 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 313 transitions. [2018-10-15 15:24:33,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-10-15 15:24:33,780 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:33,780 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:33,780 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:33,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:33,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1839819478, now seen corresponding path program 30 times [2018-10-15 15:24:33,781 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:33,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:35,342 INFO L134 CoverageAnalysis]: Checked inductivity of 4410 backedges. 0 proven. 4410 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:24:35,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:35,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-15 15:24:35,343 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-15 15:24:35,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-15 15:24:35,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1027, Invalid=3133, Unknown=0, NotChecked=0, Total=4160 [2018-10-15 15:24:35,344 INFO L87 Difference]: Start difference. First operand 313 states and 313 transitions. Second operand 65 states. [2018-10-15 15:24:37,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:37,408 INFO L93 Difference]: Finished difference Result 334 states and 334 transitions. [2018-10-15 15:24:37,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-10-15 15:24:37,408 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 312 [2018-10-15 15:24:37,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:37,411 INFO L225 Difference]: With dead ends: 334 [2018-10-15 15:24:37,411 INFO L226 Difference]: Without dead ends: 330 [2018-10-15 15:24:37,413 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2878 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4817, Invalid=11185, Unknown=0, NotChecked=0, Total=16002 [2018-10-15 15:24:37,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-10-15 15:24:37,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 323. [2018-10-15 15:24:37,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-10-15 15:24:37,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 323 transitions. [2018-10-15 15:24:37,418 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 323 transitions. Word has length 312 [2018-10-15 15:24:37,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:37,418 INFO L481 AbstractCegarLoop]: Abstraction has 323 states and 323 transitions. [2018-10-15 15:24:37,418 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-15 15:24:37,418 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 323 transitions. [2018-10-15 15:24:37,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-10-15 15:24:37,420 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:37,420 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:37,420 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:37,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:37,421 INFO L82 PathProgramCache]: Analyzing trace with hash -809829728, now seen corresponding path program 31 times [2018-10-15 15:24:37,421 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:37,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:38,771 INFO L134 CoverageAnalysis]: Checked inductivity of 4712 backedges. 0 proven. 4712 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:24:38,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:38,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-15 15:24:38,772 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-15 15:24:38,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-15 15:24:38,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1092, Invalid=3330, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 15:24:38,773 INFO L87 Difference]: Start difference. First operand 323 states and 323 transitions. Second operand 67 states. [2018-10-15 15:24:41,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:41,247 INFO L93 Difference]: Finished difference Result 344 states and 344 transitions. [2018-10-15 15:24:41,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-10-15 15:24:41,248 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 322 [2018-10-15 15:24:41,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:41,250 INFO L225 Difference]: With dead ends: 344 [2018-10-15 15:24:41,250 INFO L226 Difference]: Without dead ends: 340 [2018-10-15 15:24:41,251 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3067 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=5132, Invalid=11898, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 15:24:41,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-10-15 15:24:41,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 333. [2018-10-15 15:24:41,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-10-15 15:24:41,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 333 transitions. [2018-10-15 15:24:41,255 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 333 transitions. Word has length 322 [2018-10-15 15:24:41,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:41,256 INFO L481 AbstractCegarLoop]: Abstraction has 333 states and 333 transitions. [2018-10-15 15:24:41,256 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-15 15:24:41,256 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 333 transitions. [2018-10-15 15:24:41,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-10-15 15:24:41,258 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:41,258 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:41,258 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:41,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:41,259 INFO L82 PathProgramCache]: Analyzing trace with hash -858073622, now seen corresponding path program 32 times [2018-10-15 15:24:41,259 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:41,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:42,705 INFO L134 CoverageAnalysis]: Checked inductivity of 5024 backedges. 0 proven. 5024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:24:42,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:42,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-15 15:24:42,706 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-15 15:24:42,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-15 15:24:42,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1159, Invalid=3533, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 15:24:42,707 INFO L87 Difference]: Start difference. First operand 333 states and 333 transitions. Second operand 69 states. [2018-10-15 15:24:45,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:45,559 INFO L93 Difference]: Finished difference Result 354 states and 354 transitions. [2018-10-15 15:24:45,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-10-15 15:24:45,559 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 332 [2018-10-15 15:24:45,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:45,562 INFO L225 Difference]: With dead ends: 354 [2018-10-15 15:24:45,562 INFO L226 Difference]: Without dead ends: 350 [2018-10-15 15:24:45,563 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3262 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5457, Invalid=12633, Unknown=0, NotChecked=0, Total=18090 [2018-10-15 15:24:45,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-10-15 15:24:45,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 343. [2018-10-15 15:24:45,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-10-15 15:24:45,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 343 transitions. [2018-10-15 15:24:45,567 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 343 transitions. Word has length 332 [2018-10-15 15:24:45,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:45,567 INFO L481 AbstractCegarLoop]: Abstraction has 343 states and 343 transitions. [2018-10-15 15:24:45,568 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-15 15:24:45,568 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 343 transitions. [2018-10-15 15:24:45,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-10-15 15:24:45,569 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:45,570 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:45,570 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:45,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:45,570 INFO L82 PathProgramCache]: Analyzing trace with hash -566190924, now seen corresponding path program 33 times [2018-10-15 15:24:45,571 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:45,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:47,249 INFO L134 CoverageAnalysis]: Checked inductivity of 5346 backedges. 0 proven. 5346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:24:47,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:47,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-15 15:24:47,250 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-15 15:24:47,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-15 15:24:47,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1228, Invalid=3742, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 15:24:47,251 INFO L87 Difference]: Start difference. First operand 343 states and 343 transitions. Second operand 71 states. [2018-10-15 15:24:50,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:50,020 INFO L93 Difference]: Finished difference Result 364 states and 364 transitions. [2018-10-15 15:24:50,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-10-15 15:24:50,021 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 342 [2018-10-15 15:24:50,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:50,023 INFO L225 Difference]: With dead ends: 364 [2018-10-15 15:24:50,023 INFO L226 Difference]: Without dead ends: 360 [2018-10-15 15:24:50,025 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3463 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5792, Invalid=13390, Unknown=0, NotChecked=0, Total=19182 [2018-10-15 15:24:50,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2018-10-15 15:24:50,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 353. [2018-10-15 15:24:50,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-10-15 15:24:50,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 353 transitions. [2018-10-15 15:24:50,029 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 353 transitions. Word has length 342 [2018-10-15 15:24:50,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:50,030 INFO L481 AbstractCegarLoop]: Abstraction has 353 states and 353 transitions. [2018-10-15 15:24:50,030 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-15 15:24:50,030 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 353 transitions. [2018-10-15 15:24:50,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-10-15 15:24:50,031 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:50,032 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:50,032 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:50,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:50,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1810108674, now seen corresponding path program 34 times [2018-10-15 15:24:50,033 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:50,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:51,866 INFO L134 CoverageAnalysis]: Checked inductivity of 5678 backedges. 0 proven. 5678 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:24:51,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:51,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-15 15:24:51,868 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-15 15:24:51,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-15 15:24:51,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1299, Invalid=3957, Unknown=0, NotChecked=0, Total=5256 [2018-10-15 15:24:51,869 INFO L87 Difference]: Start difference. First operand 353 states and 353 transitions. Second operand 73 states. [2018-10-15 15:24:54,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:54,703 INFO L93 Difference]: Finished difference Result 374 states and 374 transitions. [2018-10-15 15:24:54,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-10-15 15:24:54,703 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 352 [2018-10-15 15:24:54,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:54,705 INFO L225 Difference]: With dead ends: 374 [2018-10-15 15:24:54,705 INFO L226 Difference]: Without dead ends: 370 [2018-10-15 15:24:54,706 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3670 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6137, Invalid=14169, Unknown=0, NotChecked=0, Total=20306 [2018-10-15 15:24:54,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2018-10-15 15:24:54,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 363. [2018-10-15 15:24:54,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-10-15 15:24:54,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 363 transitions. [2018-10-15 15:24:54,711 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 363 transitions. Word has length 352 [2018-10-15 15:24:54,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:54,711 INFO L481 AbstractCegarLoop]: Abstraction has 363 states and 363 transitions. [2018-10-15 15:24:54,711 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-15 15:24:54,712 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 363 transitions. [2018-10-15 15:24:54,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2018-10-15 15:24:54,713 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:54,714 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 35, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:54,714 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:54,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:54,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1066691784, now seen corresponding path program 35 times [2018-10-15 15:24:54,715 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:54,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:56,616 INFO L134 CoverageAnalysis]: Checked inductivity of 6020 backedges. 0 proven. 6020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:24:56,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:56,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-15 15:24:56,616 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-15 15:24:56,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-15 15:24:56,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1372, Invalid=4178, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 15:24:56,617 INFO L87 Difference]: Start difference. First operand 363 states and 363 transitions. Second operand 75 states. [2018-10-15 15:24:59,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:59,683 INFO L93 Difference]: Finished difference Result 384 states and 384 transitions. [2018-10-15 15:24:59,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-10-15 15:24:59,683 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 362 [2018-10-15 15:24:59,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:59,685 INFO L225 Difference]: With dead ends: 384 [2018-10-15 15:24:59,685 INFO L226 Difference]: Without dead ends: 380 [2018-10-15 15:24:59,686 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3883 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6492, Invalid=14970, Unknown=0, NotChecked=0, Total=21462 [2018-10-15 15:24:59,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-10-15 15:24:59,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 373. [2018-10-15 15:24:59,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-10-15 15:24:59,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 373 transitions. [2018-10-15 15:24:59,690 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 373 transitions. Word has length 362 [2018-10-15 15:24:59,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:59,690 INFO L481 AbstractCegarLoop]: Abstraction has 373 states and 373 transitions. [2018-10-15 15:24:59,690 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-15 15:24:59,690 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 373 transitions. [2018-10-15 15:24:59,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2018-10-15 15:24:59,692 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:59,692 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:59,692 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:59,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:59,692 INFO L82 PathProgramCache]: Analyzing trace with hash 482981394, now seen corresponding path program 36 times [2018-10-15 15:24:59,693 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:59,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:25:01,551 INFO L134 CoverageAnalysis]: Checked inductivity of 6372 backedges. 0 proven. 6372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:25:01,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:25:01,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-15 15:25:01,552 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-15 15:25:01,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-15 15:25:01,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1447, Invalid=4405, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 15:25:01,553 INFO L87 Difference]: Start difference. First operand 373 states and 373 transitions. Second operand 77 states. [2018-10-15 15:25:04,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:25:04,376 INFO L93 Difference]: Finished difference Result 394 states and 394 transitions. [2018-10-15 15:25:04,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-10-15 15:25:04,376 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 372 [2018-10-15 15:25:04,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:25:04,379 INFO L225 Difference]: With dead ends: 394 [2018-10-15 15:25:04,379 INFO L226 Difference]: Without dead ends: 390 [2018-10-15 15:25:04,380 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4102 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6857, Invalid=15793, Unknown=0, NotChecked=0, Total=22650 [2018-10-15 15:25:04,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2018-10-15 15:25:04,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 383. [2018-10-15 15:25:04,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-10-15 15:25:04,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 383 transitions. [2018-10-15 15:25:04,386 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 383 transitions. Word has length 372 [2018-10-15 15:25:04,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:25:04,386 INFO L481 AbstractCegarLoop]: Abstraction has 383 states and 383 transitions. [2018-10-15 15:25:04,386 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-15 15:25:04,386 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 383 transitions. [2018-10-15 15:25:04,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2018-10-15 15:25:04,388 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:25:04,388 INFO L375 BasicCegarLoop]: trace histogram [38, 37, 37, 37, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:25:04,389 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:25:04,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:25:04,389 INFO L82 PathProgramCache]: Analyzing trace with hash -53253412, now seen corresponding path program 37 times [2018-10-15 15:25:04,390 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:25:04,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:25:06,479 INFO L134 CoverageAnalysis]: Checked inductivity of 6734 backedges. 0 proven. 6734 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:25:06,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:25:06,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-15 15:25:06,480 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-15 15:25:06,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-15 15:25:06,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1524, Invalid=4638, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 15:25:06,481 INFO L87 Difference]: Start difference. First operand 383 states and 383 transitions. Second operand 79 states. [2018-10-15 15:25:09,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:25:09,512 INFO L93 Difference]: Finished difference Result 404 states and 404 transitions. [2018-10-15 15:25:09,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-10-15 15:25:09,513 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 382 [2018-10-15 15:25:09,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:25:09,514 INFO L225 Difference]: With dead ends: 404 [2018-10-15 15:25:09,514 INFO L226 Difference]: Without dead ends: 400 [2018-10-15 15:25:09,516 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4327 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=7232, Invalid=16638, Unknown=0, NotChecked=0, Total=23870 [2018-10-15 15:25:09,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2018-10-15 15:25:09,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 393. [2018-10-15 15:25:09,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-10-15 15:25:09,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 393 transitions. [2018-10-15 15:25:09,521 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 393 transitions. Word has length 382 [2018-10-15 15:25:09,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:25:09,521 INFO L481 AbstractCegarLoop]: Abstraction has 393 states and 393 transitions. [2018-10-15 15:25:09,521 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-15 15:25:09,522 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 393 transitions. [2018-10-15 15:25:09,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2018-10-15 15:25:09,523 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:25:09,524 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:25:09,524 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:25:09,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:25:09,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1874930470, now seen corresponding path program 38 times [2018-10-15 15:25:09,525 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:25:09,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:25:11,651 INFO L134 CoverageAnalysis]: Checked inductivity of 7106 backedges. 0 proven. 7106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:25:11,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:25:11,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-15 15:25:11,652 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-15 15:25:11,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-15 15:25:11,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1603, Invalid=4877, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 15:25:11,653 INFO L87 Difference]: Start difference. First operand 393 states and 393 transitions. Second operand 81 states. [2018-10-15 15:25:15,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:25:15,159 INFO L93 Difference]: Finished difference Result 414 states and 414 transitions. [2018-10-15 15:25:15,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-10-15 15:25:15,159 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 392 [2018-10-15 15:25:15,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:25:15,161 INFO L225 Difference]: With dead ends: 414 [2018-10-15 15:25:15,161 INFO L226 Difference]: Without dead ends: 410 [2018-10-15 15:25:15,163 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4558 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7617, Invalid=17505, Unknown=0, NotChecked=0, Total=25122 [2018-10-15 15:25:15,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-10-15 15:25:15,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 403. [2018-10-15 15:25:15,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-10-15 15:25:15,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 403 transitions. [2018-10-15 15:25:15,167 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 403 transitions. Word has length 392 [2018-10-15 15:25:15,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:25:15,167 INFO L481 AbstractCegarLoop]: Abstraction has 403 states and 403 transitions. [2018-10-15 15:25:15,167 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-15 15:25:15,167 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 403 transitions. [2018-10-15 15:25:15,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2018-10-15 15:25:15,169 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:25:15,169 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 39, 39, 39, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:25:15,169 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:25:15,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:25:15,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1855624944, now seen corresponding path program 39 times [2018-10-15 15:25:15,170 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:25:15,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:25:17,458 INFO L134 CoverageAnalysis]: Checked inductivity of 7488 backedges. 0 proven. 7488 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:25:17,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:25:17,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-15 15:25:17,460 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-15 15:25:17,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-15 15:25:17,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1684, Invalid=5122, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 15:25:17,461 INFO L87 Difference]: Start difference. First operand 403 states and 403 transitions. Second operand 83 states. [2018-10-15 15:25:20,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:25:20,984 INFO L93 Difference]: Finished difference Result 424 states and 424 transitions. [2018-10-15 15:25:20,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-10-15 15:25:20,985 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 402 [2018-10-15 15:25:20,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:25:20,987 INFO L225 Difference]: With dead ends: 424 [2018-10-15 15:25:20,987 INFO L226 Difference]: Without dead ends: 420 [2018-10-15 15:25:20,989 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4795 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=8012, Invalid=18394, Unknown=0, NotChecked=0, Total=26406 [2018-10-15 15:25:20,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2018-10-15 15:25:20,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 413. [2018-10-15 15:25:20,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2018-10-15 15:25:20,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 413 transitions. [2018-10-15 15:25:20,993 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 413 transitions. Word has length 402 [2018-10-15 15:25:20,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:25:20,994 INFO L481 AbstractCegarLoop]: Abstraction has 413 states and 413 transitions. [2018-10-15 15:25:20,994 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-15 15:25:20,994 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 413 transitions. [2018-10-15 15:25:20,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2018-10-15 15:25:20,996 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:25:20,996 INFO L375 BasicCegarLoop]: trace histogram [41, 40, 40, 40, 40, 40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:25:20,997 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:25:20,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:25:20,997 INFO L82 PathProgramCache]: Analyzing trace with hash -2057351622, now seen corresponding path program 40 times [2018-10-15 15:25:20,998 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:25:21,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:25:23,267 INFO L134 CoverageAnalysis]: Checked inductivity of 7880 backedges. 0 proven. 7880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:25:23,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:25:23,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-15 15:25:23,268 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-15 15:25:23,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-15 15:25:23,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1767, Invalid=5373, Unknown=0, NotChecked=0, Total=7140 [2018-10-15 15:25:23,269 INFO L87 Difference]: Start difference. First operand 413 states and 413 transitions. Second operand 85 states. [2018-10-15 15:25:27,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:25:27,029 INFO L93 Difference]: Finished difference Result 434 states and 434 transitions. [2018-10-15 15:25:27,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-10-15 15:25:27,030 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 412 [2018-10-15 15:25:27,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:25:27,032 INFO L225 Difference]: With dead ends: 434 [2018-10-15 15:25:27,033 INFO L226 Difference]: Without dead ends: 430 [2018-10-15 15:25:27,034 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5038 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=8417, Invalid=19305, Unknown=0, NotChecked=0, Total=27722 [2018-10-15 15:25:27,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2018-10-15 15:25:27,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 423. [2018-10-15 15:25:27,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-10-15 15:25:27,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 423 transitions. [2018-10-15 15:25:27,038 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 423 transitions. Word has length 412 [2018-10-15 15:25:27,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:25:27,039 INFO L481 AbstractCegarLoop]: Abstraction has 423 states and 423 transitions. [2018-10-15 15:25:27,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-15 15:25:27,039 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 423 transitions. [2018-10-15 15:25:27,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2018-10-15 15:25:27,041 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:25:27,042 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 41, 41, 41, 41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:25:27,042 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:25:27,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:25:27,042 INFO L82 PathProgramCache]: Analyzing trace with hash 2097606916, now seen corresponding path program 41 times [2018-10-15 15:25:27,043 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:25:27,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:25:29,297 INFO L134 CoverageAnalysis]: Checked inductivity of 8282 backedges. 0 proven. 8282 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:25:29,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:25:29,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-15 15:25:29,297 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-15 15:25:29,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-15 15:25:29,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1852, Invalid=5630, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 15:25:29,306 INFO L87 Difference]: Start difference. First operand 423 states and 423 transitions. Second operand 87 states. [2018-10-15 15:25:33,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:25:33,394 INFO L93 Difference]: Finished difference Result 444 states and 444 transitions. [2018-10-15 15:25:33,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-10-15 15:25:33,399 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 422 [2018-10-15 15:25:33,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:25:33,401 INFO L225 Difference]: With dead ends: 444 [2018-10-15 15:25:33,401 INFO L226 Difference]: Without dead ends: 440 [2018-10-15 15:25:33,403 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5287 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8832, Invalid=20238, Unknown=0, NotChecked=0, Total=29070 [2018-10-15 15:25:33,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2018-10-15 15:25:33,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 433. [2018-10-15 15:25:33,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2018-10-15 15:25:33,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 433 transitions. [2018-10-15 15:25:33,407 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 433 transitions. Word has length 422 [2018-10-15 15:25:33,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:25:33,408 INFO L481 AbstractCegarLoop]: Abstraction has 433 states and 433 transitions. [2018-10-15 15:25:33,408 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-15 15:25:33,408 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 433 transitions. [2018-10-15 15:25:33,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2018-10-15 15:25:33,410 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:25:33,411 INFO L375 BasicCegarLoop]: trace histogram [43, 42, 42, 42, 42, 42, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:25:33,411 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:25:33,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:25:33,411 INFO L82 PathProgramCache]: Analyzing trace with hash -2055135410, now seen corresponding path program 42 times [2018-10-15 15:25:33,412 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:25:33,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:25:35,974 INFO L134 CoverageAnalysis]: Checked inductivity of 8694 backedges. 0 proven. 8694 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:25:35,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:25:35,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-15 15:25:35,975 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-15 15:25:35,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-15 15:25:35,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1939, Invalid=5893, Unknown=0, NotChecked=0, Total=7832 [2018-10-15 15:25:35,976 INFO L87 Difference]: Start difference. First operand 433 states and 433 transitions. Second operand 89 states. [2018-10-15 15:25:39,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:25:39,745 INFO L93 Difference]: Finished difference Result 454 states and 454 transitions. [2018-10-15 15:25:39,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-10-15 15:25:39,745 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 432 [2018-10-15 15:25:39,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:25:39,748 INFO L225 Difference]: With dead ends: 454 [2018-10-15 15:25:39,748 INFO L226 Difference]: Without dead ends: 450 [2018-10-15 15:25:39,749 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5542 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=9257, Invalid=21193, Unknown=0, NotChecked=0, Total=30450 [2018-10-15 15:25:39,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2018-10-15 15:25:39,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 443. [2018-10-15 15:25:39,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2018-10-15 15:25:39,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 443 transitions. [2018-10-15 15:25:39,754 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 443 transitions. Word has length 432 [2018-10-15 15:25:39,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:25:39,754 INFO L481 AbstractCegarLoop]: Abstraction has 443 states and 443 transitions. [2018-10-15 15:25:39,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-15 15:25:39,754 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 443 transitions. [2018-10-15 15:25:39,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2018-10-15 15:25:39,757 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:25:39,757 INFO L375 BasicCegarLoop]: trace histogram [44, 43, 43, 43, 43, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:25:39,757 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:25:39,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:25:39,758 INFO L82 PathProgramCache]: Analyzing trace with hash -541755112, now seen corresponding path program 43 times [2018-10-15 15:25:39,758 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:25:39,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:25:42,466 INFO L134 CoverageAnalysis]: Checked inductivity of 9116 backedges. 0 proven. 9116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:25:42,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:25:42,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-15 15:25:42,467 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-15 15:25:42,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-15 15:25:42,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2028, Invalid=6162, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 15:25:42,468 INFO L87 Difference]: Start difference. First operand 443 states and 443 transitions. Second operand 91 states. [2018-10-15 15:25:46,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:25:46,614 INFO L93 Difference]: Finished difference Result 464 states and 464 transitions. [2018-10-15 15:25:46,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-10-15 15:25:46,615 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 442 [2018-10-15 15:25:46,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:25:46,617 INFO L225 Difference]: With dead ends: 464 [2018-10-15 15:25:46,618 INFO L226 Difference]: Without dead ends: 460 [2018-10-15 15:25:46,620 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5803 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=9692, Invalid=22170, Unknown=0, NotChecked=0, Total=31862 [2018-10-15 15:25:46,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2018-10-15 15:25:46,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 453. [2018-10-15 15:25:46,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453 states. [2018-10-15 15:25:46,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 453 transitions. [2018-10-15 15:25:46,623 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 453 transitions. Word has length 442 [2018-10-15 15:25:46,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:25:46,623 INFO L481 AbstractCegarLoop]: Abstraction has 453 states and 453 transitions. [2018-10-15 15:25:46,624 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-15 15:25:46,624 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 453 transitions. [2018-10-15 15:25:46,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2018-10-15 15:25:46,625 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:25:46,625 INFO L375 BasicCegarLoop]: trace histogram [45, 44, 44, 44, 44, 44, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:25:46,626 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:25:46,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:25:46,626 INFO L82 PathProgramCache]: Analyzing trace with hash 126066274, now seen corresponding path program 44 times [2018-10-15 15:25:46,626 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:25:46,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:25:49,141 INFO L134 CoverageAnalysis]: Checked inductivity of 9548 backedges. 0 proven. 9548 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:25:49,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:25:49,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-15 15:25:49,141 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-15 15:25:49,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-15 15:25:49,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2119, Invalid=6437, Unknown=0, NotChecked=0, Total=8556 [2018-10-15 15:25:49,142 INFO L87 Difference]: Start difference. First operand 453 states and 453 transitions. Second operand 93 states. [2018-10-15 15:25:53,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:25:53,543 INFO L93 Difference]: Finished difference Result 474 states and 474 transitions. [2018-10-15 15:25:53,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-10-15 15:25:53,544 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 452 [2018-10-15 15:25:53,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:25:53,547 INFO L225 Difference]: With dead ends: 474 [2018-10-15 15:25:53,547 INFO L226 Difference]: Without dead ends: 470 [2018-10-15 15:25:53,548 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6070 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=10137, Invalid=23169, Unknown=0, NotChecked=0, Total=33306 [2018-10-15 15:25:53,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-10-15 15:25:53,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 463. [2018-10-15 15:25:53,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2018-10-15 15:25:53,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 463 transitions. [2018-10-15 15:25:53,553 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 463 transitions. Word has length 452 [2018-10-15 15:25:53,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:25:53,554 INFO L481 AbstractCegarLoop]: Abstraction has 463 states and 463 transitions. [2018-10-15 15:25:53,554 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-15 15:25:53,554 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 463 transitions. [2018-10-15 15:25:53,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2018-10-15 15:25:53,556 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:25:53,556 INFO L375 BasicCegarLoop]: trace histogram [46, 45, 45, 45, 45, 45, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:25:53,557 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:25:53,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:25:53,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1573072684, now seen corresponding path program 45 times [2018-10-15 15:25:53,558 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:25:53,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:25:56,435 INFO L134 CoverageAnalysis]: Checked inductivity of 9990 backedges. 0 proven. 9990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:25:56,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:25:56,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-10-15 15:25:56,436 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-15 15:25:56,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-15 15:25:56,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2212, Invalid=6718, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 15:25:56,437 INFO L87 Difference]: Start difference. First operand 463 states and 463 transitions. Second operand 95 states. [2018-10-15 15:26:00,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:26:00,733 INFO L93 Difference]: Finished difference Result 484 states and 484 transitions. [2018-10-15 15:26:00,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2018-10-15 15:26:00,733 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 462 [2018-10-15 15:26:00,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:26:00,735 INFO L225 Difference]: With dead ends: 484 [2018-10-15 15:26:00,735 INFO L226 Difference]: Without dead ends: 480 [2018-10-15 15:26:00,737 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6343 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=10592, Invalid=24190, Unknown=0, NotChecked=0, Total=34782 [2018-10-15 15:26:00,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2018-10-15 15:26:00,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 473. [2018-10-15 15:26:00,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2018-10-15 15:26:00,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 473 transitions. [2018-10-15 15:26:00,742 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 473 transitions. Word has length 462 [2018-10-15 15:26:00,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:26:00,743 INFO L481 AbstractCegarLoop]: Abstraction has 473 states and 473 transitions. [2018-10-15 15:26:00,743 INFO L482 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-15 15:26:00,743 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 473 transitions. [2018-10-15 15:26:00,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2018-10-15 15:26:00,745 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:26:00,745 INFO L375 BasicCegarLoop]: trace histogram [47, 46, 46, 46, 46, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:26:00,745 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:26:00,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:26:00,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1380174710, now seen corresponding path program 46 times [2018-10-15 15:26:00,746 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:26:00,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:26:03,592 INFO L134 CoverageAnalysis]: Checked inductivity of 10442 backedges. 0 proven. 10442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:26:03,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:26:03,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-10-15 15:26:03,593 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-15 15:26:03,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-15 15:26:03,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2307, Invalid=7005, Unknown=0, NotChecked=0, Total=9312 [2018-10-15 15:26:03,594 INFO L87 Difference]: Start difference. First operand 473 states and 473 transitions. Second operand 97 states. [2018-10-15 15:26:08,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:26:08,628 INFO L93 Difference]: Finished difference Result 494 states and 494 transitions. [2018-10-15 15:26:08,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-10-15 15:26:08,628 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 472 [2018-10-15 15:26:08,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:26:08,631 INFO L225 Difference]: With dead ends: 494 [2018-10-15 15:26:08,631 INFO L226 Difference]: Without dead ends: 490 [2018-10-15 15:26:08,633 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6622 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=11057, Invalid=25233, Unknown=0, NotChecked=0, Total=36290 [2018-10-15 15:26:08,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2018-10-15 15:26:08,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 483. [2018-10-15 15:26:08,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2018-10-15 15:26:08,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 483 transitions. [2018-10-15 15:26:08,638 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 483 transitions. Word has length 472 [2018-10-15 15:26:08,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:26:08,638 INFO L481 AbstractCegarLoop]: Abstraction has 483 states and 483 transitions. [2018-10-15 15:26:08,639 INFO L482 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-15 15:26:08,639 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 483 transitions. [2018-10-15 15:26:08,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2018-10-15 15:26:08,641 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:26:08,641 INFO L375 BasicCegarLoop]: trace histogram [48, 47, 47, 47, 47, 47, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:26:08,642 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:26:08,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:26:08,642 INFO L82 PathProgramCache]: Analyzing trace with hash 231543616, now seen corresponding path program 47 times [2018-10-15 15:26:08,643 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:26:08,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:26:11,896 INFO L134 CoverageAnalysis]: Checked inductivity of 10904 backedges. 0 proven. 10904 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:26:11,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:26:11,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-10-15 15:26:11,897 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-15 15:26:11,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-15 15:26:11,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2404, Invalid=7298, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 15:26:11,898 INFO L87 Difference]: Start difference. First operand 483 states and 483 transitions. Second operand 99 states. [2018-10-15 15:26:16,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:26:16,797 INFO L93 Difference]: Finished difference Result 504 states and 504 transitions. [2018-10-15 15:26:16,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-10-15 15:26:16,797 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 482 [2018-10-15 15:26:16,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:26:16,800 INFO L225 Difference]: With dead ends: 504 [2018-10-15 15:26:16,800 INFO L226 Difference]: Without dead ends: 500 [2018-10-15 15:26:16,801 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6907 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=11532, Invalid=26298, Unknown=0, NotChecked=0, Total=37830 [2018-10-15 15:26:16,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2018-10-15 15:26:16,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 493. [2018-10-15 15:26:16,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2018-10-15 15:26:16,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 493 transitions. [2018-10-15 15:26:16,805 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 493 transitions. Word has length 482 [2018-10-15 15:26:16,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:26:16,806 INFO L481 AbstractCegarLoop]: Abstraction has 493 states and 493 transitions. [2018-10-15 15:26:16,806 INFO L482 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-15 15:26:16,806 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 493 transitions. [2018-10-15 15:26:16,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2018-10-15 15:26:16,808 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:26:16,808 INFO L375 BasicCegarLoop]: trace histogram [49, 48, 48, 48, 48, 48, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:26:16,808 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:26:16,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:26:16,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1675712886, now seen corresponding path program 48 times [2018-10-15 15:26:16,809 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:26:16,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:26:19,718 INFO L134 CoverageAnalysis]: Checked inductivity of 11376 backedges. 0 proven. 11376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:26:19,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:26:19,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-10-15 15:26:19,719 INFO L460 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-10-15 15:26:19,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-10-15 15:26:19,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2503, Invalid=7597, Unknown=0, NotChecked=0, Total=10100 [2018-10-15 15:26:19,720 INFO L87 Difference]: Start difference. First operand 493 states and 493 transitions. Second operand 101 states. [2018-10-15 15:26:24,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:26:24,908 INFO L93 Difference]: Finished difference Result 514 states and 514 transitions. [2018-10-15 15:26:24,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2018-10-15 15:26:24,908 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 492 [2018-10-15 15:26:24,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:26:24,910 INFO L225 Difference]: With dead ends: 514 [2018-10-15 15:26:24,910 INFO L226 Difference]: Without dead ends: 510 [2018-10-15 15:26:24,911 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7198 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=12017, Invalid=27385, Unknown=0, NotChecked=0, Total=39402 [2018-10-15 15:26:24,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2018-10-15 15:26:24,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 503. [2018-10-15 15:26:24,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2018-10-15 15:26:24,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 503 transitions. [2018-10-15 15:26:24,915 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 503 transitions. Word has length 492 [2018-10-15 15:26:24,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:26:24,916 INFO L481 AbstractCegarLoop]: Abstraction has 503 states and 503 transitions. [2018-10-15 15:26:24,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-10-15 15:26:24,916 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 503 transitions. [2018-10-15 15:26:24,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2018-10-15 15:26:24,918 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:26:24,918 INFO L375 BasicCegarLoop]: trace histogram [50, 49, 49, 49, 49, 49, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:26:24,918 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:26:24,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:26:24,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1779423916, now seen corresponding path program 49 times [2018-10-15 15:26:24,920 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:26:24,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:26:28,268 INFO L134 CoverageAnalysis]: Checked inductivity of 11858 backedges. 0 proven. 11858 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:26:28,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:26:28,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-10-15 15:26:28,269 INFO L460 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-10-15 15:26:28,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-10-15 15:26:28,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2604, Invalid=7902, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 15:26:28,270 INFO L87 Difference]: Start difference. First operand 503 states and 503 transitions. Second operand 103 states. [2018-10-15 15:26:33,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:26:33,577 INFO L93 Difference]: Finished difference Result 524 states and 524 transitions. [2018-10-15 15:26:33,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-10-15 15:26:33,577 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 502 [2018-10-15 15:26:33,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:26:33,605 INFO L225 Difference]: With dead ends: 524 [2018-10-15 15:26:33,606 INFO L226 Difference]: Without dead ends: 520 [2018-10-15 15:26:33,607 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7495 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=12512, Invalid=28494, Unknown=0, NotChecked=0, Total=41006 [2018-10-15 15:26:33,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2018-10-15 15:26:33,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 513. [2018-10-15 15:26:33,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-10-15 15:26:33,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 513 transitions. [2018-10-15 15:26:33,612 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 513 transitions. Word has length 502 [2018-10-15 15:26:33,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:26:33,613 INFO L481 AbstractCegarLoop]: Abstraction has 513 states and 513 transitions. [2018-10-15 15:26:33,613 INFO L482 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-10-15 15:26:33,613 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 513 transitions. [2018-10-15 15:26:33,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 513 [2018-10-15 15:26:33,615 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:26:33,616 INFO L375 BasicCegarLoop]: trace histogram [51, 50, 50, 50, 50, 50, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:26:33,616 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:26:33,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:26:33,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1257320350, now seen corresponding path program 50 times [2018-10-15 15:26:33,617 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:26:33,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:26:36,760 INFO L134 CoverageAnalysis]: Checked inductivity of 12350 backedges. 0 proven. 12350 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:26:36,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:26:36,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-10-15 15:26:36,761 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-10-15 15:26:36,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-10-15 15:26:36,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2707, Invalid=8213, Unknown=0, NotChecked=0, Total=10920 [2018-10-15 15:26:36,762 INFO L87 Difference]: Start difference. First operand 513 states and 513 transitions. Second operand 105 states. [2018-10-15 15:26:42,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:26:42,387 INFO L93 Difference]: Finished difference Result 534 states and 534 transitions. [2018-10-15 15:26:42,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2018-10-15 15:26:42,388 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 512 [2018-10-15 15:26:42,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:26:42,390 INFO L225 Difference]: With dead ends: 534 [2018-10-15 15:26:42,390 INFO L226 Difference]: Without dead ends: 530 [2018-10-15 15:26:42,392 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7798 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=13017, Invalid=29625, Unknown=0, NotChecked=0, Total=42642 [2018-10-15 15:26:42,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2018-10-15 15:26:42,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 523. [2018-10-15 15:26:42,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2018-10-15 15:26:42,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 523 transitions. [2018-10-15 15:26:42,396 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 523 transitions. Word has length 512 [2018-10-15 15:26:42,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:26:42,396 INFO L481 AbstractCegarLoop]: Abstraction has 523 states and 523 transitions. [2018-10-15 15:26:42,396 INFO L482 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-10-15 15:26:42,396 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 523 transitions. [2018-10-15 15:26:42,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 523 [2018-10-15 15:26:42,399 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:26:42,399 INFO L375 BasicCegarLoop]: trace histogram [52, 51, 51, 51, 51, 51, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:26:42,399 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:26:42,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:26:42,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1808360808, now seen corresponding path program 51 times [2018-10-15 15:26:42,400 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:26:42,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:26:45,741 INFO L134 CoverageAnalysis]: Checked inductivity of 12852 backedges. 0 proven. 12852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:26:45,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:26:45,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-10-15 15:26:45,742 INFO L460 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-10-15 15:26:45,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-10-15 15:26:45,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2812, Invalid=8530, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 15:26:45,744 INFO L87 Difference]: Start difference. First operand 523 states and 523 transitions. Second operand 107 states. [2018-10-15 15:26:51,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:26:51,431 INFO L93 Difference]: Finished difference Result 544 states and 544 transitions. [2018-10-15 15:26:51,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2018-10-15 15:26:51,432 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 522 [2018-10-15 15:26:51,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:26:51,435 INFO L225 Difference]: With dead ends: 544 [2018-10-15 15:26:51,435 INFO L226 Difference]: Without dead ends: 540 [2018-10-15 15:26:51,437 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8107 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=13532, Invalid=30778, Unknown=0, NotChecked=0, Total=44310 [2018-10-15 15:26:51,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2018-10-15 15:26:51,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 533. [2018-10-15 15:26:51,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2018-10-15 15:26:51,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 533 transitions. [2018-10-15 15:26:51,441 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 533 transitions. Word has length 522 [2018-10-15 15:26:51,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:26:51,441 INFO L481 AbstractCegarLoop]: Abstraction has 533 states and 533 transitions. [2018-10-15 15:26:51,441 INFO L482 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-10-15 15:26:51,441 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 533 transitions. [2018-10-15 15:26:51,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2018-10-15 15:26:51,443 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:26:51,443 INFO L375 BasicCegarLoop]: trace histogram [53, 52, 52, 52, 52, 52, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:26:51,444 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:26:51,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:26:51,444 INFO L82 PathProgramCache]: Analyzing trace with hash 874014386, now seen corresponding path program 52 times [2018-10-15 15:26:51,444 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:26:51,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:26:55,181 INFO L134 CoverageAnalysis]: Checked inductivity of 13364 backedges. 0 proven. 13364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:26:55,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:26:55,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-10-15 15:26:55,182 INFO L460 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-10-15 15:26:55,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-10-15 15:26:55,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2919, Invalid=8853, Unknown=0, NotChecked=0, Total=11772 [2018-10-15 15:26:55,183 INFO L87 Difference]: Start difference. First operand 533 states and 533 transitions. Second operand 109 states. [2018-10-15 15:27:01,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:27:01,098 INFO L93 Difference]: Finished difference Result 554 states and 554 transitions. [2018-10-15 15:27:01,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2018-10-15 15:27:01,098 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 532 [2018-10-15 15:27:01,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:27:01,100 INFO L225 Difference]: With dead ends: 554 [2018-10-15 15:27:01,100 INFO L226 Difference]: Without dead ends: 550 [2018-10-15 15:27:01,101 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8422 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=14057, Invalid=31953, Unknown=0, NotChecked=0, Total=46010 [2018-10-15 15:27:01,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2018-10-15 15:27:01,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 543. [2018-10-15 15:27:01,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2018-10-15 15:27:01,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 543 transitions. [2018-10-15 15:27:01,106 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 543 transitions. Word has length 532 [2018-10-15 15:27:01,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:27:01,106 INFO L481 AbstractCegarLoop]: Abstraction has 543 states and 543 transitions. [2018-10-15 15:27:01,106 INFO L482 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-10-15 15:27:01,106 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 543 transitions. [2018-10-15 15:27:01,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2018-10-15 15:27:01,108 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:27:01,108 INFO L375 BasicCegarLoop]: trace histogram [54, 53, 53, 53, 53, 53, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:27:01,109 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:27:01,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:27:01,109 INFO L82 PathProgramCache]: Analyzing trace with hash 343266172, now seen corresponding path program 53 times [2018-10-15 15:27:01,110 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:27:01,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:27:04,862 INFO L134 CoverageAnalysis]: Checked inductivity of 13886 backedges. 0 proven. 13886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:27:04,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:27:04,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-10-15 15:27:04,863 INFO L460 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-10-15 15:27:04,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-10-15 15:27:04,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3028, Invalid=9182, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 15:27:04,865 INFO L87 Difference]: Start difference. First operand 543 states and 543 transitions. Second operand 111 states. [2018-10-15 15:27:10,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:27:10,941 INFO L93 Difference]: Finished difference Result 564 states and 564 transitions. [2018-10-15 15:27:10,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2018-10-15 15:27:10,942 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 542 [2018-10-15 15:27:10,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:27:10,945 INFO L225 Difference]: With dead ends: 564 [2018-10-15 15:27:10,945 INFO L226 Difference]: Without dead ends: 560 [2018-10-15 15:27:10,947 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8743 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=14592, Invalid=33150, Unknown=0, NotChecked=0, Total=47742 [2018-10-15 15:27:10,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2018-10-15 15:27:10,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 553. [2018-10-15 15:27:10,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2018-10-15 15:27:10,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 553 transitions. [2018-10-15 15:27:10,951 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 553 transitions. Word has length 542 [2018-10-15 15:27:10,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:27:10,951 INFO L481 AbstractCegarLoop]: Abstraction has 553 states and 553 transitions. [2018-10-15 15:27:10,951 INFO L482 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-10-15 15:27:10,951 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 553 transitions. [2018-10-15 15:27:10,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 553 [2018-10-15 15:27:10,953 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:27:10,954 INFO L375 BasicCegarLoop]: trace histogram [55, 54, 54, 54, 54, 54, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:27:10,954 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:27:10,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:27:10,954 INFO L82 PathProgramCache]: Analyzing trace with hash -596554810, now seen corresponding path program 54 times [2018-10-15 15:27:10,955 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:27:10,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:27:14,806 INFO L134 CoverageAnalysis]: Checked inductivity of 14418 backedges. 0 proven. 14418 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:27:14,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:27:14,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-10-15 15:27:14,807 INFO L460 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-10-15 15:27:14,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-10-15 15:27:14,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3139, Invalid=9517, Unknown=0, NotChecked=0, Total=12656 [2018-10-15 15:27:14,808 INFO L87 Difference]: Start difference. First operand 553 states and 553 transitions. Second operand 113 states. [2018-10-15 15:27:21,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:27:21,096 INFO L93 Difference]: Finished difference Result 574 states and 574 transitions. [2018-10-15 15:27:21,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2018-10-15 15:27:21,096 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 552 [2018-10-15 15:27:21,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:27:21,098 INFO L225 Difference]: With dead ends: 574 [2018-10-15 15:27:21,098 INFO L226 Difference]: Without dead ends: 570 [2018-10-15 15:27:21,100 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9070 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=15137, Invalid=34369, Unknown=0, NotChecked=0, Total=49506 [2018-10-15 15:27:21,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2018-10-15 15:27:21,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 563. [2018-10-15 15:27:21,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2018-10-15 15:27:21,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 563 transitions. [2018-10-15 15:27:21,104 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 563 transitions. Word has length 552 [2018-10-15 15:27:21,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:27:21,104 INFO L481 AbstractCegarLoop]: Abstraction has 563 states and 563 transitions. [2018-10-15 15:27:21,104 INFO L482 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-10-15 15:27:21,104 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 563 transitions. [2018-10-15 15:27:21,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 563 [2018-10-15 15:27:21,106 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:27:21,107 INFO L375 BasicCegarLoop]: trace histogram [56, 55, 55, 55, 55, 55, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:27:21,107 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:27:21,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:27:21,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1687318416, now seen corresponding path program 55 times [2018-10-15 15:27:21,108 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:27:21,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:27:25,330 INFO L134 CoverageAnalysis]: Checked inductivity of 14960 backedges. 0 proven. 14960 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:27:25,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:27:25,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-10-15 15:27:25,331 INFO L460 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-10-15 15:27:25,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-10-15 15:27:25,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3252, Invalid=9858, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 15:27:25,332 INFO L87 Difference]: Start difference. First operand 563 states and 563 transitions. Second operand 115 states. [2018-10-15 15:27:31,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:27:31,930 INFO L93 Difference]: Finished difference Result 584 states and 584 transitions. [2018-10-15 15:27:31,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2018-10-15 15:27:31,930 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 562 [2018-10-15 15:27:31,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:27:31,932 INFO L225 Difference]: With dead ends: 584 [2018-10-15 15:27:31,932 INFO L226 Difference]: Without dead ends: 580 [2018-10-15 15:27:31,933 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9403 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=15692, Invalid=35610, Unknown=0, NotChecked=0, Total=51302 [2018-10-15 15:27:31,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2018-10-15 15:27:31,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 573. [2018-10-15 15:27:31,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2018-10-15 15:27:31,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 573 transitions. [2018-10-15 15:27:31,937 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 573 transitions. Word has length 562 [2018-10-15 15:27:31,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:27:31,937 INFO L481 AbstractCegarLoop]: Abstraction has 573 states and 573 transitions. [2018-10-15 15:27:31,937 INFO L482 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-10-15 15:27:31,937 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 573 transitions. [2018-10-15 15:27:31,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2018-10-15 15:27:31,940 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:27:31,940 INFO L375 BasicCegarLoop]: trace histogram [57, 56, 56, 56, 56, 56, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:27:31,940 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:27:31,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:27:31,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1202135334, now seen corresponding path program 56 times [2018-10-15 15:27:31,941 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:27:31,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:27:36,048 INFO L134 CoverageAnalysis]: Checked inductivity of 15512 backedges. 0 proven. 15512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:27:36,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:27:36,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-10-15 15:27:36,049 INFO L460 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-10-15 15:27:36,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-10-15 15:27:36,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3367, Invalid=10205, Unknown=0, NotChecked=0, Total=13572 [2018-10-15 15:27:36,050 INFO L87 Difference]: Start difference. First operand 573 states and 573 transitions. Second operand 117 states. [2018-10-15 15:27:42,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:27:42,753 INFO L93 Difference]: Finished difference Result 594 states and 594 transitions. [2018-10-15 15:27:42,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2018-10-15 15:27:42,753 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 572 [2018-10-15 15:27:42,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:27:42,756 INFO L225 Difference]: With dead ends: 594 [2018-10-15 15:27:42,756 INFO L226 Difference]: Without dead ends: 590 [2018-10-15 15:27:42,758 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9742 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=16257, Invalid=36873, Unknown=0, NotChecked=0, Total=53130 [2018-10-15 15:27:42,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2018-10-15 15:27:42,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 583. [2018-10-15 15:27:42,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2018-10-15 15:27:42,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 583 transitions. [2018-10-15 15:27:42,763 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 583 transitions. Word has length 572 [2018-10-15 15:27:42,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:27:42,763 INFO L481 AbstractCegarLoop]: Abstraction has 583 states and 583 transitions. [2018-10-15 15:27:42,763 INFO L482 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-10-15 15:27:42,763 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 583 transitions. [2018-10-15 15:27:42,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 583 [2018-10-15 15:27:42,765 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:27:42,766 INFO L375 BasicCegarLoop]: trace histogram [58, 57, 57, 57, 57, 57, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:27:42,766 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:27:42,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:27:42,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1069794908, now seen corresponding path program 57 times [2018-10-15 15:27:42,767 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:27:42,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:27:47,173 INFO L134 CoverageAnalysis]: Checked inductivity of 16074 backedges. 0 proven. 16074 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:27:47,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:27:47,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-10-15 15:27:47,174 INFO L460 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-10-15 15:27:47,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-10-15 15:27:47,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3484, Invalid=10558, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 15:27:47,175 INFO L87 Difference]: Start difference. First operand 583 states and 583 transitions. Second operand 119 states. [2018-10-15 15:27:54,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:27:54,334 INFO L93 Difference]: Finished difference Result 604 states and 604 transitions. [2018-10-15 15:27:54,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2018-10-15 15:27:54,334 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 582 [2018-10-15 15:27:54,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:27:54,337 INFO L225 Difference]: With dead ends: 604 [2018-10-15 15:27:54,338 INFO L226 Difference]: Without dead ends: 600 [2018-10-15 15:27:54,339 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10087 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=16832, Invalid=38158, Unknown=0, NotChecked=0, Total=54990 [2018-10-15 15:27:54,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2018-10-15 15:27:54,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 593. [2018-10-15 15:27:54,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2018-10-15 15:27:54,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 593 transitions. [2018-10-15 15:27:54,343 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 593 transitions. Word has length 582 [2018-10-15 15:27:54,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:27:54,344 INFO L481 AbstractCegarLoop]: Abstraction has 593 states and 593 transitions. [2018-10-15 15:27:54,344 INFO L482 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-10-15 15:27:54,344 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 593 transitions. [2018-10-15 15:27:54,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 593 [2018-10-15 15:27:54,346 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:27:54,346 INFO L375 BasicCegarLoop]: trace histogram [59, 58, 58, 58, 58, 58, 58, 58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:27:54,347 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:27:54,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:27:54,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1806442478, now seen corresponding path program 58 times [2018-10-15 15:27:54,348 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:27:54,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:27:58,488 INFO L134 CoverageAnalysis]: Checked inductivity of 16646 backedges. 0 proven. 16646 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:27:58,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:27:58,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-10-15 15:27:58,489 INFO L460 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-10-15 15:27:58,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-10-15 15:27:58,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3603, Invalid=10917, Unknown=0, NotChecked=0, Total=14520 [2018-10-15 15:27:58,490 INFO L87 Difference]: Start difference. First operand 593 states and 593 transitions. Second operand 121 states. [2018-10-15 15:28:05,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:28:05,871 INFO L93 Difference]: Finished difference Result 614 states and 614 transitions. [2018-10-15 15:28:05,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2018-10-15 15:28:05,872 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 592 [2018-10-15 15:28:05,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:28:05,874 INFO L225 Difference]: With dead ends: 614 [2018-10-15 15:28:05,874 INFO L226 Difference]: Without dead ends: 610 [2018-10-15 15:28:05,876 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10438 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=17417, Invalid=39465, Unknown=0, NotChecked=0, Total=56882 [2018-10-15 15:28:05,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2018-10-15 15:28:05,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 603. [2018-10-15 15:28:05,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2018-10-15 15:28:05,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 603 transitions. [2018-10-15 15:28:05,880 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 603 transitions. Word has length 592 [2018-10-15 15:28:05,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:28:05,880 INFO L481 AbstractCegarLoop]: Abstraction has 603 states and 603 transitions. [2018-10-15 15:28:05,880 INFO L482 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-10-15 15:28:05,880 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 603 transitions. [2018-10-15 15:28:05,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 603 [2018-10-15 15:28:05,883 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:28:05,883 INFO L375 BasicCegarLoop]: trace histogram [60, 59, 59, 59, 59, 59, 59, 59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:28:05,883 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:28:05,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:28:05,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1527787960, now seen corresponding path program 59 times [2018-10-15 15:28:05,884 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:28:05,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:28:10,468 INFO L134 CoverageAnalysis]: Checked inductivity of 17228 backedges. 0 proven. 17228 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:28:10,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:28:10,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-10-15 15:28:10,469 INFO L460 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-10-15 15:28:10,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-10-15 15:28:10,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3724, Invalid=11282, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 15:28:10,471 INFO L87 Difference]: Start difference. First operand 603 states and 603 transitions. Second operand 123 states. [2018-10-15 15:28:17,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:28:17,850 INFO L93 Difference]: Finished difference Result 624 states and 624 transitions. [2018-10-15 15:28:17,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2018-10-15 15:28:17,850 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 602 [2018-10-15 15:28:17,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:28:17,852 INFO L225 Difference]: With dead ends: 624 [2018-10-15 15:28:17,852 INFO L226 Difference]: Without dead ends: 620 [2018-10-15 15:28:17,854 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10795 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=18012, Invalid=40794, Unknown=0, NotChecked=0, Total=58806 [2018-10-15 15:28:17,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2018-10-15 15:28:17,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 613. [2018-10-15 15:28:17,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2018-10-15 15:28:17,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 613 transitions. [2018-10-15 15:28:17,859 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 613 transitions. Word has length 602 [2018-10-15 15:28:17,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:28:17,860 INFO L481 AbstractCegarLoop]: Abstraction has 613 states and 613 transitions. [2018-10-15 15:28:17,860 INFO L482 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-10-15 15:28:17,860 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 613 transitions. [2018-10-15 15:28:17,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 613 [2018-10-15 15:28:17,862 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:28:17,863 INFO L375 BasicCegarLoop]: trace histogram [61, 60, 60, 60, 60, 60, 60, 60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:28:17,863 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:28:17,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:28:17,863 INFO L82 PathProgramCache]: Analyzing trace with hash 164105986, now seen corresponding path program 60 times [2018-10-15 15:28:17,864 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:28:17,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:28:22,688 INFO L134 CoverageAnalysis]: Checked inductivity of 17820 backedges. 0 proven. 17820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:28:22,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:28:22,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-10-15 15:28:22,689 INFO L460 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-10-15 15:28:22,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-10-15 15:28:22,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3847, Invalid=11653, Unknown=0, NotChecked=0, Total=15500 [2018-10-15 15:28:22,690 INFO L87 Difference]: Start difference. First operand 613 states and 613 transitions. Second operand 125 states. [2018-10-15 15:28:30,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:28:30,484 INFO L93 Difference]: Finished difference Result 634 states and 634 transitions. [2018-10-15 15:28:30,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2018-10-15 15:28:30,484 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 612 [2018-10-15 15:28:30,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:28:30,487 INFO L225 Difference]: With dead ends: 634 [2018-10-15 15:28:30,487 INFO L226 Difference]: Without dead ends: 630 [2018-10-15 15:28:30,489 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11158 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=18617, Invalid=42145, Unknown=0, NotChecked=0, Total=60762 [2018-10-15 15:28:30,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2018-10-15 15:28:30,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 623. [2018-10-15 15:28:30,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2018-10-15 15:28:30,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 623 transitions. [2018-10-15 15:28:30,493 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 623 transitions. Word has length 612 [2018-10-15 15:28:30,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:28:30,494 INFO L481 AbstractCegarLoop]: Abstraction has 623 states and 623 transitions. [2018-10-15 15:28:30,494 INFO L482 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-10-15 15:28:30,494 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 623 transitions. [2018-10-15 15:28:30,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 623 [2018-10-15 15:28:30,496 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:28:30,497 INFO L375 BasicCegarLoop]: trace histogram [62, 61, 61, 61, 61, 61, 61, 61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:28:30,497 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:28:30,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:28:30,497 INFO L82 PathProgramCache]: Analyzing trace with hash 2016106444, now seen corresponding path program 61 times [2018-10-15 15:28:30,498 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:28:30,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:28:35,284 INFO L134 CoverageAnalysis]: Checked inductivity of 18422 backedges. 0 proven. 18422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:28:35,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:28:35,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-10-15 15:28:35,285 INFO L460 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-10-15 15:28:35,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-10-15 15:28:35,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3972, Invalid=12030, Unknown=0, NotChecked=0, Total=16002 [2018-10-15 15:28:35,286 INFO L87 Difference]: Start difference. First operand 623 states and 623 transitions. Second operand 127 states. [2018-10-15 15:28:42,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:28:42,979 INFO L93 Difference]: Finished difference Result 644 states and 644 transitions. [2018-10-15 15:28:42,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 188 states. [2018-10-15 15:28:42,979 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 622 [2018-10-15 15:28:42,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:28:42,982 INFO L225 Difference]: With dead ends: 644 [2018-10-15 15:28:42,982 INFO L226 Difference]: Without dead ends: 640 [2018-10-15 15:28:42,984 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11527 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=19232, Invalid=43518, Unknown=0, NotChecked=0, Total=62750 [2018-10-15 15:28:42,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2018-10-15 15:28:42,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 633. [2018-10-15 15:28:42,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2018-10-15 15:28:42,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 633 transitions. [2018-10-15 15:28:42,988 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 633 transitions. Word has length 622 [2018-10-15 15:28:42,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:28:42,989 INFO L481 AbstractCegarLoop]: Abstraction has 633 states and 633 transitions. [2018-10-15 15:28:42,989 INFO L482 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-10-15 15:28:42,989 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 633 transitions. [2018-10-15 15:28:42,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 633 [2018-10-15 15:28:42,991 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:28:42,992 INFO L375 BasicCegarLoop]: trace histogram [63, 62, 62, 62, 62, 62, 62, 62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:28:42,992 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:28:42,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:28:42,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1435085846, now seen corresponding path program 62 times [2018-10-15 15:28:42,993 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:28:43,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:28:48,034 INFO L134 CoverageAnalysis]: Checked inductivity of 19034 backedges. 0 proven. 19034 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:28:48,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:28:48,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-10-15 15:28:48,035 INFO L460 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-10-15 15:28:48,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-10-15 15:28:48,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4099, Invalid=12413, Unknown=0, NotChecked=0, Total=16512 [2018-10-15 15:28:48,036 INFO L87 Difference]: Start difference. First operand 633 states and 633 transitions. Second operand 129 states. [2018-10-15 15:28:56,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:28:56,547 INFO L93 Difference]: Finished difference Result 654 states and 654 transitions. [2018-10-15 15:28:56,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 191 states. [2018-10-15 15:28:56,547 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 632 [2018-10-15 15:28:56,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:28:56,549 INFO L225 Difference]: With dead ends: 654 [2018-10-15 15:28:56,549 INFO L226 Difference]: Without dead ends: 650 [2018-10-15 15:28:56,551 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11902 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=19857, Invalid=44913, Unknown=0, NotChecked=0, Total=64770 [2018-10-15 15:28:56,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2018-10-15 15:28:56,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 643. [2018-10-15 15:28:56,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2018-10-15 15:28:56,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 643 transitions. [2018-10-15 15:28:56,557 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 643 transitions. Word has length 632 [2018-10-15 15:28:56,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:28:56,558 INFO L481 AbstractCegarLoop]: Abstraction has 643 states and 643 transitions. [2018-10-15 15:28:56,558 INFO L482 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-10-15 15:28:56,558 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 643 transitions. [2018-10-15 15:28:56,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 643 [2018-10-15 15:28:56,561 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:28:56,561 INFO L375 BasicCegarLoop]: trace histogram [64, 63, 63, 63, 63, 63, 63, 63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:28:56,561 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:28:56,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:28:56,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1440044064, now seen corresponding path program 63 times [2018-10-15 15:28:56,562 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:28:56,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:29:01,795 INFO L134 CoverageAnalysis]: Checked inductivity of 19656 backedges. 0 proven. 19656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:29:01,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:29:01,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-10-15 15:29:01,796 INFO L460 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-10-15 15:29:01,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-10-15 15:29:01,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4228, Invalid=12802, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 15:29:01,797 INFO L87 Difference]: Start difference. First operand 643 states and 643 transitions. Second operand 131 states. [2018-10-15 15:29:09,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:29:09,998 INFO L93 Difference]: Finished difference Result 664 states and 664 transitions. [2018-10-15 15:29:09,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 194 states. [2018-10-15 15:29:09,998 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 642 [2018-10-15 15:29:09,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:29:10,002 INFO L225 Difference]: With dead ends: 664 [2018-10-15 15:29:10,002 INFO L226 Difference]: Without dead ends: 660 [2018-10-15 15:29:10,004 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12283 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=20492, Invalid=46330, Unknown=0, NotChecked=0, Total=66822 [2018-10-15 15:29:10,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2018-10-15 15:29:10,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 653. [2018-10-15 15:29:10,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 653 states. [2018-10-15 15:29:10,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 653 transitions. [2018-10-15 15:29:10,008 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 653 transitions. Word has length 642 [2018-10-15 15:29:10,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:29:10,009 INFO L481 AbstractCegarLoop]: Abstraction has 653 states and 653 transitions. [2018-10-15 15:29:10,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-10-15 15:29:10,009 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 653 transitions. [2018-10-15 15:29:10,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 653 [2018-10-15 15:29:10,012 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:29:10,013 INFO L375 BasicCegarLoop]: trace histogram [65, 64, 64, 64, 64, 64, 64, 64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:29:10,013 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:29:10,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:29:10,014 INFO L82 PathProgramCache]: Analyzing trace with hash 21886762, now seen corresponding path program 64 times [2018-10-15 15:29:10,014 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:29:10,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:29:15,223 INFO L134 CoverageAnalysis]: Checked inductivity of 20288 backedges. 0 proven. 20288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:29:15,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:29:15,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-10-15 15:29:15,224 INFO L460 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-10-15 15:29:15,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-10-15 15:29:15,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4359, Invalid=13197, Unknown=0, NotChecked=0, Total=17556 [2018-10-15 15:29:15,226 INFO L87 Difference]: Start difference. First operand 653 states and 653 transitions. Second operand 133 states. [2018-10-15 15:29:24,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:29:24,165 INFO L93 Difference]: Finished difference Result 674 states and 674 transitions. [2018-10-15 15:29:24,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 197 states. [2018-10-15 15:29:24,165 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 652 [2018-10-15 15:29:24,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:29:24,168 INFO L225 Difference]: With dead ends: 674 [2018-10-15 15:29:24,168 INFO L226 Difference]: Without dead ends: 670 [2018-10-15 15:29:24,170 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12670 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=21137, Invalid=47769, Unknown=0, NotChecked=0, Total=68906 [2018-10-15 15:29:24,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2018-10-15 15:29:24,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 663. [2018-10-15 15:29:24,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2018-10-15 15:29:24,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 663 transitions. [2018-10-15 15:29:24,174 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 663 transitions. Word has length 652 [2018-10-15 15:29:24,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:29:24,175 INFO L481 AbstractCegarLoop]: Abstraction has 663 states and 663 transitions. [2018-10-15 15:29:24,175 INFO L482 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-10-15 15:29:24,175 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 663 transitions. [2018-10-15 15:29:24,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 663 [2018-10-15 15:29:24,178 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:29:24,179 INFO L375 BasicCegarLoop]: trace histogram [66, 65, 65, 65, 65, 65, 65, 65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:29:24,179 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:29:24,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:29:24,179 INFO L82 PathProgramCache]: Analyzing trace with hash 321596916, now seen corresponding path program 65 times [2018-10-15 15:29:24,180 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:29:24,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:29:29,763 INFO L134 CoverageAnalysis]: Checked inductivity of 20930 backedges. 0 proven. 20930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:29:29,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:29:29,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-10-15 15:29:29,765 INFO L460 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-10-15 15:29:29,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-10-15 15:29:29,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4492, Invalid=13598, Unknown=0, NotChecked=0, Total=18090 [2018-10-15 15:29:29,766 INFO L87 Difference]: Start difference. First operand 663 states and 663 transitions. Second operand 135 states. [2018-10-15 15:29:38,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:29:38,952 INFO L93 Difference]: Finished difference Result 684 states and 684 transitions. [2018-10-15 15:29:38,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2018-10-15 15:29:38,952 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 662 [2018-10-15 15:29:38,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:29:38,955 INFO L225 Difference]: With dead ends: 684 [2018-10-15 15:29:38,955 INFO L226 Difference]: Without dead ends: 680 [2018-10-15 15:29:38,957 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13063 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=21792, Invalid=49230, Unknown=0, NotChecked=0, Total=71022 [2018-10-15 15:29:38,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2018-10-15 15:29:38,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 673. [2018-10-15 15:29:38,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 673 states. [2018-10-15 15:29:38,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 673 transitions. [2018-10-15 15:29:38,962 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 673 transitions. Word has length 662 [2018-10-15 15:29:38,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:29:38,962 INFO L481 AbstractCegarLoop]: Abstraction has 673 states and 673 transitions. [2018-10-15 15:29:38,962 INFO L482 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-10-15 15:29:38,962 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 673 transitions. [2018-10-15 15:29:38,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 673 [2018-10-15 15:29:38,965 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:29:38,966 INFO L375 BasicCegarLoop]: trace histogram [67, 66, 66, 66, 66, 66, 66, 66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:29:38,966 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:29:38,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:29:38,966 INFO L82 PathProgramCache]: Analyzing trace with hash -286134210, now seen corresponding path program 66 times [2018-10-15 15:29:38,967 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:29:39,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:29:44,571 INFO L134 CoverageAnalysis]: Checked inductivity of 21582 backedges. 0 proven. 21582 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:29:44,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:29:44,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-10-15 15:29:44,572 INFO L460 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-10-15 15:29:44,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-10-15 15:29:44,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4627, Invalid=14005, Unknown=0, NotChecked=0, Total=18632 [2018-10-15 15:29:44,573 INFO L87 Difference]: Start difference. First operand 673 states and 673 transitions. Second operand 137 states. [2018-10-15 15:29:53,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:29:53,878 INFO L93 Difference]: Finished difference Result 694 states and 694 transitions. [2018-10-15 15:29:53,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 203 states. [2018-10-15 15:29:53,879 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 672 [2018-10-15 15:29:53,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:29:53,881 INFO L225 Difference]: With dead ends: 694 [2018-10-15 15:29:53,881 INFO L226 Difference]: Without dead ends: 690 [2018-10-15 15:29:53,883 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13462 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=22457, Invalid=50713, Unknown=0, NotChecked=0, Total=73170 [2018-10-15 15:29:53,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2018-10-15 15:29:53,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 683. [2018-10-15 15:29:53,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 683 states. [2018-10-15 15:29:53,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 683 transitions. [2018-10-15 15:29:53,888 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 683 transitions. Word has length 672 [2018-10-15 15:29:53,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:29:53,888 INFO L481 AbstractCegarLoop]: Abstraction has 683 states and 683 transitions. [2018-10-15 15:29:53,888 INFO L482 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-10-15 15:29:53,889 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 683 transitions. [2018-10-15 15:29:53,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 683 [2018-10-15 15:29:53,892 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:29:53,892 INFO L375 BasicCegarLoop]: trace histogram [68, 67, 67, 67, 67, 67, 67, 67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:29:53,892 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:29:53,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:29:53,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1530274296, now seen corresponding path program 67 times [2018-10-15 15:29:53,893 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:29:53,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:29:59,571 INFO L134 CoverageAnalysis]: Checked inductivity of 22244 backedges. 0 proven. 22244 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:29:59,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:29:59,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-10-15 15:29:59,572 INFO L460 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-10-15 15:29:59,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-10-15 15:29:59,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4764, Invalid=14418, Unknown=0, NotChecked=0, Total=19182 [2018-10-15 15:29:59,573 INFO L87 Difference]: Start difference. First operand 683 states and 683 transitions. Second operand 139 states. [2018-10-15 15:30:09,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:30:09,085 INFO L93 Difference]: Finished difference Result 704 states and 704 transitions. [2018-10-15 15:30:09,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 206 states. [2018-10-15 15:30:09,086 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 682 [2018-10-15 15:30:09,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:30:09,089 INFO L225 Difference]: With dead ends: 704 [2018-10-15 15:30:09,089 INFO L226 Difference]: Without dead ends: 700 [2018-10-15 15:30:09,090 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13867 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=23132, Invalid=52218, Unknown=0, NotChecked=0, Total=75350 [2018-10-15 15:30:09,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2018-10-15 15:30:09,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 693. [2018-10-15 15:30:09,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 693 states. [2018-10-15 15:30:09,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 693 transitions. [2018-10-15 15:30:09,095 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 693 transitions. Word has length 682 [2018-10-15 15:30:09,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:30:09,095 INFO L481 AbstractCegarLoop]: Abstraction has 693 states and 693 transitions. [2018-10-15 15:30:09,095 INFO L482 AbstractCegarLoop]: Interpolant automaton has 139 states. [2018-10-15 15:30:09,095 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 693 transitions. [2018-10-15 15:30:09,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 693 [2018-10-15 15:30:09,098 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:30:09,099 INFO L375 BasicCegarLoop]: trace histogram [69, 68, 68, 68, 68, 68, 68, 68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:30:09,099 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:30:09,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:30:09,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1876072274, now seen corresponding path program 68 times [2018-10-15 15:30:09,100 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:30:09,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:30:14,984 INFO L134 CoverageAnalysis]: Checked inductivity of 22916 backedges. 0 proven. 22916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:30:14,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:30:14,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2018-10-15 15:30:14,985 INFO L460 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-10-15 15:30:14,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-10-15 15:30:14,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4903, Invalid=14837, Unknown=0, NotChecked=0, Total=19740 [2018-10-15 15:30:14,986 INFO L87 Difference]: Start difference. First operand 693 states and 693 transitions. Second operand 141 states. [2018-10-15 15:30:24,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:30:24,754 INFO L93 Difference]: Finished difference Result 714 states and 714 transitions. [2018-10-15 15:30:24,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 209 states. [2018-10-15 15:30:24,754 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 692 [2018-10-15 15:30:24,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:30:24,757 INFO L225 Difference]: With dead ends: 714 [2018-10-15 15:30:24,757 INFO L226 Difference]: Without dead ends: 710 [2018-10-15 15:30:24,758 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 277 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14278 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=23817, Invalid=53745, Unknown=0, NotChecked=0, Total=77562 [2018-10-15 15:30:24,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2018-10-15 15:30:24,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 703. [2018-10-15 15:30:24,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2018-10-15 15:30:24,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 703 transitions. [2018-10-15 15:30:24,763 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 703 transitions. Word has length 692 [2018-10-15 15:30:24,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:30:24,763 INFO L481 AbstractCegarLoop]: Abstraction has 703 states and 703 transitions. [2018-10-15 15:30:24,763 INFO L482 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-10-15 15:30:24,763 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 703 transitions. [2018-10-15 15:30:24,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 703 [2018-10-15 15:30:24,766 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:30:24,767 INFO L375 BasicCegarLoop]: trace histogram [70, 69, 69, 69, 69, 69, 69, 69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:30:24,767 INFO L424 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:30:24,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:30:24,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1612954652, now seen corresponding path program 69 times [2018-10-15 15:30:24,768 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:30:24,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:30:30,715 INFO L134 CoverageAnalysis]: Checked inductivity of 23598 backedges. 0 proven. 23598 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:30:30,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:30:30,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2018-10-15 15:30:30,716 INFO L460 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-10-15 15:30:30,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-10-15 15:30:30,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5044, Invalid=15262, Unknown=0, NotChecked=0, Total=20306 [2018-10-15 15:30:30,717 INFO L87 Difference]: Start difference. First operand 703 states and 703 transitions. Second operand 143 states. [2018-10-15 15:30:40,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:30:40,826 INFO L93 Difference]: Finished difference Result 724 states and 724 transitions. [2018-10-15 15:30:40,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 212 states. [2018-10-15 15:30:40,826 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 702 [2018-10-15 15:30:40,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:30:40,829 INFO L225 Difference]: With dead ends: 724 [2018-10-15 15:30:40,829 INFO L226 Difference]: Without dead ends: 720 [2018-10-15 15:30:40,831 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 281 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14695 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=24512, Invalid=55294, Unknown=0, NotChecked=0, Total=79806 [2018-10-15 15:30:40,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2018-10-15 15:30:40,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 713. [2018-10-15 15:30:40,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2018-10-15 15:30:40,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 713 transitions. [2018-10-15 15:30:40,836 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 713 transitions. Word has length 702 [2018-10-15 15:30:40,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:30:40,836 INFO L481 AbstractCegarLoop]: Abstraction has 713 states and 713 transitions. [2018-10-15 15:30:40,836 INFO L482 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-10-15 15:30:40,836 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 713 transitions. [2018-10-15 15:30:40,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 713 [2018-10-15 15:30:40,839 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:30:40,840 INFO L375 BasicCegarLoop]: trace histogram [71, 70, 70, 70, 70, 70, 70, 70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:30:40,840 INFO L424 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:30:40,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:30:40,840 INFO L82 PathProgramCache]: Analyzing trace with hash -2066944922, now seen corresponding path program 70 times [2018-10-15 15:30:40,841 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:30:40,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:30:47,182 INFO L134 CoverageAnalysis]: Checked inductivity of 24290 backedges. 0 proven. 24290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:30:47,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:30:47,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2018-10-15 15:30:47,183 INFO L460 AbstractCegarLoop]: Interpolant automaton has 145 states [2018-10-15 15:30:47,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2018-10-15 15:30:47,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5187, Invalid=15693, Unknown=0, NotChecked=0, Total=20880 [2018-10-15 15:30:47,185 INFO L87 Difference]: Start difference. First operand 713 states and 713 transitions. Second operand 145 states. [2018-10-15 15:30:57,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:30:57,580 INFO L93 Difference]: Finished difference Result 734 states and 734 transitions. [2018-10-15 15:30:57,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 215 states. [2018-10-15 15:30:57,580 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 712 [2018-10-15 15:30:57,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:30:57,582 INFO L225 Difference]: With dead ends: 734 [2018-10-15 15:30:57,582 INFO L226 Difference]: Without dead ends: 730 [2018-10-15 15:30:57,584 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15118 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=25217, Invalid=56865, Unknown=0, NotChecked=0, Total=82082 [2018-10-15 15:30:57,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2018-10-15 15:30:57,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 723. [2018-10-15 15:30:57,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 723 states. [2018-10-15 15:30:57,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 723 transitions. [2018-10-15 15:30:57,589 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 723 transitions. Word has length 712 [2018-10-15 15:30:57,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:30:57,590 INFO L481 AbstractCegarLoop]: Abstraction has 723 states and 723 transitions. [2018-10-15 15:30:57,590 INFO L482 AbstractCegarLoop]: Interpolant automaton has 145 states. [2018-10-15 15:30:57,590 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 723 transitions. [2018-10-15 15:30:57,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 723 [2018-10-15 15:30:57,593 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:30:57,593 INFO L375 BasicCegarLoop]: trace histogram [72, 71, 71, 71, 71, 71, 71, 71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:30:57,594 INFO L424 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:30:57,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:30:57,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1781151696, now seen corresponding path program 71 times [2018-10-15 15:30:57,594 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:30:57,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:31:04,342 INFO L134 CoverageAnalysis]: Checked inductivity of 24992 backedges. 0 proven. 24992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:31:04,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:31:04,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147] total 147 [2018-10-15 15:31:04,344 INFO L460 AbstractCegarLoop]: Interpolant automaton has 147 states [2018-10-15 15:31:04,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2018-10-15 15:31:04,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5332, Invalid=16130, Unknown=0, NotChecked=0, Total=21462 [2018-10-15 15:31:04,345 INFO L87 Difference]: Start difference. First operand 723 states and 723 transitions. Second operand 147 states. [2018-10-15 15:31:14,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:31:14,869 INFO L93 Difference]: Finished difference Result 744 states and 744 transitions. [2018-10-15 15:31:14,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 218 states. [2018-10-15 15:31:14,869 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 722 [2018-10-15 15:31:14,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:31:14,872 INFO L225 Difference]: With dead ends: 744 [2018-10-15 15:31:14,872 INFO L226 Difference]: Without dead ends: 740 [2018-10-15 15:31:14,875 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 289 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15547 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=25932, Invalid=58458, Unknown=0, NotChecked=0, Total=84390 [2018-10-15 15:31:14,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2018-10-15 15:31:14,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 733. [2018-10-15 15:31:14,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 733 states. [2018-10-15 15:31:14,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 733 transitions. [2018-10-15 15:31:14,880 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 733 transitions. Word has length 722 [2018-10-15 15:31:14,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:31:14,880 INFO L481 AbstractCegarLoop]: Abstraction has 733 states and 733 transitions. [2018-10-15 15:31:14,880 INFO L482 AbstractCegarLoop]: Interpolant automaton has 147 states. [2018-10-15 15:31:14,880 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 733 transitions. [2018-10-15 15:31:14,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 733 [2018-10-15 15:31:14,884 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:31:14,884 INFO L375 BasicCegarLoop]: trace histogram [73, 72, 72, 72, 72, 72, 72, 72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:31:14,884 INFO L424 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:31:14,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:31:14,885 INFO L82 PathProgramCache]: Analyzing trace with hash 507375482, now seen corresponding path program 72 times [2018-10-15 15:31:14,885 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:31:14,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:31:21,600 INFO L134 CoverageAnalysis]: Checked inductivity of 25704 backedges. 0 proven. 25704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:31:21,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:31:21,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149] total 149 [2018-10-15 15:31:21,601 INFO L460 AbstractCegarLoop]: Interpolant automaton has 149 states [2018-10-15 15:31:21,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2018-10-15 15:31:21,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5479, Invalid=16573, Unknown=0, NotChecked=0, Total=22052 [2018-10-15 15:31:21,602 INFO L87 Difference]: Start difference. First operand 733 states and 733 transitions. Second operand 149 states. [2018-10-15 15:31:32,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:31:32,499 INFO L93 Difference]: Finished difference Result 754 states and 754 transitions. [2018-10-15 15:31:32,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 221 states. [2018-10-15 15:31:32,499 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 732 [2018-10-15 15:31:32,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:31:32,502 INFO L225 Difference]: With dead ends: 754 [2018-10-15 15:31:32,502 INFO L226 Difference]: Without dead ends: 750 [2018-10-15 15:31:32,505 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 293 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15982 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=26657, Invalid=60073, Unknown=0, NotChecked=0, Total=86730 [2018-10-15 15:31:32,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2018-10-15 15:31:32,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 743. [2018-10-15 15:31:32,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 743 states. [2018-10-15 15:31:32,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 743 transitions. [2018-10-15 15:31:32,510 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 743 transitions. Word has length 732 [2018-10-15 15:31:32,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:31:32,511 INFO L481 AbstractCegarLoop]: Abstraction has 743 states and 743 transitions. [2018-10-15 15:31:32,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has 149 states. [2018-10-15 15:31:32,511 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 743 transitions. [2018-10-15 15:31:32,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 743 [2018-10-15 15:31:32,514 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:31:32,515 INFO L375 BasicCegarLoop]: trace histogram [74, 73, 73, 73, 73, 73, 73, 73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:31:32,515 INFO L424 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:31:32,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:31:32,515 INFO L82 PathProgramCache]: Analyzing trace with hash 637338180, now seen corresponding path program 73 times [2018-10-15 15:31:32,516 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:31:32,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:31:39,583 INFO L134 CoverageAnalysis]: Checked inductivity of 26426 backedges. 0 proven. 26426 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:31:39,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:31:39,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [151] total 151 [2018-10-15 15:31:39,584 INFO L460 AbstractCegarLoop]: Interpolant automaton has 151 states [2018-10-15 15:31:39,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 151 interpolants. [2018-10-15 15:31:39,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5628, Invalid=17022, Unknown=0, NotChecked=0, Total=22650 [2018-10-15 15:31:39,586 INFO L87 Difference]: Start difference. First operand 743 states and 743 transitions. Second operand 151 states. [2018-10-15 15:31:50,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:31:50,727 INFO L93 Difference]: Finished difference Result 764 states and 764 transitions. [2018-10-15 15:31:50,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 224 states. [2018-10-15 15:31:50,728 INFO L78 Accepts]: Start accepts. Automaton has 151 states. Word has length 742 [2018-10-15 15:31:50,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:31:50,731 INFO L225 Difference]: With dead ends: 764 [2018-10-15 15:31:50,731 INFO L226 Difference]: Without dead ends: 760 [2018-10-15 15:31:50,733 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 297 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16423 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=27392, Invalid=61710, Unknown=0, NotChecked=0, Total=89102 [2018-10-15 15:31:50,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2018-10-15 15:31:50,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 753. [2018-10-15 15:31:50,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 753 states. [2018-10-15 15:31:50,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 753 transitions. [2018-10-15 15:31:50,738 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 753 transitions. Word has length 742 [2018-10-15 15:31:50,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:31:50,739 INFO L481 AbstractCegarLoop]: Abstraction has 753 states and 753 transitions. [2018-10-15 15:31:50,739 INFO L482 AbstractCegarLoop]: Interpolant automaton has 151 states. [2018-10-15 15:31:50,739 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 753 transitions. [2018-10-15 15:31:50,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 753 [2018-10-15 15:31:50,743 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:31:50,743 INFO L375 BasicCegarLoop]: trace histogram [75, 74, 74, 74, 74, 74, 74, 74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:31:50,743 INFO L424 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:31:50,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:31:50,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1543676046, now seen corresponding path program 74 times [2018-10-15 15:31:50,744 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:31:50,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:31:57,671 INFO L134 CoverageAnalysis]: Checked inductivity of 27158 backedges. 0 proven. 27158 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:31:57,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:31:57,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [153] total 153 [2018-10-15 15:31:57,672 INFO L460 AbstractCegarLoop]: Interpolant automaton has 153 states [2018-10-15 15:31:57,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2018-10-15 15:31:57,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5779, Invalid=17477, Unknown=0, NotChecked=0, Total=23256 [2018-10-15 15:31:57,673 INFO L87 Difference]: Start difference. First operand 753 states and 753 transitions. Second operand 153 states.