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/diamond1.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d769cf3 [2018-10-15 15:23:38,971 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 15:23:38,973 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 15:23:38,988 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 15:23:38,988 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 15:23:38,989 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 15:23:38,991 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 15:23:38,992 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 15:23:38,994 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 15:23:38,995 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 15:23:38,996 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 15:23:38,996 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 15:23:38,997 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 15:23:38,998 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 15:23:38,999 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 15:23:39,000 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 15:23:39,001 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 15:23:39,003 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 15:23:39,005 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 15:23:39,007 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 15:23:39,008 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 15:23:39,009 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 15:23:39,012 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 15:23:39,012 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 15:23:39,012 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 15:23:39,013 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 15:23:39,014 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 15:23:39,015 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 15:23:39,016 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 15:23:39,017 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 15:23:39,017 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 15:23:39,018 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 15:23:39,018 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 15:23:39,018 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 15:23:39,019 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 15:23:39,020 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 15:23:39,020 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:39,030 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 15:23:39,030 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 15:23:39,031 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 15:23:39,031 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 15:23:39,032 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 15:23:39,032 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 15:23:39,032 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 15:23:39,033 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 15:23:39,033 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 15:23:39,033 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 15:23:39,033 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 15:23:39,034 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 15:23:39,034 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 15:23:39,035 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 15:23:39,035 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 15:23:39,097 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 15:23:39,113 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 15:23:39,120 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 15:23:39,122 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 15:23:39,122 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 15:23:39,123 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/diamond1.i_3.bpl [2018-10-15 15:23:39,123 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/diamond1.i_3.bpl' [2018-10-15 15:23:39,177 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 15:23:39,178 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-15 15:23:39,179 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 15:23:39,179 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 15:23:39,179 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 15:23:39,206 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:23:39" (1/1) ... [2018-10-15 15:23:39,208 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:23:39" (1/1) ... [2018-10-15 15:23:39,219 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:23:39" (1/1) ... [2018-10-15 15:23:39,219 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:23:39" (1/1) ... [2018-10-15 15:23:39,224 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:23:39" (1/1) ... [2018-10-15 15:23:39,227 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:23:39" (1/1) ... [2018-10-15 15:23:39,228 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:23:39" (1/1) ... [2018-10-15 15:23:39,230 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 15:23:39,238 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 15:23:39,238 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 15:23:39,239 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 15:23:39,241 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:23:39" (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:39,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 15:23:39,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 15:23:39,546 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 15:23:39,547 INFO L202 PluginConnector]: Adding new model diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:23:39 BoogieIcfgContainer [2018-10-15 15:23:39,547 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 15:23:39,551 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-15 15:23:39,551 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-15 15:23:39,552 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-15 15:23:39,560 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:23:39" (1/1) ... [2018-10-15 15:23:39,570 WARN L219 ansformationObserver]: HeapSeparator: input icfg has no '#valid' array -- returning unchanged Icfg! [2018-10-15 15:23:39,608 INFO L202 PluginConnector]: Adding new model diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 03:23:39 BasicIcfg [2018-10-15 15:23:39,608 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-15 15:23:39,612 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 15:23:39,613 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 15:23:39,616 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 15:23:39,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:23:39" (1/3) ... [2018-10-15 15:23:39,618 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21ddee0e and model type diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:23:39, skipping insertion in model container [2018-10-15 15:23:39,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:23:39" (2/3) ... [2018-10-15 15:23:39,619 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21ddee0e and model type diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:23:39, skipping insertion in model container [2018-10-15 15:23:39,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 03:23:39" (3/3) ... [2018-10-15 15:23:39,621 INFO L112 eAbstractionObserver]: Analyzing ICFG diamond1.i_3.bplleft_unchanged_by_heapseparator [2018-10-15 15:23:39,640 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 15:23:39,661 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 15:23:39,700 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 15:23:39,740 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 15:23:39,741 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 15:23:39,741 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 15:23:39,741 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 15:23:39,741 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 15:23:39,741 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 15:23:39,742 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 15:23:39,742 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 15:23:39,742 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 15:23:39,766 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-10-15 15:23:39,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-15 15:23:39,776 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:39,777 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:39,778 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:39,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:39,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1386147999, now seen corresponding path program 1 times [2018-10-15 15:23:39,870 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:39,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:40,039 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:40,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:23:40,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:23:40,047 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:23:40,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:23:40,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:23:40,066 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2018-10-15 15:23:40,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:40,152 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-10-15 15:23:40,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:23:40,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-10-15 15:23:40,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:40,166 INFO L225 Difference]: With dead ends: 23 [2018-10-15 15:23:40,166 INFO L226 Difference]: Without dead ends: 23 [2018-10-15 15:23:40,169 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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:40,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-15 15:23:40,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2018-10-15 15:23:40,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-15 15:23:40,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-10-15 15:23:40,206 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 13 [2018-10-15 15:23:40,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:40,206 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-10-15 15:23:40,207 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:23:40,207 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-10-15 15:23:40,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-15 15:23:40,208 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:40,208 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:40,208 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:40,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:40,209 INFO L82 PathProgramCache]: Analyzing trace with hash 2088631495, now seen corresponding path program 1 times [2018-10-15 15:23:40,210 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:40,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:40,383 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:40,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:40,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-15 15:23:40,386 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 15:23:40,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 15:23:40,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-15 15:23:40,387 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 5 states. [2018-10-15 15:23:40,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:40,586 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-10-15 15:23:40,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-15 15:23:40,587 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-10-15 15:23:40,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:40,588 INFO L225 Difference]: With dead ends: 29 [2018-10-15 15:23:40,588 INFO L226 Difference]: Without dead ends: 29 [2018-10-15 15:23:40,590 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-15 15:23:40,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-15 15:23:40,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2018-10-15 15:23:40,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-15 15:23:40,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-10-15 15:23:40,597 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 19 [2018-10-15 15:23:40,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:40,598 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-10-15 15:23:40,598 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 15:23:40,598 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-10-15 15:23:40,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-15 15:23:40,599 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:40,599 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:40,600 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:40,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:40,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1087322707, now seen corresponding path program 2 times [2018-10-15 15:23:40,601 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:40,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:41,024 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:41,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:41,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-15 15:23:41,025 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 15:23:41,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 15:23:41,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-15 15:23:41,028 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 7 states. [2018-10-15 15:23:41,238 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-15 15:23:41,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:41,342 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-10-15 15:23:41,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-15 15:23:41,343 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-10-15 15:23:41,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:41,344 INFO L225 Difference]: With dead ends: 35 [2018-10-15 15:23:41,345 INFO L226 Difference]: Without dead ends: 35 [2018-10-15 15:23:41,345 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-10-15 15:23:41,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-15 15:23:41,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2018-10-15 15:23:41,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-15 15:23:41,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-10-15 15:23:41,352 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 25 [2018-10-15 15:23:41,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:41,353 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-10-15 15:23:41,353 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 15:23:41,353 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-10-15 15:23:41,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-15 15:23:41,354 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:41,354 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:41,355 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:41,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:41,355 INFO L82 PathProgramCache]: Analyzing trace with hash 428263955, now seen corresponding path program 3 times [2018-10-15 15:23:41,356 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:41,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:41,622 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:41,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:41,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 15:23:41,623 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 15:23:41,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 15:23:41,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-15 15:23:41,624 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 9 states. [2018-10-15 15:23:42,006 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-15 15:23:42,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:42,229 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-10-15 15:23:42,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-15 15:23:42,231 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-10-15 15:23:42,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:42,232 INFO L225 Difference]: With dead ends: 41 [2018-10-15 15:23:42,232 INFO L226 Difference]: Without dead ends: 41 [2018-10-15 15:23:42,233 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-10-15 15:23:42,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-15 15:23:42,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2018-10-15 15:23:42,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-15 15:23:42,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-10-15 15:23:42,238 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 31 [2018-10-15 15:23:42,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:42,238 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-10-15 15:23:42,239 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 15:23:42,239 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-10-15 15:23:42,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-15 15:23:42,240 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:42,240 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:42,241 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:42,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:42,241 INFO L82 PathProgramCache]: Analyzing trace with hash -2012911111, now seen corresponding path program 4 times [2018-10-15 15:23:42,242 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:42,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:42,564 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:42,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:42,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 15:23:42,566 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 15:23:42,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 15:23:42,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-10-15 15:23:42,567 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 11 states. [2018-10-15 15:23:43,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:43,052 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-10-15 15:23:43,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-15 15:23:43,054 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2018-10-15 15:23:43,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:43,055 INFO L225 Difference]: With dead ends: 47 [2018-10-15 15:23:43,056 INFO L226 Difference]: Without dead ends: 47 [2018-10-15 15:23:43,056 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-10-15 15:23:43,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-15 15:23:43,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2018-10-15 15:23:43,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-15 15:23:43,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-10-15 15:23:43,062 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 37 [2018-10-15 15:23:43,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:43,063 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-10-15 15:23:43,063 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 15:23:43,063 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-10-15 15:23:43,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-15 15:23:43,064 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:43,064 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:43,065 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:43,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:43,065 INFO L82 PathProgramCache]: Analyzing trace with hash 631899487, now seen corresponding path program 5 times [2018-10-15 15:23:43,066 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:43,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:43,301 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:43,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:43,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 15:23:43,302 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 15:23:43,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 15:23:43,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-10-15 15:23:43,303 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 13 states. [2018-10-15 15:23:43,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:43,918 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-10-15 15:23:43,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-15 15:23:43,920 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2018-10-15 15:23:43,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:43,921 INFO L225 Difference]: With dead ends: 53 [2018-10-15 15:23:43,921 INFO L226 Difference]: Without dead ends: 53 [2018-10-15 15:23:43,922 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-10-15 15:23:43,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-15 15:23:43,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2018-10-15 15:23:43,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-15 15:23:43,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-10-15 15:23:43,927 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 43 [2018-10-15 15:23:43,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:43,928 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-10-15 15:23:43,928 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 15:23:43,928 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-10-15 15:23:43,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-15 15:23:43,930 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:43,930 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:43,930 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:43,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:43,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1911159877, now seen corresponding path program 6 times [2018-10-15 15:23:43,932 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:43,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:44,608 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:44,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:44,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 15:23:44,609 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 15:23:44,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 15:23:44,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-10-15 15:23:44,610 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 15 states. [2018-10-15 15:23:45,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:45,134 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-10-15 15:23:45,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-15 15:23:45,136 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 49 [2018-10-15 15:23:45,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:45,137 INFO L225 Difference]: With dead ends: 59 [2018-10-15 15:23:45,138 INFO L226 Difference]: Without dead ends: 59 [2018-10-15 15:23:45,139 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2018-10-15 15:23:45,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-15 15:23:45,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2018-10-15 15:23:45,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-15 15:23:45,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-10-15 15:23:45,144 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 49 [2018-10-15 15:23:45,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:45,145 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-10-15 15:23:45,145 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 15:23:45,145 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-10-15 15:23:45,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-15 15:23:45,147 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:45,147 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:45,147 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:45,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:45,148 INFO L82 PathProgramCache]: Analyzing trace with hash 380808875, now seen corresponding path program 7 times [2018-10-15 15:23:45,148 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:45,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:45,809 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:45,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:45,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 15:23:45,810 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 15:23:45,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 15:23:45,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-10-15 15:23:45,811 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 17 states. [2018-10-15 15:23:46,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:46,612 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-10-15 15:23:46,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-15 15:23:46,613 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 55 [2018-10-15 15:23:46,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:46,615 INFO L225 Difference]: With dead ends: 65 [2018-10-15 15:23:46,615 INFO L226 Difference]: Without dead ends: 65 [2018-10-15 15:23:46,616 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2018-10-15 15:23:46,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-15 15:23:46,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2018-10-15 15:23:46,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-10-15 15:23:46,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-10-15 15:23:46,624 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 55 [2018-10-15 15:23:46,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:46,624 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-10-15 15:23:46,625 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 15:23:46,625 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-10-15 15:23:46,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-10-15 15:23:46,626 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:46,626 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:46,627 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:46,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:46,628 INFO L82 PathProgramCache]: Analyzing trace with hash 778665105, now seen corresponding path program 8 times [2018-10-15 15:23:46,629 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:46,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:47,090 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:47,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:47,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 15:23:47,091 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 15:23:47,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 15:23:47,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-10-15 15:23:47,092 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 19 states. [2018-10-15 15:23:48,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:48,124 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-10-15 15:23:48,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-15 15:23:48,129 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2018-10-15 15:23:48,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:48,130 INFO L225 Difference]: With dead ends: 71 [2018-10-15 15:23:48,130 INFO L226 Difference]: Without dead ends: 71 [2018-10-15 15:23:48,131 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 15:23:48,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-10-15 15:23:48,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2018-10-15 15:23:48,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-10-15 15:23:48,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-10-15 15:23:48,136 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 61 [2018-10-15 15:23:48,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:48,137 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-10-15 15:23:48,137 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 15:23:48,137 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-10-15 15:23:48,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-15 15:23:48,138 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:48,138 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:48,139 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:48,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:48,139 INFO L82 PathProgramCache]: Analyzing trace with hash 166446583, now seen corresponding path program 9 times [2018-10-15 15:23:48,140 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:48,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:48,543 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:48,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:48,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 15:23:48,544 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 15:23:48,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 15:23:48,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-10-15 15:23:48,545 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 21 states. [2018-10-15 15:23:49,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:49,935 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-10-15 15:23:49,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-15 15:23:49,943 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 67 [2018-10-15 15:23:49,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:49,944 INFO L225 Difference]: With dead ends: 77 [2018-10-15 15:23:49,944 INFO L226 Difference]: Without dead ends: 77 [2018-10-15 15:23:49,945 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 15:23:49,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-10-15 15:23:49,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2018-10-15 15:23:49,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-10-15 15:23:49,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-10-15 15:23:49,950 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 67 [2018-10-15 15:23:49,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:49,950 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-10-15 15:23:49,951 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 15:23:49,951 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-10-15 15:23:49,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-15 15:23:49,952 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:49,952 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:49,952 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:49,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:49,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1989077725, now seen corresponding path program 10 times [2018-10-15 15:23:49,953 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:49,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:50,495 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 0 proven. 290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:50,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:50,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 15:23:50,496 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 15:23:50,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 15:23:50,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-10-15 15:23:50,497 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 23 states. [2018-10-15 15:23:51,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:51,564 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-10-15 15:23:51,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-15 15:23:51,564 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 73 [2018-10-15 15:23:51,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:51,566 INFO L225 Difference]: With dead ends: 83 [2018-10-15 15:23:51,566 INFO L226 Difference]: Without dead ends: 83 [2018-10-15 15:23:51,567 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 15:23:51,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-10-15 15:23:51,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2018-10-15 15:23:51,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-15 15:23:51,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-10-15 15:23:51,573 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 73 [2018-10-15 15:23:51,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:51,574 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-10-15 15:23:51,574 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 15:23:51,574 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-10-15 15:23:51,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-15 15:23:51,575 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:51,575 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:51,576 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:51,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:51,576 INFO L82 PathProgramCache]: Analyzing trace with hash -2078258365, now seen corresponding path program 11 times [2018-10-15 15:23:51,577 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:51,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:52,055 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:52,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:52,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 15:23:52,056 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 15:23:52,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 15:23:52,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-10-15 15:23:52,057 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 25 states. [2018-10-15 15:23:53,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:53,410 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-10-15 15:23:53,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-15 15:23:53,411 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 79 [2018-10-15 15:23:53,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:53,412 INFO L225 Difference]: With dead ends: 89 [2018-10-15 15:23:53,412 INFO L226 Difference]: Without dead ends: 89 [2018-10-15 15:23:53,414 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=135, Invalid=2027, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 15:23:53,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-10-15 15:23:53,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2018-10-15 15:23:53,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-10-15 15:23:53,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-10-15 15:23:53,420 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 79 [2018-10-15 15:23:53,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:53,420 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-10-15 15:23:53,420 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 15:23:53,420 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-10-15 15:23:53,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-15 15:23:53,421 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:53,422 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:53,422 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:53,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:53,425 INFO L82 PathProgramCache]: Analyzing trace with hash -890943703, now seen corresponding path program 12 times [2018-10-15 15:23:53,426 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:53,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:54,695 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:54,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:54,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 15:23:54,695 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 15:23:54,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 15:23:54,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-10-15 15:23:54,696 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 27 states. [2018-10-15 15:23:56,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:56,384 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-10-15 15:23:56,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-15 15:23:56,387 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 85 [2018-10-15 15:23:56,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:56,388 INFO L225 Difference]: With dead ends: 95 [2018-10-15 15:23:56,388 INFO L226 Difference]: Without dead ends: 95 [2018-10-15 15:23:56,389 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=147, Invalid=2403, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 15:23:56,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-10-15 15:23:56,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2018-10-15 15:23:56,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-10-15 15:23:56,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-10-15 15:23:56,395 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 85 [2018-10-15 15:23:56,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:56,395 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-10-15 15:23:56,395 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 15:23:56,395 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-10-15 15:23:56,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-15 15:23:56,396 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:56,397 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:56,397 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:56,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:56,397 INFO L82 PathProgramCache]: Analyzing trace with hash 832257679, now seen corresponding path program 13 times [2018-10-15 15:23:56,398 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:56,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:57,051 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 0 proven. 494 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:57,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:57,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 15:23:57,052 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 15:23:57,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 15:23:57,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-10-15 15:23:57,053 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 29 states. [2018-10-15 15:23:58,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:58,766 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-10-15 15:23:58,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-15 15:23:58,767 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 91 [2018-10-15 15:23:58,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:58,768 INFO L225 Difference]: With dead ends: 101 [2018-10-15 15:23:58,768 INFO L226 Difference]: Without dead ends: 101 [2018-10-15 15:23:58,770 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=159, Invalid=2811, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 15:23:58,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-10-15 15:23:58,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2018-10-15 15:23:58,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-10-15 15:23:58,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-10-15 15:23:58,775 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 91 [2018-10-15 15:23:58,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:58,775 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-10-15 15:23:58,775 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 15:23:58,776 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-10-15 15:23:58,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-10-15 15:23:58,777 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:58,777 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:58,777 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:58,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:58,778 INFO L82 PathProgramCache]: Analyzing trace with hash 863474037, now seen corresponding path program 14 times [2018-10-15 15:23:58,779 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:58,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:59,599 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 0 proven. 574 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:59,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:59,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 15:23:59,600 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 15:23:59,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 15:23:59,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-10-15 15:23:59,601 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 31 states. [2018-10-15 15:24:01,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:01,260 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-10-15 15:24:01,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-15 15:24:01,261 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 97 [2018-10-15 15:24:01,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:01,262 INFO L225 Difference]: With dead ends: 107 [2018-10-15 15:24:01,263 INFO L226 Difference]: Without dead ends: 107 [2018-10-15 15:24:01,265 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=171, Invalid=3251, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 15:24:01,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-10-15 15:24:01,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2018-10-15 15:24:01,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-10-15 15:24:01,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-10-15 15:24:01,268 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 97 [2018-10-15 15:24:01,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:01,268 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-10-15 15:24:01,268 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 15:24:01,269 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-10-15 15:24:01,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-15 15:24:01,270 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:01,270 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:01,270 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:01,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:01,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1507352613, now seen corresponding path program 15 times [2018-10-15 15:24:01,271 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:01,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:02,235 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:24:02,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:02,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 15:24:02,236 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 15:24:02,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 15:24:02,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 15:24:02,237 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 33 states. [2018-10-15 15:24:04,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:04,291 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-10-15 15:24:04,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-15 15:24:04,292 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 103 [2018-10-15 15:24:04,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:04,293 INFO L225 Difference]: With dead ends: 113 [2018-10-15 15:24:04,294 INFO L226 Difference]: Without dead ends: 113 [2018-10-15 15:24:04,295 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=183, Invalid=3723, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 15:24:04,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-10-15 15:24:04,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 110. [2018-10-15 15:24:04,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-10-15 15:24:04,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-10-15 15:24:04,298 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 103 [2018-10-15 15:24:04,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:04,298 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-10-15 15:24:04,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 15:24:04,299 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-10-15 15:24:04,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-15 15:24:04,300 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:04,300 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:04,300 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:04,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:04,300 INFO L82 PathProgramCache]: Analyzing trace with hash -3094079, now seen corresponding path program 16 times [2018-10-15 15:24:04,301 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:04,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:05,300 INFO L134 CoverageAnalysis]: Checked inductivity of 752 backedges. 0 proven. 752 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:24:05,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:05,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 15:24:05,301 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 15:24:05,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 15:24:05,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 15:24:05,302 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 35 states. [2018-10-15 15:24:07,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:07,574 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-10-15 15:24:07,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-15 15:24:07,578 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 109 [2018-10-15 15:24:07,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:07,579 INFO L225 Difference]: With dead ends: 119 [2018-10-15 15:24:07,579 INFO L226 Difference]: Without dead ends: 119 [2018-10-15 15:24:07,581 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=195, Invalid=4227, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 15:24:07,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-10-15 15:24:07,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2018-10-15 15:24:07,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-10-15 15:24:07,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-10-15 15:24:07,584 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 109 [2018-10-15 15:24:07,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:07,584 INFO L481 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-10-15 15:24:07,584 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 15:24:07,584 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-10-15 15:24:07,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-15 15:24:07,585 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:07,585 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:07,585 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:07,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:07,586 INFO L82 PathProgramCache]: Analyzing trace with hash 487616295, now seen corresponding path program 17 times [2018-10-15 15:24:07,586 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:07,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:08,629 INFO L134 CoverageAnalysis]: Checked inductivity of 850 backedges. 0 proven. 850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:24:08,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:08,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 15:24:08,630 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 15:24:08,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 15:24:08,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 15:24:08,631 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 37 states. [2018-10-15 15:24:10,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:10,924 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-10-15 15:24:10,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-15 15:24:10,925 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 115 [2018-10-15 15:24:10,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:10,926 INFO L225 Difference]: With dead ends: 125 [2018-10-15 15:24:10,926 INFO L226 Difference]: Without dead ends: 125 [2018-10-15 15:24:10,929 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=207, Invalid=4763, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 15:24:10,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-10-15 15:24:10,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 122. [2018-10-15 15:24:10,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-10-15 15:24:10,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2018-10-15 15:24:10,932 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 115 [2018-10-15 15:24:10,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:10,932 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2018-10-15 15:24:10,932 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 15:24:10,932 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2018-10-15 15:24:10,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-15 15:24:10,933 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:10,933 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:10,933 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:10,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:10,934 INFO L82 PathProgramCache]: Analyzing trace with hash -2030309363, now seen corresponding path program 18 times [2018-10-15 15:24:10,935 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:10,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:13,514 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 0 proven. 954 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:24:13,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:13,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 15:24:13,515 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 15:24:13,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 15:24:13,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 15:24:13,516 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 39 states. [2018-10-15 15:24:16,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:16,297 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-10-15 15:24:16,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-15 15:24:16,298 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 121 [2018-10-15 15:24:16,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:16,299 INFO L225 Difference]: With dead ends: 131 [2018-10-15 15:24:16,299 INFO L226 Difference]: Without dead ends: 131 [2018-10-15 15:24:16,302 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=219, Invalid=5331, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 15:24:16,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-10-15 15:24:16,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 128. [2018-10-15 15:24:16,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-10-15 15:24:16,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2018-10-15 15:24:16,305 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 121 [2018-10-15 15:24:16,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:16,306 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2018-10-15 15:24:16,306 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 15:24:16,306 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2018-10-15 15:24:16,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-15 15:24:16,307 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:16,307 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:16,307 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:16,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:16,307 INFO L82 PathProgramCache]: Analyzing trace with hash 958442611, now seen corresponding path program 19 times [2018-10-15 15:24:16,308 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:16,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:17,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1064 backedges. 0 proven. 1064 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:24:17,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:17,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 15:24:17,225 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 15:24:17,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 15:24:17,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 15:24:17,226 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 41 states. [2018-10-15 15:24:20,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:20,210 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-10-15 15:24:20,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-15 15:24:20,210 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 127 [2018-10-15 15:24:20,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:20,212 INFO L225 Difference]: With dead ends: 137 [2018-10-15 15:24:20,212 INFO L226 Difference]: Without dead ends: 137 [2018-10-15 15:24:20,215 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=231, Invalid=5931, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 15:24:20,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-10-15 15:24:20,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 134. [2018-10-15 15:24:20,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-10-15 15:24:20,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2018-10-15 15:24:20,218 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 127 [2018-10-15 15:24:20,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:20,219 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2018-10-15 15:24:20,219 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 15:24:20,219 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2018-10-15 15:24:20,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-10-15 15:24:20,220 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:20,220 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:20,220 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:20,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:20,221 INFO L82 PathProgramCache]: Analyzing trace with hash -410778535, now seen corresponding path program 20 times [2018-10-15 15:24:20,222 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:20,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:22,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1180 backedges. 0 proven. 1180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:24:22,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:22,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 15:24:22,194 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 15:24:22,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 15:24:22,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 15:24:22,195 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 43 states. [2018-10-15 15:24:25,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:25,408 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-10-15 15:24:25,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-15 15:24:25,414 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 133 [2018-10-15 15:24:25,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:25,415 INFO L225 Difference]: With dead ends: 143 [2018-10-15 15:24:25,415 INFO L226 Difference]: Without dead ends: 143 [2018-10-15 15:24:25,417 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=243, Invalid=6563, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 15:24:25,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-10-15 15:24:25,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 140. [2018-10-15 15:24:25,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-10-15 15:24:25,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2018-10-15 15:24:25,420 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 133 [2018-10-15 15:24:25,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:25,421 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2018-10-15 15:24:25,421 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 15:24:25,421 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2018-10-15 15:24:25,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-15 15:24:25,422 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:25,422 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:25,422 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:25,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:25,422 INFO L82 PathProgramCache]: Analyzing trace with hash -995928129, now seen corresponding path program 21 times [2018-10-15 15:24:25,423 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:25,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:27,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1302 backedges. 0 proven. 1302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:24:27,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:27,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 15:24:27,194 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 15:24:27,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 15:24:27,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 15:24:27,195 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 45 states. [2018-10-15 15:24:30,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:30,757 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-10-15 15:24:30,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-15 15:24:30,760 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 139 [2018-10-15 15:24:30,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:30,761 INFO L225 Difference]: With dead ends: 149 [2018-10-15 15:24:30,761 INFO L226 Difference]: Without dead ends: 149 [2018-10-15 15:24:30,762 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=255, Invalid=7227, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 15:24:30,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-10-15 15:24:30,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2018-10-15 15:24:30,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-10-15 15:24:30,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2018-10-15 15:24:30,765 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 139 [2018-10-15 15:24:30,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:30,766 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2018-10-15 15:24:30,766 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 15:24:30,766 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2018-10-15 15:24:30,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-15 15:24:30,767 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:30,767 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:30,767 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:30,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:30,768 INFO L82 PathProgramCache]: Analyzing trace with hash -948697435, now seen corresponding path program 22 times [2018-10-15 15:24:30,768 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:30,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:32,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1430 backedges. 0 proven. 1430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:24:32,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:32,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 15:24:32,163 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 15:24:32,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 15:24:32,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 15:24:32,164 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 47 states. [2018-10-15 15:24:36,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:36,015 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-10-15 15:24:36,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-15 15:24:36,016 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 145 [2018-10-15 15:24:36,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:36,018 INFO L225 Difference]: With dead ends: 155 [2018-10-15 15:24:36,018 INFO L226 Difference]: Without dead ends: 155 [2018-10-15 15:24:36,019 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=267, Invalid=7923, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 15:24:36,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-10-15 15:24:36,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 152. [2018-10-15 15:24:36,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-10-15 15:24:36,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2018-10-15 15:24:36,036 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 145 [2018-10-15 15:24:36,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:36,036 INFO L481 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2018-10-15 15:24:36,036 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 15:24:36,036 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2018-10-15 15:24:36,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-15 15:24:36,037 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:36,037 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:36,037 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:36,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:36,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1902342411, now seen corresponding path program 23 times [2018-10-15 15:24:36,038 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:36,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:38,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1564 backedges. 0 proven. 1564 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:24:38,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:38,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 15:24:38,055 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 15:24:38,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 15:24:38,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 15:24:38,056 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 49 states. [2018-10-15 15:24:42,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:42,317 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-10-15 15:24:42,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-15 15:24:42,317 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 151 [2018-10-15 15:24:42,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:42,319 INFO L225 Difference]: With dead ends: 161 [2018-10-15 15:24:42,319 INFO L226 Difference]: Without dead ends: 161 [2018-10-15 15:24:42,321 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=279, Invalid=8651, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 15:24:42,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-10-15 15:24:42,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 158. [2018-10-15 15:24:42,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-10-15 15:24:42,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2018-10-15 15:24:42,324 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 151 [2018-10-15 15:24:42,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:42,325 INFO L481 AbstractCegarLoop]: Abstraction has 158 states and 158 transitions. [2018-10-15 15:24:42,325 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 15:24:42,325 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2018-10-15 15:24:42,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-10-15 15:24:42,326 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:42,326 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:42,326 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:42,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:42,327 INFO L82 PathProgramCache]: Analyzing trace with hash 341243633, now seen corresponding path program 24 times [2018-10-15 15:24:42,327 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:42,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:43,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 0 proven. 1704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:24:43,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:43,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 15:24:43,740 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 15:24:43,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 15:24:43,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 15:24:43,741 INFO L87 Difference]: Start difference. First operand 158 states and 158 transitions. Second operand 51 states. [2018-10-15 15:24:48,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:48,166 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-10-15 15:24:48,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-15 15:24:48,167 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 157 [2018-10-15 15:24:48,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:48,168 INFO L225 Difference]: With dead ends: 167 [2018-10-15 15:24:48,168 INFO L226 Difference]: Without dead ends: 167 [2018-10-15 15:24:48,169 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=291, Invalid=9411, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 15:24:48,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-10-15 15:24:48,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 164. [2018-10-15 15:24:48,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-10-15 15:24:48,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2018-10-15 15:24:48,172 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 157 [2018-10-15 15:24:48,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:48,173 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2018-10-15 15:24:48,173 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 15:24:48,173 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2018-10-15 15:24:48,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-15 15:24:48,174 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:48,174 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:48,174 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:48,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:48,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1733560233, now seen corresponding path program 25 times [2018-10-15 15:24:48,175 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:48,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:49,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1850 backedges. 0 proven. 1850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:24:49,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:49,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 15:24:49,965 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 15:24:49,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 15:24:49,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 15:24:49,966 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand 53 states. [2018-10-15 15:24:54,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:54,838 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2018-10-15 15:24:54,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-15 15:24:54,841 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 163 [2018-10-15 15:24:54,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:54,842 INFO L225 Difference]: With dead ends: 173 [2018-10-15 15:24:54,842 INFO L226 Difference]: Without dead ends: 173 [2018-10-15 15:24:54,844 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=303, Invalid=10203, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 15:24:54,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-10-15 15:24:54,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 170. [2018-10-15 15:24:54,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-10-15 15:24:54,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 170 transitions. [2018-10-15 15:24:54,848 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 170 transitions. Word has length 163 [2018-10-15 15:24:54,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:54,848 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 170 transitions. [2018-10-15 15:24:54,848 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 15:24:54,848 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 170 transitions. [2018-10-15 15:24:54,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-15 15:24:54,849 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:54,849 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:54,850 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:54,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:54,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1019751107, now seen corresponding path program 26 times [2018-10-15 15:24:54,851 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:54,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:56,584 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:24:56,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:56,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 15:24:56,585 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 15:24:56,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 15:24:56,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 15:24:56,586 INFO L87 Difference]: Start difference. First operand 170 states and 170 transitions. Second operand 55 states. [2018-10-15 15:25:01,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:25:01,689 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-10-15 15:25:01,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-15 15:25:01,690 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 169 [2018-10-15 15:25:01,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:25:01,692 INFO L225 Difference]: With dead ends: 179 [2018-10-15 15:25:01,692 INFO L226 Difference]: Without dead ends: 179 [2018-10-15 15:25:01,693 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1326 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=315, Invalid=11027, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 15:25:01,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-10-15 15:25:01,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 176. [2018-10-15 15:25:01,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-10-15 15:25:01,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2018-10-15 15:25:01,696 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 169 [2018-10-15 15:25:01,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:25:01,697 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2018-10-15 15:25:01,697 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 15:25:01,697 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2018-10-15 15:25:01,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-15 15:25:01,697 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:25:01,698 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:25:01,698 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:25:01,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:25:01,698 INFO L82 PathProgramCache]: Analyzing trace with hash -79172189, now seen corresponding path program 27 times [2018-10-15 15:25:01,699 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:25:01,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:25:03,342 INFO L134 CoverageAnalysis]: Checked inductivity of 2160 backedges. 0 proven. 2160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:25:03,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:25:03,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 15:25:03,343 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 15:25:03,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 15:25:03,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 15:25:03,343 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 57 states. [2018-10-15 15:25:08,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:25:08,939 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2018-10-15 15:25:08,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-15 15:25:08,939 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 175 [2018-10-15 15:25:08,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:25:08,941 INFO L225 Difference]: With dead ends: 185 [2018-10-15 15:25:08,941 INFO L226 Difference]: Without dead ends: 185 [2018-10-15 15:25:08,943 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1431 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=327, Invalid=11883, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 15:25:08,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-10-15 15:25:08,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 182. [2018-10-15 15:25:08,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-10-15 15:25:08,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2018-10-15 15:25:08,946 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 175 [2018-10-15 15:25:08,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:25:08,947 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2018-10-15 15:25:08,947 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 15:25:08,947 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2018-10-15 15:25:08,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-15 15:25:08,948 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:25:08,948 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:25:08,948 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:25:08,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:25:08,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1868455543, now seen corresponding path program 28 times [2018-10-15 15:25:08,949 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:25:08,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:25:11,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2324 backedges. 0 proven. 2324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:25:11,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:25:11,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-15 15:25:11,037 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-15 15:25:11,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-15 15:25:11,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 15:25:11,037 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 59 states. [2018-10-15 15:25:16,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:25:16,961 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-10-15 15:25:16,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-15 15:25:16,969 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 181 [2018-10-15 15:25:16,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:25:16,970 INFO L225 Difference]: With dead ends: 191 [2018-10-15 15:25:16,970 INFO L226 Difference]: Without dead ends: 191 [2018-10-15 15:25:16,971 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1540 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=339, Invalid=12771, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 15:25:16,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-10-15 15:25:16,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 188. [2018-10-15 15:25:16,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-10-15 15:25:16,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 188 transitions. [2018-10-15 15:25:16,975 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 188 transitions. Word has length 181 [2018-10-15 15:25:16,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:25:16,975 INFO L481 AbstractCegarLoop]: Abstraction has 188 states and 188 transitions. [2018-10-15 15:25:16,975 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-15 15:25:16,976 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 188 transitions. [2018-10-15 15:25:16,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-10-15 15:25:16,976 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:25:16,977 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:25:16,977 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:25:16,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:25:16,977 INFO L82 PathProgramCache]: Analyzing trace with hash -2122166033, now seen corresponding path program 29 times [2018-10-15 15:25:16,978 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:25:16,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:25:18,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2494 backedges. 0 proven. 2494 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:25:18,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:25:18,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-15 15:25:18,864 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-15 15:25:18,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-15 15:25:18,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 15:25:18,864 INFO L87 Difference]: Start difference. First operand 188 states and 188 transitions. Second operand 61 states. [2018-10-15 15:25:25,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:25:25,396 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2018-10-15 15:25:25,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-15 15:25:25,396 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 187 [2018-10-15 15:25:25,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:25:25,398 INFO L225 Difference]: With dead ends: 197 [2018-10-15 15:25:25,398 INFO L226 Difference]: Without dead ends: 197 [2018-10-15 15:25:25,400 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1653 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=351, Invalid=13691, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 15:25:25,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-10-15 15:25:25,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 194. [2018-10-15 15:25:25,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-10-15 15:25:25,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 194 transitions. [2018-10-15 15:25:25,403 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 194 transitions. Word has length 187 [2018-10-15 15:25:25,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:25:25,404 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 194 transitions. [2018-10-15 15:25:25,404 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-15 15:25:25,404 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 194 transitions. [2018-10-15 15:25:25,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-15 15:25:25,405 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:25:25,405 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:25:25,405 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:25:25,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:25:25,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1063298091, now seen corresponding path program 30 times [2018-10-15 15:25:25,407 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:25:25,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:25:29,074 INFO L134 CoverageAnalysis]: Checked inductivity of 2670 backedges. 0 proven. 2670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:25:29,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:25:29,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-15 15:25:29,075 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-15 15:25:29,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-15 15:25:29,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 15:25:29,076 INFO L87 Difference]: Start difference. First operand 194 states and 194 transitions. Second operand 63 states. [2018-10-15 15:25:36,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:25:36,442 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2018-10-15 15:25:36,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-15 15:25:36,443 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 193 [2018-10-15 15:25:36,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:25:36,445 INFO L225 Difference]: With dead ends: 203 [2018-10-15 15:25:36,445 INFO L226 Difference]: Without dead ends: 203 [2018-10-15 15:25:36,447 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1770 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=363, Invalid=14643, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 15:25:36,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-10-15 15:25:36,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 200. [2018-10-15 15:25:36,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-10-15 15:25:36,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 200 transitions. [2018-10-15 15:25:36,450 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 200 transitions. Word has length 193 [2018-10-15 15:25:36,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:25:36,451 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 200 transitions. [2018-10-15 15:25:36,451 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-15 15:25:36,451 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 200 transitions. [2018-10-15 15:25:36,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-15 15:25:36,452 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:25:36,452 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:25:36,452 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:25:36,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:25:36,453 INFO L82 PathProgramCache]: Analyzing trace with hash -81386949, now seen corresponding path program 31 times [2018-10-15 15:25:36,453 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:25:36,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:25:39,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2852 backedges. 0 proven. 2852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:25:39,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:25:39,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-15 15:25:39,106 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-15 15:25:39,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-15 15:25:39,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-10-15 15:25:39,107 INFO L87 Difference]: Start difference. First operand 200 states and 200 transitions. Second operand 65 states. [2018-10-15 15:25:46,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:25:46,475 INFO L93 Difference]: Finished difference Result 209 states and 209 transitions. [2018-10-15 15:25:46,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-15 15:25:46,476 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 199 [2018-10-15 15:25:46,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:25:46,478 INFO L225 Difference]: With dead ends: 209 [2018-10-15 15:25:46,478 INFO L226 Difference]: Without dead ends: 209 [2018-10-15 15:25:46,479 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1891 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=375, Invalid=15627, Unknown=0, NotChecked=0, Total=16002 [2018-10-15 15:25:46,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-10-15 15:25:46,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2018-10-15 15:25:46,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-10-15 15:25:46,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2018-10-15 15:25:46,483 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 199 [2018-10-15 15:25:46,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:25:46,483 INFO L481 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2018-10-15 15:25:46,484 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-15 15:25:46,484 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2018-10-15 15:25:46,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-10-15 15:25:46,484 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:25:46,484 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:25:46,485 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:25:46,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:25:46,485 INFO L82 PathProgramCache]: Analyzing trace with hash -558103519, now seen corresponding path program 32 times [2018-10-15 15:25:46,486 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:25:46,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:25:49,653 INFO L134 CoverageAnalysis]: Checked inductivity of 3040 backedges. 0 proven. 3040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:25:49,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:25:49,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-15 15:25:49,654 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-15 15:25:49,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-15 15:25:49,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 15:25:49,655 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand 67 states. [2018-10-15 15:25:57,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:25:57,547 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2018-10-15 15:25:57,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-10-15 15:25:57,548 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 205 [2018-10-15 15:25:57,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:25:57,550 INFO L225 Difference]: With dead ends: 215 [2018-10-15 15:25:57,550 INFO L226 Difference]: Without dead ends: 215 [2018-10-15 15:25:57,552 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=387, Invalid=16643, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 15:25:57,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-10-15 15:25:57,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 212. [2018-10-15 15:25:57,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-10-15 15:25:57,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 212 transitions. [2018-10-15 15:25:57,555 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 212 transitions. Word has length 205 [2018-10-15 15:25:57,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:25:57,555 INFO L481 AbstractCegarLoop]: Abstraction has 212 states and 212 transitions. [2018-10-15 15:25:57,555 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-15 15:25:57,556 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 212 transitions. [2018-10-15 15:25:57,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-10-15 15:25:57,557 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:25:57,557 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:25:57,557 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:25:57,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:25:57,557 INFO L82 PathProgramCache]: Analyzing trace with hash -545365625, now seen corresponding path program 33 times [2018-10-15 15:25:57,558 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:25:57,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:26:00,379 INFO L134 CoverageAnalysis]: Checked inductivity of 3234 backedges. 0 proven. 3234 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:26:00,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:26:00,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-15 15:26:00,380 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-15 15:26:00,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-15 15:26:00,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 15:26:00,381 INFO L87 Difference]: Start difference. First operand 212 states and 212 transitions. Second operand 69 states. [2018-10-15 15:26:08,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:26:08,460 INFO L93 Difference]: Finished difference Result 221 states and 221 transitions. [2018-10-15 15:26:08,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-10-15 15:26:08,460 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 211 [2018-10-15 15:26:08,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:26:08,462 INFO L225 Difference]: With dead ends: 221 [2018-10-15 15:26:08,462 INFO L226 Difference]: Without dead ends: 221 [2018-10-15 15:26:08,464 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2145 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=399, Invalid=17691, Unknown=0, NotChecked=0, Total=18090 [2018-10-15 15:26:08,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-10-15 15:26:08,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 218. [2018-10-15 15:26:08,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-10-15 15:26:08,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 218 transitions. [2018-10-15 15:26:08,467 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 218 transitions. Word has length 211 [2018-10-15 15:26:08,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:26:08,468 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 218 transitions. [2018-10-15 15:26:08,468 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-15 15:26:08,468 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 218 transitions. [2018-10-15 15:26:08,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-10-15 15:26:08,469 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:26:08,469 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:26:08,469 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:26:08,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:26:08,470 INFO L82 PathProgramCache]: Analyzing trace with hash 2114099821, now seen corresponding path program 34 times [2018-10-15 15:26:08,470 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:26:08,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:26:10,992 INFO L134 CoverageAnalysis]: Checked inductivity of 3434 backedges. 0 proven. 3434 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:26:10,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:26:10,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-15 15:26:10,993 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-15 15:26:10,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-15 15:26:10,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 15:26:10,993 INFO L87 Difference]: Start difference. First operand 218 states and 218 transitions. Second operand 71 states. [2018-10-15 15:26:19,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:26:19,550 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2018-10-15 15:26:19,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-10-15 15:26:19,551 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 217 [2018-10-15 15:26:19,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:26:19,552 INFO L225 Difference]: With dead ends: 227 [2018-10-15 15:26:19,553 INFO L226 Difference]: Without dead ends: 227 [2018-10-15 15:26:19,554 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2278 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=411, Invalid=18771, Unknown=0, NotChecked=0, Total=19182 [2018-10-15 15:26:19,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-10-15 15:26:19,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 224. [2018-10-15 15:26:19,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-10-15 15:26:19,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 224 transitions. [2018-10-15 15:26:19,557 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 224 transitions. Word has length 217 [2018-10-15 15:26:19,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:26:19,557 INFO L481 AbstractCegarLoop]: Abstraction has 224 states and 224 transitions. [2018-10-15 15:26:19,557 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-15 15:26:19,557 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 224 transitions. [2018-10-15 15:26:19,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-10-15 15:26:19,558 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:26:19,559 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:26:19,559 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:26:19,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:26:19,559 INFO L82 PathProgramCache]: Analyzing trace with hash 223743699, now seen corresponding path program 35 times [2018-10-15 15:26:19,560 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:26:19,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:26:23,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3640 backedges. 0 proven. 3640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:26:23,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:26:23,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-15 15:26:23,674 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-15 15:26:23,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-15 15:26:23,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-10-15 15:26:23,675 INFO L87 Difference]: Start difference. First operand 224 states and 224 transitions. Second operand 73 states. [2018-10-15 15:26:32,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:26:32,828 INFO L93 Difference]: Finished difference Result 233 states and 233 transitions. [2018-10-15 15:26:32,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-10-15 15:26:32,828 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 223 [2018-10-15 15:26:32,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:26:32,830 INFO L225 Difference]: With dead ends: 233 [2018-10-15 15:26:32,830 INFO L226 Difference]: Without dead ends: 233 [2018-10-15 15:26:32,831 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2415 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=423, Invalid=19883, Unknown=0, NotChecked=0, Total=20306 [2018-10-15 15:26:32,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-10-15 15:26:32,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 230. [2018-10-15 15:26:32,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-10-15 15:26:32,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 230 transitions. [2018-10-15 15:26:32,834 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 230 transitions. Word has length 223 [2018-10-15 15:26:32,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:26:32,834 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 230 transitions. [2018-10-15 15:26:32,835 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-15 15:26:32,835 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 230 transitions. [2018-10-15 15:26:32,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-10-15 15:26:32,836 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:26:32,836 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:26:32,836 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:26:32,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:26:32,837 INFO L82 PathProgramCache]: Analyzing trace with hash -117563719, now seen corresponding path program 36 times [2018-10-15 15:26:32,837 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:26:32,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:26:35,709 INFO L134 CoverageAnalysis]: Checked inductivity of 3852 backedges. 0 proven. 3852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:26:35,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:26:35,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-15 15:26:35,710 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-15 15:26:35,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-15 15:26:35,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 15:26:35,711 INFO L87 Difference]: Start difference. First operand 230 states and 230 transitions. Second operand 75 states. [2018-10-15 15:26:45,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:26:45,275 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2018-10-15 15:26:45,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-10-15 15:26:45,275 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 229 [2018-10-15 15:26:45,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:26:45,276 INFO L225 Difference]: With dead ends: 239 [2018-10-15 15:26:45,276 INFO L226 Difference]: Without dead ends: 239 [2018-10-15 15:26:45,277 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2556 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=435, Invalid=21027, Unknown=0, NotChecked=0, Total=21462 [2018-10-15 15:26:45,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-10-15 15:26:45,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 236. [2018-10-15 15:26:45,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-10-15 15:26:45,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 236 transitions. [2018-10-15 15:26:45,281 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 236 transitions. Word has length 229 [2018-10-15 15:26:45,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:26:45,281 INFO L481 AbstractCegarLoop]: Abstraction has 236 states and 236 transitions. [2018-10-15 15:26:45,281 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-15 15:26:45,281 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 236 transitions. [2018-10-15 15:26:45,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-10-15 15:26:45,282 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:26:45,283 INFO L375 BasicCegarLoop]: trace histogram [38, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:26:45,283 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:26:45,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:26:45,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1963447777, now seen corresponding path program 37 times [2018-10-15 15:26:45,284 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:26:45,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:26:48,625 INFO L134 CoverageAnalysis]: Checked inductivity of 4070 backedges. 0 proven. 4070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:26:48,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:26:48,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-15 15:26:48,626 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-15 15:26:48,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-15 15:26:48,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 15:26:48,627 INFO L87 Difference]: Start difference. First operand 236 states and 236 transitions. Second operand 77 states. [2018-10-15 15:26:58,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:26:58,544 INFO L93 Difference]: Finished difference Result 245 states and 245 transitions. [2018-10-15 15:26:58,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-10-15 15:26:58,545 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 235 [2018-10-15 15:26:58,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:26:58,547 INFO L225 Difference]: With dead ends: 245 [2018-10-15 15:26:58,547 INFO L226 Difference]: Without dead ends: 245 [2018-10-15 15:26:58,548 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2701 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=447, Invalid=22203, Unknown=0, NotChecked=0, Total=22650 [2018-10-15 15:26:58,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-10-15 15:26:58,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 242. [2018-10-15 15:26:58,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-10-15 15:26:58,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 242 transitions. [2018-10-15 15:26:58,551 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 242 transitions. Word has length 235 [2018-10-15 15:26:58,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:26:58,551 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 242 transitions. [2018-10-15 15:26:58,551 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-15 15:26:58,551 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 242 transitions. [2018-10-15 15:26:58,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-10-15 15:26:58,552 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:26:58,552 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:26:58,552 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:26:58,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:26:58,552 INFO L82 PathProgramCache]: Analyzing trace with hash 834244869, now seen corresponding path program 38 times [2018-10-15 15:26:58,553 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:26:58,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:27:02,014 INFO L134 CoverageAnalysis]: Checked inductivity of 4294 backedges. 0 proven. 4294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:27:02,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:27:02,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-15 15:27:02,015 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-15 15:27:02,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-15 15:27:02,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 15:27:02,016 INFO L87 Difference]: Start difference. First operand 242 states and 242 transitions. Second operand 79 states. [2018-10-15 15:27:12,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:27:12,596 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2018-10-15 15:27:12,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-10-15 15:27:12,597 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 241 [2018-10-15 15:27:12,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:27:12,598 INFO L225 Difference]: With dead ends: 251 [2018-10-15 15:27:12,599 INFO L226 Difference]: Without dead ends: 251 [2018-10-15 15:27:12,600 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2850 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=459, Invalid=23411, Unknown=0, NotChecked=0, Total=23870 [2018-10-15 15:27:12,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-10-15 15:27:12,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 248. [2018-10-15 15:27:12,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-10-15 15:27:12,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 248 transitions. [2018-10-15 15:27:12,602 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 248 transitions. Word has length 241 [2018-10-15 15:27:12,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:27:12,602 INFO L481 AbstractCegarLoop]: Abstraction has 248 states and 248 transitions. [2018-10-15 15:27:12,602 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-15 15:27:12,603 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 248 transitions. [2018-10-15 15:27:12,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-10-15 15:27:12,603 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:27:12,603 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:27:12,604 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:27:12,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:27:12,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1177531243, now seen corresponding path program 39 times [2018-10-15 15:27:12,604 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:27:12,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:27:15,869 INFO L134 CoverageAnalysis]: Checked inductivity of 4524 backedges. 0 proven. 4524 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:27:15,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:27:15,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-15 15:27:15,870 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-15 15:27:15,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-15 15:27:15,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 15:27:15,870 INFO L87 Difference]: Start difference. First operand 248 states and 248 transitions. Second operand 81 states. [2018-10-15 15:27:26,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:27:26,990 INFO L93 Difference]: Finished difference Result 257 states and 257 transitions. [2018-10-15 15:27:26,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-10-15 15:27:26,991 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 247 [2018-10-15 15:27:26,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:27:26,992 INFO L225 Difference]: With dead ends: 257 [2018-10-15 15:27:26,992 INFO L226 Difference]: Without dead ends: 257 [2018-10-15 15:27:26,993 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3003 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=471, Invalid=24651, Unknown=0, NotChecked=0, Total=25122 [2018-10-15 15:27:26,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-10-15 15:27:26,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 254. [2018-10-15 15:27:26,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-10-15 15:27:26,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 254 transitions. [2018-10-15 15:27:26,997 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 254 transitions. Word has length 247 [2018-10-15 15:27:26,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:27:26,997 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 254 transitions. [2018-10-15 15:27:26,997 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-15 15:27:26,998 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 254 transitions. [2018-10-15 15:27:26,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-10-15 15:27:26,999 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:27:26,999 INFO L375 BasicCegarLoop]: trace histogram [41, 40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:27:26,999 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:27:26,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:27:26,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1371533649, now seen corresponding path program 40 times [2018-10-15 15:27:27,000 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:27:27,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:27:30,585 INFO L134 CoverageAnalysis]: Checked inductivity of 4760 backedges. 0 proven. 4760 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:27:30,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:27:30,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-15 15:27:30,586 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-15 15:27:30,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-15 15:27:30,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 15:27:30,586 INFO L87 Difference]: Start difference. First operand 254 states and 254 transitions. Second operand 83 states. [2018-10-15 15:27:42,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:27:42,121 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions. [2018-10-15 15:27:42,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-10-15 15:27:42,122 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 253 [2018-10-15 15:27:42,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:27:42,124 INFO L225 Difference]: With dead ends: 263 [2018-10-15 15:27:42,124 INFO L226 Difference]: Without dead ends: 263 [2018-10-15 15:27:42,125 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3160 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=483, Invalid=25923, Unknown=0, NotChecked=0, Total=26406 [2018-10-15 15:27:42,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-10-15 15:27:42,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 260. [2018-10-15 15:27:42,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-10-15 15:27:42,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 260 transitions. [2018-10-15 15:27:42,129 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 260 transitions. Word has length 253 [2018-10-15 15:27:42,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:27:42,130 INFO L481 AbstractCegarLoop]: Abstraction has 260 states and 260 transitions. [2018-10-15 15:27:42,130 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-15 15:27:42,130 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 260 transitions. [2018-10-15 15:27:42,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-10-15 15:27:42,131 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:27:42,131 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:27:42,131 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:27:42,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:27:42,132 INFO L82 PathProgramCache]: Analyzing trace with hash -733500745, now seen corresponding path program 41 times [2018-10-15 15:27:42,132 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:27:42,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:27:46,054 INFO L134 CoverageAnalysis]: Checked inductivity of 5002 backedges. 0 proven. 5002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:27:46,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:27:46,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-15 15:27:46,054 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-15 15:27:46,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-15 15:27:46,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2018-10-15 15:27:46,055 INFO L87 Difference]: Start difference. First operand 260 states and 260 transitions. Second operand 85 states. [2018-10-15 15:27:58,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:27:58,345 INFO L93 Difference]: Finished difference Result 269 states and 269 transitions. [2018-10-15 15:27:58,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-10-15 15:27:58,346 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 259 [2018-10-15 15:27:58,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:27:58,347 INFO L225 Difference]: With dead ends: 269 [2018-10-15 15:27:58,348 INFO L226 Difference]: Without dead ends: 269 [2018-10-15 15:27:58,349 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3321 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=495, Invalid=27227, Unknown=0, NotChecked=0, Total=27722 [2018-10-15 15:27:58,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-10-15 15:27:58,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 266. [2018-10-15 15:27:58,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-10-15 15:27:58,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 266 transitions. [2018-10-15 15:27:58,352 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 266 transitions. Word has length 259 [2018-10-15 15:27:58,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:27:58,352 INFO L481 AbstractCegarLoop]: Abstraction has 266 states and 266 transitions. [2018-10-15 15:27:58,352 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-15 15:27:58,353 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 266 transitions. [2018-10-15 15:27:58,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-10-15 15:27:58,353 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:27:58,354 INFO L375 BasicCegarLoop]: trace histogram [43, 42, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:27:58,354 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:27:58,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:27:58,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1977860195, now seen corresponding path program 42 times [2018-10-15 15:27:58,355 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:27:58,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:28:02,208 INFO L134 CoverageAnalysis]: Checked inductivity of 5250 backedges. 0 proven. 5250 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:28:02,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:28:02,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-15 15:28:02,209 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-15 15:28:02,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-15 15:28:02,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 15:28:02,210 INFO L87 Difference]: Start difference. First operand 266 states and 266 transitions. Second operand 87 states. [2018-10-15 15:28:15,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:28:15,024 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2018-10-15 15:28:15,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-10-15 15:28:15,025 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 265 [2018-10-15 15:28:15,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:28:15,027 INFO L225 Difference]: With dead ends: 275 [2018-10-15 15:28:15,027 INFO L226 Difference]: Without dead ends: 275 [2018-10-15 15:28:15,028 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3486 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=507, Invalid=28563, Unknown=0, NotChecked=0, Total=29070 [2018-10-15 15:28:15,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-10-15 15:28:15,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 272. [2018-10-15 15:28:15,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-10-15 15:28:15,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 272 transitions. [2018-10-15 15:28:15,032 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 272 transitions. Word has length 265 [2018-10-15 15:28:15,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:28:15,033 INFO L481 AbstractCegarLoop]: Abstraction has 272 states and 272 transitions. [2018-10-15 15:28:15,033 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-15 15:28:15,033 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 272 transitions. [2018-10-15 15:28:15,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-10-15 15:28:15,034 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:28:15,034 INFO L375 BasicCegarLoop]: trace histogram [44, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:28:15,035 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:28:15,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:28:15,035 INFO L82 PathProgramCache]: Analyzing trace with hash 839585795, now seen corresponding path program 43 times [2018-10-15 15:28:15,036 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:28:15,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:28:19,058 INFO L134 CoverageAnalysis]: Checked inductivity of 5504 backedges. 0 proven. 5504 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:28:19,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:28:19,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-15 15:28:19,059 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-15 15:28:19,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-15 15:28:19,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2018-10-15 15:28:19,060 INFO L87 Difference]: Start difference. First operand 272 states and 272 transitions. Second operand 89 states. [2018-10-15 15:28:32,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:28:32,511 INFO L93 Difference]: Finished difference Result 281 states and 281 transitions. [2018-10-15 15:28:32,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-10-15 15:28:32,512 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 271 [2018-10-15 15:28:32,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:28:32,513 INFO L225 Difference]: With dead ends: 281 [2018-10-15 15:28:32,514 INFO L226 Difference]: Without dead ends: 281 [2018-10-15 15:28:32,515 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3655 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=519, Invalid=29931, Unknown=0, NotChecked=0, Total=30450 [2018-10-15 15:28:32,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-10-15 15:28:32,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 278. [2018-10-15 15:28:32,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-10-15 15:28:32,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 278 transitions. [2018-10-15 15:28:32,518 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 278 transitions. Word has length 271 [2018-10-15 15:28:32,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:28:32,519 INFO L481 AbstractCegarLoop]: Abstraction has 278 states and 278 transitions. [2018-10-15 15:28:32,519 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-15 15:28:32,519 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 278 transitions. [2018-10-15 15:28:32,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-10-15 15:28:32,520 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:28:32,521 INFO L375 BasicCegarLoop]: trace histogram [45, 44, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:28:32,521 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:28:32,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:28:32,521 INFO L82 PathProgramCache]: Analyzing trace with hash -749110295, now seen corresponding path program 44 times [2018-10-15 15:28:32,522 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:28:32,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:28:36,785 INFO L134 CoverageAnalysis]: Checked inductivity of 5764 backedges. 0 proven. 5764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:28:36,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:28:36,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-15 15:28:36,786 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-15 15:28:36,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-15 15:28:36,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=8011, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 15:28:36,786 INFO L87 Difference]: Start difference. First operand 278 states and 278 transitions. Second operand 91 states. [2018-10-15 15:28:50,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:28:50,940 INFO L93 Difference]: Finished difference Result 287 states and 287 transitions. [2018-10-15 15:28:50,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-10-15 15:28:50,941 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 277 [2018-10-15 15:28:50,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:28:50,942 INFO L225 Difference]: With dead ends: 287 [2018-10-15 15:28:50,942 INFO L226 Difference]: Without dead ends: 287 [2018-10-15 15:28:50,943 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3828 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=531, Invalid=31331, Unknown=0, NotChecked=0, Total=31862 [2018-10-15 15:28:50,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-10-15 15:28:50,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 284. [2018-10-15 15:28:50,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-10-15 15:28:50,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 284 transitions. [2018-10-15 15:28:50,947 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 284 transitions. Word has length 277 [2018-10-15 15:28:50,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:28:50,947 INFO L481 AbstractCegarLoop]: Abstraction has 284 states and 284 transitions. [2018-10-15 15:28:50,947 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-15 15:28:50,948 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 284 transitions. [2018-10-15 15:28:50,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-10-15 15:28:50,949 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:28:50,949 INFO L375 BasicCegarLoop]: trace histogram [46, 45, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:28:50,949 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:28:50,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:28:50,950 INFO L82 PathProgramCache]: Analyzing trace with hash -2084248753, now seen corresponding path program 45 times [2018-10-15 15:28:50,950 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:28:50,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:28:56,039 INFO L134 CoverageAnalysis]: Checked inductivity of 6030 backedges. 0 proven. 6030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:28:56,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:28:56,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-15 15:28:56,040 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-15 15:28:56,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-15 15:28:56,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=8373, Unknown=0, NotChecked=0, Total=8556 [2018-10-15 15:28:56,040 INFO L87 Difference]: Start difference. First operand 284 states and 284 transitions. Second operand 93 states. [2018-10-15 15:29:10,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:29:10,834 INFO L93 Difference]: Finished difference Result 293 states and 293 transitions. [2018-10-15 15:29:10,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-10-15 15:29:10,835 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 283 [2018-10-15 15:29:10,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:29:10,837 INFO L225 Difference]: With dead ends: 293 [2018-10-15 15:29:10,837 INFO L226 Difference]: Without dead ends: 293 [2018-10-15 15:29:10,838 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4005 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=543, Invalid=32763, Unknown=0, NotChecked=0, Total=33306 [2018-10-15 15:29:10,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-10-15 15:29:10,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 290. [2018-10-15 15:29:10,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-10-15 15:29:10,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 290 transitions. [2018-10-15 15:29:10,841 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 290 transitions. Word has length 283 [2018-10-15 15:29:10,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:29:10,841 INFO L481 AbstractCegarLoop]: Abstraction has 290 states and 290 transitions. [2018-10-15 15:29:10,842 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-15 15:29:10,842 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 290 transitions. [2018-10-15 15:29:10,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-10-15 15:29:10,843 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:29:10,843 INFO L375 BasicCegarLoop]: trace histogram [47, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:29:10,843 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:29:10,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:29:10,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1383946699, now seen corresponding path program 46 times [2018-10-15 15:29:10,844 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:29:10,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:29:15,192 INFO L134 CoverageAnalysis]: Checked inductivity of 6302 backedges. 0 proven. 6302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:29:15,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:29:15,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-10-15 15:29:15,193 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-15 15:29:15,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-15 15:29:15,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=8743, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 15:29:15,193 INFO L87 Difference]: Start difference. First operand 290 states and 290 transitions. Second operand 95 states. [2018-10-15 15:29:27,128 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-15 15:29:30,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:29:30,883 INFO L93 Difference]: Finished difference Result 299 states and 299 transitions. [2018-10-15 15:29:30,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-10-15 15:29:30,884 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 289 [2018-10-15 15:29:30,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:29:30,886 INFO L225 Difference]: With dead ends: 299 [2018-10-15 15:29:30,886 INFO L226 Difference]: Without dead ends: 299 [2018-10-15 15:29:30,887 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4186 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=555, Invalid=34227, Unknown=0, NotChecked=0, Total=34782 [2018-10-15 15:29:30,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-10-15 15:29:30,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 296. [2018-10-15 15:29:30,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-10-15 15:29:30,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 296 transitions. [2018-10-15 15:29:30,890 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 296 transitions. Word has length 289 [2018-10-15 15:29:30,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:29:30,890 INFO L481 AbstractCegarLoop]: Abstraction has 296 states and 296 transitions. [2018-10-15 15:29:30,891 INFO L482 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-15 15:29:30,891 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 296 transitions. [2018-10-15 15:29:30,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-10-15 15:29:30,892 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:29:30,892 INFO L375 BasicCegarLoop]: trace histogram [48, 47, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:29:30,892 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:29:30,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:29:30,892 INFO L82 PathProgramCache]: Analyzing trace with hash -717216613, now seen corresponding path program 47 times [2018-10-15 15:29:30,893 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:29:30,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:29:35,343 INFO L134 CoverageAnalysis]: Checked inductivity of 6580 backedges. 0 proven. 6580 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:29:35,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:29:35,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-10-15 15:29:35,344 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-15 15:29:35,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-15 15:29:35,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=9121, Unknown=0, NotChecked=0, Total=9312 [2018-10-15 15:29:35,345 INFO L87 Difference]: Start difference. First operand 296 states and 296 transitions. Second operand 97 states. [2018-10-15 15:29:51,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:29:51,322 INFO L93 Difference]: Finished difference Result 305 states and 305 transitions. [2018-10-15 15:29:51,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-10-15 15:29:51,322 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 295 [2018-10-15 15:29:51,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:29:51,324 INFO L225 Difference]: With dead ends: 305 [2018-10-15 15:29:51,324 INFO L226 Difference]: Without dead ends: 305 [2018-10-15 15:29:51,325 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4371 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=567, Invalid=35723, Unknown=0, NotChecked=0, Total=36290 [2018-10-15 15:29:51,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-10-15 15:29:51,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 302. [2018-10-15 15:29:51,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-10-15 15:29:51,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 302 transitions. [2018-10-15 15:29:51,329 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 302 transitions. Word has length 295 [2018-10-15 15:29:51,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:29:51,330 INFO L481 AbstractCegarLoop]: Abstraction has 302 states and 302 transitions. [2018-10-15 15:29:51,330 INFO L482 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-15 15:29:51,330 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 302 transitions. [2018-10-15 15:29:51,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-10-15 15:29:51,331 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:29:51,331 INFO L375 BasicCegarLoop]: trace histogram [49, 48, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:29:51,332 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:29:51,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:29:51,332 INFO L82 PathProgramCache]: Analyzing trace with hash -534593919, now seen corresponding path program 48 times [2018-10-15 15:29:51,333 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:29:51,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:29:55,986 INFO L134 CoverageAnalysis]: Checked inductivity of 6864 backedges. 0 proven. 6864 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:29:55,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:29:55,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-10-15 15:29:55,987 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-15 15:29:55,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-15 15:29:55,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=9507, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 15:29:55,988 INFO L87 Difference]: Start difference. First operand 302 states and 302 transitions. Second operand 99 states. [2018-10-15 15:30:12,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:30:12,717 INFO L93 Difference]: Finished difference Result 311 states and 311 transitions. [2018-10-15 15:30:12,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-10-15 15:30:12,718 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 301 [2018-10-15 15:30:12,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:30:12,720 INFO L225 Difference]: With dead ends: 311 [2018-10-15 15:30:12,720 INFO L226 Difference]: Without dead ends: 311 [2018-10-15 15:30:12,722 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4560 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=579, Invalid=37251, Unknown=0, NotChecked=0, Total=37830 [2018-10-15 15:30:12,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-10-15 15:30:12,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 308. [2018-10-15 15:30:12,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-10-15 15:30:12,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 308 transitions. [2018-10-15 15:30:12,725 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 308 transitions. Word has length 301 [2018-10-15 15:30:12,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:30:12,725 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 308 transitions. [2018-10-15 15:30:12,725 INFO L482 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-15 15:30:12,725 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 308 transitions. [2018-10-15 15:30:12,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-10-15 15:30:12,727 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:30:12,727 INFO L375 BasicCegarLoop]: trace histogram [50, 49, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:30:12,727 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:30:12,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:30:12,727 INFO L82 PathProgramCache]: Analyzing trace with hash -641215513, now seen corresponding path program 49 times [2018-10-15 15:30:12,728 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:30:12,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:30:17,821 INFO L134 CoverageAnalysis]: Checked inductivity of 7154 backedges. 0 proven. 7154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:30:17,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:30:17,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-10-15 15:30:17,822 INFO L460 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-10-15 15:30:17,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-10-15 15:30:17,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=9901, Unknown=0, NotChecked=0, Total=10100 [2018-10-15 15:30:17,822 INFO L87 Difference]: Start difference. First operand 308 states and 308 transitions. Second operand 101 states. [2018-10-15 15:30:35,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:30:35,128 INFO L93 Difference]: Finished difference Result 317 states and 317 transitions. [2018-10-15 15:30:35,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-10-15 15:30:35,129 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 307 [2018-10-15 15:30:35,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:30:35,131 INFO L225 Difference]: With dead ends: 317 [2018-10-15 15:30:35,131 INFO L226 Difference]: Without dead ends: 317 [2018-10-15 15:30:35,133 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4753 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=591, Invalid=38811, Unknown=0, NotChecked=0, Total=39402 [2018-10-15 15:30:35,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-10-15 15:30:35,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 314. [2018-10-15 15:30:35,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-10-15 15:30:35,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 314 transitions. [2018-10-15 15:30:35,137 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 314 transitions. Word has length 307 [2018-10-15 15:30:35,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:30:35,138 INFO L481 AbstractCegarLoop]: Abstraction has 314 states and 314 transitions. [2018-10-15 15:30:35,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-10-15 15:30:35,138 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 314 transitions. [2018-10-15 15:30:35,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-10-15 15:30:35,139 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:30:35,139 INFO L375 BasicCegarLoop]: trace histogram [51, 50, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:30:35,140 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:30:35,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:30:35,140 INFO L82 PathProgramCache]: Analyzing trace with hash 977585357, now seen corresponding path program 50 times [2018-10-15 15:30:35,141 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:30:35,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:30:40,493 INFO L134 CoverageAnalysis]: Checked inductivity of 7450 backedges. 0 proven. 7450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:30:40,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:30:40,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-10-15 15:30:40,494 INFO L460 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-10-15 15:30:40,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-10-15 15:30:40,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 15:30:40,495 INFO L87 Difference]: Start difference. First operand 314 states and 314 transitions. Second operand 103 states. [2018-10-15 15:30:58,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:30:58,623 INFO L93 Difference]: Finished difference Result 323 states and 323 transitions. [2018-10-15 15:30:58,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-10-15 15:30:58,624 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 313 [2018-10-15 15:30:58,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:30:58,626 INFO L225 Difference]: With dead ends: 323 [2018-10-15 15:30:58,626 INFO L226 Difference]: Without dead ends: 323 [2018-10-15 15:30:58,627 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4950 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=603, Invalid=40403, Unknown=0, NotChecked=0, Total=41006 [2018-10-15 15:30:58,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-10-15 15:30:58,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 320. [2018-10-15 15:30:58,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-10-15 15:30:58,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 320 transitions. [2018-10-15 15:30:58,630 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 320 transitions. Word has length 313 [2018-10-15 15:30:58,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:30:58,631 INFO L481 AbstractCegarLoop]: Abstraction has 320 states and 320 transitions. [2018-10-15 15:30:58,631 INFO L482 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-10-15 15:30:58,631 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 320 transitions. [2018-10-15 15:30:58,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2018-10-15 15:30:58,632 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:30:58,633 INFO L375 BasicCegarLoop]: trace histogram [52, 51, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:30:58,633 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:30:58,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:30:58,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1406734029, now seen corresponding path program 51 times [2018-10-15 15:30:58,634 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:30:58,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:31:04,180 INFO L134 CoverageAnalysis]: Checked inductivity of 7752 backedges. 0 proven. 7752 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:31:04,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:31:04,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-10-15 15:31:04,181 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-10-15 15:31:04,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-10-15 15:31:04,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=10713, Unknown=0, NotChecked=0, Total=10920 [2018-10-15 15:31:04,181 INFO L87 Difference]: Start difference. First operand 320 states and 320 transitions. Second operand 105 states. [2018-10-15 15:31:22,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:31:22,731 INFO L93 Difference]: Finished difference Result 329 states and 329 transitions. [2018-10-15 15:31:22,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-10-15 15:31:22,732 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 319 [2018-10-15 15:31:22,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:31:22,734 INFO L225 Difference]: With dead ends: 329 [2018-10-15 15:31:22,734 INFO L226 Difference]: Without dead ends: 329 [2018-10-15 15:31:22,736 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5151 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=615, Invalid=42027, Unknown=0, NotChecked=0, Total=42642 [2018-10-15 15:31:22,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-10-15 15:31:22,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 326. [2018-10-15 15:31:22,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-10-15 15:31:22,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 326 transitions. [2018-10-15 15:31:22,739 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 326 transitions. Word has length 319 [2018-10-15 15:31:22,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:31:22,739 INFO L481 AbstractCegarLoop]: Abstraction has 326 states and 326 transitions. [2018-10-15 15:31:22,740 INFO L482 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-10-15 15:31:22,740 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 326 transitions. [2018-10-15 15:31:22,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2018-10-15 15:31:22,741 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:31:22,741 INFO L375 BasicCegarLoop]: trace histogram [53, 52, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:31:22,742 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:31:22,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:31:22,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1383315737, now seen corresponding path program 52 times [2018-10-15 15:31:22,743 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:31:22,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:31:28,446 INFO L134 CoverageAnalysis]: Checked inductivity of 8060 backedges. 0 proven. 8060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:31:28,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:31:28,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-10-15 15:31:28,447 INFO L460 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-10-15 15:31:28,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-10-15 15:31:28,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=11131, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 15:31:28,448 INFO L87 Difference]: Start difference. First operand 326 states and 326 transitions. Second operand 107 states. [2018-10-15 15:31:47,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:31:47,796 INFO L93 Difference]: Finished difference Result 335 states and 335 transitions. [2018-10-15 15:31:47,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2018-10-15 15:31:47,797 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 325 [2018-10-15 15:31:47,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:31:47,798 INFO L225 Difference]: With dead ends: 335 [2018-10-15 15:31:47,798 INFO L226 Difference]: Without dead ends: 335 [2018-10-15 15:31:47,799 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5356 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=627, Invalid=43683, Unknown=0, NotChecked=0, Total=44310 [2018-10-15 15:31:47,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-10-15 15:31:47,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 332. [2018-10-15 15:31:47,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-10-15 15:31:47,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 332 transitions. [2018-10-15 15:31:47,802 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 332 transitions. Word has length 325 [2018-10-15 15:31:47,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:31:47,802 INFO L481 AbstractCegarLoop]: Abstraction has 332 states and 332 transitions. [2018-10-15 15:31:47,802 INFO L482 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-10-15 15:31:47,802 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 332 transitions. [2018-10-15 15:31:47,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2018-10-15 15:31:47,804 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:31:47,804 INFO L375 BasicCegarLoop]: trace histogram [54, 53, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:31:47,804 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:31:47,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:31:47,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1901560705, now seen corresponding path program 53 times [2018-10-15 15:31:47,805 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:31:47,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:31:53,744 INFO L134 CoverageAnalysis]: Checked inductivity of 8374 backedges. 0 proven. 8374 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:31:53,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:31:53,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-10-15 15:31:53,745 INFO L460 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-10-15 15:31:53,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-10-15 15:31:53,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=11557, Unknown=0, NotChecked=0, Total=11772 [2018-10-15 15:31:53,746 INFO L87 Difference]: Start difference. First operand 332 states and 332 transitions. Second operand 109 states.