java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplTransformed.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20181015-LoopsPathprograms/const_false-unreach-call1.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2d08e6e [2018-10-15 12:55:33,127 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 12:55:33,129 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 12:55:33,144 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 12:55:33,144 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 12:55:33,145 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 12:55:33,147 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 12:55:33,148 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 12:55:33,150 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 12:55:33,151 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 12:55:33,152 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 12:55:33,152 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 12:55:33,153 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 12:55:33,154 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 12:55:33,155 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 12:55:33,156 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 12:55:33,156 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 12:55:33,159 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 12:55:33,161 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 12:55:33,166 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 12:55:33,168 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 12:55:33,169 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 12:55:33,176 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 12:55:33,176 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 12:55:33,176 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 12:55:33,177 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 12:55:33,180 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 12:55:33,181 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 12:55:33,182 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 12:55:33,185 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 12:55:33,186 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 12:55:33,186 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 12:55:33,187 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 12:55:33,187 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 12:55:33,188 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 12:55:33,190 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 12:55:33,191 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 12:55:33,206 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 12:55:33,206 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 12:55:33,207 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 12:55:33,207 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 12:55:33,207 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 12:55:33,208 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 12:55:33,209 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 12:55:33,209 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 12:55:33,209 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 12:55:33,210 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 12:55:33,210 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 12:55:33,210 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 12:55:33,210 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 12:55:33,211 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 12:55:33,211 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 12:55:33,274 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 12:55:33,286 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 12:55:33,290 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 12:55:33,292 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 12:55:33,292 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 12:55:33,293 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/const_false-unreach-call1.i_3.bpl [2018-10-15 12:55:33,293 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/const_false-unreach-call1.i_3.bpl' [2018-10-15 12:55:33,344 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 12:55:33,346 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-15 12:55:33,346 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 12:55:33,347 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 12:55:33,347 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 12:55:33,374 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "const_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:33" (1/1) ... [2018-10-15 12:55:33,376 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "const_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:33" (1/1) ... [2018-10-15 12:55:33,386 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "const_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:33" (1/1) ... [2018-10-15 12:55:33,386 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "const_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:33" (1/1) ... [2018-10-15 12:55:33,391 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "const_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:33" (1/1) ... [2018-10-15 12:55:33,393 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "const_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:33" (1/1) ... [2018-10-15 12:55:33,393 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "const_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:33" (1/1) ... [2018-10-15 12:55:33,395 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 12:55:33,396 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 12:55:33,396 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 12:55:33,396 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 12:55:33,397 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "const_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:33" (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 12:55:33,457 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-15 12:55:33,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 12:55:33,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 12:55:33,622 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 12:55:33,623 INFO L202 PluginConnector]: Adding new model const_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:55:33 BoogieIcfgContainer [2018-10-15 12:55:33,623 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 12:55:33,623 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-15 12:55:33,624 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-15 12:55:33,625 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-15 12:55:33,628 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "const_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:55:33" (1/1) ... [2018-10-15 12:55:33,633 WARN L219 ansformationObserver]: HeapSeparator: input icfg has no '#valid' array -- returning unchanged Icfg! [2018-10-15 12:55:33,650 INFO L202 PluginConnector]: Adding new model const_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 12:55:33 BasicIcfg [2018-10-15 12:55:33,651 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-15 12:55:33,652 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 12:55:33,652 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 12:55:33,655 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 12:55:33,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "const_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:33" (1/3) ... [2018-10-15 12:55:33,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4db2352f and model type const_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 12:55:33, skipping insertion in model container [2018-10-15 12:55:33,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "const_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:55:33" (2/3) ... [2018-10-15 12:55:33,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4db2352f and model type const_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 12:55:33, skipping insertion in model container [2018-10-15 12:55:33,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "const_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 12:55:33" (3/3) ... [2018-10-15 12:55:33,659 INFO L112 eAbstractionObserver]: Analyzing ICFG const_false-unreach-call1.i_3.bplleft_unchanged_by_heapseparator [2018-10-15 12:55:33,670 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 12:55:33,679 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 12:55:33,698 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 12:55:33,729 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 12:55:33,730 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 12:55:33,730 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 12:55:33,730 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 12:55:33,730 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 12:55:33,730 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 12:55:33,731 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 12:55:33,731 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 12:55:33,731 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 12:55:33,746 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-10-15 12:55:33,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-15 12:55:33,766 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:33,767 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:33,768 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:33,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:33,784 INFO L82 PathProgramCache]: Analyzing trace with hash 570541353, now seen corresponding path program 1 times [2018-10-15 12:55:33,853 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:33,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:34,056 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 12:55:34,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 12:55:34,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 12:55:34,065 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 12:55:34,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 12:55:34,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 12:55:34,090 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2018-10-15 12:55:34,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:34,210 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-10-15 12:55:34,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 12:55:34,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-10-15 12:55:34,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:34,225 INFO L225 Difference]: With dead ends: 19 [2018-10-15 12:55:34,225 INFO L226 Difference]: Without dead ends: 19 [2018-10-15 12:55:34,228 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 12:55:34,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-15 12:55:34,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2018-10-15 12:55:34,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-15 12:55:34,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-10-15 12:55:34,268 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 10 [2018-10-15 12:55:34,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:34,269 INFO L481 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-10-15 12:55:34,269 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 12:55:34,269 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-10-15 12:55:34,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-15 12:55:34,270 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:34,270 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:34,271 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:34,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:34,271 INFO L82 PathProgramCache]: Analyzing trace with hash 303616675, now seen corresponding path program 1 times [2018-10-15 12:55:34,272 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:34,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:34,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:34,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:34,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-15 12:55:34,632 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 12:55:34,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 12:55:34,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-15 12:55:34,634 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 5 states. [2018-10-15 12:55:34,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:34,817 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-10-15 12:55:34,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-15 12:55:34,819 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-10-15 12:55:34,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:34,820 INFO L225 Difference]: With dead ends: 24 [2018-10-15 12:55:34,820 INFO L226 Difference]: Without dead ends: 24 [2018-10-15 12:55:34,821 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-15 12:55:34,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-15 12:55:34,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2018-10-15 12:55:34,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-15 12:55:34,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-10-15 12:55:34,826 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 15 [2018-10-15 12:55:34,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:34,826 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-10-15 12:55:34,826 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 12:55:34,826 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-10-15 12:55:34,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-15 12:55:34,827 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:34,827 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:34,828 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:34,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:34,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1752096407, now seen corresponding path program 2 times [2018-10-15 12:55:34,829 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:34,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:35,157 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:35,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:35,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-15 12:55:35,159 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 12:55:35,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 12:55:35,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-15 12:55:35,160 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 7 states. [2018-10-15 12:55:35,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:35,560 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-10-15 12:55:35,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-15 12:55:35,561 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-10-15 12:55:35,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:35,563 INFO L225 Difference]: With dead ends: 29 [2018-10-15 12:55:35,563 INFO L226 Difference]: Without dead ends: 29 [2018-10-15 12:55:35,564 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-10-15 12:55:35,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-15 12:55:35,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2018-10-15 12:55:35,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-15 12:55:35,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-10-15 12:55:35,569 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 20 [2018-10-15 12:55:35,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:35,570 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-10-15 12:55:35,570 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 12:55:35,570 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-10-15 12:55:35,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-15 12:55:35,571 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:35,572 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:35,572 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:35,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:35,573 INFO L82 PathProgramCache]: Analyzing trace with hash 687414883, now seen corresponding path program 3 times [2018-10-15 12:55:35,574 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:35,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:35,785 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:35,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:35,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 12:55:35,787 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 12:55:35,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 12:55:35,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-15 12:55:35,788 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 9 states. [2018-10-15 12:55:36,014 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-15 12:55:36,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:36,406 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-10-15 12:55:36,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-15 12:55:36,407 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-10-15 12:55:36,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:36,408 INFO L225 Difference]: With dead ends: 34 [2018-10-15 12:55:36,409 INFO L226 Difference]: Without dead ends: 34 [2018-10-15 12:55:36,410 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-10-15 12:55:36,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-15 12:55:36,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2018-10-15 12:55:36,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-15 12:55:36,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-10-15 12:55:36,415 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 25 [2018-10-15 12:55:36,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:36,416 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-10-15 12:55:36,416 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 12:55:36,416 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-10-15 12:55:36,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-15 12:55:36,417 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:36,417 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:36,418 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:36,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:36,418 INFO L82 PathProgramCache]: Analyzing trace with hash 264908201, now seen corresponding path program 4 times [2018-10-15 12:55:36,419 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:36,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:36,671 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:36,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:36,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 12:55:36,673 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 12:55:36,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 12:55:36,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-10-15 12:55:36,674 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 11 states. [2018-10-15 12:55:37,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:37,275 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-10-15 12:55:37,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-15 12:55:37,276 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-10-15 12:55:37,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:37,277 INFO L225 Difference]: With dead ends: 39 [2018-10-15 12:55:37,278 INFO L226 Difference]: Without dead ends: 39 [2018-10-15 12:55:37,278 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 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 12:55:37,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-15 12:55:37,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-10-15 12:55:37,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-15 12:55:37,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-10-15 12:55:37,283 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 30 [2018-10-15 12:55:37,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:37,284 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-10-15 12:55:37,284 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 12:55:37,284 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-10-15 12:55:37,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-15 12:55:37,285 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:37,286 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:37,286 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:37,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:37,286 INFO L82 PathProgramCache]: Analyzing trace with hash -742540765, now seen corresponding path program 5 times [2018-10-15 12:55:37,287 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:37,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:37,558 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:37,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:37,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 12:55:37,559 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 12:55:37,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 12:55:37,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-10-15 12:55:37,560 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 13 states. [2018-10-15 12:55:38,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:38,190 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-10-15 12:55:38,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-15 12:55:38,190 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 35 [2018-10-15 12:55:38,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:38,192 INFO L225 Difference]: With dead ends: 44 [2018-10-15 12:55:38,192 INFO L226 Difference]: Without dead ends: 44 [2018-10-15 12:55:38,193 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 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 12:55:38,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-15 12:55:38,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2018-10-15 12:55:38,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-15 12:55:38,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-10-15 12:55:38,199 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 35 [2018-10-15 12:55:38,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:38,199 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-10-15 12:55:38,199 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 12:55:38,200 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-10-15 12:55:38,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-15 12:55:38,201 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:38,201 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:38,201 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:38,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:38,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1179707881, now seen corresponding path program 6 times [2018-10-15 12:55:38,203 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:38,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:38,708 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:38,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:38,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 12:55:38,709 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 12:55:38,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 12:55:38,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-10-15 12:55:38,710 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 15 states. [2018-10-15 12:55:39,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:39,171 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-10-15 12:55:39,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-15 12:55:39,173 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2018-10-15 12:55:39,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:39,174 INFO L225 Difference]: With dead ends: 49 [2018-10-15 12:55:39,174 INFO L226 Difference]: Without dead ends: 49 [2018-10-15 12:55:39,175 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2018-10-15 12:55:39,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-15 12:55:39,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-10-15 12:55:39,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-15 12:55:39,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-10-15 12:55:39,180 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 40 [2018-10-15 12:55:39,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:39,180 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-10-15 12:55:39,180 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 12:55:39,180 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-10-15 12:55:39,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-15 12:55:39,182 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:39,182 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:39,182 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:39,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:39,183 INFO L82 PathProgramCache]: Analyzing trace with hash -45963805, now seen corresponding path program 7 times [2018-10-15 12:55:39,184 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:39,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:39,666 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:39,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:39,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 12:55:39,667 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 12:55:39,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 12:55:39,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-10-15 12:55:39,668 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 17 states. [2018-10-15 12:55:40,137 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-15 12:55:40,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:40,534 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-10-15 12:55:40,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-15 12:55:40,535 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 45 [2018-10-15 12:55:40,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:40,536 INFO L225 Difference]: With dead ends: 54 [2018-10-15 12:55:40,537 INFO L226 Difference]: Without dead ends: 54 [2018-10-15 12:55:40,538 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2018-10-15 12:55:40,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-15 12:55:40,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2018-10-15 12:55:40,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-15 12:55:40,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-10-15 12:55:40,544 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 45 [2018-10-15 12:55:40,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:40,545 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-10-15 12:55:40,545 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 12:55:40,545 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-10-15 12:55:40,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-15 12:55:40,547 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:40,547 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:40,547 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:40,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:40,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1177987543, now seen corresponding path program 8 times [2018-10-15 12:55:40,549 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:40,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:40,875 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:40,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:40,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 12:55:40,876 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 12:55:40,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 12:55:40,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-10-15 12:55:40,877 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 19 states. [2018-10-15 12:55:41,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:41,894 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-10-15 12:55:41,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-15 12:55:41,897 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 50 [2018-10-15 12:55:41,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:41,898 INFO L225 Difference]: With dead ends: 59 [2018-10-15 12:55:41,898 INFO L226 Difference]: Without dead ends: 59 [2018-10-15 12:55:41,899 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:55:41,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-15 12:55:41,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2018-10-15 12:55:41,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-15 12:55:41,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-10-15 12:55:41,904 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 50 [2018-10-15 12:55:41,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:41,904 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-10-15 12:55:41,904 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 12:55:41,905 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-10-15 12:55:41,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-15 12:55:41,906 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:41,906 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:41,906 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:41,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:41,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1385963101, now seen corresponding path program 9 times [2018-10-15 12:55:41,908 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:41,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:42,481 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:42,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:42,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 12:55:42,482 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 12:55:42,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 12:55:42,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-10-15 12:55:42,483 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 21 states. [2018-10-15 12:55:43,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:43,347 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-10-15 12:55:43,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-15 12:55:43,348 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 55 [2018-10-15 12:55:43,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:43,349 INFO L225 Difference]: With dead ends: 64 [2018-10-15 12:55:43,349 INFO L226 Difference]: Without dead ends: 64 [2018-10-15 12:55:43,350 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:55:43,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-10-15 12:55:43,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2018-10-15 12:55:43,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-15 12:55:43,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-10-15 12:55:43,355 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 55 [2018-10-15 12:55:43,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:43,356 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-10-15 12:55:43,356 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 12:55:43,356 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-10-15 12:55:43,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-15 12:55:43,357 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:43,357 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:43,357 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:43,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:43,358 INFO L82 PathProgramCache]: Analyzing trace with hash -338202007, now seen corresponding path program 10 times [2018-10-15 12:55:43,359 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:43,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:44,129 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:44,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:44,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 12:55:44,130 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 12:55:44,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 12:55:44,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-10-15 12:55:44,131 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 23 states. [2018-10-15 12:55:45,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:45,548 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-10-15 12:55:45,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-15 12:55:45,554 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 60 [2018-10-15 12:55:45,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:45,555 INFO L225 Difference]: With dead ends: 69 [2018-10-15 12:55:45,555 INFO L226 Difference]: Without dead ends: 69 [2018-10-15 12:55:45,556 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:55:45,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-15 12:55:45,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2018-10-15 12:55:45,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-10-15 12:55:45,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-10-15 12:55:45,567 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 60 [2018-10-15 12:55:45,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:45,567 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-10-15 12:55:45,567 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 12:55:45,567 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-10-15 12:55:45,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-15 12:55:45,568 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:45,569 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:45,569 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:45,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:45,569 INFO L82 PathProgramCache]: Analyzing trace with hash -922915485, now seen corresponding path program 11 times [2018-10-15 12:55:45,571 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:45,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:46,202 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 0 proven. 286 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:46,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:46,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 12:55:46,203 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 12:55:46,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 12:55:46,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-10-15 12:55:46,204 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 25 states. [2018-10-15 12:55:47,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:47,679 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-10-15 12:55:47,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-15 12:55:47,680 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 65 [2018-10-15 12:55:47,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:47,681 INFO L225 Difference]: With dead ends: 74 [2018-10-15 12:55:47,681 INFO L226 Difference]: Without dead ends: 74 [2018-10-15 12:55:47,682 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=135, Invalid=2027, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:55:47,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-15 12:55:47,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2018-10-15 12:55:47,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-10-15 12:55:47,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-10-15 12:55:47,688 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 65 [2018-10-15 12:55:47,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:47,688 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-10-15 12:55:47,688 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 12:55:47,688 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-10-15 12:55:47,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-15 12:55:47,693 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:47,693 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:47,693 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:47,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:47,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1591787863, now seen corresponding path program 12 times [2018-10-15 12:55:47,694 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:47,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:48,359 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:48,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:48,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 12:55:48,360 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 12:55:48,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 12:55:48,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-10-15 12:55:48,361 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 27 states. [2018-10-15 12:55:49,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:49,689 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-10-15 12:55:49,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-15 12:55:49,692 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 70 [2018-10-15 12:55:49,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:49,693 INFO L225 Difference]: With dead ends: 79 [2018-10-15 12:55:49,693 INFO L226 Difference]: Without dead ends: 79 [2018-10-15 12:55:49,694 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=147, Invalid=2403, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 12:55:49,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-15 12:55:49,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2018-10-15 12:55:49,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-15 12:55:49,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-10-15 12:55:49,699 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 70 [2018-10-15 12:55:49,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:49,699 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-10-15 12:55:49,699 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 12:55:49,700 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-10-15 12:55:49,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-15 12:55:49,701 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:49,701 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:49,701 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:49,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:49,701 INFO L82 PathProgramCache]: Analyzing trace with hash -773109469, now seen corresponding path program 13 times [2018-10-15 12:55:49,702 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:49,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:50,334 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 0 proven. 403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:50,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:50,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 12:55:50,335 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 12:55:50,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 12:55:50,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-10-15 12:55:50,336 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 29 states. [2018-10-15 12:55:51,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:51,916 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-10-15 12:55:51,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-15 12:55:51,917 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 75 [2018-10-15 12:55:51,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:51,918 INFO L225 Difference]: With dead ends: 84 [2018-10-15 12:55:51,918 INFO L226 Difference]: Without dead ends: 84 [2018-10-15 12:55:51,920 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=159, Invalid=2811, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 12:55:51,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-10-15 12:55:51,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2018-10-15 12:55:51,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-10-15 12:55:51,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-10-15 12:55:51,925 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 75 [2018-10-15 12:55:51,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:51,925 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-10-15 12:55:51,925 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 12:55:51,925 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-10-15 12:55:51,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-15 12:55:51,926 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:51,926 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:51,927 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:51,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:51,927 INFO L82 PathProgramCache]: Analyzing trace with hash 558152425, now seen corresponding path program 14 times [2018-10-15 12:55:51,928 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:51,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:52,895 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 0 proven. 469 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:52,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:52,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 12:55:52,896 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 12:55:52,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 12:55:52,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-10-15 12:55:52,897 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 31 states. [2018-10-15 12:55:54,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:54,546 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-10-15 12:55:54,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-15 12:55:54,547 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 80 [2018-10-15 12:55:54,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:54,548 INFO L225 Difference]: With dead ends: 89 [2018-10-15 12:55:54,548 INFO L226 Difference]: Without dead ends: 89 [2018-10-15 12:55:54,550 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=171, Invalid=3251, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 12:55:54,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-10-15 12:55:54,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2018-10-15 12:55:54,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-10-15 12:55:54,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-10-15 12:55:54,553 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 80 [2018-10-15 12:55:54,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:54,554 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-10-15 12:55:54,554 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 12:55:54,554 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-10-15 12:55:54,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-15 12:55:54,555 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:54,555 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:54,555 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:54,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:54,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1492552477, now seen corresponding path program 15 times [2018-10-15 12:55:54,556 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:54,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:55,764 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 0 proven. 540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:55,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:55,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 12:55:55,765 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 12:55:55,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 12:55:55,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 12:55:55,766 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 33 states. [2018-10-15 12:55:57,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:57,904 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-10-15 12:55:57,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-15 12:55:57,911 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 85 [2018-10-15 12:55:57,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:57,912 INFO L225 Difference]: With dead ends: 94 [2018-10-15 12:55:57,912 INFO L226 Difference]: Without dead ends: 94 [2018-10-15 12:55:57,914 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=183, Invalid=3723, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 12:55:57,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-10-15 12:55:57,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2018-10-15 12:55:57,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-15 12:55:57,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-10-15 12:55:57,917 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 85 [2018-10-15 12:55:57,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:57,917 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-10-15 12:55:57,917 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 12:55:57,918 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-10-15 12:55:57,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-15 12:55:57,918 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:57,919 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:57,919 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:57,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:57,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1995171625, now seen corresponding path program 16 times [2018-10-15 12:55:57,920 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:57,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:58,720 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 0 proven. 616 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:58,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:58,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 12:55:58,721 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 12:55:58,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 12:55:58,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:55:58,722 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 35 states. [2018-10-15 12:56:00,579 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-15 12:56:01,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:01,250 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-10-15 12:56:01,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-15 12:56:01,251 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 90 [2018-10-15 12:56:01,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:01,252 INFO L225 Difference]: With dead ends: 99 [2018-10-15 12:56:01,252 INFO L226 Difference]: Without dead ends: 99 [2018-10-15 12:56:01,255 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=195, Invalid=4227, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 12:56:01,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-10-15 12:56:01,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2018-10-15 12:56:01,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-10-15 12:56:01,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-10-15 12:56:01,258 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 90 [2018-10-15 12:56:01,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:01,258 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-10-15 12:56:01,258 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 12:56:01,258 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-10-15 12:56:01,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-15 12:56:01,259 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:01,260 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:01,260 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:01,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:01,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1144254627, now seen corresponding path program 17 times [2018-10-15 12:56:01,261 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:01,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:02,863 INFO L134 CoverageAnalysis]: Checked inductivity of 697 backedges. 0 proven. 697 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:02,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:02,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 12:56:02,864 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 12:56:02,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 12:56:02,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 12:56:02,865 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 37 states. [2018-10-15 12:56:05,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:05,103 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-10-15 12:56:05,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-15 12:56:05,104 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 95 [2018-10-15 12:56:05,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:05,105 INFO L225 Difference]: With dead ends: 104 [2018-10-15 12:56:05,105 INFO L226 Difference]: Without dead ends: 104 [2018-10-15 12:56:05,108 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=207, Invalid=4763, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 12:56:05,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-10-15 12:56:05,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2018-10-15 12:56:05,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-10-15 12:56:05,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-10-15 12:56:05,111 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 95 [2018-10-15 12:56:05,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:05,111 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-10-15 12:56:05,111 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 12:56:05,111 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-10-15 12:56:05,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-15 12:56:05,112 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:05,112 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:05,113 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:05,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:05,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1346845847, now seen corresponding path program 18 times [2018-10-15 12:56:05,114 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:05,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:06,048 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 0 proven. 783 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:06,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:06,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 12:56:06,049 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 12:56:06,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 12:56:06,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:56:06,050 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 39 states. [2018-10-15 12:56:09,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:09,068 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-10-15 12:56:09,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-15 12:56:09,068 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 100 [2018-10-15 12:56:09,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:09,069 INFO L225 Difference]: With dead ends: 109 [2018-10-15 12:56:09,069 INFO L226 Difference]: Without dead ends: 109 [2018-10-15 12:56:09,071 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=219, Invalid=5331, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 12:56:09,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-10-15 12:56:09,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2018-10-15 12:56:09,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-10-15 12:56:09,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-10-15 12:56:09,073 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 100 [2018-10-15 12:56:09,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:09,074 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-10-15 12:56:09,074 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 12:56:09,074 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-10-15 12:56:09,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-10-15 12:56:09,075 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:09,075 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:09,075 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:09,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:09,075 INFO L82 PathProgramCache]: Analyzing trace with hash -2109293469, now seen corresponding path program 19 times [2018-10-15 12:56:09,076 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:09,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:09,970 INFO L134 CoverageAnalysis]: Checked inductivity of 874 backedges. 0 proven. 874 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:09,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:09,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 12:56:09,971 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 12:56:09,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 12:56:09,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 12:56:09,972 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 41 states. [2018-10-15 12:56:13,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:13,028 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-10-15 12:56:13,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-15 12:56:13,029 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 105 [2018-10-15 12:56:13,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:13,030 INFO L225 Difference]: With dead ends: 114 [2018-10-15 12:56:13,030 INFO L226 Difference]: Without dead ends: 114 [2018-10-15 12:56:13,032 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=231, Invalid=5931, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 12:56:13,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-10-15 12:56:13,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2018-10-15 12:56:13,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-10-15 12:56:13,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-10-15 12:56:13,035 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 105 [2018-10-15 12:56:13,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:13,035 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-10-15 12:56:13,035 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 12:56:13,035 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-10-15 12:56:13,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-15 12:56:13,036 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:13,036 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:13,036 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:13,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:13,036 INFO L82 PathProgramCache]: Analyzing trace with hash 474959785, now seen corresponding path program 20 times [2018-10-15 12:56:13,037 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:13,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:14,819 INFO L134 CoverageAnalysis]: Checked inductivity of 970 backedges. 0 proven. 970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:14,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:14,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 12:56:14,820 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 12:56:14,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 12:56:14,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:56:14,821 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 43 states. [2018-10-15 12:56:17,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:17,907 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-10-15 12:56:17,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-15 12:56:17,907 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 110 [2018-10-15 12:56:17,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:17,909 INFO L225 Difference]: With dead ends: 119 [2018-10-15 12:56:17,909 INFO L226 Difference]: Without dead ends: 119 [2018-10-15 12:56:17,912 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=243, Invalid=6563, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 12:56:17,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-10-15 12:56:17,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2018-10-15 12:56:17,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-10-15 12:56:17,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-10-15 12:56:17,915 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 110 [2018-10-15 12:56:17,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:17,915 INFO L481 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-10-15 12:56:17,915 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 12:56:17,916 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-10-15 12:56:17,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-15 12:56:17,916 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:17,916 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:17,917 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:17,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:17,917 INFO L82 PathProgramCache]: Analyzing trace with hash -685909981, now seen corresponding path program 21 times [2018-10-15 12:56:17,918 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:17,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:19,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1071 backedges. 0 proven. 1071 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:19,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:19,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 12:56:19,188 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 12:56:19,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 12:56:19,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 12:56:19,189 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 45 states. [2018-10-15 12:56:22,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:22,914 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2018-10-15 12:56:22,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-15 12:56:22,917 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 115 [2018-10-15 12:56:22,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:22,918 INFO L225 Difference]: With dead ends: 124 [2018-10-15 12:56:22,918 INFO L226 Difference]: Without dead ends: 124 [2018-10-15 12:56:22,919 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=255, Invalid=7227, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 12:56:22,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-10-15 12:56:22,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 121. [2018-10-15 12:56:22,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-10-15 12:56:22,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-10-15 12:56:22,923 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 115 [2018-10-15 12:56:22,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:22,924 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-10-15 12:56:22,924 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 12:56:22,924 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-10-15 12:56:22,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-15 12:56:22,924 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:22,925 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:22,925 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:22,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:22,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1873572887, now seen corresponding path program 22 times [2018-10-15 12:56:22,926 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:22,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:24,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1177 backedges. 0 proven. 1177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:24,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:24,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 12:56:24,698 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 12:56:24,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 12:56:24,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:56:24,699 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 47 states. [2018-10-15 12:56:28,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:28,542 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-10-15 12:56:28,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-15 12:56:28,543 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 120 [2018-10-15 12:56:28,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:28,544 INFO L225 Difference]: With dead ends: 129 [2018-10-15 12:56:28,544 INFO L226 Difference]: Without dead ends: 129 [2018-10-15 12:56:28,545 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=267, Invalid=7923, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 12:56:28,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-10-15 12:56:28,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2018-10-15 12:56:28,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-10-15 12:56:28,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2018-10-15 12:56:28,548 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 120 [2018-10-15 12:56:28,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:28,548 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2018-10-15 12:56:28,549 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 12:56:28,549 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2018-10-15 12:56:28,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-15 12:56:28,549 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:28,550 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:28,550 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:28,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:28,550 INFO L82 PathProgramCache]: Analyzing trace with hash 362103779, now seen corresponding path program 23 times [2018-10-15 12:56:28,551 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:28,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:29,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1288 backedges. 0 proven. 1288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:29,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:29,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 12:56:29,896 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 12:56:29,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 12:56:29,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 12:56:29,897 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 49 states. [2018-10-15 12:56:34,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:34,125 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2018-10-15 12:56:34,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-15 12:56:34,126 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 125 [2018-10-15 12:56:34,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:34,126 INFO L225 Difference]: With dead ends: 134 [2018-10-15 12:56:34,126 INFO L226 Difference]: Without dead ends: 134 [2018-10-15 12:56:34,127 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=279, Invalid=8651, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 12:56:34,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-10-15 12:56:34,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 131. [2018-10-15 12:56:34,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-10-15 12:56:34,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-10-15 12:56:34,130 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 125 [2018-10-15 12:56:34,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:34,130 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-10-15 12:56:34,130 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 12:56:34,130 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-10-15 12:56:34,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-15 12:56:34,131 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:34,131 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:34,131 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:34,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:34,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1570146263, now seen corresponding path program 24 times [2018-10-15 12:56:34,132 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:34,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:35,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 1404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:35,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:35,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 12:56:35,461 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 12:56:35,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 12:56:35,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 12:56:35,462 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 51 states. [2018-10-15 12:56:39,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:39,939 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-10-15 12:56:39,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-15 12:56:39,941 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 130 [2018-10-15 12:56:39,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:39,942 INFO L225 Difference]: With dead ends: 139 [2018-10-15 12:56:39,942 INFO L226 Difference]: Without dead ends: 139 [2018-10-15 12:56:39,943 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 0 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 12:56:39,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-10-15 12:56:39,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2018-10-15 12:56:39,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-10-15 12:56:39,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2018-10-15 12:56:39,946 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 130 [2018-10-15 12:56:39,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:39,946 INFO L481 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2018-10-15 12:56:39,947 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 12:56:39,947 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2018-10-15 12:56:39,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-15 12:56:39,947 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:39,948 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:39,948 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:39,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:39,948 INFO L82 PathProgramCache]: Analyzing trace with hash 763953059, now seen corresponding path program 25 times [2018-10-15 12:56:39,949 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:39,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:41,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1525 backedges. 0 proven. 1525 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:41,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:41,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 12:56:41,475 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 12:56:41,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 12:56:41,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 12:56:41,476 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 53 states. [2018-10-15 12:56:46,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:46,232 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2018-10-15 12:56:46,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-15 12:56:46,232 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 135 [2018-10-15 12:56:46,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:46,234 INFO L225 Difference]: With dead ends: 144 [2018-10-15 12:56:46,234 INFO L226 Difference]: Without dead ends: 144 [2018-10-15 12:56:46,235 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=303, Invalid=10203, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 12:56:46,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-10-15 12:56:46,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2018-10-15 12:56:46,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-10-15 12:56:46,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-10-15 12:56:46,239 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 135 [2018-10-15 12:56:46,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:46,239 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-10-15 12:56:46,240 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 12:56:46,240 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-10-15 12:56:46,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-15 12:56:46,240 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:46,241 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:46,241 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:46,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:46,241 INFO L82 PathProgramCache]: Analyzing trace with hash -332065687, now seen corresponding path program 26 times [2018-10-15 12:56:46,242 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:46,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:47,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1651 backedges. 0 proven. 1651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:47,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:47,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 12:56:47,830 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 12:56:47,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 12:56:47,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 12:56:47,831 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 55 states. [2018-10-15 12:56:53,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:53,002 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-10-15 12:56:53,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-15 12:56:53,002 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 140 [2018-10-15 12:56:53,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:53,004 INFO L225 Difference]: With dead ends: 149 [2018-10-15 12:56:53,004 INFO L226 Difference]: Without dead ends: 149 [2018-10-15 12:56:53,005 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 2 SyntacticMatches, 0 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 12:56:53,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-10-15 12:56:53,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2018-10-15 12:56:53,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-10-15 12:56:53,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2018-10-15 12:56:53,008 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 140 [2018-10-15 12:56:53,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:53,008 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2018-10-15 12:56:53,008 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 12:56:53,009 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2018-10-15 12:56:53,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-15 12:56:53,009 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:53,010 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:53,010 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:53,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:53,010 INFO L82 PathProgramCache]: Analyzing trace with hash -338359453, now seen corresponding path program 27 times [2018-10-15 12:56:53,011 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:53,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:54,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1782 backedges. 0 proven. 1782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:54,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:54,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 12:56:54,989 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 12:56:54,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 12:56:54,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 12:56:54,989 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 57 states. [2018-10-15 12:57:00,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:00,530 INFO L93 Difference]: Finished difference Result 154 states and 154 transitions. [2018-10-15 12:57:00,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-15 12:57:00,531 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 145 [2018-10-15 12:57:00,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:00,532 INFO L225 Difference]: With dead ends: 154 [2018-10-15 12:57:00,532 INFO L226 Difference]: Without dead ends: 154 [2018-10-15 12:57:00,533 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1431 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=327, Invalid=11883, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 12:57:00,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-10-15 12:57:00,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2018-10-15 12:57:00,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-10-15 12:57:00,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-10-15 12:57:00,537 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 145 [2018-10-15 12:57:00,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:00,537 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-10-15 12:57:00,538 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 12:57:00,538 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-10-15 12:57:00,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-15 12:57:00,538 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:00,539 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:00,539 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:00,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:00,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1247436969, now seen corresponding path program 28 times [2018-10-15 12:57:00,540 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:00,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:02,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1918 backedges. 0 proven. 1918 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:02,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:02,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-15 12:57:02,349 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-15 12:57:02,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-15 12:57:02,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 12:57:02,349 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 59 states. [2018-10-15 12:57:08,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:08,292 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-10-15 12:57:08,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-15 12:57:08,293 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 150 [2018-10-15 12:57:08,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:08,294 INFO L225 Difference]: With dead ends: 159 [2018-10-15 12:57:08,294 INFO L226 Difference]: Without dead ends: 159 [2018-10-15 12:57:08,296 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1540 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=339, Invalid=12771, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 12:57:08,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-10-15 12:57:08,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 156. [2018-10-15 12:57:08,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-10-15 12:57:08,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2018-10-15 12:57:08,299 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 150 [2018-10-15 12:57:08,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:08,299 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2018-10-15 12:57:08,300 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-15 12:57:08,300 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2018-10-15 12:57:08,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-15 12:57:08,300 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:08,301 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:08,301 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:08,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:08,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1168808157, now seen corresponding path program 29 times [2018-10-15 12:57:08,302 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:08,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:10,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2059 backedges. 0 proven. 2059 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:10,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:10,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-15 12:57:10,547 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-15 12:57:10,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-15 12:57:10,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 12:57:10,547 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 61 states. [2018-10-15 12:57:16,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:16,789 INFO L93 Difference]: Finished difference Result 164 states and 164 transitions. [2018-10-15 12:57:16,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-15 12:57:16,790 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 155 [2018-10-15 12:57:16,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:16,791 INFO L225 Difference]: With dead ends: 164 [2018-10-15 12:57:16,791 INFO L226 Difference]: Without dead ends: 164 [2018-10-15 12:57:16,792 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1653 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=351, Invalid=13691, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 12:57:16,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-10-15 12:57:16,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 161. [2018-10-15 12:57:16,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-10-15 12:57:16,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-10-15 12:57:16,795 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 155 [2018-10-15 12:57:16,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:16,796 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-10-15 12:57:16,796 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-15 12:57:16,796 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-10-15 12:57:16,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-15 12:57:16,796 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:16,796 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:16,797 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:16,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:16,797 INFO L82 PathProgramCache]: Analyzing trace with hash 477977833, now seen corresponding path program 30 times [2018-10-15 12:57:16,798 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:16,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:18,850 INFO L134 CoverageAnalysis]: Checked inductivity of 2205 backedges. 0 proven. 2205 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:18,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:18,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-15 12:57:18,851 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-15 12:57:18,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-15 12:57:18,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 12:57:18,852 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 63 states. [2018-10-15 12:57:25,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:25,768 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2018-10-15 12:57:25,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-15 12:57:25,768 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 160 [2018-10-15 12:57:25,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:25,770 INFO L225 Difference]: With dead ends: 169 [2018-10-15 12:57:25,771 INFO L226 Difference]: Without dead ends: 169 [2018-10-15 12:57:25,772 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1770 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=363, Invalid=14643, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 12:57:25,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-10-15 12:57:25,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 166. [2018-10-15 12:57:25,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-10-15 12:57:25,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2018-10-15 12:57:25,775 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 160 [2018-10-15 12:57:25,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:25,775 INFO L481 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2018-10-15 12:57:25,775 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-15 12:57:25,775 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2018-10-15 12:57:25,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-10-15 12:57:25,776 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:25,776 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:25,776 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:25,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:25,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1608913635, now seen corresponding path program 31 times [2018-10-15 12:57:25,778 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:25,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:28,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2356 backedges. 0 proven. 2356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:28,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:28,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-15 12:57:28,118 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-15 12:57:28,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-15 12:57:28,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-10-15 12:57:28,118 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 65 states. [2018-10-15 12:57:35,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:35,587 INFO L93 Difference]: Finished difference Result 174 states and 174 transitions. [2018-10-15 12:57:35,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-15 12:57:35,588 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 165 [2018-10-15 12:57:35,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:35,589 INFO L225 Difference]: With dead ends: 174 [2018-10-15 12:57:35,589 INFO L226 Difference]: Without dead ends: 174 [2018-10-15 12:57:35,590 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1891 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=375, Invalid=15627, Unknown=0, NotChecked=0, Total=16002 [2018-10-15 12:57:35,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-10-15 12:57:35,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 171. [2018-10-15 12:57:35,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-10-15 12:57:35,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-10-15 12:57:35,594 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 165 [2018-10-15 12:57:35,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:35,594 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-10-15 12:57:35,594 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-15 12:57:35,594 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-10-15 12:57:35,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-15 12:57:35,595 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:35,595 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:35,596 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:35,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:35,596 INFO L82 PathProgramCache]: Analyzing trace with hash -2059269847, now seen corresponding path program 32 times [2018-10-15 12:57:35,597 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:35,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:37,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2512 backedges. 0 proven. 2512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:37,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:37,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-15 12:57:37,845 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-15 12:57:37,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-15 12:57:37,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 12:57:37,846 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 67 states. [2018-10-15 12:57:45,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:45,675 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-10-15 12:57:45,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-10-15 12:57:45,676 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 170 [2018-10-15 12:57:45,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:45,678 INFO L225 Difference]: With dead ends: 179 [2018-10-15 12:57:45,678 INFO L226 Difference]: Without dead ends: 179 [2018-10-15 12:57:45,680 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=387, Invalid=16643, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 12:57:45,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-10-15 12:57:45,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 176. [2018-10-15 12:57:45,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-10-15 12:57:45,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2018-10-15 12:57:45,683 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 170 [2018-10-15 12:57:45,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:45,684 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2018-10-15 12:57:45,684 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-15 12:57:45,684 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2018-10-15 12:57:45,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-15 12:57:45,685 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:45,685 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:45,685 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:45,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:45,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1067250013, now seen corresponding path program 33 times [2018-10-15 12:57:45,686 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:45,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:49,602 INFO L134 CoverageAnalysis]: Checked inductivity of 2673 backedges. 0 proven. 2673 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:49,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:49,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-15 12:57:49,603 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-15 12:57:49,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-15 12:57:49,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 12:57:49,604 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 69 states. [2018-10-15 12:57:57,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:57,785 INFO L93 Difference]: Finished difference Result 184 states and 184 transitions. [2018-10-15 12:57:57,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-10-15 12:57:57,786 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 175 [2018-10-15 12:57:57,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:57,788 INFO L225 Difference]: With dead ends: 184 [2018-10-15 12:57:57,788 INFO L226 Difference]: Without dead ends: 184 [2018-10-15 12:57:57,789 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2145 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=399, Invalid=17691, Unknown=0, NotChecked=0, Total=18090 [2018-10-15 12:57:57,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-10-15 12:57:57,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 181. [2018-10-15 12:57:57,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-10-15 12:57:57,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-10-15 12:57:57,793 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 175 [2018-10-15 12:57:57,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:57,793 INFO L481 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-10-15 12:57:57,793 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-15 12:57:57,794 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-10-15 12:57:57,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-15 12:57:57,794 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:57,795 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:57,795 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:57,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:57,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1437833879, now seen corresponding path program 34 times [2018-10-15 12:57:57,796 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:57,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:01,557 INFO L134 CoverageAnalysis]: Checked inductivity of 2839 backedges. 0 proven. 2839 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:01,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:01,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-15 12:58:01,557 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-15 12:58:01,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-15 12:58:01,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 12:58:01,558 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 71 states. [2018-10-15 12:58:11,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:11,124 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2018-10-15 12:58:11,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-10-15 12:58:11,125 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 180 [2018-10-15 12:58:11,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:11,126 INFO L225 Difference]: With dead ends: 189 [2018-10-15 12:58:11,127 INFO L226 Difference]: Without dead ends: 189 [2018-10-15 12:58:11,128 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2278 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=411, Invalid=18771, Unknown=0, NotChecked=0, Total=19182 [2018-10-15 12:58:11,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-10-15 12:58:11,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 186. [2018-10-15 12:58:11,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-10-15 12:58:11,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2018-10-15 12:58:11,131 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 180 [2018-10-15 12:58:11,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:11,132 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2018-10-15 12:58:11,132 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-15 12:58:11,132 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2018-10-15 12:58:11,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-10-15 12:58:11,133 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:11,133 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:58:11,133 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:11,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:11,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1666688413, now seen corresponding path program 35 times [2018-10-15 12:58:11,134 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:11,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:13,814 INFO L134 CoverageAnalysis]: Checked inductivity of 3010 backedges. 0 proven. 3010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:13,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:13,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-15 12:58:13,815 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-15 12:58:13,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-15 12:58:13,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-10-15 12:58:13,815 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 73 states. [2018-10-15 12:58:22,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:22,870 INFO L93 Difference]: Finished difference Result 194 states and 194 transitions. [2018-10-15 12:58:22,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-10-15 12:58:22,871 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 185 [2018-10-15 12:58:22,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:22,872 INFO L225 Difference]: With dead ends: 194 [2018-10-15 12:58:22,872 INFO L226 Difference]: Without dead ends: 194 [2018-10-15 12:58:22,873 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2415 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=423, Invalid=19883, Unknown=0, NotChecked=0, Total=20306 [2018-10-15 12:58:22,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-10-15 12:58:22,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2018-10-15 12:58:22,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-10-15 12:58:22,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-10-15 12:58:22,876 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 185 [2018-10-15 12:58:22,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:22,876 INFO L481 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2018-10-15 12:58:22,877 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-15 12:58:22,877 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-10-15 12:58:22,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-15 12:58:22,877 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:22,878 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:58:22,878 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:22,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:22,878 INFO L82 PathProgramCache]: Analyzing trace with hash -197103191, now seen corresponding path program 36 times [2018-10-15 12:58:22,879 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:22,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:26,488 INFO L134 CoverageAnalysis]: Checked inductivity of 3186 backedges. 0 proven. 3186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:26,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:26,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-15 12:58:26,489 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-15 12:58:26,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-15 12:58:26,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 12:58:26,490 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 75 states. [2018-10-15 12:58:36,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:36,013 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2018-10-15 12:58:36,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-10-15 12:58:36,014 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 190 [2018-10-15 12:58:36,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:36,015 INFO L225 Difference]: With dead ends: 199 [2018-10-15 12:58:36,015 INFO L226 Difference]: Without dead ends: 199 [2018-10-15 12:58:36,016 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2556 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=435, Invalid=21027, Unknown=0, NotChecked=0, Total=21462 [2018-10-15 12:58:36,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-10-15 12:58:36,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 196. [2018-10-15 12:58:36,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-10-15 12:58:36,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2018-10-15 12:58:36,020 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 190 [2018-10-15 12:58:36,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:36,020 INFO L481 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2018-10-15 12:58:36,020 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-15 12:58:36,020 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2018-10-15 12:58:36,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-10-15 12:58:36,021 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:36,021 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:58:36,022 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:36,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:36,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1385297443, now seen corresponding path program 37 times [2018-10-15 12:58:36,022 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:36,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:38,963 INFO L134 CoverageAnalysis]: Checked inductivity of 3367 backedges. 0 proven. 3367 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:38,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:38,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-15 12:58:38,964 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-15 12:58:38,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-15 12:58:38,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 12:58:38,964 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 77 states. [2018-10-15 12:58:49,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:49,065 INFO L93 Difference]: Finished difference Result 204 states and 204 transitions. [2018-10-15 12:58:49,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-10-15 12:58:49,065 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 195 [2018-10-15 12:58:49,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:49,067 INFO L225 Difference]: With dead ends: 204 [2018-10-15 12:58:49,067 INFO L226 Difference]: Without dead ends: 204 [2018-10-15 12:58:49,068 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2701 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=447, Invalid=22203, Unknown=0, NotChecked=0, Total=22650 [2018-10-15 12:58:49,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-10-15 12:58:49,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 201. [2018-10-15 12:58:49,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-10-15 12:58:49,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-10-15 12:58:49,071 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 195 [2018-10-15 12:58:49,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:49,072 INFO L481 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-10-15 12:58:49,072 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-15 12:58:49,072 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-10-15 12:58:49,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-10-15 12:58:49,073 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:49,073 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:58:49,073 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:49,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:49,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1321348585, now seen corresponding path program 38 times [2018-10-15 12:58:49,074 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:49,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:53,999 INFO L134 CoverageAnalysis]: Checked inductivity of 3553 backedges. 0 proven. 3553 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:53,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:53,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-15 12:58:53,999 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-15 12:58:54,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-15 12:58:54,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 12:58:54,000 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 79 states. [2018-10-15 12:59:04,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:59:04,574 INFO L93 Difference]: Finished difference Result 209 states and 209 transitions. [2018-10-15 12:59:04,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-10-15 12:59:04,574 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 200 [2018-10-15 12:59:04,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:59:04,576 INFO L225 Difference]: With dead ends: 209 [2018-10-15 12:59:04,576 INFO L226 Difference]: Without dead ends: 209 [2018-10-15 12:59:04,577 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2850 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=459, Invalid=23411, Unknown=0, NotChecked=0, Total=23870 [2018-10-15 12:59:04,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-10-15 12:59:04,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2018-10-15 12:59:04,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-10-15 12:59:04,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2018-10-15 12:59:04,580 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 200 [2018-10-15 12:59:04,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:59:04,580 INFO L481 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2018-10-15 12:59:04,580 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-15 12:59:04,580 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2018-10-15 12:59:04,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-10-15 12:59:04,581 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:59:04,581 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:59:04,581 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:59:04,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:59:04,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1661214237, now seen corresponding path program 39 times [2018-10-15 12:59:04,582 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:59:04,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:59:09,026 INFO L134 CoverageAnalysis]: Checked inductivity of 3744 backedges. 0 proven. 3744 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:59:09,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:59:09,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-15 12:59:09,027 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-15 12:59:09,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-15 12:59:09,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 12:59:09,028 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand 81 states. [2018-10-15 12:59:19,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:59:19,994 INFO L93 Difference]: Finished difference Result 214 states and 214 transitions. [2018-10-15 12:59:19,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-10-15 12:59:19,994 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 205 [2018-10-15 12:59:19,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:59:19,995 INFO L225 Difference]: With dead ends: 214 [2018-10-15 12:59:19,995 INFO L226 Difference]: Without dead ends: 214 [2018-10-15 12:59:19,997 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3003 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=471, Invalid=24651, Unknown=0, NotChecked=0, Total=25122 [2018-10-15 12:59:19,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-10-15 12:59:19,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 211. [2018-10-15 12:59:19,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-10-15 12:59:19,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2018-10-15 12:59:20,000 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 205 [2018-10-15 12:59:20,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:59:20,000 INFO L481 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2018-10-15 12:59:20,000 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-15 12:59:20,000 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2018-10-15 12:59:20,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-10-15 12:59:20,001 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:59:20,001 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:59:20,001 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:59:20,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:59:20,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1752537641, now seen corresponding path program 40 times [2018-10-15 12:59:20,002 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:59:20,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:59:23,565 INFO L134 CoverageAnalysis]: Checked inductivity of 3940 backedges. 0 proven. 3940 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:59:23,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:59:23,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-15 12:59:23,566 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-15 12:59:23,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-15 12:59:23,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 12:59:23,567 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 83 states. [2018-10-15 12:59:35,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:59:35,165 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2018-10-15 12:59:35,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-10-15 12:59:35,165 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 210 [2018-10-15 12:59:35,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:59:35,166 INFO L225 Difference]: With dead ends: 219 [2018-10-15 12:59:35,167 INFO L226 Difference]: Without dead ends: 219 [2018-10-15 12:59:35,168 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3160 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=483, Invalid=25923, Unknown=0, NotChecked=0, Total=26406 [2018-10-15 12:59:35,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-10-15 12:59:35,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 216. [2018-10-15 12:59:35,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-10-15 12:59:35,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 216 transitions. [2018-10-15 12:59:35,171 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 216 transitions. Word has length 210 [2018-10-15 12:59:35,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:59:35,171 INFO L481 AbstractCegarLoop]: Abstraction has 216 states and 216 transitions. [2018-10-15 12:59:35,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-15 12:59:35,171 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 216 transitions. [2018-10-15 12:59:35,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-10-15 12:59:35,172 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:59:35,172 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:59:35,172 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:59:35,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:59:35,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1405230499, now seen corresponding path program 41 times [2018-10-15 12:59:35,173 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:59:35,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:59:39,095 INFO L134 CoverageAnalysis]: Checked inductivity of 4141 backedges. 0 proven. 4141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:59:39,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:59:39,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-15 12:59:39,096 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-15 12:59:39,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-15 12:59:39,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2018-10-15 12:59:39,097 INFO L87 Difference]: Start difference. First operand 216 states and 216 transitions. Second operand 85 states. [2018-10-15 12:59:51,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:59:51,201 INFO L93 Difference]: Finished difference Result 224 states and 224 transitions. [2018-10-15 12:59:51,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-10-15 12:59:51,201 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 215 [2018-10-15 12:59:51,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:59:51,202 INFO L225 Difference]: With dead ends: 224 [2018-10-15 12:59:51,202 INFO L226 Difference]: Without dead ends: 224 [2018-10-15 12:59:51,203 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3321 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=495, Invalid=27227, Unknown=0, NotChecked=0, Total=27722 [2018-10-15 12:59:51,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-10-15 12:59:51,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 221. [2018-10-15 12:59:51,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-10-15 12:59:51,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2018-10-15 12:59:51,205 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 215 [2018-10-15 12:59:51,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:59:51,206 INFO L481 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2018-10-15 12:59:51,206 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-15 12:59:51,206 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2018-10-15 12:59:51,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-10-15 12:59:51,207 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:59:51,207 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:59:51,207 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:59:51,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:59:51,207 INFO L82 PathProgramCache]: Analyzing trace with hash -218188183, now seen corresponding path program 42 times [2018-10-15 12:59:51,208 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:59:51,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:59:55,869 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 0 proven. 4347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:59:55,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:59:55,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-15 12:59:55,870 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-15 12:59:55,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-15 12:59:55,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 12:59:55,871 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 87 states. [2018-10-15 13:00:09,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:00:09,007 INFO L93 Difference]: Finished difference Result 229 states and 229 transitions. [2018-10-15 13:00:09,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-10-15 13:00:09,008 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 220 [2018-10-15 13:00:09,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:00:09,010 INFO L225 Difference]: With dead ends: 229 [2018-10-15 13:00:09,010 INFO L226 Difference]: Without dead ends: 229 [2018-10-15 13:00:09,011 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3486 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=507, Invalid=28563, Unknown=0, NotChecked=0, Total=29070 [2018-10-15 13:00:09,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-10-15 13:00:09,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226. [2018-10-15 13:00:09,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-10-15 13:00:09,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 226 transitions. [2018-10-15 13:00:09,014 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 226 transitions. Word has length 220 [2018-10-15 13:00:09,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:00:09,015 INFO L481 AbstractCegarLoop]: Abstraction has 226 states and 226 transitions. [2018-10-15 13:00:09,015 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-15 13:00:09,015 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 226 transitions. [2018-10-15 13:00:09,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-10-15 13:00:09,016 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:00:09,016 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:00:09,016 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:00:09,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:00:09,017 INFO L82 PathProgramCache]: Analyzing trace with hash 734046563, now seen corresponding path program 43 times [2018-10-15 13:00:09,017 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:00:09,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:00:12,867 INFO L134 CoverageAnalysis]: Checked inductivity of 4558 backedges. 0 proven. 4558 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:00:12,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:00:12,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-15 13:00:12,868 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-15 13:00:12,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-15 13:00:12,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2018-10-15 13:00:12,868 INFO L87 Difference]: Start difference. First operand 226 states and 226 transitions. Second operand 89 states. [2018-10-15 13:00:26,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:00:26,457 INFO L93 Difference]: Finished difference Result 234 states and 234 transitions. [2018-10-15 13:00:26,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-10-15 13:00:26,458 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 225 [2018-10-15 13:00:26,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:00:26,459 INFO L225 Difference]: With dead ends: 234 [2018-10-15 13:00:26,459 INFO L226 Difference]: Without dead ends: 234 [2018-10-15 13:00:26,460 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3655 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=519, Invalid=29931, Unknown=0, NotChecked=0, Total=30450 [2018-10-15 13:00:26,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-10-15 13:00:26,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 231. [2018-10-15 13:00:26,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-10-15 13:00:26,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2018-10-15 13:00:26,464 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 225 [2018-10-15 13:00:26,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:00:26,464 INFO L481 AbstractCegarLoop]: Abstraction has 231 states and 231 transitions. [2018-10-15 13:00:26,464 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-15 13:00:26,465 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 231 transitions. [2018-10-15 13:00:26,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-15 13:00:26,466 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:00:26,466 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:00:26,466 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:00:26,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:00:26,466 INFO L82 PathProgramCache]: Analyzing trace with hash -486440279, now seen corresponding path program 44 times [2018-10-15 13:00:26,467 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:00:26,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:00:30,744 INFO L134 CoverageAnalysis]: Checked inductivity of 4774 backedges. 0 proven. 4774 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:00:30,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:00:30,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-15 13:00:30,745 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-15 13:00:30,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-15 13:00:30,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=8011, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 13:00:30,746 INFO L87 Difference]: Start difference. First operand 231 states and 231 transitions. Second operand 91 states. [2018-10-15 13:00:44,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:00:44,953 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2018-10-15 13:00:44,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-10-15 13:00:44,953 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 230 [2018-10-15 13:00:44,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:00:44,955 INFO L225 Difference]: With dead ends: 239 [2018-10-15 13:00:44,955 INFO L226 Difference]: Without dead ends: 239 [2018-10-15 13:00:44,956 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 2 SyntacticMatches, 0 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 13:00:44,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-10-15 13:00:44,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 236. [2018-10-15 13:00:44,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-10-15 13:00:44,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 236 transitions. [2018-10-15 13:00:44,960 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 236 transitions. Word has length 230 [2018-10-15 13:00:44,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:00:44,960 INFO L481 AbstractCegarLoop]: Abstraction has 236 states and 236 transitions. [2018-10-15 13:00:44,960 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-15 13:00:44,960 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 236 transitions. [2018-10-15 13:00:44,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-10-15 13:00:44,961 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:00:44,962 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:00:44,962 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:00:44,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:00:44,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1993573667, now seen corresponding path program 45 times [2018-10-15 13:00:44,963 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:00:44,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:00:49,100 INFO L134 CoverageAnalysis]: Checked inductivity of 4995 backedges. 0 proven. 4995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:00:49,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:00:49,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-15 13:00:49,100 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-15 13:00:49,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-15 13:00:49,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=8373, Unknown=0, NotChecked=0, Total=8556 [2018-10-15 13:00:49,101 INFO L87 Difference]: Start difference. First operand 236 states and 236 transitions. Second operand 93 states. [2018-10-15 13:01:03,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:01:03,862 INFO L93 Difference]: Finished difference Result 244 states and 244 transitions. [2018-10-15 13:01:03,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-10-15 13:01:03,863 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 235 [2018-10-15 13:01:03,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:01:03,864 INFO L225 Difference]: With dead ends: 244 [2018-10-15 13:01:03,864 INFO L226 Difference]: Without dead ends: 244 [2018-10-15 13:01:03,865 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4005 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=543, Invalid=32763, Unknown=0, NotChecked=0, Total=33306 [2018-10-15 13:01:03,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-10-15 13:01:03,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 241. [2018-10-15 13:01:03,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-10-15 13:01:03,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2018-10-15 13:01:03,867 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 235 [2018-10-15 13:01:03,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:01:03,867 INFO L481 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2018-10-15 13:01:03,867 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-15 13:01:03,867 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2018-10-15 13:01:03,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-10-15 13:01:03,868 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:01:03,868 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:01:03,868 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:01:03,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:01:03,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1339949335, now seen corresponding path program 46 times [2018-10-15 13:01:03,869 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:01:03,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:01:08,457 INFO L134 CoverageAnalysis]: Checked inductivity of 5221 backedges. 0 proven. 5221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:01:08,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:01:08,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-10-15 13:01:08,458 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-15 13:01:08,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-15 13:01:08,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=8743, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 13:01:08,459 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 95 states. [2018-10-15 13:01:23,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:01:23,987 INFO L93 Difference]: Finished difference Result 249 states and 249 transitions. [2018-10-15 13:01:23,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-10-15 13:01:23,987 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 240 [2018-10-15 13:01:23,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:01:23,989 INFO L225 Difference]: With dead ends: 249 [2018-10-15 13:01:23,989 INFO L226 Difference]: Without dead ends: 249 [2018-10-15 13:01:23,990 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4186 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=555, Invalid=34227, Unknown=0, NotChecked=0, Total=34782 [2018-10-15 13:01:23,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-10-15 13:01:23,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 246. [2018-10-15 13:01:23,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-10-15 13:01:23,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 246 transitions. [2018-10-15 13:01:23,993 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 246 transitions. Word has length 240 [2018-10-15 13:01:23,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:01:23,993 INFO L481 AbstractCegarLoop]: Abstraction has 246 states and 246 transitions. [2018-10-15 13:01:23,994 INFO L482 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-15 13:01:23,994 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 246 transitions. [2018-10-15 13:01:23,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-10-15 13:01:23,995 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:01:23,995 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:01:23,995 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:01:23,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:01:23,996 INFO L82 PathProgramCache]: Analyzing trace with hash -472469277, now seen corresponding path program 47 times [2018-10-15 13:01:23,996 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:01:24,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:01:28,910 INFO L134 CoverageAnalysis]: Checked inductivity of 5452 backedges. 0 proven. 5452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:01:28,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:01:28,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-10-15 13:01:28,911 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-15 13:01:28,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-15 13:01:28,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=9121, Unknown=0, NotChecked=0, Total=9312 [2018-10-15 13:01:28,911 INFO L87 Difference]: Start difference. First operand 246 states and 246 transitions. Second operand 97 states. [2018-10-15 13:01:31,530 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-15 13:01:45,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:01:45,616 INFO L93 Difference]: Finished difference Result 254 states and 254 transitions. [2018-10-15 13:01:45,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-10-15 13:01:45,617 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 245 [2018-10-15 13:01:45,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:01:45,617 INFO L225 Difference]: With dead ends: 254 [2018-10-15 13:01:45,618 INFO L226 Difference]: Without dead ends: 254 [2018-10-15 13:01:45,619 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4371 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=567, Invalid=35723, Unknown=0, NotChecked=0, Total=36290 [2018-10-15 13:01:45,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-10-15 13:01:45,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 251. [2018-10-15 13:01:45,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-10-15 13:01:45,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2018-10-15 13:01:45,622 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 245 [2018-10-15 13:01:45,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:01:45,622 INFO L481 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2018-10-15 13:01:45,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-15 13:01:45,622 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2018-10-15 13:01:45,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-10-15 13:01:45,623 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:01:45,623 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:01:45,624 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:01:45,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:01:45,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1794888919, now seen corresponding path program 48 times [2018-10-15 13:01:45,625 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:01:45,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:01:50,264 INFO L134 CoverageAnalysis]: Checked inductivity of 5688 backedges. 0 proven. 5688 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:01:50,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:01:50,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-10-15 13:01:50,265 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-15 13:01:50,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-15 13:01:50,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=9507, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 13:01:50,266 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 99 states. [2018-10-15 13:02:06,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:02:06,956 INFO L93 Difference]: Finished difference Result 259 states and 259 transitions. [2018-10-15 13:02:06,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-10-15 13:02:06,956 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 250 [2018-10-15 13:02:06,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:02:06,958 INFO L225 Difference]: With dead ends: 259 [2018-10-15 13:02:06,958 INFO L226 Difference]: Without dead ends: 259 [2018-10-15 13:02:06,960 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4560 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=579, Invalid=37251, Unknown=0, NotChecked=0, Total=37830 [2018-10-15 13:02:06,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-10-15 13:02:06,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 256. [2018-10-15 13:02:06,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-10-15 13:02:06,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 256 transitions. [2018-10-15 13:02:06,964 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 256 transitions. Word has length 250 [2018-10-15 13:02:06,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:02:06,964 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 256 transitions. [2018-10-15 13:02:06,964 INFO L482 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-15 13:02:06,964 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 256 transitions. [2018-10-15 13:02:06,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-10-15 13:02:06,965 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:02:06,966 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:02:06,966 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:02:06,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:02:06,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1051077795, now seen corresponding path program 49 times [2018-10-15 13:02:06,967 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:02:06,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:02:12,006 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 0 proven. 5929 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:02:12,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:02:12,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-10-15 13:02:12,007 INFO L460 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-10-15 13:02:12,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-10-15 13:02:12,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=9901, Unknown=0, NotChecked=0, Total=10100 [2018-10-15 13:02:12,008 INFO L87 Difference]: Start difference. First operand 256 states and 256 transitions. Second operand 101 states. [2018-10-15 13:02:29,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:02:29,353 INFO L93 Difference]: Finished difference Result 264 states and 264 transitions. [2018-10-15 13:02:29,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-10-15 13:02:29,353 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 255 [2018-10-15 13:02:29,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:02:29,355 INFO L225 Difference]: With dead ends: 264 [2018-10-15 13:02:29,355 INFO L226 Difference]: Without dead ends: 264 [2018-10-15 13:02:29,356 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 2 SyntacticMatches, 0 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 13:02:29,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-10-15 13:02:29,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 261. [2018-10-15 13:02:29,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-10-15 13:02:29,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2018-10-15 13:02:29,362 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 255 [2018-10-15 13:02:29,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:02:29,362 INFO L481 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2018-10-15 13:02:29,362 INFO L482 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-10-15 13:02:29,362 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2018-10-15 13:02:29,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-10-15 13:02:29,363 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:02:29,364 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:02:29,364 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:02:29,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:02:29,364 INFO L82 PathProgramCache]: Analyzing trace with hash -817100951, now seen corresponding path program 50 times [2018-10-15 13:02:29,365 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:02:29,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:02:34,610 INFO L134 CoverageAnalysis]: Checked inductivity of 6175 backedges. 0 proven. 6175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:02:34,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:02:34,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-10-15 13:02:34,611 INFO L460 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-10-15 13:02:34,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-10-15 13:02:34,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 13:02:34,612 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 103 states. [2018-10-15 13:02:52,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:02:52,961 INFO L93 Difference]: Finished difference Result 269 states and 269 transitions. [2018-10-15 13:02:52,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-10-15 13:02:52,963 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 260 [2018-10-15 13:02:52,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:02:52,964 INFO L225 Difference]: With dead ends: 269 [2018-10-15 13:02:52,964 INFO L226 Difference]: Without dead ends: 269 [2018-10-15 13:02:52,965 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 2 SyntacticMatches, 0 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 13:02:52,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-10-15 13:02:52,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 266. [2018-10-15 13:02:52,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-10-15 13:02:52,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 266 transitions. [2018-10-15 13:02:52,969 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 266 transitions. Word has length 260 [2018-10-15 13:02:52,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:02:52,969 INFO L481 AbstractCegarLoop]: Abstraction has 266 states and 266 transitions. [2018-10-15 13:02:52,969 INFO L482 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-10-15 13:02:52,969 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 266 transitions. [2018-10-15 13:02:52,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-10-15 13:02:52,970 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:02:52,971 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:02:52,971 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:02:52,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:02:52,971 INFO L82 PathProgramCache]: Analyzing trace with hash 807270499, now seen corresponding path program 51 times [2018-10-15 13:02:52,972 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:02:52,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:02:58,740 INFO L134 CoverageAnalysis]: Checked inductivity of 6426 backedges. 0 proven. 6426 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:02:58,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:02:58,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-10-15 13:02:58,741 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-10-15 13:02:58,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-10-15 13:02:58,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=10713, Unknown=0, NotChecked=0, Total=10920 [2018-10-15 13:02:58,742 INFO L87 Difference]: Start difference. First operand 266 states and 266 transitions. Second operand 105 states. [2018-10-15 13:03:17,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:17,662 INFO L93 Difference]: Finished difference Result 274 states and 274 transitions. [2018-10-15 13:03:17,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-10-15 13:03:17,663 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 265 [2018-10-15 13:03:17,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:17,664 INFO L225 Difference]: With dead ends: 274 [2018-10-15 13:03:17,664 INFO L226 Difference]: Without dead ends: 274 [2018-10-15 13:03:17,665 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5151 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=615, Invalid=42027, Unknown=0, NotChecked=0, Total=42642 [2018-10-15 13:03:17,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-10-15 13:03:17,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 271. [2018-10-15 13:03:17,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-10-15 13:03:17,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 271 transitions. [2018-10-15 13:03:17,668 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 271 transitions. Word has length 265 [2018-10-15 13:03:17,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:17,669 INFO L481 AbstractCegarLoop]: Abstraction has 271 states and 271 transitions. [2018-10-15 13:03:17,669 INFO L482 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-10-15 13:03:17,669 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 271 transitions. [2018-10-15 13:03:17,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-10-15 13:03:17,670 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:17,671 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:17,671 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:17,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:17,671 INFO L82 PathProgramCache]: Analyzing trace with hash -543321175, now seen corresponding path program 52 times [2018-10-15 13:03:17,672 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:17,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:23,449 INFO L134 CoverageAnalysis]: Checked inductivity of 6682 backedges. 0 proven. 6682 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:23,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:23,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-10-15 13:03:23,450 INFO L460 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-10-15 13:03:23,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-10-15 13:03:23,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=11131, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 13:03:23,451 INFO L87 Difference]: Start difference. First operand 271 states and 271 transitions. Second operand 107 states. [2018-10-15 13:03:42,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:42,815 INFO L93 Difference]: Finished difference Result 279 states and 279 transitions. [2018-10-15 13:03:42,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2018-10-15 13:03:42,816 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 270 [2018-10-15 13:03:42,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:42,817 INFO L225 Difference]: With dead ends: 279 [2018-10-15 13:03:42,817 INFO L226 Difference]: Without dead ends: 279 [2018-10-15 13:03:42,819 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5356 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=627, Invalid=43683, Unknown=0, NotChecked=0, Total=44310 [2018-10-15 13:03:42,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-10-15 13:03:42,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 276. [2018-10-15 13:03:42,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-10-15 13:03:42,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 276 transitions. [2018-10-15 13:03:42,823 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 276 transitions. Word has length 270 [2018-10-15 13:03:42,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:42,823 INFO L481 AbstractCegarLoop]: Abstraction has 276 states and 276 transitions. [2018-10-15 13:03:42,823 INFO L482 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-10-15 13:03:42,823 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 276 transitions. [2018-10-15 13:03:42,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-10-15 13:03:42,825 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:42,825 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:42,825 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:42,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:42,825 INFO L82 PathProgramCache]: Analyzing trace with hash -31845341, now seen corresponding path program 53 times [2018-10-15 13:03:42,826 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:42,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:48,863 INFO L134 CoverageAnalysis]: Checked inductivity of 6943 backedges. 0 proven. 6943 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:48,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:48,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-10-15 13:03:48,864 INFO L460 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-10-15 13:03:48,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-10-15 13:03:48,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=11557, Unknown=0, NotChecked=0, Total=11772 [2018-10-15 13:03:48,865 INFO L87 Difference]: Start difference. First operand 276 states and 276 transitions. Second operand 109 states.