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/ArraysOfVariableLength_true-valid-memsafety.c_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-b8f97f7-m [2018-10-10 15:18:43,368 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 15:18:43,370 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 15:18:43,382 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 15:18:43,382 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 15:18:43,383 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 15:18:43,384 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 15:18:43,386 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 15:18:43,388 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 15:18:43,389 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 15:18:43,390 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 15:18:43,390 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 15:18:43,391 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 15:18:43,392 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 15:18:43,393 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 15:18:43,394 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 15:18:43,395 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 15:18:43,397 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 15:18:43,399 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 15:18:43,400 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 15:18:43,402 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 15:18:43,403 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 15:18:43,405 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 15:18:43,406 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 15:18:43,406 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 15:18:43,407 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 15:18:43,408 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 15:18:43,409 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 15:18:43,410 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 15:18:43,411 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 15:18:43,411 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 15:18:43,412 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 15:18:43,412 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 15:18:43,412 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 15:18:43,413 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 15:18:43,415 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 15:18:43,415 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:18:43,435 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 15:18:43,436 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 15:18:43,437 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-10 15:18:43,438 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-10 15:18:43,438 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-10 15:18:43,439 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-10 15:18:43,439 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 15:18:43,440 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-10 15:18:43,440 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 15:18:43,440 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-10 15:18:43,441 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-10 15:18:43,441 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-10 15:18:43,441 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-10 15:18:43,442 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-10 15:18:43,442 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-10 15:18:43,495 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 15:18:43,508 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 15:18:43,512 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 15:18:43,513 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-10 15:18:43,514 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-10 15:18:43,516 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength_true-valid-memsafety.c_12.bpl [2018-10-10 15:18:43,516 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength_true-valid-memsafety.c_12.bpl' [2018-10-10 15:18:43,607 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 15:18:43,608 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-10 15:18:43,609 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 15:18:43,609 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 15:18:43,609 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 15:18:43,638 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:18:43" (1/1) ... [2018-10-10 15:18:43,640 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:18:43" (1/1) ... [2018-10-10 15:18:43,655 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:18:43" (1/1) ... [2018-10-10 15:18:43,656 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:18:43" (1/1) ... [2018-10-10 15:18:43,660 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:18:43" (1/1) ... [2018-10-10 15:18:43,662 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:18:43" (1/1) ... [2018-10-10 15:18:43,664 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:18:43" (1/1) ... [2018-10-10 15:18:43,666 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 15:18:43,667 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 15:18:43,668 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 15:18:43,668 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 15:18:43,669 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:18:43" (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:18:43,744 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-10 15:18:43,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 15:18:43,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 15:18:44,316 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 15:18:44,317 INFO L202 PluginConnector]: Adding new model ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 03:18:44 BoogieIcfgContainer [2018-10-10 15:18:44,318 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 15:18:44,319 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 15:18:44,319 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 15:18:44,323 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 15:18:44,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:18:43" (1/2) ... [2018-10-10 15:18:44,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f9436cb and model type ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 03:18:44, skipping insertion in model container [2018-10-10 15:18:44,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 03:18:44" (2/2) ... [2018-10-10 15:18:44,326 INFO L112 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength_true-valid-memsafety.c_12.bpl [2018-10-10 15:18:44,336 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-10 15:18:44,344 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-10 15:18:44,361 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-10 15:18:44,389 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 15:18:44,390 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 15:18:44,390 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 15:18:44,390 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-10 15:18:44,391 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 15:18:44,391 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 15:18:44,391 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 15:18:44,391 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 15:18:44,391 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 15:18:44,409 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2018-10-10 15:18:44,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-10 15:18:44,418 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:44,420 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] [2018-10-10 15:18:44,421 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:44,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:44,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1642431773, now seen corresponding path program 1 times [2018-10-10 15:18:44,473 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:44,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:44,944 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:18:44,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 15:18:44,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 15:18:44,952 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 15:18:44,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 15:18:44,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-10-10 15:18:44,973 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 8 states. [2018-10-10 15:18:45,266 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-10 15:18:45,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:45,633 INFO L93 Difference]: Finished difference Result 129 states and 132 transitions. [2018-10-10 15:18:45,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 15:18:45,636 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2018-10-10 15:18:45,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:45,659 INFO L225 Difference]: With dead ends: 129 [2018-10-10 15:18:45,659 INFO L226 Difference]: Without dead ends: 129 [2018-10-10 15:18:45,663 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2018-10-10 15:18:45,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-10-10 15:18:45,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 91. [2018-10-10 15:18:45,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-10 15:18:45,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 93 transitions. [2018-10-10 15:18:45,709 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 93 transitions. Word has length 36 [2018-10-10 15:18:45,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:45,710 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 93 transitions. [2018-10-10 15:18:45,710 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 15:18:45,710 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 93 transitions. [2018-10-10 15:18:45,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-10 15:18:45,713 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:45,713 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:18:45,714 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:45,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:45,714 INFO L82 PathProgramCache]: Analyzing trace with hash -2036500607, now seen corresponding path program 1 times [2018-10-10 15:18:45,715 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:45,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:45,947 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:18:45,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:45,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-10 15:18:45,950 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 15:18:45,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 15:18:45,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-10 15:18:45,952 INFO L87 Difference]: Start difference. First operand 91 states and 93 transitions. Second operand 8 states. [2018-10-10 15:18:46,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:46,900 INFO L93 Difference]: Finished difference Result 159 states and 162 transitions. [2018-10-10 15:18:46,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 15:18:46,902 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2018-10-10 15:18:46,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:46,904 INFO L225 Difference]: With dead ends: 159 [2018-10-10 15:18:46,904 INFO L226 Difference]: Without dead ends: 159 [2018-10-10 15:18:46,908 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-10-10 15:18:46,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-10-10 15:18:46,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 110. [2018-10-10 15:18:46,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-10-10 15:18:46,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 112 transitions. [2018-10-10 15:18:46,920 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 112 transitions. Word has length 62 [2018-10-10 15:18:46,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:46,921 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 112 transitions. [2018-10-10 15:18:46,921 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 15:18:46,921 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 112 transitions. [2018-10-10 15:18:46,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-10 15:18:46,924 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:46,924 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,925 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:46,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:46,925 INFO L82 PathProgramCache]: Analyzing trace with hash -195640530, now seen corresponding path program 1 times [2018-10-10 15:18:46,926 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:46,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:47,327 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-10 15:18:47,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:47,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-10 15:18:47,329 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 15:18:47,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 15:18:47,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-10-10 15:18:47,330 INFO L87 Difference]: Start difference. First operand 110 states and 112 transitions. Second operand 10 states. [2018-10-10 15:18:47,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:47,859 INFO L93 Difference]: Finished difference Result 170 states and 174 transitions. [2018-10-10 15:18:47,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-10 15:18:47,861 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 77 [2018-10-10 15:18:47,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:47,864 INFO L225 Difference]: With dead ends: 170 [2018-10-10 15:18:47,864 INFO L226 Difference]: Without dead ends: 170 [2018-10-10 15:18:47,864 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2018-10-10 15:18:47,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-10-10 15:18:47,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 132. [2018-10-10 15:18:47,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-10-10 15:18:47,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 135 transitions. [2018-10-10 15:18:47,877 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 135 transitions. Word has length 77 [2018-10-10 15:18:47,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:47,877 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 135 transitions. [2018-10-10 15:18:47,878 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 15:18:47,878 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 135 transitions. [2018-10-10 15:18:47,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-10 15:18:47,883 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:47,888 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:18:47,888 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:47,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:47,889 INFO L82 PathProgramCache]: Analyzing trace with hash -514873332, now seen corresponding path program 2 times [2018-10-10 15:18:47,890 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:47,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:48,173 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 17 proven. 47 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-10 15:18:48,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:48,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-10 15:18:48,174 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 15:18:48,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 15:18:48,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-10-10 15:18:48,175 INFO L87 Difference]: Start difference. First operand 132 states and 135 transitions. Second operand 10 states. [2018-10-10 15:18:48,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:48,550 INFO L93 Difference]: Finished difference Result 158 states and 161 transitions. [2018-10-10 15:18:48,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-10 15:18:48,551 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 103 [2018-10-10 15:18:48,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:48,554 INFO L225 Difference]: With dead ends: 158 [2018-10-10 15:18:48,554 INFO L226 Difference]: Without dead ends: 158 [2018-10-10 15:18:48,555 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2018-10-10 15:18:48,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-10-10 15:18:48,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 133. [2018-10-10 15:18:48,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-10-10 15:18:48,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 136 transitions. [2018-10-10 15:18:48,570 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 136 transitions. Word has length 103 [2018-10-10 15:18:48,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:48,571 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 136 transitions. [2018-10-10 15:18:48,571 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 15:18:48,571 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 136 transitions. [2018-10-10 15:18:48,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-10 15:18:48,576 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:48,576 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:18:48,577 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:48,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:48,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1932659523, now seen corresponding path program 3 times [2018-10-10 15:18:48,579 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:48,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:48,899 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 17 proven. 65 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-10 15:18:48,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:48,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-10 15:18:48,900 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 15:18:48,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 15:18:48,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-10-10 15:18:48,901 INFO L87 Difference]: Start difference. First operand 133 states and 136 transitions. Second operand 12 states. [2018-10-10 15:18:49,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:49,781 INFO L93 Difference]: Finished difference Result 160 states and 163 transitions. [2018-10-10 15:18:49,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-10 15:18:49,782 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 118 [2018-10-10 15:18:49,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:49,783 INFO L225 Difference]: With dead ends: 160 [2018-10-10 15:18:49,783 INFO L226 Difference]: Without dead ends: 160 [2018-10-10 15:18:49,784 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=477, Unknown=0, NotChecked=0, Total=600 [2018-10-10 15:18:49,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-10-10 15:18:49,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 148. [2018-10-10 15:18:49,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-10-10 15:18:49,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 151 transitions. [2018-10-10 15:18:49,795 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 151 transitions. Word has length 118 [2018-10-10 15:18:49,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:49,796 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 151 transitions. [2018-10-10 15:18:49,796 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 15:18:49,796 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 151 transitions. [2018-10-10 15:18:49,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-10-10 15:18:49,798 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:49,799 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:18:49,799 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:49,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:49,800 INFO L82 PathProgramCache]: Analyzing trace with hash -2144079060, now seen corresponding path program 4 times [2018-10-10 15:18:49,800 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:49,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:50,150 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-10 15:18:50,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:50,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-10 15:18:50,151 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 15:18:50,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 15:18:50,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-10-10 15:18:50,152 INFO L87 Difference]: Start difference. First operand 148 states and 151 transitions. Second operand 12 states. [2018-10-10 15:18:50,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:50,831 INFO L93 Difference]: Finished difference Result 258 states and 263 transitions. [2018-10-10 15:18:50,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-10 15:18:50,833 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 133 [2018-10-10 15:18:50,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:50,835 INFO L225 Difference]: With dead ends: 258 [2018-10-10 15:18:50,835 INFO L226 Difference]: Without dead ends: 258 [2018-10-10 15:18:50,836 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2018-10-10 15:18:50,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-10-10 15:18:50,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 204. [2018-10-10 15:18:50,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-10-10 15:18:50,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 208 transitions. [2018-10-10 15:18:50,845 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 208 transitions. Word has length 133 [2018-10-10 15:18:50,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:50,846 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 208 transitions. [2018-10-10 15:18:50,846 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 15:18:50,846 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 208 transitions. [2018-10-10 15:18:50,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-10-10 15:18:50,849 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:50,850 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:18:50,850 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:50,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:50,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1201213738, now seen corresponding path program 5 times [2018-10-10 15:18:50,851 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:50,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:51,266 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 86 proven. 198 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-10 15:18:51,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:51,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-10 15:18:51,268 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-10 15:18:51,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-10 15:18:51,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-10-10 15:18:51,269 INFO L87 Difference]: Start difference. First operand 204 states and 208 transitions. Second operand 16 states. [2018-10-10 15:18:52,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:52,086 INFO L93 Difference]: Finished difference Result 231 states and 235 transitions. [2018-10-10 15:18:52,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-10 15:18:52,086 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 189 [2018-10-10 15:18:52,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:52,089 INFO L225 Difference]: With dead ends: 231 [2018-10-10 15:18:52,089 INFO L226 Difference]: Without dead ends: 231 [2018-10-10 15:18:52,091 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=232, Invalid=958, Unknown=0, NotChecked=0, Total=1190 [2018-10-10 15:18:52,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-10-10 15:18:52,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 219. [2018-10-10 15:18:52,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-10-10 15:18:52,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 223 transitions. [2018-10-10 15:18:52,098 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 223 transitions. Word has length 189 [2018-10-10 15:18:52,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:52,099 INFO L481 AbstractCegarLoop]: Abstraction has 219 states and 223 transitions. [2018-10-10 15:18:52,099 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-10 15:18:52,099 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 223 transitions. [2018-10-10 15:18:52,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-10-10 15:18:52,103 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:52,103 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:18:52,103 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:52,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:52,104 INFO L82 PathProgramCache]: Analyzing trace with hash -723418523, now seen corresponding path program 6 times [2018-10-10 15:18:52,104 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:52,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:53,295 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 349 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-10-10 15:18:53,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:53,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-10 15:18:53,297 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-10 15:18:53,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-10 15:18:53,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2018-10-10 15:18:53,298 INFO L87 Difference]: Start difference. First operand 219 states and 223 transitions. Second operand 20 states. [2018-10-10 15:18:57,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:57,141 INFO L93 Difference]: Finished difference Result 461 states and 468 transitions. [2018-10-10 15:18:57,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-10 15:18:57,142 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 204 [2018-10-10 15:18:57,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:57,145 INFO L225 Difference]: With dead ends: 461 [2018-10-10 15:18:57,145 INFO L226 Difference]: Without dead ends: 460 [2018-10-10 15:18:57,148 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1311 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1079, Invalid=4033, Unknown=0, NotChecked=0, Total=5112 [2018-10-10 15:18:57,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2018-10-10 15:18:57,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 276. [2018-10-10 15:18:57,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-10-10 15:18:57,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 280 transitions. [2018-10-10 15:18:57,155 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 280 transitions. Word has length 204 [2018-10-10 15:18:57,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:57,156 INFO L481 AbstractCegarLoop]: Abstraction has 276 states and 280 transitions. [2018-10-10 15:18:57,156 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-10 15:18:57,156 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 280 transitions. [2018-10-10 15:18:57,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-10-10 15:18:57,161 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:57,161 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:18:57,161 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:57,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:57,162 INFO L82 PathProgramCache]: Analyzing trace with hash -113288948, now seen corresponding path program 7 times [2018-10-10 15:18:57,163 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:57,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:57,886 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 0 proven. 733 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-10-10 15:18:57,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:57,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-10 15:18:57,888 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-10 15:18:57,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-10 15:18:57,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2018-10-10 15:18:57,889 INFO L87 Difference]: Start difference. First operand 276 states and 280 transitions. Second operand 22 states. [2018-10-10 15:19:02,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:02,435 INFO L93 Difference]: Finished difference Result 531 states and 539 transitions. [2018-10-10 15:19:02,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-10 15:19:02,436 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 275 [2018-10-10 15:19:02,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:02,440 INFO L225 Difference]: With dead ends: 531 [2018-10-10 15:19:02,440 INFO L226 Difference]: Without dead ends: 531 [2018-10-10 15:19:02,443 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1988 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1421, Invalid=5719, Unknown=0, NotChecked=0, Total=7140 [2018-10-10 15:19:02,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2018-10-10 15:19:02,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 347. [2018-10-10 15:19:02,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-10-10 15:19:02,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 352 transitions. [2018-10-10 15:19:02,452 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 352 transitions. Word has length 275 [2018-10-10 15:19:02,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:02,452 INFO L481 AbstractCegarLoop]: Abstraction has 347 states and 352 transitions. [2018-10-10 15:19:02,453 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-10 15:19:02,453 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 352 transitions. [2018-10-10 15:19:02,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-10-10 15:19:02,458 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:02,459 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:19:02,459 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:02,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:02,459 INFO L82 PathProgramCache]: Analyzing trace with hash 2083569797, now seen corresponding path program 8 times [2018-10-10 15:19:02,460 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:02,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:03,281 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-10 15:19:04,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1412 backedges. 0 proven. 1284 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-10-10 15:19:04,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:04,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-10 15:19:04,277 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-10 15:19:04,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-10 15:19:04,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2018-10-10 15:19:04,278 INFO L87 Difference]: Start difference. First operand 347 states and 352 transitions. Second operand 24 states. [2018-10-10 15:19:04,537 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 20 [2018-10-10 15:19:08,392 WARN L178 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2018-10-10 15:19:10,054 WARN L178 SmtUtils]: Spent 291.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-10-10 15:19:10,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:10,886 INFO L93 Difference]: Finished difference Result 602 states and 611 transitions. [2018-10-10 15:19:10,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-10 15:19:10,886 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 346 [2018-10-10 15:19:10,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:10,889 INFO L225 Difference]: With dead ends: 602 [2018-10-10 15:19:10,890 INFO L226 Difference]: Without dead ends: 602 [2018-10-10 15:19:10,893 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2815 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=1820, Invalid=7686, Unknown=0, NotChecked=0, Total=9506 [2018-10-10 15:19:10,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2018-10-10 15:19:10,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 418. [2018-10-10 15:19:10,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2018-10-10 15:19:10,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 424 transitions. [2018-10-10 15:19:10,902 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 424 transitions. Word has length 346 [2018-10-10 15:19:10,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:10,903 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 424 transitions. [2018-10-10 15:19:10,903 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-10 15:19:10,903 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 424 transitions. [2018-10-10 15:19:10,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2018-10-10 15:19:10,909 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:10,909 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:19:10,910 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:10,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:10,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1540032788, now seen corresponding path program 9 times [2018-10-10 15:19:10,911 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:10,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:12,068 INFO L134 CoverageAnalysis]: Checked inductivity of 2178 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2018-10-10 15:19:12,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:12,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-10 15:19:12,069 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-10 15:19:12,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-10 15:19:12,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650 [2018-10-10 15:19:12,070 INFO L87 Difference]: Start difference. First operand 418 states and 424 transitions. Second operand 26 states. [2018-10-10 15:19:13,945 WARN L178 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 24 [2018-10-10 15:19:19,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:19,021 INFO L93 Difference]: Finished difference Result 673 states and 683 transitions. [2018-10-10 15:19:19,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-10-10 15:19:19,022 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 417 [2018-10-10 15:19:19,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:19,026 INFO L225 Difference]: With dead ends: 673 [2018-10-10 15:19:19,026 INFO L226 Difference]: Without dead ends: 673 [2018-10-10 15:19:19,031 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3792 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=2276, Invalid=9934, Unknown=0, NotChecked=0, Total=12210 [2018-10-10 15:19:19,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2018-10-10 15:19:19,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 489. [2018-10-10 15:19:19,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2018-10-10 15:19:19,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 496 transitions. [2018-10-10 15:19:19,041 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 496 transitions. Word has length 417 [2018-10-10 15:19:19,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:19,042 INFO L481 AbstractCegarLoop]: Abstraction has 489 states and 496 transitions. [2018-10-10 15:19:19,042 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-10 15:19:19,043 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 496 transitions. [2018-10-10 15:19:19,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2018-10-10 15:19:19,046 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:19,047 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:19:19,047 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:19,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:19,047 INFO L82 PathProgramCache]: Analyzing trace with hash 2112276133, now seen corresponding path program 10 times [2018-10-10 15:19:19,048 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:19,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:20,609 INFO L134 CoverageAnalysis]: Checked inductivity of 3111 backedges. 0 proven. 2887 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2018-10-10 15:19:20,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:20,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-10 15:19:20,610 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-10 15:19:20,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-10 15:19:20,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=643, Unknown=0, NotChecked=0, Total=756 [2018-10-10 15:19:20,611 INFO L87 Difference]: Start difference. First operand 489 states and 496 transitions. Second operand 28 states. [2018-10-10 15:19:21,807 WARN L178 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2018-10-10 15:19:28,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:28,985 INFO L93 Difference]: Finished difference Result 744 states and 755 transitions. [2018-10-10 15:19:28,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-10-10 15:19:28,985 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 488 [2018-10-10 15:19:28,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:28,990 INFO L225 Difference]: With dead ends: 744 [2018-10-10 15:19:28,990 INFO L226 Difference]: Without dead ends: 744 [2018-10-10 15:19:28,995 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4919 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=2789, Invalid=12463, Unknown=0, NotChecked=0, Total=15252 [2018-10-10 15:19:28,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2018-10-10 15:19:29,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 560. [2018-10-10 15:19:29,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2018-10-10 15:19:29,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 568 transitions. [2018-10-10 15:19:29,005 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 568 transitions. Word has length 488 [2018-10-10 15:19:29,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:29,006 INFO L481 AbstractCegarLoop]: Abstraction has 560 states and 568 transitions. [2018-10-10 15:19:29,006 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-10 15:19:29,006 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 568 transitions. [2018-10-10 15:19:29,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 560 [2018-10-10 15:19:29,010 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:29,010 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:19:29,011 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:29,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:29,011 INFO L82 PathProgramCache]: Analyzing trace with hash 592628940, now seen corresponding path program 11 times [2018-10-10 15:19:29,012 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:29,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:30,887 INFO L134 CoverageAnalysis]: Checked inductivity of 4211 backedges. 0 proven. 3939 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-10-10 15:19:30,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:30,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-10 15:19:30,888 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-10 15:19:30,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-10 15:19:30,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=738, Unknown=0, NotChecked=0, Total=870 [2018-10-10 15:19:30,889 INFO L87 Difference]: Start difference. First operand 560 states and 568 transitions. Second operand 30 states. [2018-10-10 15:19:31,726 WARN L178 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2018-10-10 15:19:39,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:39,505 INFO L93 Difference]: Finished difference Result 815 states and 827 transitions. [2018-10-10 15:19:39,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-10-10 15:19:39,506 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 559 [2018-10-10 15:19:39,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:39,510 INFO L225 Difference]: With dead ends: 815 [2018-10-10 15:19:39,510 INFO L226 Difference]: Without dead ends: 815 [2018-10-10 15:19:39,516 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6196 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=3359, Invalid=15273, Unknown=0, NotChecked=0, Total=18632 [2018-10-10 15:19:39,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2018-10-10 15:19:39,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 631. [2018-10-10 15:19:39,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2018-10-10 15:19:39,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 640 transitions. [2018-10-10 15:19:39,526 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 640 transitions. Word has length 559 [2018-10-10 15:19:39,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:39,527 INFO L481 AbstractCegarLoop]: Abstraction has 631 states and 640 transitions. [2018-10-10 15:19:39,528 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-10 15:19:39,528 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 640 transitions. [2018-10-10 15:19:39,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 631 [2018-10-10 15:19:39,532 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:39,532 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:19:39,533 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:39,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:39,533 INFO L82 PathProgramCache]: Analyzing trace with hash -972712763, now seen corresponding path program 12 times [2018-10-10 15:19:39,534 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:39,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:43,091 INFO L134 CoverageAnalysis]: Checked inductivity of 5478 backedges. 0 proven. 5158 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2018-10-10 15:19:43,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:43,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-10 15:19:43,092 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-10 15:19:43,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-10 15:19:43,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=839, Unknown=0, NotChecked=0, Total=992 [2018-10-10 15:19:43,093 INFO L87 Difference]: Start difference. First operand 631 states and 640 transitions. Second operand 32 states. [2018-10-10 15:19:52,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:52,233 INFO L93 Difference]: Finished difference Result 886 states and 899 transitions. [2018-10-10 15:19:52,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-10-10 15:19:52,234 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 630 [2018-10-10 15:19:52,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:52,239 INFO L225 Difference]: With dead ends: 886 [2018-10-10 15:19:52,239 INFO L226 Difference]: Without dead ends: 886 [2018-10-10 15:19:52,241 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7623 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=3986, Invalid=18364, Unknown=0, NotChecked=0, Total=22350 [2018-10-10 15:19:52,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2018-10-10 15:19:52,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 702. [2018-10-10 15:19:52,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 702 states. [2018-10-10 15:19:52,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 712 transitions. [2018-10-10 15:19:52,252 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 712 transitions. Word has length 630 [2018-10-10 15:19:52,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:52,253 INFO L481 AbstractCegarLoop]: Abstraction has 702 states and 712 transitions. [2018-10-10 15:19:52,253 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-10 15:19:52,253 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 712 transitions. [2018-10-10 15:19:52,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 702 [2018-10-10 15:19:52,258 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:52,258 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:19:52,258 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:52,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:52,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1951849132, now seen corresponding path program 13 times [2018-10-10 15:19:52,260 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:52,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:55,451 INFO L134 CoverageAnalysis]: Checked inductivity of 6912 backedges. 0 proven. 6544 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2018-10-10 15:19:55,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:55,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-10 15:19:55,452 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-10 15:19:55,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-10 15:19:55,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=946, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 15:19:55,452 INFO L87 Difference]: Start difference. First operand 702 states and 712 transitions. Second operand 34 states. [2018-10-10 15:20:05,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:20:05,634 INFO L93 Difference]: Finished difference Result 957 states and 971 transitions. [2018-10-10 15:20:05,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-10-10 15:20:05,635 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 701 [2018-10-10 15:20:05,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:20:05,638 INFO L225 Difference]: With dead ends: 957 [2018-10-10 15:20:05,638 INFO L226 Difference]: Without dead ends: 957 [2018-10-10 15:20:05,641 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9200 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=4670, Invalid=21736, Unknown=0, NotChecked=0, Total=26406 [2018-10-10 15:20:05,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2018-10-10 15:20:05,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 773. [2018-10-10 15:20:05,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2018-10-10 15:20:05,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 784 transitions. [2018-10-10 15:20:05,652 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 784 transitions. Word has length 701 [2018-10-10 15:20:05,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:20:05,653 INFO L481 AbstractCegarLoop]: Abstraction has 773 states and 784 transitions. [2018-10-10 15:20:05,653 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-10 15:20:05,653 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 784 transitions. [2018-10-10 15:20:05,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 773 [2018-10-10 15:20:05,659 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:20:05,660 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:20:05,660 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:20:05,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:20:05,660 INFO L82 PathProgramCache]: Analyzing trace with hash -183555355, now seen corresponding path program 14 times [2018-10-10 15:20:05,661 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:20:05,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:20:08,593 INFO L134 CoverageAnalysis]: Checked inductivity of 8513 backedges. 0 proven. 8097 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2018-10-10 15:20:08,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:20:08,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-10 15:20:08,595 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-10 15:20:08,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-10 15:20:08,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1059, Unknown=0, NotChecked=0, Total=1260 [2018-10-10 15:20:08,596 INFO L87 Difference]: Start difference. First operand 773 states and 784 transitions. Second operand 36 states. [2018-10-10 15:20:19,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:20:19,993 INFO L93 Difference]: Finished difference Result 1028 states and 1043 transitions. [2018-10-10 15:20:19,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-10-10 15:20:19,994 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 772 [2018-10-10 15:20:19,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:20:19,998 INFO L225 Difference]: With dead ends: 1028 [2018-10-10 15:20:19,998 INFO L226 Difference]: Without dead ends: 1028 [2018-10-10 15:20:20,001 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10927 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=5411, Invalid=25389, Unknown=0, NotChecked=0, Total=30800 [2018-10-10 15:20:20,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2018-10-10 15:20:20,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 844. [2018-10-10 15:20:20,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2018-10-10 15:20:20,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 856 transitions. [2018-10-10 15:20:20,013 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 856 transitions. Word has length 772 [2018-10-10 15:20:20,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:20:20,014 INFO L481 AbstractCegarLoop]: Abstraction has 844 states and 856 transitions. [2018-10-10 15:20:20,014 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-10 15:20:20,014 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 856 transitions. [2018-10-10 15:20:20,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 844 [2018-10-10 15:20:20,021 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:20:20,021 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:20:20,022 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:20:20,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:20:20,022 INFO L82 PathProgramCache]: Analyzing trace with hash -796974964, now seen corresponding path program 15 times [2018-10-10 15:20:20,023 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:20:20,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:20:21,007 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-10 15:20:23,899 INFO L134 CoverageAnalysis]: Checked inductivity of 10281 backedges. 0 proven. 9817 refuted. 0 times theorem prover too weak. 464 trivial. 0 not checked. [2018-10-10 15:20:23,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:20:23,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-10 15:20:23,901 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-10 15:20:23,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-10 15:20:23,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=1178, Unknown=0, NotChecked=0, Total=1406 [2018-10-10 15:20:23,901 INFO L87 Difference]: Start difference. First operand 844 states and 856 transitions. Second operand 38 states. [2018-10-10 15:20:36,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:20:36,072 INFO L93 Difference]: Finished difference Result 1099 states and 1115 transitions. [2018-10-10 15:20:36,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2018-10-10 15:20:36,073 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 843 [2018-10-10 15:20:36,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:20:36,077 INFO L225 Difference]: With dead ends: 1099 [2018-10-10 15:20:36,078 INFO L226 Difference]: Without dead ends: 1099 [2018-10-10 15:20:36,080 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12804 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=6209, Invalid=29323, Unknown=0, NotChecked=0, Total=35532 [2018-10-10 15:20:36,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2018-10-10 15:20:36,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 915. [2018-10-10 15:20:36,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 915 states. [2018-10-10 15:20:36,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 928 transitions. [2018-10-10 15:20:36,092 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 928 transitions. Word has length 843 [2018-10-10 15:20:36,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:20:36,093 INFO L481 AbstractCegarLoop]: Abstraction has 915 states and 928 transitions. [2018-10-10 15:20:36,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-10 15:20:36,093 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 928 transitions. [2018-10-10 15:20:36,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 915 [2018-10-10 15:20:36,100 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:20:36,101 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:20:36,101 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:20:36,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:20:36,102 INFO L82 PathProgramCache]: Analyzing trace with hash -2147120891, now seen corresponding path program 16 times [2018-10-10 15:20:36,102 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:20:36,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:20:39,732 INFO L134 CoverageAnalysis]: Checked inductivity of 12216 backedges. 0 proven. 11704 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2018-10-10 15:20:39,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:20:39,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-10 15:20:39,733 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-10 15:20:39,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-10 15:20:39,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=1303, Unknown=0, NotChecked=0, Total=1560 [2018-10-10 15:20:39,734 INFO L87 Difference]: Start difference. First operand 915 states and 928 transitions. Second operand 40 states. [2018-10-10 15:20:49,960 WARN L178 SmtUtils]: Spent 623.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2018-10-10 15:20:54,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:20:54,207 INFO L93 Difference]: Finished difference Result 1170 states and 1187 transitions. [2018-10-10 15:20:54,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2018-10-10 15:20:54,207 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 914 [2018-10-10 15:20:54,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:20:54,211 INFO L225 Difference]: With dead ends: 1170 [2018-10-10 15:20:54,211 INFO L226 Difference]: Without dead ends: 1170 [2018-10-10 15:20:54,214 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14831 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=7064, Invalid=33538, Unknown=0, NotChecked=0, Total=40602 [2018-10-10 15:20:54,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2018-10-10 15:20:54,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 986. [2018-10-10 15:20:54,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2018-10-10 15:20:54,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 1000 transitions. [2018-10-10 15:20:54,227 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 1000 transitions. Word has length 914 [2018-10-10 15:20:54,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:20:54,227 INFO L481 AbstractCegarLoop]: Abstraction has 986 states and 1000 transitions. [2018-10-10 15:20:54,228 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-10 15:20:54,228 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1000 transitions. [2018-10-10 15:20:54,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 986 [2018-10-10 15:20:54,236 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:20:54,237 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:20:54,237 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:20:54,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:20:54,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1937138068, now seen corresponding path program 17 times [2018-10-10 15:20:54,238 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:20:54,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:20:58,262 INFO L134 CoverageAnalysis]: Checked inductivity of 14318 backedges. 0 proven. 13758 refuted. 0 times theorem prover too weak. 560 trivial. 0 not checked. [2018-10-10 15:20:58,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:20:58,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-10 15:20:58,264 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-10 15:20:58,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-10 15:20:58,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=1434, Unknown=0, NotChecked=0, Total=1722 [2018-10-10 15:20:58,265 INFO L87 Difference]: Start difference. First operand 986 states and 1000 transitions. Second operand 42 states. [2018-10-10 15:21:13,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:21:13,445 INFO L93 Difference]: Finished difference Result 1241 states and 1259 transitions. [2018-10-10 15:21:13,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2018-10-10 15:21:13,446 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 985 [2018-10-10 15:21:13,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:21:13,450 INFO L225 Difference]: With dead ends: 1241 [2018-10-10 15:21:13,450 INFO L226 Difference]: Without dead ends: 1241 [2018-10-10 15:21:13,452 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17008 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=7976, Invalid=38034, Unknown=0, NotChecked=0, Total=46010 [2018-10-10 15:21:13,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2018-10-10 15:21:13,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1057. [2018-10-10 15:21:13,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1057 states. [2018-10-10 15:21:13,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 1072 transitions. [2018-10-10 15:21:13,465 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 1072 transitions. Word has length 985 [2018-10-10 15:21:13,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:21:13,465 INFO L481 AbstractCegarLoop]: Abstraction has 1057 states and 1072 transitions. [2018-10-10 15:21:13,465 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-10 15:21:13,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 1072 transitions. [2018-10-10 15:21:13,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1057 [2018-10-10 15:21:13,476 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:21:13,477 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:21:13,477 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:21:13,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:21:13,478 INFO L82 PathProgramCache]: Analyzing trace with hash -798314715, now seen corresponding path program 18 times [2018-10-10 15:21:13,478 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:21:13,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:21:17,701 INFO L134 CoverageAnalysis]: Checked inductivity of 16587 backedges. 0 proven. 15979 refuted. 0 times theorem prover too weak. 608 trivial. 0 not checked. [2018-10-10 15:21:17,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:21:17,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-10 15:21:17,702 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-10 15:21:17,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-10 15:21:17,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=1571, Unknown=0, NotChecked=0, Total=1892 [2018-10-10 15:21:17,703 INFO L87 Difference]: Start difference. First operand 1057 states and 1072 transitions. Second operand 44 states. [2018-10-10 15:21:34,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:21:34,192 INFO L93 Difference]: Finished difference Result 1312 states and 1331 transitions. [2018-10-10 15:21:34,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 188 states. [2018-10-10 15:21:34,192 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 1056 [2018-10-10 15:21:34,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:21:34,196 INFO L225 Difference]: With dead ends: 1312 [2018-10-10 15:21:34,196 INFO L226 Difference]: Without dead ends: 1312 [2018-10-10 15:21:34,198 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19335 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=8945, Invalid=42811, Unknown=0, NotChecked=0, Total=51756 [2018-10-10 15:21:34,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2018-10-10 15:21:34,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1128. [2018-10-10 15:21:34,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1128 states. [2018-10-10 15:21:34,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 1144 transitions. [2018-10-10 15:21:34,210 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 1144 transitions. Word has length 1056 [2018-10-10 15:21:34,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:21:34,211 INFO L481 AbstractCegarLoop]: Abstraction has 1128 states and 1144 transitions. [2018-10-10 15:21:34,211 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-10 15:21:34,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 1144 transitions. [2018-10-10 15:21:34,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1128 [2018-10-10 15:21:34,222 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:21:34,222 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:21:34,222 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:21:34,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:21:34,223 INFO L82 PathProgramCache]: Analyzing trace with hash -122399668, now seen corresponding path program 19 times [2018-10-10 15:21:34,224 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:21:34,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:21:39,133 INFO L134 CoverageAnalysis]: Checked inductivity of 19023 backedges. 0 proven. 18367 refuted. 0 times theorem prover too weak. 656 trivial. 0 not checked. [2018-10-10 15:21:39,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:21:39,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-10 15:21:39,134 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-10 15:21:39,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-10 15:21:39,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=1714, Unknown=0, NotChecked=0, Total=2070 [2018-10-10 15:21:39,135 INFO L87 Difference]: Start difference. First operand 1128 states and 1144 transitions. Second operand 46 states. [2018-10-10 15:21:57,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:21:57,195 INFO L93 Difference]: Finished difference Result 1383 states and 1403 transitions. [2018-10-10 15:21:57,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 199 states. [2018-10-10 15:21:57,196 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 1127 [2018-10-10 15:21:57,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:21:57,200 INFO L225 Difference]: With dead ends: 1383 [2018-10-10 15:21:57,201 INFO L226 Difference]: Without dead ends: 1383 [2018-10-10 15:21:57,204 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21812 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=9971, Invalid=47869, Unknown=0, NotChecked=0, Total=57840 [2018-10-10 15:21:57,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2018-10-10 15:21:57,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1199. [2018-10-10 15:21:57,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1199 states. [2018-10-10 15:21:57,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 1216 transitions. [2018-10-10 15:21:57,218 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 1216 transitions. Word has length 1127 [2018-10-10 15:21:57,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:21:57,219 INFO L481 AbstractCegarLoop]: Abstraction has 1199 states and 1216 transitions. [2018-10-10 15:21:57,219 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-10 15:21:57,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1216 transitions. [2018-10-10 15:21:57,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1199 [2018-10-10 15:21:57,232 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:21:57,233 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:21:57,233 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:21:57,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:21:57,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1681956165, now seen corresponding path program 20 times [2018-10-10 15:21:57,235 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:21:57,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:21:58,304 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-10 15:22:03,168 INFO L134 CoverageAnalysis]: Checked inductivity of 21626 backedges. 0 proven. 20922 refuted. 0 times theorem prover too weak. 704 trivial. 0 not checked. [2018-10-10 15:22:03,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:22:03,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-10 15:22:03,169 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-10 15:22:03,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-10 15:22:03,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=393, Invalid=1863, Unknown=0, NotChecked=0, Total=2256 [2018-10-10 15:22:03,170 INFO L87 Difference]: Start difference. First operand 1199 states and 1216 transitions. Second operand 48 states. [2018-10-10 15:22:22,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:22:22,017 INFO L93 Difference]: Finished difference Result 1454 states and 1475 transitions. [2018-10-10 15:22:22,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 210 states. [2018-10-10 15:22:22,018 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 1198 [2018-10-10 15:22:22,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:22:22,024 INFO L225 Difference]: With dead ends: 1454 [2018-10-10 15:22:22,024 INFO L226 Difference]: Without dead ends: 1454 [2018-10-10 15:22:22,027 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24439 ImplicationChecksByTransitivity, 18.4s TimeCoverageRelationStatistics Valid=11054, Invalid=53208, Unknown=0, NotChecked=0, Total=64262 [2018-10-10 15:22:22,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2018-10-10 15:22:22,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 1270. [2018-10-10 15:22:22,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1270 states. [2018-10-10 15:22:22,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1288 transitions. [2018-10-10 15:22:22,040 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1288 transitions. Word has length 1198 [2018-10-10 15:22:22,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:22:22,041 INFO L481 AbstractCegarLoop]: Abstraction has 1270 states and 1288 transitions. [2018-10-10 15:22:22,041 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-10 15:22:22,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1288 transitions. [2018-10-10 15:22:22,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1270 [2018-10-10 15:22:22,053 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:22:22,054 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:22:22,054 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:22:22,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:22:22,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1086145068, now seen corresponding path program 21 times [2018-10-10 15:22:22,056 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:22:22,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:22:28,004 INFO L134 CoverageAnalysis]: Checked inductivity of 24396 backedges. 0 proven. 23644 refuted. 0 times theorem prover too weak. 752 trivial. 0 not checked. [2018-10-10 15:22:28,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:22:28,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-10 15:22:28,005 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-10 15:22:28,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-10 15:22:28,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=432, Invalid=2018, Unknown=0, NotChecked=0, Total=2450 [2018-10-10 15:22:28,006 INFO L87 Difference]: Start difference. First operand 1270 states and 1288 transitions. Second operand 50 states. [2018-10-10 15:22:49,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:22:49,029 INFO L93 Difference]: Finished difference Result 1525 states and 1547 transitions. [2018-10-10 15:22:49,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 221 states. [2018-10-10 15:22:49,029 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 1269 [2018-10-10 15:22:49,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:22:49,034 INFO L225 Difference]: With dead ends: 1525 [2018-10-10 15:22:49,034 INFO L226 Difference]: Without dead ends: 1525 [2018-10-10 15:22:49,039 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27216 ImplicationChecksByTransitivity, 19.4s TimeCoverageRelationStatistics Valid=12194, Invalid=58828, Unknown=0, NotChecked=0, Total=71022 [2018-10-10 15:22:49,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1525 states. [2018-10-10 15:22:49,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1525 to 1341. [2018-10-10 15:22:49,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1341 states. [2018-10-10 15:22:49,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 1360 transitions. [2018-10-10 15:22:49,051 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 1360 transitions. Word has length 1269 [2018-10-10 15:22:49,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:22:49,052 INFO L481 AbstractCegarLoop]: Abstraction has 1341 states and 1360 transitions. [2018-10-10 15:22:49,052 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-10 15:22:49,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 1360 transitions. [2018-10-10 15:22:49,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1341 [2018-10-10 15:22:49,068 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:22:49,069 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:22:49,069 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:22:49,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:22:49,070 INFO L82 PathProgramCache]: Analyzing trace with hash -301378715, now seen corresponding path program 22 times [2018-10-10 15:22:49,070 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:22:49,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:22:56,188 INFO L134 CoverageAnalysis]: Checked inductivity of 27333 backedges. 0 proven. 26533 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2018-10-10 15:22:56,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:22:56,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-10 15:22:56,189 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-10 15:22:56,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-10 15:22:56,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=473, Invalid=2179, Unknown=0, NotChecked=0, Total=2652 [2018-10-10 15:22:56,190 INFO L87 Difference]: Start difference. First operand 1341 states and 1360 transitions. Second operand 52 states. [2018-10-10 15:23:18,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:23:18,958 INFO L93 Difference]: Finished difference Result 1596 states and 1619 transitions. [2018-10-10 15:23:18,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 232 states. [2018-10-10 15:23:18,958 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 1340 [2018-10-10 15:23:18,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:23:18,964 INFO L225 Difference]: With dead ends: 1596 [2018-10-10 15:23:18,964 INFO L226 Difference]: Without dead ends: 1596 [2018-10-10 15:23:18,971 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 278 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30143 ImplicationChecksByTransitivity, 21.7s TimeCoverageRelationStatistics Valid=13391, Invalid=64729, Unknown=0, NotChecked=0, Total=78120 [2018-10-10 15:23:18,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2018-10-10 15:23:18,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 1412. [2018-10-10 15:23:18,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1412 states. [2018-10-10 15:23:18,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 1432 transitions. [2018-10-10 15:23:18,988 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 1432 transitions. Word has length 1340 [2018-10-10 15:23:18,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:23:18,989 INFO L481 AbstractCegarLoop]: Abstraction has 1412 states and 1432 transitions. [2018-10-10 15:23:18,989 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-10 15:23:18,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 1432 transitions. [2018-10-10 15:23:19,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1412 [2018-10-10 15:23:19,052 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:23:19,053 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:23:19,053 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:23:19,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:23:19,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1273128972, now seen corresponding path program 23 times [2018-10-10 15:23:19,056 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:23:19,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:23:25,901 INFO L134 CoverageAnalysis]: Checked inductivity of 30437 backedges. 0 proven. 29589 refuted. 0 times theorem prover too weak. 848 trivial. 0 not checked. [2018-10-10 15:23:25,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:23:25,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-10 15:23:25,903 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-10 15:23:25,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-10 15:23:25,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=516, Invalid=2346, Unknown=0, NotChecked=0, Total=2862 [2018-10-10 15:23:25,904 INFO L87 Difference]: Start difference. First operand 1412 states and 1432 transitions. Second operand 54 states. [2018-10-10 15:23:50,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:23:50,027 INFO L93 Difference]: Finished difference Result 1667 states and 1691 transitions. [2018-10-10 15:23:50,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 243 states. [2018-10-10 15:23:50,028 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 1411 [2018-10-10 15:23:50,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:23:50,033 INFO L225 Difference]: With dead ends: 1667 [2018-10-10 15:23:50,033 INFO L226 Difference]: Without dead ends: 1667 [2018-10-10 15:23:50,038 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 291 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33220 ImplicationChecksByTransitivity, 22.7s TimeCoverageRelationStatistics Valid=14645, Invalid=70911, Unknown=0, NotChecked=0, Total=85556 [2018-10-10 15:23:50,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2018-10-10 15:23:50,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1483. [2018-10-10 15:23:50,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1483 states. [2018-10-10 15:23:50,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1483 states to 1483 states and 1504 transitions. [2018-10-10 15:23:50,050 INFO L78 Accepts]: Start accepts. Automaton has 1483 states and 1504 transitions. Word has length 1411 [2018-10-10 15:23:50,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:23:50,051 INFO L481 AbstractCegarLoop]: Abstraction has 1483 states and 1504 transitions. [2018-10-10 15:23:50,051 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-10 15:23:50,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1483 states and 1504 transitions. [2018-10-10 15:23:50,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1483 [2018-10-10 15:23:50,070 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:23:50,071 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:23:50,071 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:23:50,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:23:50,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1959186821, now seen corresponding path program 24 times [2018-10-10 15:23:50,072 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:23:50,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:23:57,863 INFO L134 CoverageAnalysis]: Checked inductivity of 33708 backedges. 0 proven. 32812 refuted. 0 times theorem prover too weak. 896 trivial. 0 not checked. [2018-10-10 15:23:57,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:23:57,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-10-10 15:23:57,865 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-10 15:23:57,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-10 15:23:57,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=2519, Unknown=0, NotChecked=0, Total=3080 [2018-10-10 15:23:57,865 INFO L87 Difference]: Start difference. First operand 1483 states and 1504 transitions. Second operand 56 states. [2018-10-10 15:24:23,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:24:23,822 INFO L93 Difference]: Finished difference Result 1738 states and 1763 transitions. [2018-10-10 15:24:23,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 254 states. [2018-10-10 15:24:23,822 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 1482 [2018-10-10 15:24:23,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:24:23,827 INFO L225 Difference]: With dead ends: 1738 [2018-10-10 15:24:23,828 INFO L226 Difference]: Without dead ends: 1738 [2018-10-10 15:24:23,830 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 304 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36447 ImplicationChecksByTransitivity, 24.5s TimeCoverageRelationStatistics Valid=15956, Invalid=77374, Unknown=0, NotChecked=0, Total=93330 [2018-10-10 15:24:23,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2018-10-10 15:24:23,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1554. [2018-10-10 15:24:23,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1554 states. [2018-10-10 15:24:23,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 1554 states and 1576 transitions. [2018-10-10 15:24:23,842 INFO L78 Accepts]: Start accepts. Automaton has 1554 states and 1576 transitions. Word has length 1482 [2018-10-10 15:24:23,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:24:23,842 INFO L481 AbstractCegarLoop]: Abstraction has 1554 states and 1576 transitions. [2018-10-10 15:24:23,842 INFO L482 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-10 15:24:23,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 1576 transitions. [2018-10-10 15:24:23,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1554 [2018-10-10 15:24:23,860 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:24:23,861 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:24:23,861 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:24:23,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:24:23,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1662925332, now seen corresponding path program 25 times [2018-10-10 15:24:23,862 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:24:23,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:24:32,490 INFO L134 CoverageAnalysis]: Checked inductivity of 37146 backedges. 0 proven. 36202 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2018-10-10 15:24:32,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:24:32,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-10-10 15:24:32,491 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-10 15:24:32,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-10 15:24:32,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=608, Invalid=2698, Unknown=0, NotChecked=0, Total=3306 [2018-10-10 15:24:32,492 INFO L87 Difference]: Start difference. First operand 1554 states and 1576 transitions. Second operand 58 states. [2018-10-10 15:25:00,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:25:00,008 INFO L93 Difference]: Finished difference Result 1809 states and 1835 transitions. [2018-10-10 15:25:00,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 265 states. [2018-10-10 15:25:00,008 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 1553 [2018-10-10 15:25:00,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:25:00,014 INFO L225 Difference]: With dead ends: 1809 [2018-10-10 15:25:00,014 INFO L226 Difference]: Without dead ends: 1809 [2018-10-10 15:25:00,019 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 317 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39824 ImplicationChecksByTransitivity, 26.1s TimeCoverageRelationStatistics Valid=17324, Invalid=84118, Unknown=0, NotChecked=0, Total=101442 [2018-10-10 15:25:00,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2018-10-10 15:25:00,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1625. [2018-10-10 15:25:00,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1625 states. [2018-10-10 15:25:00,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1625 states to 1625 states and 1648 transitions. [2018-10-10 15:25:00,030 INFO L78 Accepts]: Start accepts. Automaton has 1625 states and 1648 transitions. Word has length 1553 [2018-10-10 15:25:00,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:25:00,031 INFO L481 AbstractCegarLoop]: Abstraction has 1625 states and 1648 transitions. [2018-10-10 15:25:00,031 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-10 15:25:00,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1625 states and 1648 transitions. [2018-10-10 15:25:00,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1625 [2018-10-10 15:25:00,048 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:25:00,049 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:25:00,049 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:25:00,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:25:00,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1945835429, now seen corresponding path program 26 times [2018-10-10 15:25:00,050 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:25:00,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:25:08,734 INFO L134 CoverageAnalysis]: Checked inductivity of 40751 backedges. 0 proven. 39759 refuted. 0 times theorem prover too weak. 992 trivial. 0 not checked. [2018-10-10 15:25:08,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:25:08,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-10-10 15:25:08,736 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-10 15:25:08,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-10 15:25:08,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=657, Invalid=2883, Unknown=0, NotChecked=0, Total=3540 [2018-10-10 15:25:08,736 INFO L87 Difference]: Start difference. First operand 1625 states and 1648 transitions. Second operand 60 states. [2018-10-10 15:25:37,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:25:37,690 INFO L93 Difference]: Finished difference Result 1880 states and 1907 transitions. [2018-10-10 15:25:37,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 276 states. [2018-10-10 15:25:37,690 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 1624 [2018-10-10 15:25:37,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:25:37,696 INFO L225 Difference]: With dead ends: 1880 [2018-10-10 15:25:37,696 INFO L226 Difference]: Without dead ends: 1880 [2018-10-10 15:25:37,700 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 330 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43351 ImplicationChecksByTransitivity, 26.8s TimeCoverageRelationStatistics Valid=18749, Invalid=91143, Unknown=0, NotChecked=0, Total=109892 [2018-10-10 15:25:37,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1880 states. [2018-10-10 15:25:37,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1880 to 1696. [2018-10-10 15:25:37,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1696 states. [2018-10-10 15:25:37,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1696 states to 1696 states and 1720 transitions. [2018-10-10 15:25:37,712 INFO L78 Accepts]: Start accepts. Automaton has 1696 states and 1720 transitions. Word has length 1624 [2018-10-10 15:25:37,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:25:37,713 INFO L481 AbstractCegarLoop]: Abstraction has 1696 states and 1720 transitions. [2018-10-10 15:25:37,713 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-10 15:25:37,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1696 states and 1720 transitions. [2018-10-10 15:25:37,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1696 [2018-10-10 15:25:37,728 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:25:37,729 INFO L375 BasicCegarLoop]: trace histogram [69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:25:37,729 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:25:37,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:25:37,730 INFO L82 PathProgramCache]: Analyzing trace with hash 838425548, now seen corresponding path program 27 times [2018-10-10 15:25:37,730 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:25:37,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:25:47,742 INFO L134 CoverageAnalysis]: Checked inductivity of 44523 backedges. 0 proven. 43483 refuted. 0 times theorem prover too weak. 1040 trivial. 0 not checked. [2018-10-10 15:25:47,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:25:47,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-10-10 15:25:47,744 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-10 15:25:47,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-10 15:25:47,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=708, Invalid=3074, Unknown=0, NotChecked=0, Total=3782 [2018-10-10 15:25:47,745 INFO L87 Difference]: Start difference. First operand 1696 states and 1720 transitions. Second operand 62 states. [2018-10-10 15:26:17,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:26:17,440 INFO L93 Difference]: Finished difference Result 1951 states and 1979 transitions. [2018-10-10 15:26:17,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 287 states. [2018-10-10 15:26:17,449 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 1695 [2018-10-10 15:26:17,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:26:17,456 INFO L225 Difference]: With dead ends: 1951 [2018-10-10 15:26:17,457 INFO L226 Difference]: Without dead ends: 1951 [2018-10-10 15:26:17,462 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 343 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47028 ImplicationChecksByTransitivity, 29.4s TimeCoverageRelationStatistics Valid=20231, Invalid=98449, Unknown=0, NotChecked=0, Total=118680 [2018-10-10 15:26:17,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1951 states. [2018-10-10 15:26:17,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1951 to 1767. [2018-10-10 15:26:17,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1767 states. [2018-10-10 15:26:17,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1767 states to 1767 states and 1792 transitions. [2018-10-10 15:26:17,478 INFO L78 Accepts]: Start accepts. Automaton has 1767 states and 1792 transitions. Word has length 1695 [2018-10-10 15:26:17,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:26:17,479 INFO L481 AbstractCegarLoop]: Abstraction has 1767 states and 1792 transitions. [2018-10-10 15:26:17,479 INFO L482 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-10 15:26:17,480 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 1792 transitions. [2018-10-10 15:26:17,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1767 [2018-10-10 15:26:17,497 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:26:17,498 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:26:17,498 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:26:17,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:26:17,499 INFO L82 PathProgramCache]: Analyzing trace with hash -72866363, now seen corresponding path program 28 times [2018-10-10 15:26:17,499 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:26:17,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:26:27,523 INFO L134 CoverageAnalysis]: Checked inductivity of 48462 backedges. 0 proven. 47374 refuted. 0 times theorem prover too weak. 1088 trivial. 0 not checked. [2018-10-10 15:26:27,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:26:27,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-10-10 15:26:27,525 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-10 15:26:27,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-10 15:26:27,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=761, Invalid=3271, Unknown=0, NotChecked=0, Total=4032 [2018-10-10 15:26:27,525 INFO L87 Difference]: Start difference. First operand 1767 states and 1792 transitions. Second operand 64 states. [2018-10-10 15:26:58,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:26:58,847 INFO L93 Difference]: Finished difference Result 2022 states and 2051 transitions. [2018-10-10 15:26:58,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 298 states. [2018-10-10 15:26:58,847 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 1766 [2018-10-10 15:26:58,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:26:58,853 INFO L225 Difference]: With dead ends: 2022 [2018-10-10 15:26:58,853 INFO L226 Difference]: Without dead ends: 2022 [2018-10-10 15:26:58,857 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 356 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50855 ImplicationChecksByTransitivity, 30.5s TimeCoverageRelationStatistics Valid=21770, Invalid=106036, Unknown=0, NotChecked=0, Total=127806 [2018-10-10 15:26:58,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2022 states. [2018-10-10 15:26:58,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2022 to 1838. [2018-10-10 15:26:58,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2018-10-10 15:26:58,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 1864 transitions. [2018-10-10 15:26:58,870 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 1864 transitions. Word has length 1766 [2018-10-10 15:26:58,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:26:58,871 INFO L481 AbstractCegarLoop]: Abstraction has 1838 states and 1864 transitions. [2018-10-10 15:26:58,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-10 15:26:58,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 1864 transitions. [2018-10-10 15:26:58,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1838 [2018-10-10 15:26:58,892 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:26:58,893 INFO L375 BasicCegarLoop]: trace histogram [75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:26:58,893 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:26:58,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:26:58,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1692871084, now seen corresponding path program 29 times [2018-10-10 15:26:58,894 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:26:58,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:27:10,461 INFO L134 CoverageAnalysis]: Checked inductivity of 52568 backedges. 0 proven. 51432 refuted. 0 times theorem prover too weak. 1136 trivial. 0 not checked. [2018-10-10 15:27:10,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:27:10,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-10-10 15:27:10,463 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-10 15:27:10,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-10 15:27:10,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=816, Invalid=3474, Unknown=0, NotChecked=0, Total=4290 [2018-10-10 15:27:10,464 INFO L87 Difference]: Start difference. First operand 1838 states and 1864 transitions. Second operand 66 states.