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/AutomizerBpl.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20181010-MemSafetyPathprograms/20051113-1.c_false-valid-memtrack.i_9.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-b8f97f7-m [2018-10-10 15:17:05,219 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 15:17:05,223 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 15:17:05,242 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 15:17:05,242 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 15:17:05,244 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 15:17:05,246 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 15:17:05,249 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 15:17:05,251 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 15:17:05,253 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 15:17:05,254 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 15:17:05,255 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 15:17:05,256 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 15:17:05,259 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 15:17:05,266 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 15:17:05,267 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 15:17:05,271 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 15:17:05,276 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 15:17:05,281 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 15:17:05,285 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 15:17:05,287 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 15:17:05,288 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 15:17:05,293 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 15:17:05,294 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 15:17:05,294 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 15:17:05,295 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 15:17:05,296 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 15:17:05,297 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 15:17:05,299 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 15:17:05,301 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 15:17:05,301 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 15:17:05,303 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 15:17:05,303 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 15:17:05,303 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 15:17:05,304 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 15:17:05,307 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 15:17:05,307 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-10 15:17:05,323 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 15:17:05,323 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 15:17:05,324 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-10 15:17:05,325 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-10 15:17:05,325 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-10 15:17:05,325 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-10 15:17:05,326 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 15:17:05,326 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-10 15:17:05,327 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 15:17:05,327 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-10 15:17:05,327 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-10 15:17:05,327 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-10 15:17:05,327 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-10 15:17:05,329 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-10 15:17:05,329 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-10 15:17:05,397 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 15:17:05,411 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 15:17:05,415 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 15:17:05,417 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-10 15:17:05,417 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-10 15:17:05,418 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/20051113-1.c_false-valid-memtrack.i_9.bpl [2018-10-10 15:17:05,419 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/20051113-1.c_false-valid-memtrack.i_9.bpl' [2018-10-10 15:17:05,487 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 15:17:05,489 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-10 15:17:05,489 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 15:17:05,490 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 15:17:05,490 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 15:17:05,519 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:17:05" (1/1) ... [2018-10-10 15:17:05,521 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:17:05" (1/1) ... [2018-10-10 15:17:05,538 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:17:05" (1/1) ... [2018-10-10 15:17:05,539 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:17:05" (1/1) ... [2018-10-10 15:17:05,546 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:17:05" (1/1) ... [2018-10-10 15:17:05,550 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:17:05" (1/1) ... [2018-10-10 15:17:05,551 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:17:05" (1/1) ... [2018-10-10 15:17:05,558 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 15:17:05,559 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 15:17:05,559 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 15:17:05,559 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 15:17:05,561 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "20051113-1.c_false-valid-memtrack.i_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:17:05" (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-10 15:17:05,635 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-10 15:17:05,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 15:17:05,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 15:17:06,183 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 15:17:06,184 INFO L202 PluginConnector]: Adding new model 20051113-1.c_false-valid-memtrack.i_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 03:17:06 BoogieIcfgContainer [2018-10-10 15:17:06,184 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 15:17:06,186 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 15:17:06,186 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 15:17:06,189 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 15:17:06,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "20051113-1.c_false-valid-memtrack.i_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:17:05" (1/2) ... [2018-10-10 15:17:06,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@da120ba and model type 20051113-1.c_false-valid-memtrack.i_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 03:17:06, skipping insertion in model container [2018-10-10 15:17:06,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "20051113-1.c_false-valid-memtrack.i_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 03:17:06" (2/2) ... [2018-10-10 15:17:06,193 INFO L112 eAbstractionObserver]: Analyzing ICFG 20051113-1.c_false-valid-memtrack.i_9.bpl [2018-10-10 15:17:06,203 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-10 15:17:06,212 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-10 15:17:06,230 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-10 15:17:06,266 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 15:17:06,267 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 15:17:06,267 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 15:17:06,268 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-10 15:17:06,268 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 15:17:06,268 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 15:17:06,268 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 15:17:06,268 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 15:17:06,269 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 15:17:06,291 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-10-10 15:17:06,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-10 15:17:06,315 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:06,319 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:06,320 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:06,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:06,326 INFO L82 PathProgramCache]: Analyzing trace with hash -758509889, now seen corresponding path program 1 times [2018-10-10 15:17:06,377 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:06,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:06,581 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-10 15:17:06,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 15:17:06,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 15:17:06,590 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-10 15:17:06,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-10 15:17:06,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-10 15:17:06,607 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 4 states. [2018-10-10 15:17:06,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:06,739 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-10-10 15:17:06,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-10 15:17:06,741 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-10-10 15:17:06,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:06,755 INFO L225 Difference]: With dead ends: 55 [2018-10-10 15:17:06,755 INFO L226 Difference]: Without dead ends: 55 [2018-10-10 15:17:06,757 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-10 15:17:06,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-10 15:17:06,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2018-10-10 15:17:06,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-10 15:17:06,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-10-10 15:17:06,801 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 49 [2018-10-10 15:17:06,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:06,801 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-10-10 15:17:06,802 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-10 15:17:06,802 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-10-10 15:17:06,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-10 15:17:06,804 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:06,804 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:06,804 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:06,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:06,805 INFO L82 PathProgramCache]: Analyzing trace with hash 824639837, now seen corresponding path program 1 times [2018-10-10 15:17:06,806 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:06,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:06,958 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-10 15:17:06,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:06,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-10 15:17:06,960 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 15:17:06,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 15:17:06,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-10 15:17:06,961 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 5 states. [2018-10-10 15:17:07,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:07,238 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-10-10 15:17:07,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-10 15:17:07,241 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-10-10 15:17:07,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:07,244 INFO L225 Difference]: With dead ends: 58 [2018-10-10 15:17:07,245 INFO L226 Difference]: Without dead ends: 58 [2018-10-10 15:17:07,246 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-10 15:17:07,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-10-10 15:17:07,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2018-10-10 15:17:07,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-10 15:17:07,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-10-10 15:17:07,256 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 52 [2018-10-10 15:17:07,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:07,257 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-10-10 15:17:07,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 15:17:07,257 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-10-10 15:17:07,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-10 15:17:07,259 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:07,259 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:07,260 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:07,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:07,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1402249727, now seen corresponding path program 2 times [2018-10-10 15:17:07,263 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:07,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:07,429 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:07,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:07,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-10 15:17:07,431 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 15:17:07,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 15:17:07,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-10 15:17:07,432 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 6 states. [2018-10-10 15:17:07,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:07,566 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-10-10 15:17:07,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 15:17:07,567 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2018-10-10 15:17:07,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:07,569 INFO L225 Difference]: With dead ends: 61 [2018-10-10 15:17:07,569 INFO L226 Difference]: Without dead ends: 61 [2018-10-10 15:17:07,570 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-10-10 15:17:07,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-10-10 15:17:07,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-10-10 15:17:07,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-10 15:17:07,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-10-10 15:17:07,577 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 55 [2018-10-10 15:17:07,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:07,578 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-10-10 15:17:07,578 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 15:17:07,578 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-10-10 15:17:07,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-10 15:17:07,580 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:07,580 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:07,581 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:07,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:07,581 INFO L82 PathProgramCache]: Analyzing trace with hash -955472355, now seen corresponding path program 3 times [2018-10-10 15:17:07,582 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:07,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:07,794 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:07,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:07,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-10 15:17:07,795 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 15:17:07,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 15:17:07,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-10 15:17:07,796 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 7 states. [2018-10-10 15:17:07,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:07,927 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-10-10 15:17:07,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-10 15:17:07,928 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2018-10-10 15:17:07,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:07,930 INFO L225 Difference]: With dead ends: 64 [2018-10-10 15:17:07,930 INFO L226 Difference]: Without dead ends: 64 [2018-10-10 15:17:07,931 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-10 15:17:07,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-10-10 15:17:07,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2018-10-10 15:17:07,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-10-10 15:17:07,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-10-10 15:17:07,937 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 58 [2018-10-10 15:17:07,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:07,937 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-10-10 15:17:07,938 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 15:17:07,938 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-10-10 15:17:07,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-10-10 15:17:07,939 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:07,939 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:07,940 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:07,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:07,940 INFO L82 PathProgramCache]: Analyzing trace with hash 41141567, now seen corresponding path program 4 times [2018-10-10 15:17:07,941 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:07,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:08,128 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:08,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:08,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-10 15:17:08,129 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 15:17:08,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 15:17:08,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-10-10 15:17:08,130 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 8 states. [2018-10-10 15:17:08,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:08,688 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-10-10 15:17:08,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 15:17:08,691 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2018-10-10 15:17:08,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:08,693 INFO L225 Difference]: With dead ends: 67 [2018-10-10 15:17:08,693 INFO L226 Difference]: Without dead ends: 67 [2018-10-10 15:17:08,696 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-10-10 15:17:08,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-10-10 15:17:08,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2018-10-10 15:17:08,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-10-10 15:17:08,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-10-10 15:17:08,708 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 61 [2018-10-10 15:17:08,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:08,709 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-10-10 15:17:08,709 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 15:17:08,709 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-10-10 15:17:08,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-10 15:17:08,712 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:08,712 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:08,713 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:08,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:08,713 INFO L82 PathProgramCache]: Analyzing trace with hash -942425379, now seen corresponding path program 5 times [2018-10-10 15:17:08,714 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:08,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:09,151 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:09,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:09,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-10 15:17:09,152 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 15:17:09,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 15:17:09,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-10-10 15:17:09,153 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 9 states. [2018-10-10 15:17:09,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:09,403 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-10-10 15:17:09,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 15:17:09,405 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2018-10-10 15:17:09,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:09,406 INFO L225 Difference]: With dead ends: 70 [2018-10-10 15:17:09,406 INFO L226 Difference]: Without dead ends: 70 [2018-10-10 15:17:09,407 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-10-10 15:17:09,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-10-10 15:17:09,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2018-10-10 15:17:09,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-10-10 15:17:09,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-10-10 15:17:09,412 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 64 [2018-10-10 15:17:09,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:09,412 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-10-10 15:17:09,412 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 15:17:09,413 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-10-10 15:17:09,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-10 15:17:09,414 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:09,414 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:09,414 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:09,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:09,415 INFO L82 PathProgramCache]: Analyzing trace with hash -2118420353, now seen corresponding path program 6 times [2018-10-10 15:17:09,416 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:09,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:09,590 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:09,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:09,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-10 15:17:09,591 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 15:17:09,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 15:17:09,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-10 15:17:09,592 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 10 states. [2018-10-10 15:17:09,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:09,838 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-10-10 15:17:09,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 15:17:09,839 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2018-10-10 15:17:09,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:09,840 INFO L225 Difference]: With dead ends: 73 [2018-10-10 15:17:09,840 INFO L226 Difference]: Without dead ends: 73 [2018-10-10 15:17:09,841 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-10-10 15:17:09,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-10-10 15:17:09,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2018-10-10 15:17:09,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-10-10 15:17:09,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-10-10 15:17:09,847 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 67 [2018-10-10 15:17:09,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:09,847 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-10-10 15:17:09,847 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 15:17:09,847 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-10-10 15:17:09,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-10 15:17:09,849 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:09,849 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:09,849 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:09,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:09,850 INFO L82 PathProgramCache]: Analyzing trace with hash -2136457315, now seen corresponding path program 7 times [2018-10-10 15:17:09,850 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:09,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:10,068 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:10,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:10,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-10 15:17:10,069 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-10 15:17:10,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-10 15:17:10,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2018-10-10 15:17:10,070 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 11 states. [2018-10-10 15:17:10,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:10,234 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-10-10 15:17:10,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 15:17:10,240 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 70 [2018-10-10 15:17:10,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:10,241 INFO L225 Difference]: With dead ends: 76 [2018-10-10 15:17:10,241 INFO L226 Difference]: Without dead ends: 76 [2018-10-10 15:17:10,242 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-10-10 15:17:10,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-10-10 15:17:10,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2018-10-10 15:17:10,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-10-10 15:17:10,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-10-10 15:17:10,247 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 70 [2018-10-10 15:17:10,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:10,247 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-10-10 15:17:10,248 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-10 15:17:10,248 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-10-10 15:17:10,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-10 15:17:10,249 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:10,249 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:10,250 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:10,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:10,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1690287039, now seen corresponding path program 8 times [2018-10-10 15:17:10,251 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:10,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:10,432 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:10,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:10,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-10 15:17:10,433 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 15:17:10,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 15:17:10,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2018-10-10 15:17:10,434 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 12 states. [2018-10-10 15:17:10,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:10,622 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-10-10 15:17:10,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-10 15:17:10,623 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 73 [2018-10-10 15:17:10,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:10,624 INFO L225 Difference]: With dead ends: 79 [2018-10-10 15:17:10,624 INFO L226 Difference]: Without dead ends: 79 [2018-10-10 15:17:10,625 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-10-10 15:17:10,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-10 15:17:10,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2018-10-10 15:17:10,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-10-10 15:17:10,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-10-10 15:17:10,630 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 73 [2018-10-10 15:17:10,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:10,631 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-10-10 15:17:10,631 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 15:17:10,631 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-10-10 15:17:10,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-10 15:17:10,632 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:10,632 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:10,633 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:10,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:10,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1380567971, now seen corresponding path program 9 times [2018-10-10 15:17:10,634 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:10,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:11,243 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:11,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:11,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-10 15:17:11,245 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 15:17:11,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 15:17:11,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2018-10-10 15:17:11,245 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 13 states. [2018-10-10 15:17:11,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:11,511 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-10-10 15:17:11,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-10 15:17:11,518 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 76 [2018-10-10 15:17:11,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:11,519 INFO L225 Difference]: With dead ends: 82 [2018-10-10 15:17:11,519 INFO L226 Difference]: Without dead ends: 82 [2018-10-10 15:17:11,520 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-10-10 15:17:11,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-10-10 15:17:11,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2018-10-10 15:17:11,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-10 15:17:11,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-10-10 15:17:11,527 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 76 [2018-10-10 15:17:11,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:11,527 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-10-10 15:17:11,527 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 15:17:11,528 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-10-10 15:17:11,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-10 15:17:11,529 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:11,529 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:11,529 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:11,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:11,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1876201215, now seen corresponding path program 10 times [2018-10-10 15:17:11,531 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:11,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:12,307 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:12,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:12,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-10 15:17:12,308 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-10 15:17:12,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-10 15:17:12,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2018-10-10 15:17:12,309 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 14 states. [2018-10-10 15:17:12,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:12,924 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-10-10 15:17:12,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-10 15:17:12,925 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 79 [2018-10-10 15:17:12,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:12,926 INFO L225 Difference]: With dead ends: 85 [2018-10-10 15:17:12,927 INFO L226 Difference]: Without dead ends: 85 [2018-10-10 15:17:12,927 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=221, Invalid=331, Unknown=0, NotChecked=0, Total=552 [2018-10-10 15:17:12,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-10 15:17:12,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2018-10-10 15:17:12,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-10-10 15:17:12,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-10-10 15:17:12,936 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 79 [2018-10-10 15:17:12,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:12,936 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-10-10 15:17:12,936 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-10 15:17:12,936 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-10-10 15:17:12,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-10 15:17:12,940 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:12,940 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:12,940 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:12,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:12,941 INFO L82 PathProgramCache]: Analyzing trace with hash 975804701, now seen corresponding path program 11 times [2018-10-10 15:17:12,947 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:12,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:13,251 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:13,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:13,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-10 15:17:13,252 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-10 15:17:13,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-10 15:17:13,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=116, Unknown=0, NotChecked=0, Total=210 [2018-10-10 15:17:13,253 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 15 states. [2018-10-10 15:17:13,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:13,543 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-10-10 15:17:13,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-10 15:17:13,544 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 82 [2018-10-10 15:17:13,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:13,545 INFO L225 Difference]: With dead ends: 88 [2018-10-10 15:17:13,545 INFO L226 Difference]: Without dead ends: 88 [2018-10-10 15:17:13,546 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650 [2018-10-10 15:17:13,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-10-10 15:17:13,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2018-10-10 15:17:13,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-10-10 15:17:13,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-10-10 15:17:13,550 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 82 [2018-10-10 15:17:13,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:13,551 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-10-10 15:17:13,551 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-10 15:17:13,551 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-10-10 15:17:13,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-10 15:17:13,552 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:13,552 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:13,552 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:13,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:13,553 INFO L82 PathProgramCache]: Analyzing trace with hash -665980353, now seen corresponding path program 12 times [2018-10-10 15:17:13,554 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:13,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:13,995 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:13,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:13,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-10 15:17:13,996 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-10 15:17:13,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-10 15:17:13,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=132, Unknown=0, NotChecked=0, Total=240 [2018-10-10 15:17:13,997 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 16 states. [2018-10-10 15:17:14,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:14,361 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-10-10 15:17:14,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 15:17:14,362 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 85 [2018-10-10 15:17:14,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:14,363 INFO L225 Difference]: With dead ends: 91 [2018-10-10 15:17:14,363 INFO L226 Difference]: Without dead ends: 91 [2018-10-10 15:17:14,364 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=300, Invalid=456, Unknown=0, NotChecked=0, Total=756 [2018-10-10 15:17:14,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-10-10 15:17:14,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2018-10-10 15:17:14,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-10-10 15:17:14,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-10-10 15:17:14,368 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 85 [2018-10-10 15:17:14,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:14,369 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-10-10 15:17:14,369 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-10 15:17:14,369 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-10-10 15:17:14,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-10 15:17:14,370 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:14,370 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:14,370 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:14,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:14,371 INFO L82 PathProgramCache]: Analyzing trace with hash 3042781, now seen corresponding path program 13 times [2018-10-10 15:17:14,372 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:14,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:14,632 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:14,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:14,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-10 15:17:14,633 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-10 15:17:14,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-10 15:17:14,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=149, Unknown=0, NotChecked=0, Total=272 [2018-10-10 15:17:14,634 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 17 states. [2018-10-10 15:17:15,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:15,202 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-10-10 15:17:15,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-10 15:17:15,203 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 88 [2018-10-10 15:17:15,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:15,204 INFO L225 Difference]: With dead ends: 94 [2018-10-10 15:17:15,204 INFO L226 Difference]: Without dead ends: 94 [2018-10-10 15:17:15,205 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=344, Invalid=526, Unknown=0, NotChecked=0, Total=870 [2018-10-10 15:17:15,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-10-10 15:17:15,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2018-10-10 15:17:15,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-10-10 15:17:15,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-10-10 15:17:15,208 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 88 [2018-10-10 15:17:15,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:15,209 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-10-10 15:17:15,209 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-10 15:17:15,209 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-10-10 15:17:15,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-10 15:17:15,210 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:15,210 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:15,210 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:15,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:15,211 INFO L82 PathProgramCache]: Analyzing trace with hash -2071992961, now seen corresponding path program 14 times [2018-10-10 15:17:15,211 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:15,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:15,456 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:15,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:15,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-10 15:17:15,457 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-10 15:17:15,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-10 15:17:15,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=167, Unknown=0, NotChecked=0, Total=306 [2018-10-10 15:17:15,458 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 18 states. [2018-10-10 15:17:15,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:15,836 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-10-10 15:17:15,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-10 15:17:15,837 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 91 [2018-10-10 15:17:15,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:15,838 INFO L225 Difference]: With dead ends: 97 [2018-10-10 15:17:15,838 INFO L226 Difference]: Without dead ends: 97 [2018-10-10 15:17:15,839 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=391, Invalid=601, Unknown=0, NotChecked=0, Total=992 [2018-10-10 15:17:15,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-10-10 15:17:15,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2018-10-10 15:17:15,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-10-10 15:17:15,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-10-10 15:17:15,842 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 91 [2018-10-10 15:17:15,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:15,842 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-10-10 15:17:15,842 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-10 15:17:15,842 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-10-10 15:17:15,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-10 15:17:15,843 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:15,843 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:15,843 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:15,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:15,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1997491555, now seen corresponding path program 15 times [2018-10-10 15:17:15,845 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:15,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:16,320 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:16,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:16,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-10 15:17:16,321 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-10 15:17:16,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-10 15:17:16,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=186, Unknown=0, NotChecked=0, Total=342 [2018-10-10 15:17:16,322 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 19 states. [2018-10-10 15:17:16,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:16,681 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-10-10 15:17:16,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-10 15:17:16,682 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 94 [2018-10-10 15:17:16,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:16,683 INFO L225 Difference]: With dead ends: 100 [2018-10-10 15:17:16,683 INFO L226 Difference]: Without dead ends: 100 [2018-10-10 15:17:16,684 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=441, Invalid=681, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 15:17:16,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-10-10 15:17:16,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2018-10-10 15:17:16,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-10-10 15:17:16,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-10-10 15:17:16,686 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 94 [2018-10-10 15:17:16,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:16,687 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-10-10 15:17:16,687 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-10 15:17:16,687 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-10-10 15:17:16,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-10-10 15:17:16,688 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:16,688 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:16,689 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:16,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:16,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1270769855, now seen corresponding path program 16 times [2018-10-10 15:17:16,690 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:16,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:17,204 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:17,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:17,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-10 15:17:17,204 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-10 15:17:17,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-10 15:17:17,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=206, Unknown=0, NotChecked=0, Total=380 [2018-10-10 15:17:17,205 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 20 states. [2018-10-10 15:17:17,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:17,538 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-10-10 15:17:17,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-10 15:17:17,538 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 97 [2018-10-10 15:17:17,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:17,540 INFO L225 Difference]: With dead ends: 103 [2018-10-10 15:17:17,540 INFO L226 Difference]: Without dead ends: 103 [2018-10-10 15:17:17,541 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=494, Invalid=766, Unknown=0, NotChecked=0, Total=1260 [2018-10-10 15:17:17,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-10-10 15:17:17,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2018-10-10 15:17:17,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-10-10 15:17:17,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-10-10 15:17:17,544 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 97 [2018-10-10 15:17:17,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:17,544 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-10-10 15:17:17,544 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-10 15:17:17,544 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-10-10 15:17:17,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-10 15:17:17,545 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:17,545 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:17,545 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:17,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:17,546 INFO L82 PathProgramCache]: Analyzing trace with hash -862165155, now seen corresponding path program 17 times [2018-10-10 15:17:17,546 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:17,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:18,064 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:18,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:18,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-10 15:17:18,065 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-10 15:17:18,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-10 15:17:18,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=227, Unknown=0, NotChecked=0, Total=420 [2018-10-10 15:17:18,066 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 21 states. [2018-10-10 15:17:19,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:19,052 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-10-10 15:17:19,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-10 15:17:19,056 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 100 [2018-10-10 15:17:19,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:19,057 INFO L225 Difference]: With dead ends: 106 [2018-10-10 15:17:19,057 INFO L226 Difference]: Without dead ends: 106 [2018-10-10 15:17:19,058 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=550, Invalid=856, Unknown=0, NotChecked=0, Total=1406 [2018-10-10 15:17:19,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-10-10 15:17:19,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2018-10-10 15:17:19,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-10-10 15:17:19,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-10-10 15:17:19,061 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 100 [2018-10-10 15:17:19,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:19,062 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-10-10 15:17:19,062 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-10 15:17:19,062 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-10-10 15:17:19,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-10 15:17:19,063 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:19,063 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:19,063 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:19,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:19,063 INFO L82 PathProgramCache]: Analyzing trace with hash 912096255, now seen corresponding path program 18 times [2018-10-10 15:17:19,064 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:19,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:19,655 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 0 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:19,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:19,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-10 15:17:19,656 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-10 15:17:19,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-10 15:17:19,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=249, Unknown=0, NotChecked=0, Total=462 [2018-10-10 15:17:19,656 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 22 states. [2018-10-10 15:17:20,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:20,180 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-10-10 15:17:20,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-10 15:17:20,180 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 103 [2018-10-10 15:17:20,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:20,181 INFO L225 Difference]: With dead ends: 109 [2018-10-10 15:17:20,181 INFO L226 Difference]: Without dead ends: 109 [2018-10-10 15:17:20,182 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=609, Invalid=951, Unknown=0, NotChecked=0, Total=1560 [2018-10-10 15:17:20,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-10-10 15:17:20,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2018-10-10 15:17:20,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-10-10 15:17:20,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-10-10 15:17:20,185 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 103 [2018-10-10 15:17:20,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:20,186 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-10-10 15:17:20,186 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-10 15:17:20,186 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-10-10 15:17:20,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-10 15:17:20,186 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:20,186 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:20,187 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:20,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:20,187 INFO L82 PathProgramCache]: Analyzing trace with hash -228750307, now seen corresponding path program 19 times [2018-10-10 15:17:20,188 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:20,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:20,833 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:20,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:20,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-10 15:17:20,834 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-10 15:17:20,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-10 15:17:20,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=272, Unknown=0, NotChecked=0, Total=506 [2018-10-10 15:17:20,835 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 23 states. [2018-10-10 15:17:21,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:21,279 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2018-10-10 15:17:21,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-10 15:17:21,279 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 106 [2018-10-10 15:17:21,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:21,281 INFO L225 Difference]: With dead ends: 112 [2018-10-10 15:17:21,281 INFO L226 Difference]: Without dead ends: 112 [2018-10-10 15:17:21,282 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=671, Invalid=1051, Unknown=0, NotChecked=0, Total=1722 [2018-10-10 15:17:21,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-10-10 15:17:21,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2018-10-10 15:17:21,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-10-10 15:17:21,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-10-10 15:17:21,285 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 106 [2018-10-10 15:17:21,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:21,285 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-10-10 15:17:21,285 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-10 15:17:21,285 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-10-10 15:17:21,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-10 15:17:21,286 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:21,286 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:21,287 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:21,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:21,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1112465601, now seen corresponding path program 20 times [2018-10-10 15:17:21,288 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:21,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:21,841 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:21,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:21,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-10 15:17:21,842 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-10 15:17:21,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-10 15:17:21,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=296, Unknown=0, NotChecked=0, Total=552 [2018-10-10 15:17:21,843 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 24 states. [2018-10-10 15:17:22,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:22,347 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-10-10 15:17:22,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-10 15:17:22,348 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 109 [2018-10-10 15:17:22,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:22,349 INFO L225 Difference]: With dead ends: 115 [2018-10-10 15:17:22,349 INFO L226 Difference]: Without dead ends: 115 [2018-10-10 15:17:22,350 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=736, Invalid=1156, Unknown=0, NotChecked=0, Total=1892 [2018-10-10 15:17:22,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-10-10 15:17:22,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2018-10-10 15:17:22,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-10-10 15:17:22,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-10-10 15:17:22,353 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 109 [2018-10-10 15:17:22,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:22,354 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-10-10 15:17:22,354 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-10 15:17:22,354 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-10-10 15:17:22,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-10 15:17:22,355 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:22,355 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:22,355 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:22,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:22,355 INFO L82 PathProgramCache]: Analyzing trace with hash 274735325, now seen corresponding path program 21 times [2018-10-10 15:17:22,356 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:22,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:22,987 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:22,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:22,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-10 15:17:22,988 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-10 15:17:22,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-10 15:17:22,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=321, Unknown=0, NotChecked=0, Total=600 [2018-10-10 15:17:22,989 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 25 states. [2018-10-10 15:17:23,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:23,463 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2018-10-10 15:17:23,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-10 15:17:23,470 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 112 [2018-10-10 15:17:23,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:23,471 INFO L225 Difference]: With dead ends: 118 [2018-10-10 15:17:23,471 INFO L226 Difference]: Without dead ends: 118 [2018-10-10 15:17:23,472 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=804, Invalid=1266, Unknown=0, NotChecked=0, Total=2070 [2018-10-10 15:17:23,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-10-10 15:17:23,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2018-10-10 15:17:23,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-10-10 15:17:23,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-10-10 15:17:23,476 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 112 [2018-10-10 15:17:23,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:23,476 INFO L481 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-10-10 15:17:23,476 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-10 15:17:23,476 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-10-10 15:17:23,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-10 15:17:23,477 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:23,477 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:23,478 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:23,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:23,478 INFO L82 PathProgramCache]: Analyzing trace with hash 202199679, now seen corresponding path program 22 times [2018-10-10 15:17:23,479 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:23,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:23,984 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:23,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:23,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-10 15:17:23,985 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-10 15:17:23,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-10 15:17:23,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=347, Unknown=0, NotChecked=0, Total=650 [2018-10-10 15:17:23,986 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 26 states. [2018-10-10 15:17:24,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:24,616 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-10-10 15:17:24,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-10 15:17:24,618 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 115 [2018-10-10 15:17:24,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:24,619 INFO L225 Difference]: With dead ends: 121 [2018-10-10 15:17:24,619 INFO L226 Difference]: Without dead ends: 121 [2018-10-10 15:17:24,621 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=875, Invalid=1381, Unknown=0, NotChecked=0, Total=2256 [2018-10-10 15:17:24,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-10-10 15:17:24,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2018-10-10 15:17:24,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-10-10 15:17:24,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-10-10 15:17:24,623 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 115 [2018-10-10 15:17:24,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:24,624 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-10-10 15:17:24,624 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-10 15:17:24,624 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-10-10 15:17:24,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-10 15:17:24,625 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:24,625 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:24,625 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:24,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:24,625 INFO L82 PathProgramCache]: Analyzing trace with hash -338680419, now seen corresponding path program 23 times [2018-10-10 15:17:24,626 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:24,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:25,154 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 0 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:25,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:25,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-10 15:17:25,155 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-10 15:17:25,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-10 15:17:25,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=374, Unknown=0, NotChecked=0, Total=702 [2018-10-10 15:17:25,156 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 27 states. [2018-10-10 15:17:25,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:25,718 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2018-10-10 15:17:25,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-10 15:17:25,719 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 118 [2018-10-10 15:17:25,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:25,720 INFO L225 Difference]: With dead ends: 124 [2018-10-10 15:17:25,720 INFO L226 Difference]: Without dead ends: 124 [2018-10-10 15:17:25,722 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=949, Invalid=1501, Unknown=0, NotChecked=0, Total=2450 [2018-10-10 15:17:25,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-10-10 15:17:25,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2018-10-10 15:17:25,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-10-10 15:17:25,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2018-10-10 15:17:25,724 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 118 [2018-10-10 15:17:25,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:25,724 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2018-10-10 15:17:25,725 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-10 15:17:25,725 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2018-10-10 15:17:25,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-10 15:17:25,725 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:25,725 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:25,725 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:25,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:25,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1019614655, now seen corresponding path program 24 times [2018-10-10 15:17:25,726 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:25,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:26,872 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 0 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:26,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:26,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-10 15:17:26,872 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-10 15:17:26,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-10 15:17:26,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=402, Unknown=0, NotChecked=0, Total=756 [2018-10-10 15:17:26,873 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 28 states. [2018-10-10 15:17:27,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:27,466 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-10-10 15:17:27,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-10 15:17:27,466 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 121 [2018-10-10 15:17:27,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:27,468 INFO L225 Difference]: With dead ends: 127 [2018-10-10 15:17:27,468 INFO L226 Difference]: Without dead ends: 127 [2018-10-10 15:17:27,469 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1026, Invalid=1626, Unknown=0, NotChecked=0, Total=2652 [2018-10-10 15:17:27,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-10-10 15:17:27,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2018-10-10 15:17:27,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-10-10 15:17:27,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-10-10 15:17:27,472 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 121 [2018-10-10 15:17:27,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:27,473 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-10-10 15:17:27,473 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-10 15:17:27,473 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-10-10 15:17:27,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-10 15:17:27,473 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:27,474 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:27,474 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:27,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:27,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1193698723, now seen corresponding path program 25 times [2018-10-10 15:17:27,475 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:27,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:28,264 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 0 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:28,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:28,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-10 15:17:28,265 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-10 15:17:28,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-10 15:17:28,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=381, Invalid=431, Unknown=0, NotChecked=0, Total=812 [2018-10-10 15:17:28,266 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 29 states. [2018-10-10 15:17:28,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:28,930 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2018-10-10 15:17:28,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-10 15:17:28,931 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 124 [2018-10-10 15:17:28,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:28,932 INFO L225 Difference]: With dead ends: 130 [2018-10-10 15:17:28,932 INFO L226 Difference]: Without dead ends: 130 [2018-10-10 15:17:28,933 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1106, Invalid=1756, Unknown=0, NotChecked=0, Total=2862 [2018-10-10 15:17:28,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-10-10 15:17:28,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 128. [2018-10-10 15:17:28,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-10-10 15:17:28,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2018-10-10 15:17:28,936 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 124 [2018-10-10 15:17:28,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:28,936 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2018-10-10 15:17:28,936 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-10 15:17:28,937 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2018-10-10 15:17:28,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-10 15:17:28,937 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:28,938 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:28,938 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:28,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:28,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1674614529, now seen corresponding path program 26 times [2018-10-10 15:17:28,939 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:28,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:29,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 0 proven. 1001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:29,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:29,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-10 15:17:29,545 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-10 15:17:29,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-10 15:17:29,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=409, Invalid=461, Unknown=0, NotChecked=0, Total=870 [2018-10-10 15:17:29,546 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 30 states. [2018-10-10 15:17:30,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:30,326 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-10-10 15:17:30,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-10 15:17:30,327 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 127 [2018-10-10 15:17:30,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:30,328 INFO L225 Difference]: With dead ends: 133 [2018-10-10 15:17:30,328 INFO L226 Difference]: Without dead ends: 133 [2018-10-10 15:17:30,329 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1189, Invalid=1891, Unknown=0, NotChecked=0, Total=3080 [2018-10-10 15:17:30,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-10-10 15:17:30,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2018-10-10 15:17:30,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-10-10 15:17:30,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-10-10 15:17:30,332 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 127 [2018-10-10 15:17:30,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:30,332 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-10-10 15:17:30,332 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-10 15:17:30,332 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-10-10 15:17:30,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-10 15:17:30,332 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:30,333 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:30,333 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:30,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:30,333 INFO L82 PathProgramCache]: Analyzing trace with hash -626491619, now seen corresponding path program 27 times [2018-10-10 15:17:30,334 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:30,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:31,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 0 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:31,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:31,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-10 15:17:31,229 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-10 15:17:31,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-10 15:17:31,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=438, Invalid=492, Unknown=0, NotChecked=0, Total=930 [2018-10-10 15:17:31,230 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 31 states. [2018-10-10 15:17:31,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:31,972 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2018-10-10 15:17:31,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-10 15:17:31,972 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 130 [2018-10-10 15:17:31,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:31,974 INFO L225 Difference]: With dead ends: 136 [2018-10-10 15:17:31,974 INFO L226 Difference]: Without dead ends: 136 [2018-10-10 15:17:31,975 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1275, Invalid=2031, Unknown=0, NotChecked=0, Total=3306 [2018-10-10 15:17:31,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-10-10 15:17:31,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2018-10-10 15:17:31,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-10-10 15:17:31,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2018-10-10 15:17:31,979 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 130 [2018-10-10 15:17:31,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:31,979 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2018-10-10 15:17:31,979 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-10 15:17:31,979 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2018-10-10 15:17:31,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-10-10 15:17:31,980 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:31,980 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:31,981 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:31,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:31,981 INFO L82 PathProgramCache]: Analyzing trace with hash -409121729, now seen corresponding path program 28 times [2018-10-10 15:17:31,982 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:31,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:32,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 0 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:32,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:32,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-10 15:17:32,550 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-10 15:17:32,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-10 15:17:32,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=468, Invalid=524, Unknown=0, NotChecked=0, Total=992 [2018-10-10 15:17:32,551 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 32 states. [2018-10-10 15:17:33,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:33,919 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-10-10 15:17:33,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-10 15:17:33,920 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 133 [2018-10-10 15:17:33,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:33,921 INFO L225 Difference]: With dead ends: 139 [2018-10-10 15:17:33,921 INFO L226 Difference]: Without dead ends: 139 [2018-10-10 15:17:33,922 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1364, Invalid=2176, Unknown=0, NotChecked=0, Total=3540 [2018-10-10 15:17:33,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-10-10 15:17:33,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2018-10-10 15:17:33,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-10-10 15:17:33,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-10-10 15:17:33,926 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 133 [2018-10-10 15:17:33,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:33,926 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-10-10 15:17:33,926 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-10 15:17:33,926 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-10-10 15:17:33,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-10 15:17:33,927 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:33,927 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:33,927 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:33,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:33,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1553411107, now seen corresponding path program 29 times [2018-10-10 15:17:33,928 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:33,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:34,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 0 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:34,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:34,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-10 15:17:34,604 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-10 15:17:34,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-10 15:17:34,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=499, Invalid=557, Unknown=0, NotChecked=0, Total=1056 [2018-10-10 15:17:34,605 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 33 states. [2018-10-10 15:17:35,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:35,538 INFO L93 Difference]: Finished difference Result 142 states and 142 transitions. [2018-10-10 15:17:35,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-10 15:17:35,539 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 136 [2018-10-10 15:17:35,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:35,539 INFO L225 Difference]: With dead ends: 142 [2018-10-10 15:17:35,540 INFO L226 Difference]: Without dead ends: 142 [2018-10-10 15:17:35,541 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1456, Invalid=2326, Unknown=0, NotChecked=0, Total=3782 [2018-10-10 15:17:35,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-10-10 15:17:35,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2018-10-10 15:17:35,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-10-10 15:17:35,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2018-10-10 15:17:35,544 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 136 [2018-10-10 15:17:35,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:35,544 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2018-10-10 15:17:35,544 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-10 15:17:35,544 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2018-10-10 15:17:35,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-10 15:17:35,545 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:35,545 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:35,545 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:35,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:35,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1922842753, now seen corresponding path program 30 times [2018-10-10 15:17:35,546 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:35,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:36,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:36,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:36,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-10 15:17:36,174 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-10 15:17:36,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-10 15:17:36,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=531, Invalid=591, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 15:17:36,175 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 34 states. [2018-10-10 15:17:36,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:36,954 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-10-10 15:17:36,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-10 15:17:36,955 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 139 [2018-10-10 15:17:36,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:36,956 INFO L225 Difference]: With dead ends: 145 [2018-10-10 15:17:36,956 INFO L226 Difference]: Without dead ends: 145 [2018-10-10 15:17:36,960 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1551, Invalid=2481, Unknown=0, NotChecked=0, Total=4032 [2018-10-10 15:17:36,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-10-10 15:17:36,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2018-10-10 15:17:36,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-10-10 15:17:36,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-10-10 15:17:36,963 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 139 [2018-10-10 15:17:36,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:36,963 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-10-10 15:17:36,963 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-10 15:17:36,964 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-10-10 15:17:36,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-10 15:17:36,964 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:36,965 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:36,965 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:36,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:36,965 INFO L82 PathProgramCache]: Analyzing trace with hash 340170909, now seen corresponding path program 31 times [2018-10-10 15:17:36,966 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:36,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:38,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:38,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:38,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-10 15:17:38,565 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-10 15:17:38,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-10 15:17:38,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=564, Invalid=626, Unknown=0, NotChecked=0, Total=1190 [2018-10-10 15:17:38,566 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 35 states. [2018-10-10 15:17:39,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:39,388 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2018-10-10 15:17:39,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-10 15:17:39,388 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 142 [2018-10-10 15:17:39,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:39,390 INFO L225 Difference]: With dead ends: 148 [2018-10-10 15:17:39,390 INFO L226 Difference]: Without dead ends: 148 [2018-10-10 15:17:39,392 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1649, Invalid=2641, Unknown=0, NotChecked=0, Total=4290 [2018-10-10 15:17:39,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-10-10 15:17:39,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 146. [2018-10-10 15:17:39,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-10-10 15:17:39,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2018-10-10 15:17:39,395 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 142 [2018-10-10 15:17:39,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:39,396 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2018-10-10 15:17:39,396 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-10 15:17:39,396 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2018-10-10 15:17:39,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-10 15:17:39,397 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:39,397 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:39,397 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:39,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:39,398 INFO L82 PathProgramCache]: Analyzing trace with hash -321469761, now seen corresponding path program 32 times [2018-10-10 15:17:39,398 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:39,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:40,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 0 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:40,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:40,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-10 15:17:40,033 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-10 15:17:40,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-10 15:17:40,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=598, Invalid=662, Unknown=0, NotChecked=0, Total=1260 [2018-10-10 15:17:40,034 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 36 states. [2018-10-10 15:17:41,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:41,640 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-10-10 15:17:41,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-10 15:17:41,641 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 145 [2018-10-10 15:17:41,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:41,642 INFO L225 Difference]: With dead ends: 151 [2018-10-10 15:17:41,643 INFO L226 Difference]: Without dead ends: 151 [2018-10-10 15:17:41,645 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1750, Invalid=2806, Unknown=0, NotChecked=0, Total=4556 [2018-10-10 15:17:41,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-10-10 15:17:41,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 149. [2018-10-10 15:17:41,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-10-10 15:17:41,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-10-10 15:17:41,647 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 145 [2018-10-10 15:17:41,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:41,648 INFO L481 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-10-10 15:17:41,648 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-10 15:17:41,648 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-10-10 15:17:41,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-10 15:17:41,649 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:41,649 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:41,649 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:41,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:41,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1653748387, now seen corresponding path program 33 times [2018-10-10 15:17:41,650 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:41,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:42,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 0 proven. 1617 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:42,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:42,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-10 15:17:42,774 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-10 15:17:42,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-10 15:17:42,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=633, Invalid=699, Unknown=0, NotChecked=0, Total=1332 [2018-10-10 15:17:42,775 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 37 states. [2018-10-10 15:17:44,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:44,053 INFO L93 Difference]: Finished difference Result 154 states and 154 transitions. [2018-10-10 15:17:44,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-10 15:17:44,054 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 148 [2018-10-10 15:17:44,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:44,055 INFO L225 Difference]: With dead ends: 154 [2018-10-10 15:17:44,055 INFO L226 Difference]: Without dead ends: 154 [2018-10-10 15:17:44,056 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1854, Invalid=2976, Unknown=0, NotChecked=0, Total=4830 [2018-10-10 15:17:44,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-10-10 15:17:44,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 152. [2018-10-10 15:17:44,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-10-10 15:17:44,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2018-10-10 15:17:44,059 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 148 [2018-10-10 15:17:44,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:44,059 INFO L481 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2018-10-10 15:17:44,059 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-10 15:17:44,059 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2018-10-10 15:17:44,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-10 15:17:44,060 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:44,060 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:44,060 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:44,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:44,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1773513217, now seen corresponding path program 34 times [2018-10-10 15:17:44,061 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:44,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:45,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 0 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:45,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:45,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-10 15:17:45,417 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-10 15:17:45,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-10 15:17:45,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=669, Invalid=737, Unknown=0, NotChecked=0, Total=1406 [2018-10-10 15:17:45,418 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 38 states. [2018-10-10 15:17:46,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:46,461 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2018-10-10 15:17:46,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-10 15:17:46,461 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 151 [2018-10-10 15:17:46,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:46,462 INFO L225 Difference]: With dead ends: 157 [2018-10-10 15:17:46,462 INFO L226 Difference]: Without dead ends: 157 [2018-10-10 15:17:46,463 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1961, Invalid=3151, Unknown=0, NotChecked=0, Total=5112 [2018-10-10 15:17:46,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-10-10 15:17:46,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 155. [2018-10-10 15:17:46,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-10-10 15:17:46,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-10-10 15:17:46,466 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 151 [2018-10-10 15:17:46,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:46,466 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-10-10 15:17:46,466 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-10 15:17:46,467 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-10-10 15:17:46,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-10 15:17:46,467 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:46,467 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:46,468 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:46,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:46,468 INFO L82 PathProgramCache]: Analyzing trace with hash -569740771, now seen corresponding path program 35 times [2018-10-10 15:17:46,469 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:46,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:47,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 0 proven. 1820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:47,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:47,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-10 15:17:47,244 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-10 15:17:47,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-10 15:17:47,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=706, Invalid=776, Unknown=0, NotChecked=0, Total=1482 [2018-10-10 15:17:47,244 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 39 states. [2018-10-10 15:17:48,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:48,561 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2018-10-10 15:17:48,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-10 15:17:48,562 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 154 [2018-10-10 15:17:48,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:48,563 INFO L225 Difference]: With dead ends: 160 [2018-10-10 15:17:48,563 INFO L226 Difference]: Without dead ends: 160 [2018-10-10 15:17:48,564 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2071, Invalid=3331, Unknown=0, NotChecked=0, Total=5402 [2018-10-10 15:17:48,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-10-10 15:17:48,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2018-10-10 15:17:48,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-10-10 15:17:48,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2018-10-10 15:17:48,567 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 154 [2018-10-10 15:17:48,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:48,567 INFO L481 AbstractCegarLoop]: Abstraction has 158 states and 158 transitions. [2018-10-10 15:17:48,567 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-10 15:17:48,568 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2018-10-10 15:17:48,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-10-10 15:17:48,568 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:48,568 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:48,569 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:48,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:48,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1961723585, now seen corresponding path program 36 times [2018-10-10 15:17:48,570 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:48,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:49,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 0 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:49,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:49,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-10 15:17:49,872 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-10 15:17:49,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-10 15:17:49,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=744, Invalid=816, Unknown=0, NotChecked=0, Total=1560 [2018-10-10 15:17:49,873 INFO L87 Difference]: Start difference. First operand 158 states and 158 transitions. Second operand 40 states. [2018-10-10 15:17:50,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:50,944 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-10-10 15:17:50,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-10 15:17:50,945 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 157 [2018-10-10 15:17:50,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:50,946 INFO L225 Difference]: With dead ends: 163 [2018-10-10 15:17:50,946 INFO L226 Difference]: Without dead ends: 163 [2018-10-10 15:17:50,947 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2184, Invalid=3516, Unknown=0, NotChecked=0, Total=5700 [2018-10-10 15:17:50,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-10-10 15:17:50,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 161. [2018-10-10 15:17:50,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-10-10 15:17:50,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-10-10 15:17:50,950 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 157 [2018-10-10 15:17:50,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:50,950 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-10-10 15:17:50,950 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-10 15:17:50,950 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-10-10 15:17:50,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-10 15:17:50,951 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:50,951 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:50,952 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:50,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:50,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1682474717, now seen corresponding path program 37 times [2018-10-10 15:17:50,953 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:50,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:52,233 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 0 proven. 2035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:52,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:52,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-10 15:17:52,234 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-10 15:17:52,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-10 15:17:52,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=857, Unknown=0, NotChecked=0, Total=1640 [2018-10-10 15:17:52,234 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 41 states. [2018-10-10 15:17:54,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:54,223 INFO L93 Difference]: Finished difference Result 166 states and 166 transitions. [2018-10-10 15:17:54,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-10 15:17:54,223 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 160 [2018-10-10 15:17:54,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:54,224 INFO L225 Difference]: With dead ends: 166 [2018-10-10 15:17:54,224 INFO L226 Difference]: Without dead ends: 166 [2018-10-10 15:17:54,225 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2300, Invalid=3706, Unknown=0, NotChecked=0, Total=6006 [2018-10-10 15:17:54,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-10-10 15:17:54,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2018-10-10 15:17:54,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-10-10 15:17:54,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2018-10-10 15:17:54,227 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 160 [2018-10-10 15:17:54,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:54,227 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2018-10-10 15:17:54,227 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-10 15:17:54,228 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2018-10-10 15:17:54,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-10 15:17:54,228 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:54,228 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:54,229 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:54,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:54,229 INFO L82 PathProgramCache]: Analyzing trace with hash 2105748607, now seen corresponding path program 38 times [2018-10-10 15:17:54,230 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:54,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:55,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 0 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:55,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:55,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-10 15:17:55,206 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-10 15:17:55,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-10 15:17:55,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=823, Invalid=899, Unknown=0, NotChecked=0, Total=1722 [2018-10-10 15:17:55,207 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand 42 states. [2018-10-10 15:17:56,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:56,421 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2018-10-10 15:17:56,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-10 15:17:56,421 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 163 [2018-10-10 15:17:56,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:56,422 INFO L225 Difference]: With dead ends: 169 [2018-10-10 15:17:56,422 INFO L226 Difference]: Without dead ends: 169 [2018-10-10 15:17:56,426 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2419, Invalid=3901, Unknown=0, NotChecked=0, Total=6320 [2018-10-10 15:17:56,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-10-10 15:17:56,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 167. [2018-10-10 15:17:56,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-10-10 15:17:56,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2018-10-10 15:17:56,429 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 163 [2018-10-10 15:17:56,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:56,430 INFO L481 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2018-10-10 15:17:56,430 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-10 15:17:56,430 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2018-10-10 15:17:56,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-10-10 15:17:56,431 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:56,431 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:56,431 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:56,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:56,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1834224541, now seen corresponding path program 39 times [2018-10-10 15:17:56,432 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:56,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:57,368 INFO L134 CoverageAnalysis]: Checked inductivity of 2262 backedges. 0 proven. 2262 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:57,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:57,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-10 15:17:57,369 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-10 15:17:57,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-10 15:17:57,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=864, Invalid=942, Unknown=0, NotChecked=0, Total=1806 [2018-10-10 15:17:57,370 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 43 states. [2018-10-10 15:17:58,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:58,827 INFO L93 Difference]: Finished difference Result 172 states and 172 transitions. [2018-10-10 15:17:58,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-10 15:17:58,833 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 166 [2018-10-10 15:17:58,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:58,834 INFO L225 Difference]: With dead ends: 172 [2018-10-10 15:17:58,834 INFO L226 Difference]: Without dead ends: 172 [2018-10-10 15:17:58,835 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2541, Invalid=4101, Unknown=0, NotChecked=0, Total=6642 [2018-10-10 15:17:58,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-10-10 15:17:58,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2018-10-10 15:17:58,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-10-10 15:17:58,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 170 transitions. [2018-10-10 15:17:58,838 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 170 transitions. Word has length 166 [2018-10-10 15:17:58,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:58,838 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 170 transitions. [2018-10-10 15:17:58,838 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-10 15:17:58,838 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 170 transitions. [2018-10-10 15:17:58,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-10 15:17:58,839 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:58,839 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:58,840 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:58,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:58,840 INFO L82 PathProgramCache]: Analyzing trace with hash 284192703, now seen corresponding path program 40 times [2018-10-10 15:17:58,841 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:58,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:59,903 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 2380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:59,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:59,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-10 15:17:59,904 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-10 15:17:59,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-10 15:17:59,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=906, Invalid=986, Unknown=0, NotChecked=0, Total=1892 [2018-10-10 15:17:59,905 INFO L87 Difference]: Start difference. First operand 170 states and 170 transitions. Second operand 44 states. [2018-10-10 15:18:01,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:01,404 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-10-10 15:18:01,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-10 15:18:01,405 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 169 [2018-10-10 15:18:01,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:01,406 INFO L225 Difference]: With dead ends: 175 [2018-10-10 15:18:01,406 INFO L226 Difference]: Without dead ends: 175 [2018-10-10 15:18:01,407 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2666, Invalid=4306, Unknown=0, NotChecked=0, Total=6972 [2018-10-10 15:18:01,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-10-10 15:18:01,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 173. [2018-10-10 15:18:01,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-10-10 15:18:01,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-10-10 15:18:01,414 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 169 [2018-10-10 15:18:01,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:01,414 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-10-10 15:18:01,414 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-10 15:18:01,414 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-10-10 15:18:01,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-10 15:18:01,415 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:01,415 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:18:01,415 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:01,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:01,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1520893859, now seen corresponding path program 41 times [2018-10-10 15:18:01,416 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:01,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:02,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 0 proven. 2501 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:18:02,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:02,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-10 15:18:02,349 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-10 15:18:02,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-10 15:18:02,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=949, Invalid=1031, Unknown=0, NotChecked=0, Total=1980 [2018-10-10 15:18:02,349 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 45 states. [2018-10-10 15:18:04,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:04,172 INFO L93 Difference]: Finished difference Result 178 states and 178 transitions. [2018-10-10 15:18:04,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-10 15:18:04,172 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 172 [2018-10-10 15:18:04,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:04,173 INFO L225 Difference]: With dead ends: 178 [2018-10-10 15:18:04,173 INFO L226 Difference]: Without dead ends: 178 [2018-10-10 15:18:04,174 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2794, Invalid=4516, Unknown=0, NotChecked=0, Total=7310 [2018-10-10 15:18:04,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-10-10 15:18:04,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 176. [2018-10-10 15:18:04,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-10-10 15:18:04,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2018-10-10 15:18:04,177 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 172 [2018-10-10 15:18:04,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:04,177 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2018-10-10 15:18:04,177 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-10 15:18:04,177 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2018-10-10 15:18:04,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-10 15:18:04,178 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:04,178 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:18:04,179 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:04,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:04,179 INFO L82 PathProgramCache]: Analyzing trace with hash 430850815, now seen corresponding path program 42 times [2018-10-10 15:18:04,180 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:04,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:05,171 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 0 proven. 2625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:18:05,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:05,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-10 15:18:05,172 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-10 15:18:05,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-10 15:18:05,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=993, Invalid=1077, Unknown=0, NotChecked=0, Total=2070 [2018-10-10 15:18:05,173 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 46 states. [2018-10-10 15:18:06,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:06,592 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2018-10-10 15:18:06,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-10 15:18:06,592 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 175 [2018-10-10 15:18:06,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:06,593 INFO L225 Difference]: With dead ends: 181 [2018-10-10 15:18:06,593 INFO L226 Difference]: Without dead ends: 181 [2018-10-10 15:18:06,594 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2925, Invalid=4731, Unknown=0, NotChecked=0, Total=7656 [2018-10-10 15:18:06,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-10-10 15:18:06,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 179. [2018-10-10 15:18:06,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-10-10 15:18:06,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2018-10-10 15:18:06,597 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 175 [2018-10-10 15:18:06,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:06,598 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2018-10-10 15:18:06,598 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-10 15:18:06,598 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2018-10-10 15:18:06,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-10 15:18:06,598 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:06,599 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:18:06,599 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:06,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:06,599 INFO L82 PathProgramCache]: Analyzing trace with hash -410819299, now seen corresponding path program 43 times [2018-10-10 15:18:06,600 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:06,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:07,666 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 0 proven. 2752 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:18:07,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:07,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-10 15:18:07,666 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-10 15:18:07,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-10 15:18:07,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1038, Invalid=1124, Unknown=0, NotChecked=0, Total=2162 [2018-10-10 15:18:07,667 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 47 states. [2018-10-10 15:18:09,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:09,440 INFO L93 Difference]: Finished difference Result 184 states and 184 transitions. [2018-10-10 15:18:09,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-10 15:18:09,440 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 178 [2018-10-10 15:18:09,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:09,441 INFO L225 Difference]: With dead ends: 184 [2018-10-10 15:18:09,441 INFO L226 Difference]: Without dead ends: 184 [2018-10-10 15:18:09,441 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3059, Invalid=4951, Unknown=0, NotChecked=0, Total=8010 [2018-10-10 15:18:09,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-10-10 15:18:09,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 182. [2018-10-10 15:18:09,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-10-10 15:18:09,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2018-10-10 15:18:09,443 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 178 [2018-10-10 15:18:09,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:09,444 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2018-10-10 15:18:09,444 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-10 15:18:09,444 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2018-10-10 15:18:09,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-10 15:18:09,445 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:09,445 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:18:09,445 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:09,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:09,445 INFO L82 PathProgramCache]: Analyzing trace with hash -586111425, now seen corresponding path program 44 times [2018-10-10 15:18:09,446 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:09,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:10,492 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 0 proven. 2882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:18:10,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:10,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-10 15:18:10,492 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-10 15:18:10,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-10 15:18:10,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1084, Invalid=1172, Unknown=0, NotChecked=0, Total=2256 [2018-10-10 15:18:10,493 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 48 states. [2018-10-10 15:18:12,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:12,084 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2018-10-10 15:18:12,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-10 15:18:12,084 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 181 [2018-10-10 15:18:12,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:12,085 INFO L225 Difference]: With dead ends: 187 [2018-10-10 15:18:12,085 INFO L226 Difference]: Without dead ends: 187 [2018-10-10 15:18:12,086 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3196, Invalid=5176, Unknown=0, NotChecked=0, Total=8372 [2018-10-10 15:18:12,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-10-10 15:18:12,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2018-10-10 15:18:12,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-10-10 15:18:12,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-10-10 15:18:12,088 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 181 [2018-10-10 15:18:12,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:12,088 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-10-10 15:18:12,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-10 15:18:12,088 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-10-10 15:18:12,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-10 15:18:12,089 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:12,089 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:18:12,090 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:12,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:12,090 INFO L82 PathProgramCache]: Analyzing trace with hash -33605155, now seen corresponding path program 45 times [2018-10-10 15:18:12,090 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:12,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:13,290 INFO L134 CoverageAnalysis]: Checked inductivity of 3015 backedges. 0 proven. 3015 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:18:13,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:13,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-10 15:18:13,291 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-10 15:18:13,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-10 15:18:13,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1131, Invalid=1221, Unknown=0, NotChecked=0, Total=2352 [2018-10-10 15:18:13,292 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 49 states. [2018-10-10 15:18:15,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:15,209 INFO L93 Difference]: Finished difference Result 190 states and 190 transitions. [2018-10-10 15:18:15,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-10 15:18:15,209 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 184 [2018-10-10 15:18:15,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:15,210 INFO L225 Difference]: With dead ends: 190 [2018-10-10 15:18:15,210 INFO L226 Difference]: Without dead ends: 190 [2018-10-10 15:18:15,211 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3336, Invalid=5406, Unknown=0, NotChecked=0, Total=8742 [2018-10-10 15:18:15,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-10-10 15:18:15,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 188. [2018-10-10 15:18:15,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-10-10 15:18:15,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 188 transitions. [2018-10-10 15:18:15,214 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 188 transitions. Word has length 184 [2018-10-10 15:18:15,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:15,214 INFO L481 AbstractCegarLoop]: Abstraction has 188 states and 188 transitions. [2018-10-10 15:18:15,214 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-10 15:18:15,215 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 188 transitions. [2018-10-10 15:18:15,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-10-10 15:18:15,215 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:15,216 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:18:15,216 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:15,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:15,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1366006143, now seen corresponding path program 46 times [2018-10-10 15:18:15,217 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:15,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:16,349 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:18:16,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:16,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-10 15:18:16,349 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-10 15:18:16,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-10 15:18:16,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1179, Invalid=1271, Unknown=0, NotChecked=0, Total=2450 [2018-10-10 15:18:16,350 INFO L87 Difference]: Start difference. First operand 188 states and 188 transitions. Second operand 50 states. [2018-10-10 15:18:18,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:18,104 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2018-10-10 15:18:18,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-10 15:18:18,104 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 187 [2018-10-10 15:18:18,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:18,105 INFO L225 Difference]: With dead ends: 193 [2018-10-10 15:18:18,105 INFO L226 Difference]: Without dead ends: 193 [2018-10-10 15:18:18,106 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3479, Invalid=5641, Unknown=0, NotChecked=0, Total=9120 [2018-10-10 15:18:18,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-10-10 15:18:18,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 191. [2018-10-10 15:18:18,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-10-10 15:18:18,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-10-10 15:18:18,108 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 187 [2018-10-10 15:18:18,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:18,109 INFO L481 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2018-10-10 15:18:18,109 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-10 15:18:18,109 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-10-10 15:18:18,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-10 15:18:18,110 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:18,110 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:18:18,110 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:18,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:18,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1643675293, now seen corresponding path program 47 times [2018-10-10 15:18:18,111 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:18,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:19,686 INFO L134 CoverageAnalysis]: Checked inductivity of 3290 backedges. 0 proven. 3290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:18:19,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:19,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-10 15:18:19,686 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-10 15:18:19,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-10 15:18:19,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1228, Invalid=1322, Unknown=0, NotChecked=0, Total=2550 [2018-10-10 15:18:19,687 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 51 states. [2018-10-10 15:18:21,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:21,442 INFO L93 Difference]: Finished difference Result 196 states and 196 transitions. [2018-10-10 15:18:21,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-10 15:18:21,443 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 190 [2018-10-10 15:18:21,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:21,443 INFO L225 Difference]: With dead ends: 196 [2018-10-10 15:18:21,444 INFO L226 Difference]: Without dead ends: 196 [2018-10-10 15:18:21,444 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3625, Invalid=5881, Unknown=0, NotChecked=0, Total=9506 [2018-10-10 15:18:21,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-10-10 15:18:21,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 194. [2018-10-10 15:18:21,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-10-10 15:18:21,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 194 transitions. [2018-10-10 15:18:21,448 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 194 transitions. Word has length 190 [2018-10-10 15:18:21,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:21,449 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 194 transitions. [2018-10-10 15:18:21,449 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-10 15:18:21,449 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 194 transitions. [2018-10-10 15:18:21,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-10 15:18:21,449 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:21,450 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:18:21,450 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:21,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:21,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1578310847, now seen corresponding path program 48 times [2018-10-10 15:18:21,451 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:21,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:22,737 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 0 proven. 3432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:18:22,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:22,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-10 15:18:22,738 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-10 15:18:22,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-10 15:18:22,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1278, Invalid=1374, Unknown=0, NotChecked=0, Total=2652 [2018-10-10 15:18:22,739 INFO L87 Difference]: Start difference. First operand 194 states and 194 transitions. Second operand 52 states. [2018-10-10 15:18:24,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:24,784 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2018-10-10 15:18:24,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-10 15:18:24,785 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 193 [2018-10-10 15:18:24,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:24,786 INFO L225 Difference]: With dead ends: 199 [2018-10-10 15:18:24,786 INFO L226 Difference]: Without dead ends: 199 [2018-10-10 15:18:24,787 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3774, Invalid=6126, Unknown=0, NotChecked=0, Total=9900 [2018-10-10 15:18:24,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-10-10 15:18:24,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 197. [2018-10-10 15:18:24,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-10-10 15:18:24,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2018-10-10 15:18:24,790 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 193 [2018-10-10 15:18:24,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:24,790 INFO L481 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2018-10-10 15:18:24,790 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-10 15:18:24,791 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2018-10-10 15:18:24,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-10-10 15:18:24,791 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:24,792 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:18:24,792 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:24,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:24,792 INFO L82 PathProgramCache]: Analyzing trace with hash -73714851, now seen corresponding path program 49 times [2018-10-10 15:18:24,793 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:24,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:26,104 INFO L134 CoverageAnalysis]: Checked inductivity of 3577 backedges. 0 proven. 3577 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:18:26,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:26,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-10 15:18:26,105 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-10 15:18:26,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-10 15:18:26,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1329, Invalid=1427, Unknown=0, NotChecked=0, Total=2756 [2018-10-10 15:18:26,105 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 53 states. [2018-10-10 15:18:28,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:28,013 INFO L93 Difference]: Finished difference Result 202 states and 202 transitions. [2018-10-10 15:18:28,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-10 15:18:28,014 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 196 [2018-10-10 15:18:28,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:28,014 INFO L225 Difference]: With dead ends: 202 [2018-10-10 15:18:28,014 INFO L226 Difference]: Without dead ends: 202 [2018-10-10 15:18:28,016 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3926, Invalid=6376, Unknown=0, NotChecked=0, Total=10302 [2018-10-10 15:18:28,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-10-10 15:18:28,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 200. [2018-10-10 15:18:28,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-10-10 15:18:28,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 200 transitions. [2018-10-10 15:18:28,019 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 200 transitions. Word has length 196 [2018-10-10 15:18:28,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:28,019 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 200 transitions. [2018-10-10 15:18:28,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-10 15:18:28,019 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 200 transitions. [2018-10-10 15:18:28,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-10 15:18:28,020 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:28,020 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:18:28,021 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:28,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:28,021 INFO L82 PathProgramCache]: Analyzing trace with hash 458960895, now seen corresponding path program 50 times [2018-10-10 15:18:28,021 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:28,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:29,972 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 0 proven. 3725 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:18:29,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:29,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-10 15:18:29,973 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-10 15:18:29,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-10 15:18:29,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1381, Invalid=1481, Unknown=0, NotChecked=0, Total=2862 [2018-10-10 15:18:29,974 INFO L87 Difference]: Start difference. First operand 200 states and 200 transitions. Second operand 54 states. [2018-10-10 15:18:31,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:31,959 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2018-10-10 15:18:31,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-10 15:18:31,959 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 199 [2018-10-10 15:18:31,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:31,960 INFO L225 Difference]: With dead ends: 205 [2018-10-10 15:18:31,960 INFO L226 Difference]: Without dead ends: 205 [2018-10-10 15:18:31,961 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4081, Invalid=6631, Unknown=0, NotChecked=0, Total=10712 [2018-10-10 15:18:31,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-10-10 15:18:31,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 203. [2018-10-10 15:18:31,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-10-10 15:18:31,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2018-10-10 15:18:31,963 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 199 [2018-10-10 15:18:31,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:31,963 INFO L481 AbstractCegarLoop]: Abstraction has 203 states and 203 transitions. [2018-10-10 15:18:31,963 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-10 15:18:31,964 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2018-10-10 15:18:31,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-10 15:18:31,965 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:31,965 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:18:31,965 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:31,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:31,965 INFO L82 PathProgramCache]: Analyzing trace with hash -502048739, now seen corresponding path program 51 times [2018-10-10 15:18:31,966 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:31,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:33,259 INFO L134 CoverageAnalysis]: Checked inductivity of 3876 backedges. 0 proven. 3876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:18:33,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:33,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-10 15:18:33,259 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-10 15:18:33,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-10 15:18:33,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1434, Invalid=1536, Unknown=0, NotChecked=0, Total=2970 [2018-10-10 15:18:33,260 INFO L87 Difference]: Start difference. First operand 203 states and 203 transitions. Second operand 55 states. [2018-10-10 15:18:35,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:35,408 INFO L93 Difference]: Finished difference Result 208 states and 208 transitions. [2018-10-10 15:18:35,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-10 15:18:35,409 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 202 [2018-10-10 15:18:35,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:35,410 INFO L225 Difference]: With dead ends: 208 [2018-10-10 15:18:35,411 INFO L226 Difference]: Without dead ends: 208 [2018-10-10 15:18:35,412 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1326 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4239, Invalid=6891, Unknown=0, NotChecked=0, Total=11130 [2018-10-10 15:18:35,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-10-10 15:18:35,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 206. [2018-10-10 15:18:35,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-10-10 15:18:35,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2018-10-10 15:18:35,415 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 202 [2018-10-10 15:18:35,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:35,416 INFO L481 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2018-10-10 15:18:35,416 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-10 15:18:35,416 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2018-10-10 15:18:35,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-10-10 15:18:35,417 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:35,417 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:18:35,417 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:35,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:35,418 INFO L82 PathProgramCache]: Analyzing trace with hash 311939903, now seen corresponding path program 52 times [2018-10-10 15:18:35,418 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:35,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:36,814 INFO L134 CoverageAnalysis]: Checked inductivity of 4030 backedges. 0 proven. 4030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:18:36,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:36,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-10-10 15:18:36,815 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-10 15:18:36,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-10 15:18:36,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1488, Invalid=1592, Unknown=0, NotChecked=0, Total=3080 [2018-10-10 15:18:36,815 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand 56 states. [2018-10-10 15:18:38,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:38,838 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2018-10-10 15:18:38,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-10 15:18:38,838 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 205 [2018-10-10 15:18:38,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:38,839 INFO L225 Difference]: With dead ends: 211 [2018-10-10 15:18:38,839 INFO L226 Difference]: Without dead ends: 211 [2018-10-10 15:18:38,840 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1378 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4400, Invalid=7156, Unknown=0, NotChecked=0, Total=11556 [2018-10-10 15:18:38,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-10-10 15:18:38,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2018-10-10 15:18:38,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-10-10 15:18:38,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2018-10-10 15:18:38,844 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 205 [2018-10-10 15:18:38,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:38,844 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2018-10-10 15:18:38,844 INFO L482 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-10 15:18:38,844 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2018-10-10 15:18:38,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-10-10 15:18:38,845 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:38,845 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:18:38,846 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:38,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:38,846 INFO L82 PathProgramCache]: Analyzing trace with hash 462220509, now seen corresponding path program 53 times [2018-10-10 15:18:38,847 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:38,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:40,566 INFO L134 CoverageAnalysis]: Checked inductivity of 4187 backedges. 0 proven. 4187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:18:40,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:40,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-10 15:18:40,567 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-10 15:18:40,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-10 15:18:40,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1543, Invalid=1649, Unknown=0, NotChecked=0, Total=3192 [2018-10-10 15:18:40,567 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 57 states. [2018-10-10 15:18:42,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:42,592 INFO L93 Difference]: Finished difference Result 214 states and 214 transitions. [2018-10-10 15:18:42,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-10 15:18:42,593 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 208 [2018-10-10 15:18:42,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:42,594 INFO L225 Difference]: With dead ends: 214 [2018-10-10 15:18:42,594 INFO L226 Difference]: Without dead ends: 214 [2018-10-10 15:18:42,595 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1431 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4564, Invalid=7426, Unknown=0, NotChecked=0, Total=11990 [2018-10-10 15:18:42,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-10-10 15:18:42,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 212. [2018-10-10 15:18:42,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-10-10 15:18:42,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 212 transitions. [2018-10-10 15:18:42,597 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 212 transitions. Word has length 208 [2018-10-10 15:18:42,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:42,597 INFO L481 AbstractCegarLoop]: Abstraction has 212 states and 212 transitions. [2018-10-10 15:18:42,597 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-10 15:18:42,597 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 212 transitions. [2018-10-10 15:18:42,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-10-10 15:18:42,598 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:42,598 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:18:42,598 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:42,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:42,599 INFO L82 PathProgramCache]: Analyzing trace with hash 2115831423, now seen corresponding path program 54 times [2018-10-10 15:18:42,599 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:42,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:44,206 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-10 15:18:44,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:44,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-10-10 15:18:44,206 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-10 15:18:44,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-10 15:18:44,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1599, Invalid=1707, Unknown=0, NotChecked=0, Total=3306 [2018-10-10 15:18:44,207 INFO L87 Difference]: Start difference. First operand 212 states and 212 transitions. Second operand 58 states. [2018-10-10 15:18:46,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:46,663 INFO L93 Difference]: Finished difference Result 217 states and 217 transitions. [2018-10-10 15:18:46,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-10 15:18:46,663 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 211 [2018-10-10 15:18:46,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:46,664 INFO L225 Difference]: With dead ends: 217 [2018-10-10 15:18:46,664 INFO L226 Difference]: Without dead ends: 217 [2018-10-10 15:18:46,665 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1485 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4731, Invalid=7701, Unknown=0, NotChecked=0, Total=12432 [2018-10-10 15:18:46,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-10-10 15:18:46,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 215. [2018-10-10 15:18:46,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-10-10 15:18:46,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 215 transitions. [2018-10-10 15:18:46,667 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 215 transitions. Word has length 211 [2018-10-10 15:18:46,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:46,667 INFO L481 AbstractCegarLoop]: Abstraction has 215 states and 215 transitions. [2018-10-10 15:18:46,668 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-10 15:18:46,668 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 215 transitions. [2018-10-10 15:18:46,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-10-10 15:18:46,668 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:46,668 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:18:46,669 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:46,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:46,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1563685277, now seen corresponding path program 55 times [2018-10-10 15:18:46,669 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:46,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:48,234 INFO L134 CoverageAnalysis]: Checked inductivity of 4510 backedges. 0 proven. 4510 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:18:48,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:48,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-10 15:18:48,234 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-10 15:18:48,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-10 15:18:48,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1656, Invalid=1766, Unknown=0, NotChecked=0, Total=3422 [2018-10-10 15:18:48,235 INFO L87 Difference]: Start difference. First operand 215 states and 215 transitions. Second operand 59 states. [2018-10-10 15:18:50,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:50,779 INFO L93 Difference]: Finished difference Result 220 states and 220 transitions. [2018-10-10 15:18:50,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-10 15:18:50,779 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 214 [2018-10-10 15:18:50,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:50,780 INFO L225 Difference]: With dead ends: 220 [2018-10-10 15:18:50,780 INFO L226 Difference]: Without dead ends: 220 [2018-10-10 15:18:50,781 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1540 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4901, Invalid=7981, Unknown=0, NotChecked=0, Total=12882 [2018-10-10 15:18:50,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-10-10 15:18:50,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 218. [2018-10-10 15:18:50,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-10-10 15:18:50,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 218 transitions. [2018-10-10 15:18:50,783 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 218 transitions. Word has length 214 [2018-10-10 15:18:50,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:50,784 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 218 transitions. [2018-10-10 15:18:50,784 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-10 15:18:50,784 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 218 transitions. [2018-10-10 15:18:50,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-10-10 15:18:50,785 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:50,785 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:18:50,785 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:50,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:50,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1992373825, now seen corresponding path program 56 times [2018-10-10 15:18:50,786 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:50,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:52,318 INFO L134 CoverageAnalysis]: Checked inductivity of 4676 backedges. 0 proven. 4676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:18:52,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:52,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-10-10 15:18:52,319 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-10 15:18:52,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-10 15:18:52,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1714, Invalid=1826, Unknown=0, NotChecked=0, Total=3540 [2018-10-10 15:18:52,320 INFO L87 Difference]: Start difference. First operand 218 states and 218 transitions. Second operand 60 states. [2018-10-10 15:18:54,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:54,526 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2018-10-10 15:18:54,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-10 15:18:54,527 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 217 [2018-10-10 15:18:54,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:54,528 INFO L225 Difference]: With dead ends: 223 [2018-10-10 15:18:54,528 INFO L226 Difference]: Without dead ends: 223 [2018-10-10 15:18:54,529 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1596 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=5074, Invalid=8266, Unknown=0, NotChecked=0, Total=13340 [2018-10-10 15:18:54,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-10-10 15:18:54,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 221. [2018-10-10 15:18:54,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-10-10 15:18:54,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2018-10-10 15:18:54,532 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 217 [2018-10-10 15:18:54,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:54,532 INFO L481 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2018-10-10 15:18:54,532 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-10 15:18:54,532 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2018-10-10 15:18:54,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-10-10 15:18:54,534 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:54,534 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:18:54,534 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:54,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:54,535 INFO L82 PathProgramCache]: Analyzing trace with hash -885758371, now seen corresponding path program 57 times [2018-10-10 15:18:54,535 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:54,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:56,359 INFO L134 CoverageAnalysis]: Checked inductivity of 4845 backedges. 0 proven. 4845 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:18:56,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:56,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-10 15:18:56,360 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-10 15:18:56,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-10 15:18:56,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1773, Invalid=1887, Unknown=0, NotChecked=0, Total=3660 [2018-10-10 15:18:56,361 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 61 states. [2018-10-10 15:18:58,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:58,612 INFO L93 Difference]: Finished difference Result 226 states and 226 transitions. [2018-10-10 15:18:58,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-10 15:18:58,613 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 220 [2018-10-10 15:18:58,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:58,614 INFO L225 Difference]: With dead ends: 226 [2018-10-10 15:18:58,614 INFO L226 Difference]: Without dead ends: 226 [2018-10-10 15:18:58,616 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1653 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5250, Invalid=8556, Unknown=0, NotChecked=0, Total=13806 [2018-10-10 15:18:58,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-10-10 15:18:58,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 224. [2018-10-10 15:18:58,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-10-10 15:18:58,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 224 transitions. [2018-10-10 15:18:58,618 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 224 transitions. Word has length 220 [2018-10-10 15:18:58,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:58,619 INFO L481 AbstractCegarLoop]: Abstraction has 224 states and 224 transitions. [2018-10-10 15:18:58,619 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-10 15:18:58,619 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 224 transitions. [2018-10-10 15:18:58,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-10-10 15:18:58,619 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:58,620 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:18:58,620 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:58,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:58,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1873732353, now seen corresponding path program 58 times [2018-10-10 15:18:58,621 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:58,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:00,805 INFO L134 CoverageAnalysis]: Checked inductivity of 5017 backedges. 0 proven. 5017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:19:00,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:00,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-10-10 15:19:00,806 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-10 15:19:00,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-10 15:19:00,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1833, Invalid=1949, Unknown=0, NotChecked=0, Total=3782 [2018-10-10 15:19:00,807 INFO L87 Difference]: Start difference. First operand 224 states and 224 transitions. Second operand 62 states. [2018-10-10 15:19:03,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:03,349 INFO L93 Difference]: Finished difference Result 229 states and 229 transitions. [2018-10-10 15:19:03,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-10 15:19:03,349 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 223 [2018-10-10 15:19:03,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:03,350 INFO L225 Difference]: With dead ends: 229 [2018-10-10 15:19:03,350 INFO L226 Difference]: Without dead ends: 229 [2018-10-10 15:19:03,351 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1711 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5429, Invalid=8851, Unknown=0, NotChecked=0, Total=14280 [2018-10-10 15:19:03,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-10-10 15:19:03,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 227. [2018-10-10 15:19:03,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-10-10 15:19:03,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2018-10-10 15:19:03,353 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 223 [2018-10-10 15:19:03,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:03,353 INFO L481 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2018-10-10 15:19:03,353 INFO L482 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-10 15:19:03,353 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2018-10-10 15:19:03,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-10-10 15:19:03,354 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:03,354 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:19:03,354 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:03,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:03,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1195750627, now seen corresponding path program 59 times [2018-10-10 15:19:03,355 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:03,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:05,004 INFO L134 CoverageAnalysis]: Checked inductivity of 5192 backedges. 0 proven. 5192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:19:05,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:05,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-10 15:19:05,005 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-10 15:19:05,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-10 15:19:05,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1894, Invalid=2012, Unknown=0, NotChecked=0, Total=3906 [2018-10-10 15:19:05,006 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 63 states. [2018-10-10 15:19:07,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:07,653 INFO L93 Difference]: Finished difference Result 232 states and 232 transitions. [2018-10-10 15:19:07,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-10 15:19:07,654 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 226 [2018-10-10 15:19:07,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:07,654 INFO L225 Difference]: With dead ends: 232 [2018-10-10 15:19:07,655 INFO L226 Difference]: Without dead ends: 232 [2018-10-10 15:19:07,655 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1770 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5611, Invalid=9151, Unknown=0, NotChecked=0, Total=14762 [2018-10-10 15:19:07,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-10-10 15:19:07,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 230. [2018-10-10 15:19:07,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-10-10 15:19:07,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 230 transitions. [2018-10-10 15:19:07,658 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 230 transitions. Word has length 226 [2018-10-10 15:19:07,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:07,658 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 230 transitions. [2018-10-10 15:19:07,658 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-10 15:19:07,658 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 230 transitions. [2018-10-10 15:19:07,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-10-10 15:19:07,659 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:07,659 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:19:07,660 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:07,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:07,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1621622847, now seen corresponding path program 60 times [2018-10-10 15:19:07,661 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:07,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:09,476 INFO L134 CoverageAnalysis]: Checked inductivity of 5370 backedges. 0 proven. 5370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:19:09,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:09,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-10-10 15:19:09,477 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-10 15:19:09,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-10 15:19:09,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1956, Invalid=2076, Unknown=0, NotChecked=0, Total=4032 [2018-10-10 15:19:09,478 INFO L87 Difference]: Start difference. First operand 230 states and 230 transitions. Second operand 64 states. [2018-10-10 15:19:12,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:12,513 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2018-10-10 15:19:12,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-10 15:19:12,513 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 229 [2018-10-10 15:19:12,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:12,514 INFO L225 Difference]: With dead ends: 235 [2018-10-10 15:19:12,514 INFO L226 Difference]: Without dead ends: 235 [2018-10-10 15:19:12,514 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1830 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5796, Invalid=9456, Unknown=0, NotChecked=0, Total=15252 [2018-10-10 15:19:12,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-10-10 15:19:12,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 233. [2018-10-10 15:19:12,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-10-10 15:19:12,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2018-10-10 15:19:12,517 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 229 [2018-10-10 15:19:12,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:12,518 INFO L481 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2018-10-10 15:19:12,518 INFO L482 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-10 15:19:12,518 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2018-10-10 15:19:12,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-10-10 15:19:12,520 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:12,520 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:19:12,520 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:12,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:12,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1743888349, now seen corresponding path program 61 times [2018-10-10 15:19:12,521 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:12,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:14,288 INFO L134 CoverageAnalysis]: Checked inductivity of 5551 backedges. 0 proven. 5551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:19:14,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:14,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-10 15:19:14,289 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-10 15:19:14,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-10 15:19:14,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2019, Invalid=2141, Unknown=0, NotChecked=0, Total=4160 [2018-10-10 15:19:14,290 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 65 states. [2018-10-10 15:19:17,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:17,246 INFO L93 Difference]: Finished difference Result 238 states and 238 transitions. [2018-10-10 15:19:17,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-10 15:19:17,246 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 232 [2018-10-10 15:19:17,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:17,247 INFO L225 Difference]: With dead ends: 238 [2018-10-10 15:19:17,247 INFO L226 Difference]: Without dead ends: 238 [2018-10-10 15:19:17,247 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1891 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5984, Invalid=9766, Unknown=0, NotChecked=0, Total=15750 [2018-10-10 15:19:17,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-10-10 15:19:17,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 236. [2018-10-10 15:19:17,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-10-10 15:19:17,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 236 transitions. [2018-10-10 15:19:17,250 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 236 transitions. Word has length 232 [2018-10-10 15:19:17,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:17,251 INFO L481 AbstractCegarLoop]: Abstraction has 236 states and 236 transitions. [2018-10-10 15:19:17,251 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-10 15:19:17,251 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 236 transitions. [2018-10-10 15:19:17,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-10-10 15:19:17,252 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:17,252 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:19:17,252 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:17,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:17,253 INFO L82 PathProgramCache]: Analyzing trace with hash 2023191423, now seen corresponding path program 62 times [2018-10-10 15:19:17,253 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:17,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:19,081 INFO L134 CoverageAnalysis]: Checked inductivity of 5735 backedges. 0 proven. 5735 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:19:19,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:19,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-10-10 15:19:19,082 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-10 15:19:19,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-10 15:19:19,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2083, Invalid=2207, Unknown=0, NotChecked=0, Total=4290 [2018-10-10 15:19:19,083 INFO L87 Difference]: Start difference. First operand 236 states and 236 transitions. Second operand 66 states. [2018-10-10 15:19:21,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:21,949 INFO L93 Difference]: Finished difference Result 241 states and 241 transitions. [2018-10-10 15:19:21,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-10 15:19:21,949 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 235 [2018-10-10 15:19:21,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:21,951 INFO L225 Difference]: With dead ends: 241 [2018-10-10 15:19:21,951 INFO L226 Difference]: Without dead ends: 241 [2018-10-10 15:19:21,951 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1953 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6175, Invalid=10081, Unknown=0, NotChecked=0, Total=16256 [2018-10-10 15:19:21,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-10-10 15:19:21,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 239. [2018-10-10 15:19:21,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-10-10 15:19:21,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 239 transitions. [2018-10-10 15:19:21,954 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 239 transitions. Word has length 235 [2018-10-10 15:19:21,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:21,954 INFO L481 AbstractCegarLoop]: Abstraction has 239 states and 239 transitions. [2018-10-10 15:19:21,955 INFO L482 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-10 15:19:21,955 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 239 transitions. [2018-10-10 15:19:21,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-10-10 15:19:21,956 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:21,956 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:19:21,956 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:21,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:21,957 INFO L82 PathProgramCache]: Analyzing trace with hash -905550691, now seen corresponding path program 63 times [2018-10-10 15:19:21,957 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:21,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:23,868 INFO L134 CoverageAnalysis]: Checked inductivity of 5922 backedges. 0 proven. 5922 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:19:23,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:23,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-10 15:19:23,869 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-10 15:19:23,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-10 15:19:23,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2148, Invalid=2274, Unknown=0, NotChecked=0, Total=4422 [2018-10-10 15:19:23,870 INFO L87 Difference]: Start difference. First operand 239 states and 239 transitions. Second operand 67 states. [2018-10-10 15:19:26,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:26,912 INFO L93 Difference]: Finished difference Result 244 states and 244 transitions. [2018-10-10 15:19:26,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-10 15:19:26,912 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 238 [2018-10-10 15:19:26,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:26,913 INFO L225 Difference]: With dead ends: 244 [2018-10-10 15:19:26,913 INFO L226 Difference]: Without dead ends: 244 [2018-10-10 15:19:26,914 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6369, Invalid=10401, Unknown=0, NotChecked=0, Total=16770 [2018-10-10 15:19:26,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-10-10 15:19:26,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 242. [2018-10-10 15:19:26,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-10-10 15:19:26,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 242 transitions. [2018-10-10 15:19:26,917 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 242 transitions. Word has length 238 [2018-10-10 15:19:26,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:26,917 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 242 transitions. [2018-10-10 15:19:26,917 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-10 15:19:26,917 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 242 transitions. [2018-10-10 15:19:26,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-10-10 15:19:26,918 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:26,918 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:19:26,919 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:26,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:26,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1198749375, now seen corresponding path program 64 times [2018-10-10 15:19:26,919 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:26,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:28,830 INFO L134 CoverageAnalysis]: Checked inductivity of 6112 backedges. 0 proven. 6112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:19:28,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:28,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-10-10 15:19:28,831 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-10 15:19:28,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-10 15:19:28,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2214, Invalid=2342, Unknown=0, NotChecked=0, Total=4556 [2018-10-10 15:19:28,832 INFO L87 Difference]: Start difference. First operand 242 states and 242 transitions. Second operand 68 states. [2018-10-10 15:19:31,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:31,997 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2018-10-10 15:19:31,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-10 15:19:31,998 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 241 [2018-10-10 15:19:31,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:31,999 INFO L225 Difference]: With dead ends: 247 [2018-10-10 15:19:31,999 INFO L226 Difference]: Without dead ends: 247 [2018-10-10 15:19:32,000 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2080 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6566, Invalid=10726, Unknown=0, NotChecked=0, Total=17292 [2018-10-10 15:19:32,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-10-10 15:19:32,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 245. [2018-10-10 15:19:32,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-10-10 15:19:32,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2018-10-10 15:19:32,002 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 241 [2018-10-10 15:19:32,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:32,003 INFO L481 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2018-10-10 15:19:32,003 INFO L482 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-10 15:19:32,003 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2018-10-10 15:19:32,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-10-10 15:19:32,004 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:32,005 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:19:32,005 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:32,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:32,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1059363165, now seen corresponding path program 65 times [2018-10-10 15:19:32,006 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:32,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:33,977 INFO L134 CoverageAnalysis]: Checked inductivity of 6305 backedges. 0 proven. 6305 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:19:33,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:33,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-10 15:19:33,978 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-10 15:19:33,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-10 15:19:33,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2281, Invalid=2411, Unknown=0, NotChecked=0, Total=4692 [2018-10-10 15:19:33,979 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 69 states. [2018-10-10 15:19:37,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:37,080 INFO L93 Difference]: Finished difference Result 250 states and 250 transitions. [2018-10-10 15:19:37,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-10 15:19:37,080 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 244 [2018-10-10 15:19:37,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:37,081 INFO L225 Difference]: With dead ends: 250 [2018-10-10 15:19:37,081 INFO L226 Difference]: Without dead ends: 250 [2018-10-10 15:19:37,082 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2145 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6766, Invalid=11056, Unknown=0, NotChecked=0, Total=17822 [2018-10-10 15:19:37,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-10-10 15:19:37,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2018-10-10 15:19:37,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-10-10 15:19:37,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 248 transitions. [2018-10-10 15:19:37,084 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 248 transitions. Word has length 244 [2018-10-10 15:19:37,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:37,085 INFO L481 AbstractCegarLoop]: Abstraction has 248 states and 248 transitions. [2018-10-10 15:19:37,085 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-10 15:19:37,085 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 248 transitions. [2018-10-10 15:19:37,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-10-10 15:19:37,086 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:37,086 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:19:37,087 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:37,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:37,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1838156287, now seen corresponding path program 66 times [2018-10-10 15:19:37,088 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:37,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:39,121 INFO L134 CoverageAnalysis]: Checked inductivity of 6501 backedges. 0 proven. 6501 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:19:39,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:39,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-10-10 15:19:39,122 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-10 15:19:39,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-10 15:19:39,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2349, Invalid=2481, Unknown=0, NotChecked=0, Total=4830 [2018-10-10 15:19:39,123 INFO L87 Difference]: Start difference. First operand 248 states and 248 transitions. Second operand 70 states. [2018-10-10 15:19:42,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:42,413 INFO L93 Difference]: Finished difference Result 253 states and 253 transitions. [2018-10-10 15:19:42,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-10 15:19:42,413 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 247 [2018-10-10 15:19:42,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:42,414 INFO L225 Difference]: With dead ends: 253 [2018-10-10 15:19:42,415 INFO L226 Difference]: Without dead ends: 253 [2018-10-10 15:19:42,415 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2211 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6969, Invalid=11391, Unknown=0, NotChecked=0, Total=18360 [2018-10-10 15:19:42,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-10-10 15:19:42,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 251. [2018-10-10 15:19:42,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-10-10 15:19:42,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2018-10-10 15:19:42,418 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 247 [2018-10-10 15:19:42,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:42,418 INFO L481 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2018-10-10 15:19:42,418 INFO L482 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-10 15:19:42,418 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2018-10-10 15:19:42,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-10-10 15:19:42,419 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:42,419 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:19:42,419 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:42,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:42,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1450720797, now seen corresponding path program 67 times [2018-10-10 15:19:42,420 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:42,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:44,469 INFO L134 CoverageAnalysis]: Checked inductivity of 6700 backedges. 0 proven. 6700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:19:44,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:44,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-10 15:19:44,470 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-10 15:19:44,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-10 15:19:44,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2418, Invalid=2552, Unknown=0, NotChecked=0, Total=4970 [2018-10-10 15:19:44,471 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 71 states. [2018-10-10 15:19:47,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:47,643 INFO L93 Difference]: Finished difference Result 256 states and 256 transitions. [2018-10-10 15:19:47,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-10 15:19:47,643 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 250 [2018-10-10 15:19:47,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:47,645 INFO L225 Difference]: With dead ends: 256 [2018-10-10 15:19:47,645 INFO L226 Difference]: Without dead ends: 256 [2018-10-10 15:19:47,646 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2278 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=7175, Invalid=11731, Unknown=0, NotChecked=0, Total=18906 [2018-10-10 15:19:47,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-10-10 15:19:47,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 254. [2018-10-10 15:19:47,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-10-10 15:19:47,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 254 transitions. [2018-10-10 15:19:47,649 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 254 transitions. Word has length 250 [2018-10-10 15:19:47,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:47,649 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 254 transitions. [2018-10-10 15:19:47,649 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-10 15:19:47,649 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 254 transitions. [2018-10-10 15:19:47,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-10-10 15:19:47,650 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:47,650 INFO L375 BasicCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:19:47,650 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:47,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:47,651 INFO L82 PathProgramCache]: Analyzing trace with hash -62837441, now seen corresponding path program 68 times [2018-10-10 15:19:47,651 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:47,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:49,959 INFO L134 CoverageAnalysis]: Checked inductivity of 6902 backedges. 0 proven. 6902 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:19:49,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:49,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-10-10 15:19:49,960 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-10 15:19:49,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-10 15:19:49,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2488, Invalid=2624, Unknown=0, NotChecked=0, Total=5112 [2018-10-10 15:19:49,961 INFO L87 Difference]: Start difference. First operand 254 states and 254 transitions. Second operand 72 states. [2018-10-10 15:19:53,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:53,433 INFO L93 Difference]: Finished difference Result 259 states and 259 transitions. [2018-10-10 15:19:53,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-10 15:19:53,433 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 253 [2018-10-10 15:19:53,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:53,434 INFO L225 Difference]: With dead ends: 259 [2018-10-10 15:19:53,434 INFO L226 Difference]: Without dead ends: 259 [2018-10-10 15:19:53,435 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2346 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7384, Invalid=12076, Unknown=0, NotChecked=0, Total=19460 [2018-10-10 15:19:53,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-10-10 15:19:53,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 257. [2018-10-10 15:19:53,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-10-10 15:19:53,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2018-10-10 15:19:53,438 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 253 [2018-10-10 15:19:53,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:53,438 INFO L481 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2018-10-10 15:19:53,438 INFO L482 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-10 15:19:53,438 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2018-10-10 15:19:53,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-10-10 15:19:53,439 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:53,439 INFO L375 BasicCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:19:53,439 INFO L424 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:53,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:53,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1909632291, now seen corresponding path program 69 times [2018-10-10 15:19:53,440 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:53,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:55,802 INFO L134 CoverageAnalysis]: Checked inductivity of 7107 backedges. 0 proven. 7107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:19:55,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:55,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-10 15:19:55,803 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-10 15:19:55,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-10 15:19:55,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2559, Invalid=2697, Unknown=0, NotChecked=0, Total=5256 [2018-10-10 15:19:55,804 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 73 states. [2018-10-10 15:19:59,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:59,263 INFO L93 Difference]: Finished difference Result 262 states and 262 transitions. [2018-10-10 15:19:59,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-10 15:19:59,264 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 256 [2018-10-10 15:19:59,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:59,265 INFO L225 Difference]: With dead ends: 262 [2018-10-10 15:19:59,265 INFO L226 Difference]: Without dead ends: 262 [2018-10-10 15:19:59,266 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2415 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7596, Invalid=12426, Unknown=0, NotChecked=0, Total=20022 [2018-10-10 15:19:59,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-10-10 15:19:59,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2018-10-10 15:19:59,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-10-10 15:19:59,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 260 transitions. [2018-10-10 15:19:59,269 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 260 transitions. Word has length 256 [2018-10-10 15:19:59,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:59,270 INFO L481 AbstractCegarLoop]: Abstraction has 260 states and 260 transitions. [2018-10-10 15:19:59,270 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-10 15:19:59,270 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 260 transitions. [2018-10-10 15:19:59,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-10-10 15:19:59,271 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:59,271 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:19:59,271 INFO L424 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:59,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:59,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1243946881, now seen corresponding path program 70 times [2018-10-10 15:19:59,272 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:59,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:20:01,840 INFO L134 CoverageAnalysis]: Checked inductivity of 7315 backedges. 0 proven. 7315 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:20:01,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:20:01,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-10-10 15:20:01,841 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-10-10 15:20:01,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-10-10 15:20:01,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2631, Invalid=2771, Unknown=0, NotChecked=0, Total=5402 [2018-10-10 15:20:01,841 INFO L87 Difference]: Start difference. First operand 260 states and 260 transitions. Second operand 74 states. [2018-10-10 15:20:05,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:20:05,032 INFO L93 Difference]: Finished difference Result 265 states and 265 transitions. [2018-10-10 15:20:05,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-10 15:20:05,032 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 259 [2018-10-10 15:20:05,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:20:05,033 INFO L225 Difference]: With dead ends: 265 [2018-10-10 15:20:05,033 INFO L226 Difference]: Without dead ends: 265 [2018-10-10 15:20:05,034 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2485 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7811, Invalid=12781, Unknown=0, NotChecked=0, Total=20592 [2018-10-10 15:20:05,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-10-10 15:20:05,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 263. [2018-10-10 15:20:05,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-10-10 15:20:05,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 263 transitions. [2018-10-10 15:20:05,037 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 263 transitions. Word has length 259 [2018-10-10 15:20:05,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:20:05,037 INFO L481 AbstractCegarLoop]: Abstraction has 263 states and 263 transitions. [2018-10-10 15:20:05,037 INFO L482 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-10-10 15:20:05,037 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 263 transitions. [2018-10-10 15:20:05,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-10-10 15:20:05,038 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:20:05,038 INFO L375 BasicCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:20:05,038 INFO L424 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:20:05,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:20:05,038 INFO L82 PathProgramCache]: Analyzing trace with hash 326096797, now seen corresponding path program 71 times [2018-10-10 15:20:05,039 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:20:05,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:20:07,661 INFO L134 CoverageAnalysis]: Checked inductivity of 7526 backedges. 0 proven. 7526 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:20:07,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:20:07,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-10 15:20:07,662 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-10 15:20:07,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-10 15:20:07,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2704, Invalid=2846, Unknown=0, NotChecked=0, Total=5550 [2018-10-10 15:20:07,663 INFO L87 Difference]: Start difference. First operand 263 states and 263 transitions. Second operand 75 states. [2018-10-10 15:20:11,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:20:11,317 INFO L93 Difference]: Finished difference Result 268 states and 268 transitions. [2018-10-10 15:20:11,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-10 15:20:11,317 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 262 [2018-10-10 15:20:11,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:20:11,318 INFO L225 Difference]: With dead ends: 268 [2018-10-10 15:20:11,318 INFO L226 Difference]: Without dead ends: 268 [2018-10-10 15:20:11,320 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2556 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=8029, Invalid=13141, Unknown=0, NotChecked=0, Total=21170 [2018-10-10 15:20:11,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-10-10 15:20:11,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 266. [2018-10-10 15:20:11,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-10-10 15:20:11,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 266 transitions. [2018-10-10 15:20:11,323 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 266 transitions. Word has length 262 [2018-10-10 15:20:11,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:20:11,323 INFO L481 AbstractCegarLoop]: Abstraction has 266 states and 266 transitions. [2018-10-10 15:20:11,323 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-10 15:20:11,323 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 266 transitions. [2018-10-10 15:20:11,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-10-10 15:20:11,324 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:20:11,324 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:20:11,324 INFO L424 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:20:11,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:20:11,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1303454655, now seen corresponding path program 72 times [2018-10-10 15:20:11,325 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:20:11,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:20:13,975 INFO L134 CoverageAnalysis]: Checked inductivity of 7740 backedges. 0 proven. 7740 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:20:13,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:20:13,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-10-10 15:20:13,976 INFO L460 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-10-10 15:20:13,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-10-10 15:20:13,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2778, Invalid=2922, Unknown=0, NotChecked=0, Total=5700 [2018-10-10 15:20:13,977 INFO L87 Difference]: Start difference. First operand 266 states and 266 transitions. Second operand 76 states. [2018-10-10 15:20:17,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:20:17,820 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions. [2018-10-10 15:20:17,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-10 15:20:17,820 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 265 [2018-10-10 15:20:17,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:20:17,821 INFO L225 Difference]: With dead ends: 271 [2018-10-10 15:20:17,821 INFO L226 Difference]: Without dead ends: 271 [2018-10-10 15:20:17,822 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2628 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=8250, Invalid=13506, Unknown=0, NotChecked=0, Total=21756 [2018-10-10 15:20:17,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-10-10 15:20:17,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 269. [2018-10-10 15:20:17,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-10-10 15:20:17,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 269 transitions. [2018-10-10 15:20:17,824 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 269 transitions. Word has length 265 [2018-10-10 15:20:17,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:20:17,825 INFO L481 AbstractCegarLoop]: Abstraction has 269 states and 269 transitions. [2018-10-10 15:20:17,825 INFO L482 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-10-10 15:20:17,825 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 269 transitions. [2018-10-10 15:20:17,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-10-10 15:20:17,825 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:20:17,826 INFO L375 BasicCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:20:17,826 INFO L424 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:20:17,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:20:17,826 INFO L82 PathProgramCache]: Analyzing trace with hash -2106864547, now seen corresponding path program 73 times [2018-10-10 15:20:17,827 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:20:17,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:20:20,255 INFO L134 CoverageAnalysis]: Checked inductivity of 7957 backedges. 0 proven. 7957 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:20:20,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:20:20,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-10 15:20:20,255 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-10 15:20:20,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-10 15:20:20,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2853, Invalid=2999, Unknown=0, NotChecked=0, Total=5852 [2018-10-10 15:20:20,256 INFO L87 Difference]: Start difference. First operand 269 states and 269 transitions. Second operand 77 states. [2018-10-10 15:20:24,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:20:24,246 INFO L93 Difference]: Finished difference Result 274 states and 274 transitions. [2018-10-10 15:20:24,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-10 15:20:24,247 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 268 [2018-10-10 15:20:24,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:20:24,248 INFO L225 Difference]: With dead ends: 274 [2018-10-10 15:20:24,248 INFO L226 Difference]: Without dead ends: 274 [2018-10-10 15:20:24,249 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2701 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8474, Invalid=13876, Unknown=0, NotChecked=0, Total=22350 [2018-10-10 15:20:24,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-10-10 15:20:24,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 272. [2018-10-10 15:20:24,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-10-10 15:20:24,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 272 transitions. [2018-10-10 15:20:24,251 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 272 transitions. Word has length 268 [2018-10-10 15:20:24,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:20:24,251 INFO L481 AbstractCegarLoop]: Abstraction has 272 states and 272 transitions. [2018-10-10 15:20:24,251 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-10 15:20:24,251 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 272 transitions. [2018-10-10 15:20:24,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-10-10 15:20:24,252 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:20:24,252 INFO L375 BasicCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:20:24,253 INFO L424 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:20:24,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:20:24,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1474824449, now seen corresponding path program 74 times [2018-10-10 15:20:24,253 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:20:24,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:20:26,761 INFO L134 CoverageAnalysis]: Checked inductivity of 8177 backedges. 0 proven. 8177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:20:26,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:20:26,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-10-10 15:20:26,762 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-10 15:20:26,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-10 15:20:26,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2929, Invalid=3077, Unknown=0, NotChecked=0, Total=6006 [2018-10-10 15:20:26,762 INFO L87 Difference]: Start difference. First operand 272 states and 272 transitions. Second operand 78 states. [2018-10-10 15:20:30,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:20:30,696 INFO L93 Difference]: Finished difference Result 277 states and 277 transitions. [2018-10-10 15:20:30,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-10 15:20:30,696 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 271 [2018-10-10 15:20:30,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:20:30,697 INFO L225 Difference]: With dead ends: 277 [2018-10-10 15:20:30,698 INFO L226 Difference]: Without dead ends: 277 [2018-10-10 15:20:30,698 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2775 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8701, Invalid=14251, Unknown=0, NotChecked=0, Total=22952 [2018-10-10 15:20:30,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-10-10 15:20:30,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 275. [2018-10-10 15:20:30,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-10-10 15:20:30,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 275 transitions. [2018-10-10 15:20:30,701 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 275 transitions. Word has length 271 [2018-10-10 15:20:30,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:20:30,701 INFO L481 AbstractCegarLoop]: Abstraction has 275 states and 275 transitions. [2018-10-10 15:20:30,701 INFO L482 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-10 15:20:30,701 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 275 transitions. [2018-10-10 15:20:30,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-10-10 15:20:30,702 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:20:30,702 INFO L375 BasicCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:20:30,702 INFO L424 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:20:30,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:20:30,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1504890595, now seen corresponding path program 75 times [2018-10-10 15:20:30,703 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:20:30,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:20:33,505 INFO L134 CoverageAnalysis]: Checked inductivity of 8400 backedges. 0 proven. 8400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:20:33,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:20:33,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-10 15:20:33,506 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-10 15:20:33,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-10 15:20:33,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3006, Invalid=3156, Unknown=0, NotChecked=0, Total=6162 [2018-10-10 15:20:33,507 INFO L87 Difference]: Start difference. First operand 275 states and 275 transitions. Second operand 79 states. [2018-10-10 15:20:37,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:20:37,530 INFO L93 Difference]: Finished difference Result 280 states and 280 transitions. [2018-10-10 15:20:37,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-10 15:20:37,530 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 274 [2018-10-10 15:20:37,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:20:37,531 INFO L225 Difference]: With dead ends: 280 [2018-10-10 15:20:37,531 INFO L226 Difference]: Without dead ends: 280 [2018-10-10 15:20:37,532 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2850 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=8931, Invalid=14631, Unknown=0, NotChecked=0, Total=23562 [2018-10-10 15:20:37,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-10-10 15:20:37,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 278. [2018-10-10 15:20:37,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-10-10 15:20:37,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 278 transitions. [2018-10-10 15:20:37,534 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 278 transitions. Word has length 274 [2018-10-10 15:20:37,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:20:37,534 INFO L481 AbstractCegarLoop]: Abstraction has 278 states and 278 transitions. [2018-10-10 15:20:37,534 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-10 15:20:37,534 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 278 transitions. [2018-10-10 15:20:37,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-10-10 15:20:37,535 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:20:37,535 INFO L375 BasicCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:20:37,536 INFO L424 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:20:37,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:20:37,536 INFO L82 PathProgramCache]: Analyzing trace with hash 442718783, now seen corresponding path program 76 times [2018-10-10 15:20:37,536 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:20:37,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:20:40,193 INFO L134 CoverageAnalysis]: Checked inductivity of 8626 backedges. 0 proven. 8626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:20:40,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:20:40,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-10-10 15:20:40,194 INFO L460 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-10-10 15:20:40,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-10-10 15:20:40,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3084, Invalid=3236, Unknown=0, NotChecked=0, Total=6320 [2018-10-10 15:20:40,195 INFO L87 Difference]: Start difference. First operand 278 states and 278 transitions. Second operand 80 states. [2018-10-10 15:20:44,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:20:44,351 INFO L93 Difference]: Finished difference Result 283 states and 283 transitions. [2018-10-10 15:20:44,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-10 15:20:44,352 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 277 [2018-10-10 15:20:44,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:20:44,353 INFO L225 Difference]: With dead ends: 283 [2018-10-10 15:20:44,353 INFO L226 Difference]: Without dead ends: 283 [2018-10-10 15:20:44,354 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2926 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=9164, Invalid=15016, Unknown=0, NotChecked=0, Total=24180 [2018-10-10 15:20:44,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-10-10 15:20:44,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 281. [2018-10-10 15:20:44,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-10-10 15:20:44,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2018-10-10 15:20:44,356 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 277 [2018-10-10 15:20:44,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:20:44,357 INFO L481 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2018-10-10 15:20:44,357 INFO L482 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-10-10 15:20:44,357 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2018-10-10 15:20:44,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-10-10 15:20:44,358 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:20:44,358 INFO L375 BasicCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:20:44,358 INFO L424 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:20:44,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:20:44,358 INFO L82 PathProgramCache]: Analyzing trace with hash 960497117, now seen corresponding path program 77 times [2018-10-10 15:20:44,359 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:20:44,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:20:47,032 INFO L134 CoverageAnalysis]: Checked inductivity of 8855 backedges. 0 proven. 8855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:20:47,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:20:47,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-10 15:20:47,033 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-10 15:20:47,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-10 15:20:47,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3163, Invalid=3317, Unknown=0, NotChecked=0, Total=6480 [2018-10-10 15:20:47,034 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 81 states. [2018-10-10 15:20:51,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:20:51,075 INFO L93 Difference]: Finished difference Result 286 states and 286 transitions. [2018-10-10 15:20:51,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-10 15:20:51,076 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 280 [2018-10-10 15:20:51,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:20:51,077 INFO L225 Difference]: With dead ends: 286 [2018-10-10 15:20:51,077 INFO L226 Difference]: Without dead ends: 286 [2018-10-10 15:20:51,078 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3003 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=9400, Invalid=15406, Unknown=0, NotChecked=0, Total=24806 [2018-10-10 15:20:51,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-10-10 15:20:51,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 284. [2018-10-10 15:20:51,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-10-10 15:20:51,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 284 transitions. [2018-10-10 15:20:51,080 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 284 transitions. Word has length 280 [2018-10-10 15:20:51,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:20:51,080 INFO L481 AbstractCegarLoop]: Abstraction has 284 states and 284 transitions. [2018-10-10 15:20:51,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-10 15:20:51,080 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 284 transitions. [2018-10-10 15:20:51,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-10-10 15:20:51,081 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:20:51,081 INFO L375 BasicCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:20:51,082 INFO L424 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:20:51,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:20:51,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1427681921, now seen corresponding path program 78 times [2018-10-10 15:20:51,082 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:20:51,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:20:54,231 INFO L134 CoverageAnalysis]: Checked inductivity of 9087 backedges. 0 proven. 9087 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:20:54,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:20:54,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-10-10 15:20:54,232 INFO L460 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-10-10 15:20:54,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-10-10 15:20:54,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3243, Invalid=3399, Unknown=0, NotChecked=0, Total=6642 [2018-10-10 15:20:54,233 INFO L87 Difference]: Start difference. First operand 284 states and 284 transitions. Second operand 82 states. [2018-10-10 15:20:58,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:20:58,486 INFO L93 Difference]: Finished difference Result 289 states and 289 transitions. [2018-10-10 15:20:58,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-10 15:20:58,487 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 283 [2018-10-10 15:20:58,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:20:58,488 INFO L225 Difference]: With dead ends: 289 [2018-10-10 15:20:58,488 INFO L226 Difference]: Without dead ends: 289 [2018-10-10 15:20:58,488 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3081 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=9639, Invalid=15801, Unknown=0, NotChecked=0, Total=25440 [2018-10-10 15:20:58,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-10-10 15:20:58,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 287. [2018-10-10 15:20:58,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-10-10 15:20:58,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 287 transitions. [2018-10-10 15:20:58,491 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 287 transitions. Word has length 283 [2018-10-10 15:20:58,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:20:58,491 INFO L481 AbstractCegarLoop]: Abstraction has 287 states and 287 transitions. [2018-10-10 15:20:58,491 INFO L482 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-10-10 15:20:58,491 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 287 transitions. [2018-10-10 15:20:58,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-10-10 15:20:58,492 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:20:58,492 INFO L375 BasicCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:20:58,492 INFO L424 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:20:58,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:20:58,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1536144739, now seen corresponding path program 79 times [2018-10-10 15:20:58,493 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:20:58,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:21:01,334 INFO L134 CoverageAnalysis]: Checked inductivity of 9322 backedges. 0 proven. 9322 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:21:01,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:21:01,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-10 15:21:01,335 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-10 15:21:01,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-10 15:21:01,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3324, Invalid=3482, Unknown=0, NotChecked=0, Total=6806 [2018-10-10 15:21:01,336 INFO L87 Difference]: Start difference. First operand 287 states and 287 transitions. Second operand 83 states. [2018-10-10 15:21:05,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:21:05,732 INFO L93 Difference]: Finished difference Result 292 states and 292 transitions. [2018-10-10 15:21:05,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-10-10 15:21:05,733 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 286 [2018-10-10 15:21:05,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:21:05,734 INFO L225 Difference]: With dead ends: 292 [2018-10-10 15:21:05,734 INFO L226 Difference]: Without dead ends: 292 [2018-10-10 15:21:05,735 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3160 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=9881, Invalid=16201, Unknown=0, NotChecked=0, Total=26082 [2018-10-10 15:21:05,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-10-10 15:21:05,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 290. [2018-10-10 15:21:05,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-10-10 15:21:05,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 290 transitions. [2018-10-10 15:21:05,737 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 290 transitions. Word has length 286 [2018-10-10 15:21:05,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:21:05,737 INFO L481 AbstractCegarLoop]: Abstraction has 290 states and 290 transitions. [2018-10-10 15:21:05,737 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-10 15:21:05,737 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 290 transitions. [2018-10-10 15:21:05,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-10-10 15:21:05,738 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:21:05,739 INFO L375 BasicCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:21:05,739 INFO L424 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:21:05,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:21:05,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1358418111, now seen corresponding path program 80 times [2018-10-10 15:21:05,739 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:21:05,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:21:09,007 INFO L134 CoverageAnalysis]: Checked inductivity of 9560 backedges. 0 proven. 9560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:21:09,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:21:09,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-10-10 15:21:09,008 INFO L460 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-10-10 15:21:09,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-10-10 15:21:09,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3406, Invalid=3566, Unknown=0, NotChecked=0, Total=6972 [2018-10-10 15:21:09,008 INFO L87 Difference]: Start difference. First operand 290 states and 290 transitions. Second operand 84 states. [2018-10-10 15:21:13,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:21:13,456 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2018-10-10 15:21:13,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-10 15:21:13,457 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 289 [2018-10-10 15:21:13,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:21:13,458 INFO L225 Difference]: With dead ends: 295 [2018-10-10 15:21:13,458 INFO L226 Difference]: Without dead ends: 295 [2018-10-10 15:21:13,459 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3240 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=10126, Invalid=16606, Unknown=0, NotChecked=0, Total=26732 [2018-10-10 15:21:13,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-10-10 15:21:13,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 293. [2018-10-10 15:21:13,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-10-10 15:21:13,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2018-10-10 15:21:13,463 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 289 [2018-10-10 15:21:13,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:21:13,463 INFO L481 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2018-10-10 15:21:13,463 INFO L482 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-10-10 15:21:13,463 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2018-10-10 15:21:13,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-10-10 15:21:13,464 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:21:13,465 INFO L375 BasicCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:21:13,465 INFO L424 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:21:13,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:21:13,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1073086627, now seen corresponding path program 81 times [2018-10-10 15:21:13,466 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:21:13,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:21:16,441 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 0 proven. 9801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:21:16,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:21:16,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-10 15:21:16,442 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-10 15:21:16,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-10 15:21:16,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3489, Invalid=3651, Unknown=0, NotChecked=0, Total=7140 [2018-10-10 15:21:16,442 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 85 states. [2018-10-10 15:21:21,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:21:21,004 INFO L93 Difference]: Finished difference Result 298 states and 298 transitions. [2018-10-10 15:21:21,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-10 15:21:21,004 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 292 [2018-10-10 15:21:21,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:21:21,005 INFO L225 Difference]: With dead ends: 298 [2018-10-10 15:21:21,005 INFO L226 Difference]: Without dead ends: 298 [2018-10-10 15:21:21,006 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3321 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=10374, Invalid=17016, Unknown=0, NotChecked=0, Total=27390 [2018-10-10 15:21:21,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-10-10 15:21:21,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 296. [2018-10-10 15:21:21,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-10-10 15:21:21,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 296 transitions. [2018-10-10 15:21:21,009 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 296 transitions. Word has length 292 [2018-10-10 15:21:21,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:21:21,009 INFO L481 AbstractCegarLoop]: Abstraction has 296 states and 296 transitions. [2018-10-10 15:21:21,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-10 15:21:21,009 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 296 transitions. [2018-10-10 15:21:21,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-10-10 15:21:21,010 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:21:21,010 INFO L375 BasicCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:21:21,010 INFO L424 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:21:21,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:21:21,010 INFO L82 PathProgramCache]: Analyzing trace with hash 887677951, now seen corresponding path program 82 times [2018-10-10 15:21:21,011 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:21:21,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:21:24,361 INFO L134 CoverageAnalysis]: Checked inductivity of 10045 backedges. 0 proven. 10045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:21:24,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:21:24,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-10-10 15:21:24,362 INFO L460 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-10-10 15:21:24,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-10-10 15:21:24,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3573, Invalid=3737, Unknown=0, NotChecked=0, Total=7310 [2018-10-10 15:21:24,362 INFO L87 Difference]: Start difference. First operand 296 states and 296 transitions. Second operand 86 states. [2018-10-10 15:21:29,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:21:29,123 INFO L93 Difference]: Finished difference Result 301 states and 301 transitions. [2018-10-10 15:21:29,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-10-10 15:21:29,124 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 295 [2018-10-10 15:21:29,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:21:29,125 INFO L225 Difference]: With dead ends: 301 [2018-10-10 15:21:29,125 INFO L226 Difference]: Without dead ends: 301 [2018-10-10 15:21:29,126 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3403 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=10625, Invalid=17431, Unknown=0, NotChecked=0, Total=28056 [2018-10-10 15:21:29,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-10-10 15:21:29,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 299. [2018-10-10 15:21:29,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-10-10 15:21:29,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 299 transitions. [2018-10-10 15:21:29,128 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 299 transitions. Word has length 295 [2018-10-10 15:21:29,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:21:29,128 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 299 transitions. [2018-10-10 15:21:29,128 INFO L482 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-10-10 15:21:29,128 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 299 transitions. [2018-10-10 15:21:29,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-10-10 15:21:29,129 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:21:29,130 INFO L375 BasicCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:21:29,130 INFO L424 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:21:29,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:21:29,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1824971747, now seen corresponding path program 83 times [2018-10-10 15:21:29,130 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:21:29,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:21:32,323 INFO L134 CoverageAnalysis]: Checked inductivity of 10292 backedges. 0 proven. 10292 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:21:32,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:21:32,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-10 15:21:32,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-10 15:21:32,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-10 15:21:32,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3658, Invalid=3824, Unknown=0, NotChecked=0, Total=7482 [2018-10-10 15:21:32,324 INFO L87 Difference]: Start difference. First operand 299 states and 299 transitions. Second operand 87 states. [2018-10-10 15:21:36,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:21:36,908 INFO L93 Difference]: Finished difference Result 304 states and 304 transitions. [2018-10-10 15:21:36,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-10 15:21:36,909 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 298 [2018-10-10 15:21:36,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:21:36,910 INFO L225 Difference]: With dead ends: 304 [2018-10-10 15:21:36,910 INFO L226 Difference]: Without dead ends: 304 [2018-10-10 15:21:36,911 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3486 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=10879, Invalid=17851, Unknown=0, NotChecked=0, Total=28730 [2018-10-10 15:21:36,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-10-10 15:21:36,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 302. [2018-10-10 15:21:36,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-10-10 15:21:36,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 302 transitions. [2018-10-10 15:21:36,915 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 302 transitions. Word has length 298 [2018-10-10 15:21:36,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:21:36,915 INFO L481 AbstractCegarLoop]: Abstraction has 302 states and 302 transitions. [2018-10-10 15:21:36,915 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-10 15:21:36,915 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 302 transitions. [2018-10-10 15:21:36,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-10-10 15:21:36,916 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:21:36,916 INFO L375 BasicCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:21:36,916 INFO L424 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:21:36,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:21:36,917 INFO L82 PathProgramCache]: Analyzing trace with hash -267483329, now seen corresponding path program 84 times [2018-10-10 15:21:36,917 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:21:36,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:21:40,233 INFO L134 CoverageAnalysis]: Checked inductivity of 10542 backedges. 0 proven. 10542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:21:40,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:21:40,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-10-10 15:21:40,234 INFO L460 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-10-10 15:21:40,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-10-10 15:21:40,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3744, Invalid=3912, Unknown=0, NotChecked=0, Total=7656 [2018-10-10 15:21:40,235 INFO L87 Difference]: Start difference. First operand 302 states and 302 transitions. Second operand 88 states. [2018-10-10 15:21:45,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:21:45,290 INFO L93 Difference]: Finished difference Result 307 states and 307 transitions. [2018-10-10 15:21:45,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-10 15:21:45,290 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 301 [2018-10-10 15:21:45,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:21:45,291 INFO L225 Difference]: With dead ends: 307 [2018-10-10 15:21:45,291 INFO L226 Difference]: Without dead ends: 307 [2018-10-10 15:21:45,292 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3570 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=11136, Invalid=18276, Unknown=0, NotChecked=0, Total=29412 [2018-10-10 15:21:45,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-10-10 15:21:45,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 305. [2018-10-10 15:21:45,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-10-10 15:21:45,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 305 transitions. [2018-10-10 15:21:45,295 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 305 transitions. Word has length 301 [2018-10-10 15:21:45,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:21:45,295 INFO L481 AbstractCegarLoop]: Abstraction has 305 states and 305 transitions. [2018-10-10 15:21:45,295 INFO L482 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-10-10 15:21:45,296 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 305 transitions. [2018-10-10 15:21:45,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-10-10 15:21:45,297 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:21:45,297 INFO L375 BasicCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:21:45,297 INFO L424 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:21:45,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:21:45,298 INFO L82 PathProgramCache]: Analyzing trace with hash 338278621, now seen corresponding path program 85 times [2018-10-10 15:21:45,298 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:21:45,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:21:48,535 INFO L134 CoverageAnalysis]: Checked inductivity of 10795 backedges. 0 proven. 10795 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:21:48,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:21:48,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-10 15:21:48,536 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-10 15:21:48,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-10 15:21:48,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3831, Invalid=4001, Unknown=0, NotChecked=0, Total=7832 [2018-10-10 15:21:48,537 INFO L87 Difference]: Start difference. First operand 305 states and 305 transitions. Second operand 89 states. [2018-10-10 15:21:53,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:21:53,541 INFO L93 Difference]: Finished difference Result 310 states and 310 transitions. [2018-10-10 15:21:53,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-10-10 15:21:53,541 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 304 [2018-10-10 15:21:53,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:21:53,542 INFO L225 Difference]: With dead ends: 310 [2018-10-10 15:21:53,542 INFO L226 Difference]: Without dead ends: 310 [2018-10-10 15:21:53,543 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3655 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=11396, Invalid=18706, Unknown=0, NotChecked=0, Total=30102 [2018-10-10 15:21:53,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-10-10 15:21:53,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 308. [2018-10-10 15:21:53,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-10-10 15:21:53,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 308 transitions. [2018-10-10 15:21:53,547 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 308 transitions. Word has length 304 [2018-10-10 15:21:53,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:21:53,547 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 308 transitions. [2018-10-10 15:21:53,547 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-10 15:21:53,547 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 308 transitions. [2018-10-10 15:21:53,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-10-10 15:21:53,548 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:21:53,549 INFO L375 BasicCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:21:53,549 INFO L424 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:21:53,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:21:53,549 INFO L82 PathProgramCache]: Analyzing trace with hash -860046721, now seen corresponding path program 86 times [2018-10-10 15:21:53,549 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:21:53,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:21:57,448 INFO L134 CoverageAnalysis]: Checked inductivity of 11051 backedges. 0 proven. 11051 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:21:57,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:21:57,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-10-10 15:21:57,450 INFO L460 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-10-10 15:21:57,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-10-10 15:21:57,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3919, Invalid=4091, Unknown=0, NotChecked=0, Total=8010 [2018-10-10 15:21:57,451 INFO L87 Difference]: Start difference. First operand 308 states and 308 transitions. Second operand 90 states. [2018-10-10 15:22:02,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:22:02,557 INFO L93 Difference]: Finished difference Result 313 states and 313 transitions. [2018-10-10 15:22:02,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-10 15:22:02,557 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 307 [2018-10-10 15:22:02,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:22:02,558 INFO L225 Difference]: With dead ends: 313 [2018-10-10 15:22:02,558 INFO L226 Difference]: Without dead ends: 313 [2018-10-10 15:22:02,559 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3741 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=11659, Invalid=19141, Unknown=0, NotChecked=0, Total=30800 [2018-10-10 15:22:02,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-10-10 15:22:02,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 311. [2018-10-10 15:22:02,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-10-10 15:22:02,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 311 transitions. [2018-10-10 15:22:02,562 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 311 transitions. Word has length 307 [2018-10-10 15:22:02,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:22:02,562 INFO L481 AbstractCegarLoop]: Abstraction has 311 states and 311 transitions. [2018-10-10 15:22:02,562 INFO L482 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-10-10 15:22:02,562 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 311 transitions. [2018-10-10 15:22:02,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-10-10 15:22:02,563 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:22:02,564 INFO L375 BasicCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:22:02,564 INFO L424 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:22:02,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:22:02,564 INFO L82 PathProgramCache]: Analyzing trace with hash -402145891, now seen corresponding path program 87 times [2018-10-10 15:22:02,565 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:22:02,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:22:06,225 INFO L134 CoverageAnalysis]: Checked inductivity of 11310 backedges. 0 proven. 11310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:22:06,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:22:06,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-10 15:22:06,226 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-10 15:22:06,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-10 15:22:06,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4008, Invalid=4182, Unknown=0, NotChecked=0, Total=8190 [2018-10-10 15:22:06,227 INFO L87 Difference]: Start difference. First operand 311 states and 311 transitions. Second operand 91 states. [2018-10-10 15:22:11,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:22:11,344 INFO L93 Difference]: Finished difference Result 316 states and 316 transitions. [2018-10-10 15:22:11,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-10-10 15:22:11,344 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 310 [2018-10-10 15:22:11,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:22:11,345 INFO L225 Difference]: With dead ends: 316 [2018-10-10 15:22:11,345 INFO L226 Difference]: Without dead ends: 316 [2018-10-10 15:22:11,346 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3828 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=11925, Invalid=19581, Unknown=0, NotChecked=0, Total=31506 [2018-10-10 15:22:11,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-10-10 15:22:11,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 314. [2018-10-10 15:22:11,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-10-10 15:22:11,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 314 transitions. [2018-10-10 15:22:11,348 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 314 transitions. Word has length 310 [2018-10-10 15:22:11,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:22:11,349 INFO L481 AbstractCegarLoop]: Abstraction has 314 states and 314 transitions. [2018-10-10 15:22:11,349 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-10 15:22:11,349 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 314 transitions. [2018-10-10 15:22:11,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-10-10 15:22:11,350 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:22:11,350 INFO L375 BasicCegarLoop]: trace histogram [88, 88, 88, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:22:11,350 INFO L424 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:22:11,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:22:11,350 INFO L82 PathProgramCache]: Analyzing trace with hash 105348543, now seen corresponding path program 88 times [2018-10-10 15:22:11,351 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:22:11,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:22:15,264 INFO L134 CoverageAnalysis]: Checked inductivity of 11572 backedges. 0 proven. 11572 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:22:15,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:22:15,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-10-10 15:22:15,265 INFO L460 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-10-10 15:22:15,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-10-10 15:22:15,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4098, Invalid=4274, Unknown=0, NotChecked=0, Total=8372 [2018-10-10 15:22:15,265 INFO L87 Difference]: Start difference. First operand 314 states and 314 transitions. Second operand 92 states. [2018-10-10 15:22:20,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:22:20,501 INFO L93 Difference]: Finished difference Result 319 states and 319 transitions. [2018-10-10 15:22:20,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-10-10 15:22:20,502 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 313 [2018-10-10 15:22:20,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:22:20,503 INFO L225 Difference]: With dead ends: 319 [2018-10-10 15:22:20,503 INFO L226 Difference]: Without dead ends: 319 [2018-10-10 15:22:20,504 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3916 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=12194, Invalid=20026, Unknown=0, NotChecked=0, Total=32220 [2018-10-10 15:22:20,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-10-10 15:22:20,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 317. [2018-10-10 15:22:20,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-10-10 15:22:20,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 317 transitions. [2018-10-10 15:22:20,507 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 317 transitions. Word has length 313 [2018-10-10 15:22:20,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:22:20,507 INFO L481 AbstractCegarLoop]: Abstraction has 317 states and 317 transitions. [2018-10-10 15:22:20,507 INFO L482 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-10-10 15:22:20,507 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 317 transitions. [2018-10-10 15:22:20,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2018-10-10 15:22:20,508 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:22:20,509 INFO L375 BasicCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:22:20,509 INFO L424 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:22:20,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:22:20,509 INFO L82 PathProgramCache]: Analyzing trace with hash 587149917, now seen corresponding path program 89 times [2018-10-10 15:22:20,509 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:22:20,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:22:24,095 INFO L134 CoverageAnalysis]: Checked inductivity of 11837 backedges. 0 proven. 11837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:22:24,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:22:24,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-10 15:22:24,096 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-10 15:22:24,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-10 15:22:24,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4189, Invalid=4367, Unknown=0, NotChecked=0, Total=8556 [2018-10-10 15:22:24,096 INFO L87 Difference]: Start difference. First operand 317 states and 317 transitions. Second operand 93 states. [2018-10-10 15:22:29,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:22:29,288 INFO L93 Difference]: Finished difference Result 322 states and 322 transitions. [2018-10-10 15:22:29,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-10 15:22:29,288 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 316 [2018-10-10 15:22:29,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:22:29,289 INFO L225 Difference]: With dead ends: 322 [2018-10-10 15:22:29,289 INFO L226 Difference]: Without dead ends: 322 [2018-10-10 15:22:29,291 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4005 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=12466, Invalid=20476, Unknown=0, NotChecked=0, Total=32942 [2018-10-10 15:22:29,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-10-10 15:22:29,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 320. [2018-10-10 15:22:29,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-10-10 15:22:29,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 320 transitions. [2018-10-10 15:22:29,294 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 320 transitions. Word has length 316 [2018-10-10 15:22:29,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:22:29,294 INFO L481 AbstractCegarLoop]: Abstraction has 320 states and 320 transitions. [2018-10-10 15:22:29,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-10 15:22:29,294 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 320 transitions. [2018-10-10 15:22:29,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2018-10-10 15:22:29,295 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:22:29,296 INFO L375 BasicCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:22:29,296 INFO L424 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:22:29,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:22:29,296 INFO L82 PathProgramCache]: Analyzing trace with hash 151179519, now seen corresponding path program 90 times [2018-10-10 15:22:29,296 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:22:29,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:22:33,211 INFO L134 CoverageAnalysis]: Checked inductivity of 12105 backedges. 0 proven. 12105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:22:33,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:22:33,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-10-10 15:22:33,212 INFO L460 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-10-10 15:22:33,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-10-10 15:22:33,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4281, Invalid=4461, Unknown=0, NotChecked=0, Total=8742 [2018-10-10 15:22:33,213 INFO L87 Difference]: Start difference. First operand 320 states and 320 transitions. Second operand 94 states. [2018-10-10 15:22:38,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:22:38,768 INFO L93 Difference]: Finished difference Result 325 states and 325 transitions. [2018-10-10 15:22:38,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-10-10 15:22:38,768 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 319 [2018-10-10 15:22:38,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:22:38,769 INFO L225 Difference]: With dead ends: 325 [2018-10-10 15:22:38,769 INFO L226 Difference]: Without dead ends: 325 [2018-10-10 15:22:38,770 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4095 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=12741, Invalid=20931, Unknown=0, NotChecked=0, Total=33672 [2018-10-10 15:22:38,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-10-10 15:22:38,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 323. [2018-10-10 15:22:38,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-10-10 15:22:38,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 323 transitions. [2018-10-10 15:22:38,773 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 323 transitions. Word has length 319 [2018-10-10 15:22:38,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:22:38,774 INFO L481 AbstractCegarLoop]: Abstraction has 323 states and 323 transitions. [2018-10-10 15:22:38,774 INFO L482 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-10-10 15:22:38,774 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 323 transitions. [2018-10-10 15:22:38,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-10-10 15:22:38,775 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:22:38,775 INFO L375 BasicCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:22:38,776 INFO L424 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:22:38,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:22:38,776 INFO L82 PathProgramCache]: Analyzing trace with hash 138155805, now seen corresponding path program 91 times [2018-10-10 15:22:38,776 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:22:38,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:22:42,754 INFO L134 CoverageAnalysis]: Checked inductivity of 12376 backedges. 0 proven. 12376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:22:42,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:22:42,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-10-10 15:22:42,755 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-10 15:22:42,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-10 15:22:42,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4374, Invalid=4556, Unknown=0, NotChecked=0, Total=8930 [2018-10-10 15:22:42,756 INFO L87 Difference]: Start difference. First operand 323 states and 323 transitions. Second operand 95 states. [2018-10-10 15:22:48,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:22:48,371 INFO L93 Difference]: Finished difference Result 328 states and 328 transitions. [2018-10-10 15:22:48,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-10-10 15:22:48,371 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 322 [2018-10-10 15:22:48,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:22:48,372 INFO L225 Difference]: With dead ends: 328 [2018-10-10 15:22:48,372 INFO L226 Difference]: Without dead ends: 328 [2018-10-10 15:22:48,373 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4186 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=13019, Invalid=21391, Unknown=0, NotChecked=0, Total=34410 [2018-10-10 15:22:48,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-10-10 15:22:48,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 326. [2018-10-10 15:22:48,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-10-10 15:22:48,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 326 transitions. [2018-10-10 15:22:48,376 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 326 transitions. Word has length 322 [2018-10-10 15:22:48,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:22:48,376 INFO L481 AbstractCegarLoop]: Abstraction has 326 states and 326 transitions. [2018-10-10 15:22:48,376 INFO L482 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-10 15:22:48,376 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 326 transitions. [2018-10-10 15:22:48,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2018-10-10 15:22:48,377 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:22:48,377 INFO L375 BasicCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:22:48,378 INFO L424 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:22:48,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:22:48,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1304251329, now seen corresponding path program 92 times [2018-10-10 15:22:48,378 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:22:48,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:22:52,567 INFO L134 CoverageAnalysis]: Checked inductivity of 12650 backedges. 0 proven. 12650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:22:52,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:22:52,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-10-10 15:22:52,568 INFO L460 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-10-10 15:22:52,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-10-10 15:22:52,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4468, Invalid=4652, Unknown=0, NotChecked=0, Total=9120 [2018-10-10 15:22:52,569 INFO L87 Difference]: Start difference. First operand 326 states and 326 transitions. Second operand 96 states. [2018-10-10 15:22:58,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:22:58,020 INFO L93 Difference]: Finished difference Result 331 states and 331 transitions. [2018-10-10 15:22:58,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-10 15:22:58,021 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 325 [2018-10-10 15:22:58,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:22:58,022 INFO L225 Difference]: With dead ends: 331 [2018-10-10 15:22:58,022 INFO L226 Difference]: Without dead ends: 331 [2018-10-10 15:22:58,023 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4278 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=13300, Invalid=21856, Unknown=0, NotChecked=0, Total=35156 [2018-10-10 15:22:58,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-10-10 15:22:58,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 329. [2018-10-10 15:22:58,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-10-10 15:22:58,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 329 transitions. [2018-10-10 15:22:58,026 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 329 transitions. Word has length 325 [2018-10-10 15:22:58,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:22:58,026 INFO L481 AbstractCegarLoop]: Abstraction has 329 states and 329 transitions. [2018-10-10 15:22:58,026 INFO L482 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-10-10 15:22:58,026 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 329 transitions. [2018-10-10 15:22:58,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-10-10 15:22:58,027 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:22:58,028 INFO L375 BasicCegarLoop]: trace histogram [93, 93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:22:58,028 INFO L424 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:22:58,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:22:58,028 INFO L82 PathProgramCache]: Analyzing trace with hash -907383843, now seen corresponding path program 93 times [2018-10-10 15:22:58,029 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:22:58,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:23:02,195 INFO L134 CoverageAnalysis]: Checked inductivity of 12927 backedges. 0 proven. 12927 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:23:02,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:23:02,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-10-10 15:23:02,196 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-10 15:23:02,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-10 15:23:02,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4563, Invalid=4749, Unknown=0, NotChecked=0, Total=9312 [2018-10-10 15:23:02,198 INFO L87 Difference]: Start difference. First operand 329 states and 329 transitions. Second operand 97 states. [2018-10-10 15:23:07,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:23:07,854 INFO L93 Difference]: Finished difference Result 332 states and 332 transitions. [2018-10-10 15:23:07,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-10-10 15:23:07,855 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 328 [2018-10-10 15:23:07,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:23:07,856 INFO L225 Difference]: With dead ends: 332 [2018-10-10 15:23:07,856 INFO L226 Difference]: Without dead ends: 332 [2018-10-10 15:23:07,857 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4371 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=13584, Invalid=22326, Unknown=0, NotChecked=0, Total=35910 [2018-10-10 15:23:07,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-10-10 15:23:07,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2018-10-10 15:23:07,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-10-10 15:23:07,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 332 transitions. [2018-10-10 15:23:07,859 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 332 transitions. Word has length 328 [2018-10-10 15:23:07,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:23:07,860 INFO L481 AbstractCegarLoop]: Abstraction has 332 states and 332 transitions. [2018-10-10 15:23:07,860 INFO L482 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-10 15:23:07,860 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 332 transitions. [2018-10-10 15:23:07,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2018-10-10 15:23:07,861 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:23:07,861 INFO L375 BasicCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:23:07,861 INFO L424 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:23:07,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:23:07,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1873074305, now seen corresponding path program 94 times [2018-10-10 15:23:07,862 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:23:07,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:23:08,416 INFO L134 CoverageAnalysis]: Checked inductivity of 13207 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13207 trivial. 0 not checked. [2018-10-10 15:23:08,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 15:23:08,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 15:23:08,418 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 15:23:08,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 15:23:08,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-10 15:23:08,418 INFO L87 Difference]: Start difference. First operand 332 states and 332 transitions. Second operand 8 states. [2018-10-10 15:23:09,238 WARN L178 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-10-10 15:23:09,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:23:09,254 INFO L93 Difference]: Finished difference Result 330 states and 330 transitions. [2018-10-10 15:23:09,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 15:23:09,255 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 331 [2018-10-10 15:23:09,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:23:09,255 INFO L225 Difference]: With dead ends: 330 [2018-10-10 15:23:09,255 INFO L226 Difference]: Without dead ends: 0 [2018-10-10 15:23:09,256 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-10-10 15:23:09,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-10 15:23:09,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-10 15:23:09,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-10 15:23:09,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-10 15:23:09,257 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 331 [2018-10-10 15:23:09,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:23:09,257 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-10 15:23:09,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 15:23:09,257 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-10 15:23:09,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-10 15:23:09,262 INFO L202 PluginConnector]: Adding new model 20051113-1.c_false-valid-memtrack.i_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 03:23:09 BoogieIcfgContainer [2018-10-10 15:23:09,263 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-10 15:23:09,264 INFO L168 Benchmark]: Toolchain (without parser) took 363775.69 ms. Allocated memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: -142.1 MB). Free memory was 1.5 GB in the beginning and 862.8 MB in the end (delta: 610.7 MB). Peak memory consumption was 468.6 MB. Max. memory is 7.1 GB. [2018-10-10 15:23:09,267 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 15:23:09,268 INFO L168 Benchmark]: Boogie Preprocessor took 68.67 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 15:23:09,268 INFO L168 Benchmark]: RCFGBuilder took 625.79 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-10 15:23:09,269 INFO L168 Benchmark]: TraceAbstraction took 363077.16 ms. Allocated memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: -142.1 MB). Free memory was 1.5 GB in the beginning and 862.8 MB in the end (delta: 589.6 MB). Peak memory consumption was 447.5 MB. Max. memory is 7.1 GB. [2018-10-10 15:23:09,275 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 68.67 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 625.79 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 363077.16 ms. Allocated memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: -142.1 MB). Free memory was 1.5 GB in the beginning and 862.8 MB in the end (delta: 589.6 MB). Peak memory consumption was 447.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 102]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 54 locations, 1 error locations. SAFE Result, 363.0s OverallTime, 95 OverallIterations, 94 TraceHistogramMax, 210.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4360 SDtfs, 20733 SDslu, 133894 SDs, 0 SdLazy, 29474 SolverSat, 4608 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 28.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9130 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 8940 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138419 ImplicationChecksByTransitivity, 313.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=332occurred in iteration=94, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 95 MinimizatonAttempts, 186 StatesRemovedByMinimization, 93 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 144.8s InterpolantComputationTime, 18050 NumberOfCodeBlocks, 18050 NumberOfCodeBlocksAsserted, 95 NumberOfCheckSat, 17955 ConstructedInterpolants, 0 QuantifiedInterpolants, 17628963 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 95 InterpolantComputations, 2 PerfectInterpolantSequences, 13207/419710 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_9.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-10-10_15-23-09-293.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_9.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-10_15-23-09-293.csv Received shutdown request...