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/ArraysOfVariableLength5_true-valid-memsafety.c_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-093a8c0 [2018-10-14 16:25:28,231 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-14 16:25:28,234 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-14 16:25:28,250 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-14 16:25:28,250 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-14 16:25:28,251 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-14 16:25:28,255 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-14 16:25:28,257 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-14 16:25:28,260 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-14 16:25:28,261 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-14 16:25:28,263 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-14 16:25:28,264 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-14 16:25:28,265 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-14 16:25:28,266 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-14 16:25:28,274 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-14 16:25:28,275 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-14 16:25:28,276 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-14 16:25:28,279 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-14 16:25:28,281 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-14 16:25:28,286 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-14 16:25:28,288 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-14 16:25:28,289 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-14 16:25:28,294 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-14 16:25:28,294 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-14 16:25:28,295 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-14 16:25:28,296 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-14 16:25:28,297 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-14 16:25:28,297 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-14 16:25:28,300 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-14 16:25:28,302 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-14 16:25:28,302 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-14 16:25:28,303 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-14 16:25:28,303 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-14 16:25:28,303 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-14 16:25:28,306 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-14 16:25:28,307 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-14 16:25:28,307 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-14 16:25:28,320 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-14 16:25:28,320 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-14 16:25:28,321 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-14 16:25:28,321 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-14 16:25:28,321 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-14 16:25:28,322 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-14 16:25:28,325 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-14 16:25:28,325 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-14 16:25:28,326 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-14 16:25:28,326 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-14 16:25:28,326 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-14 16:25:28,326 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-14 16:25:28,326 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-14 16:25:28,328 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-14 16:25:28,328 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-14 16:25:28,384 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-14 16:25:28,404 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-14 16:25:28,411 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-14 16:25:28,413 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-14 16:25:28,413 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-14 16:25:28,414 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength5_true-valid-memsafety.c_12.bpl [2018-10-14 16:25:28,414 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength5_true-valid-memsafety.c_12.bpl' [2018-10-14 16:25:28,506 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-14 16:25:28,508 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-14 16:25:28,509 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-14 16:25:28,509 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-14 16:25:28,510 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-14 16:25:28,538 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArraysOfVariableLength5_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:25:28" (1/1) ... [2018-10-14 16:25:28,540 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArraysOfVariableLength5_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:25:28" (1/1) ... [2018-10-14 16:25:28,558 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArraysOfVariableLength5_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:25:28" (1/1) ... [2018-10-14 16:25:28,559 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArraysOfVariableLength5_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:25:28" (1/1) ... [2018-10-14 16:25:28,564 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArraysOfVariableLength5_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:25:28" (1/1) ... [2018-10-14 16:25:28,568 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArraysOfVariableLength5_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:25:28" (1/1) ... [2018-10-14 16:25:28,569 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArraysOfVariableLength5_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:25:28" (1/1) ... [2018-10-14 16:25:28,573 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-14 16:25:28,577 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-14 16:25:28,578 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-14 16:25:28,578 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-14 16:25:28,579 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArraysOfVariableLength5_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:25:28" (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-14 16:25:28,654 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-14 16:25:28,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-14 16:25:28,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-14 16:25:29,228 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-14 16:25:29,228 INFO L202 PluginConnector]: Adding new model ArraysOfVariableLength5_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:25:29 BoogieIcfgContainer [2018-10-14 16:25:29,229 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-14 16:25:29,230 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-14 16:25:29,230 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-14 16:25:29,233 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-14 16:25:29,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength5_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:25:28" (1/2) ... [2018-10-14 16:25:29,234 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31a92bb1 and model type ArraysOfVariableLength5_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:25:29, skipping insertion in model container [2018-10-14 16:25:29,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength5_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:25:29" (2/2) ... [2018-10-14 16:25:29,236 INFO L112 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength5_true-valid-memsafety.c_12.bpl [2018-10-14 16:25:29,246 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-14 16:25:29,254 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-14 16:25:29,271 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-14 16:25:29,300 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-14 16:25:29,301 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-14 16:25:29,301 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-14 16:25:29,301 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-14 16:25:29,301 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-14 16:25:29,301 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-14 16:25:29,301 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-14 16:25:29,302 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-14 16:25:29,302 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-14 16:25:29,319 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2018-10-14 16:25:29,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-14 16:25:29,330 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:25:29,331 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:25:29,332 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:25:29,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:25:29,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1145449833, now seen corresponding path program 1 times [2018-10-14 16:25:29,390 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:25:29,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:25:30,252 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-14 16:25:30,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 16:25:30,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-14 16:25:30,260 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-14 16:25:30,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-14 16:25:30,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-10-14 16:25:30,282 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 12 states. [2018-10-14 16:25:30,814 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-14 16:25:31,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:25:31,649 INFO L93 Difference]: Finished difference Result 141 states and 144 transitions. [2018-10-14 16:25:31,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-14 16:25:31,651 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2018-10-14 16:25:31,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:25:31,664 INFO L225 Difference]: With dead ends: 141 [2018-10-14 16:25:31,665 INFO L226 Difference]: Without dead ends: 141 [2018-10-14 16:25:31,668 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2018-10-14 16:25:31,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-10-14 16:25:31,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 103. [2018-10-14 16:25:31,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-10-14 16:25:31,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 105 transitions. [2018-10-14 16:25:31,717 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 105 transitions. Word has length 48 [2018-10-14 16:25:31,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:25:31,718 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 105 transitions. [2018-10-14 16:25:31,718 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-14 16:25:31,718 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 105 transitions. [2018-10-14 16:25:31,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-14 16:25:31,721 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:25:31,721 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] [2018-10-14 16:25:31,721 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:25:31,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:25:31,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1952169465, now seen corresponding path program 1 times [2018-10-14 16:25:31,723 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:25:31,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:25:31,919 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-14 16:25:31,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:25:31,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-14 16:25:31,922 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-14 16:25:31,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-14 16:25:31,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-14 16:25:31,923 INFO L87 Difference]: Start difference. First operand 103 states and 105 transitions. Second operand 8 states. [2018-10-14 16:25:32,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:25:32,522 INFO L93 Difference]: Finished difference Result 172 states and 175 transitions. [2018-10-14 16:25:32,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-14 16:25:32,523 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 74 [2018-10-14 16:25:32,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:25:32,526 INFO L225 Difference]: With dead ends: 172 [2018-10-14 16:25:32,527 INFO L226 Difference]: Without dead ends: 172 [2018-10-14 16:25:32,528 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-10-14 16:25:32,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-10-14 16:25:32,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 122. [2018-10-14 16:25:32,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-10-14 16:25:32,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 124 transitions. [2018-10-14 16:25:32,542 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 124 transitions. Word has length 74 [2018-10-14 16:25:32,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:25:32,543 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 124 transitions. [2018-10-14 16:25:32,543 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-14 16:25:32,543 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 124 transitions. [2018-10-14 16:25:32,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-14 16:25:32,546 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:25:32,547 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:25:32,547 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:25:32,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:25:32,547 INFO L82 PathProgramCache]: Analyzing trace with hash -721157772, now seen corresponding path program 1 times [2018-10-14 16:25:32,548 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:25:32,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:25:33,098 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-14 16:25:33,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:25:33,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-14 16:25:33,100 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-14 16:25:33,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-14 16:25:33,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-10-14 16:25:33,101 INFO L87 Difference]: Start difference. First operand 122 states and 124 transitions. Second operand 15 states. [2018-10-14 16:25:34,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:25:34,337 INFO L93 Difference]: Finished difference Result 182 states and 186 transitions. [2018-10-14 16:25:34,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-14 16:25:34,337 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 89 [2018-10-14 16:25:34,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:25:34,340 INFO L225 Difference]: With dead ends: 182 [2018-10-14 16:25:34,340 INFO L226 Difference]: Without dead ends: 182 [2018-10-14 16:25:34,341 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=192, Invalid=738, Unknown=0, NotChecked=0, Total=930 [2018-10-14 16:25:34,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-10-14 16:25:34,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 144. [2018-10-14 16:25:34,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-10-14 16:25:34,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 147 transitions. [2018-10-14 16:25:34,354 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 147 transitions. Word has length 89 [2018-10-14 16:25:34,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:25:34,355 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 147 transitions. [2018-10-14 16:25:34,355 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-14 16:25:34,355 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 147 transitions. [2018-10-14 16:25:34,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-14 16:25:34,357 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:25:34,358 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:25:34,358 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:25:34,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:25:34,359 INFO L82 PathProgramCache]: Analyzing trace with hash 310169170, now seen corresponding path program 2 times [2018-10-14 16:25:34,361 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:25:34,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:25:34,589 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 18 proven. 46 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-14 16:25:34,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:25:34,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-14 16:25:34,590 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-14 16:25:34,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-14 16:25:34,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-10-14 16:25:34,591 INFO L87 Difference]: Start difference. First operand 144 states and 147 transitions. Second operand 10 states. [2018-10-14 16:25:35,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:25:35,074 INFO L93 Difference]: Finished difference Result 171 states and 174 transitions. [2018-10-14 16:25:35,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-14 16:25:35,075 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 115 [2018-10-14 16:25:35,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:25:35,078 INFO L225 Difference]: With dead ends: 171 [2018-10-14 16:25:35,078 INFO L226 Difference]: Without dead ends: 171 [2018-10-14 16:25:35,079 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2018-10-14 16:25:35,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-10-14 16:25:35,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 145. [2018-10-14 16:25:35,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-10-14 16:25:35,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 148 transitions. [2018-10-14 16:25:35,091 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 148 transitions. Word has length 115 [2018-10-14 16:25:35,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:25:35,091 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 148 transitions. [2018-10-14 16:25:35,091 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-14 16:25:35,092 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 148 transitions. [2018-10-14 16:25:35,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-14 16:25:35,094 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:25:35,095 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:25:35,095 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:25:35,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:25:35,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1640106551, now seen corresponding path program 3 times [2018-10-14 16:25:35,096 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:25:35,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:25:35,336 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 18 proven. 64 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-14 16:25:35,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:25:35,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-14 16:25:35,338 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-14 16:25:35,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-14 16:25:35,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-10-14 16:25:35,339 INFO L87 Difference]: Start difference. First operand 145 states and 148 transitions. Second operand 12 states. [2018-10-14 16:25:35,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:25:35,902 INFO L93 Difference]: Finished difference Result 173 states and 176 transitions. [2018-10-14 16:25:35,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-14 16:25:35,903 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 130 [2018-10-14 16:25:35,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:25:35,905 INFO L225 Difference]: With dead ends: 173 [2018-10-14 16:25:35,905 INFO L226 Difference]: Without dead ends: 173 [2018-10-14 16:25:35,910 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=477, Unknown=0, NotChecked=0, Total=600 [2018-10-14 16:25:35,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-10-14 16:25:35,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 160. [2018-10-14 16:25:35,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-10-14 16:25:35,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 163 transitions. [2018-10-14 16:25:35,919 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 163 transitions. Word has length 130 [2018-10-14 16:25:35,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:25:35,920 INFO L481 AbstractCegarLoop]: Abstraction has 160 states and 163 transitions. [2018-10-14 16:25:35,920 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-14 16:25:35,920 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 163 transitions. [2018-10-14 16:25:35,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-14 16:25:35,923 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:25:35,923 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:25:35,923 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:25:35,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:25:35,924 INFO L82 PathProgramCache]: Analyzing trace with hash 200806770, now seen corresponding path program 4 times [2018-10-14 16:25:35,925 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:25:35,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:25:36,670 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-14 16:25:36,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:25:36,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-14 16:25:36,671 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-14 16:25:36,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-14 16:25:36,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2018-10-14 16:25:36,672 INFO L87 Difference]: Start difference. First operand 160 states and 163 transitions. Second operand 18 states. [2018-10-14 16:25:37,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:25:37,997 INFO L93 Difference]: Finished difference Result 270 states and 275 transitions. [2018-10-14 16:25:38,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-14 16:25:38,007 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 145 [2018-10-14 16:25:38,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:25:38,009 INFO L225 Difference]: With dead ends: 270 [2018-10-14 16:25:38,009 INFO L226 Difference]: Without dead ends: 270 [2018-10-14 16:25:38,010 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=242, Invalid=1090, Unknown=0, NotChecked=0, Total=1332 [2018-10-14 16:25:38,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-10-14 16:25:38,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 216. [2018-10-14 16:25:38,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-10-14 16:25:38,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 220 transitions. [2018-10-14 16:25:38,019 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 220 transitions. Word has length 145 [2018-10-14 16:25:38,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:25:38,020 INFO L481 AbstractCegarLoop]: Abstraction has 216 states and 220 transitions. [2018-10-14 16:25:38,020 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-14 16:25:38,020 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 220 transitions. [2018-10-14 16:25:38,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-10-14 16:25:38,024 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:25:38,024 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:25:38,024 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:25:38,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:25:38,025 INFO L82 PathProgramCache]: Analyzing trace with hash -866906256, now seen corresponding path program 5 times [2018-10-14 16:25:38,026 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:25:38,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:25:39,134 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 88 proven. 196 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-14 16:25:39,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:25:39,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-14 16:25:39,135 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-14 16:25:39,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-14 16:25:39,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-10-14 16:25:39,136 INFO L87 Difference]: Start difference. First operand 216 states and 220 transitions. Second operand 16 states. [2018-10-14 16:25:39,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:25:39,999 INFO L93 Difference]: Finished difference Result 244 states and 248 transitions. [2018-10-14 16:25:39,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-14 16:25:39,999 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 201 [2018-10-14 16:25:40,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:25:40,001 INFO L225 Difference]: With dead ends: 244 [2018-10-14 16:25:40,002 INFO L226 Difference]: Without dead ends: 244 [2018-10-14 16:25:40,003 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=232, Invalid=958, Unknown=0, NotChecked=0, Total=1190 [2018-10-14 16:25:40,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-10-14 16:25:40,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 231. [2018-10-14 16:25:40,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-10-14 16:25:40,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 235 transitions. [2018-10-14 16:25:40,010 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 235 transitions. Word has length 201 [2018-10-14 16:25:40,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:25:40,011 INFO L481 AbstractCegarLoop]: Abstraction has 231 states and 235 transitions. [2018-10-14 16:25:40,011 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-14 16:25:40,011 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 235 transitions. [2018-10-14 16:25:40,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-10-14 16:25:40,015 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:25:40,016 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:25:40,016 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:25:40,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:25:40,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1812687637, now seen corresponding path program 6 times [2018-10-14 16:25:40,021 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:25:40,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:25:40,844 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-14 16:25:41,430 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 348 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-10-14 16:25:41,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:25:41,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-14 16:25:41,431 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-14 16:25:41,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-14 16:25:41,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2018-10-14 16:25:41,432 INFO L87 Difference]: Start difference. First operand 231 states and 235 transitions. Second operand 26 states. [2018-10-14 16:25:46,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:25:46,644 INFO L93 Difference]: Finished difference Result 472 states and 479 transitions. [2018-10-14 16:25:46,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-14 16:25:46,645 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 216 [2018-10-14 16:25:46,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:25:46,647 INFO L225 Difference]: With dead ends: 472 [2018-10-14 16:25:46,647 INFO L226 Difference]: Without dead ends: 472 [2018-10-14 16:25:46,649 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2052 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1316, Invalid=5994, Unknown=0, NotChecked=0, Total=7310 [2018-10-14 16:25:46,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2018-10-14 16:25:46,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 288. [2018-10-14 16:25:46,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-10-14 16:25:46,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 292 transitions. [2018-10-14 16:25:46,656 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 292 transitions. Word has length 216 [2018-10-14 16:25:46,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:25:46,657 INFO L481 AbstractCegarLoop]: Abstraction has 288 states and 292 transitions. [2018-10-14 16:25:46,657 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-14 16:25:46,657 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 292 transitions. [2018-10-14 16:25:46,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-10-14 16:25:46,662 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:25:46,662 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:25:46,662 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:25:46,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:25:46,663 INFO L82 PathProgramCache]: Analyzing trace with hash 139865938, now seen corresponding path program 7 times [2018-10-14 16:25:46,663 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:25:46,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:25:47,536 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 0 proven. 732 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-10-14 16:25:47,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:25:47,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-14 16:25:47,537 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-14 16:25:47,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-14 16:25:47,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=662, Unknown=0, NotChecked=0, Total=756 [2018-10-14 16:25:47,538 INFO L87 Difference]: Start difference. First operand 288 states and 292 transitions. Second operand 28 states. [2018-10-14 16:25:50,409 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2018-10-14 16:25:53,948 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-10-14 16:25:54,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:25:54,063 INFO L93 Difference]: Finished difference Result 543 states and 551 transitions. [2018-10-14 16:25:54,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-14 16:25:54,063 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 287 [2018-10-14 16:25:54,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:25:54,068 INFO L225 Difference]: With dead ends: 543 [2018-10-14 16:25:54,069 INFO L226 Difference]: Without dead ends: 543 [2018-10-14 16:25:54,072 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2875 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1695, Invalid=8007, Unknown=0, NotChecked=0, Total=9702 [2018-10-14 16:25:54,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2018-10-14 16:25:54,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 359. [2018-10-14 16:25:54,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-10-14 16:25:54,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 364 transitions. [2018-10-14 16:25:54,080 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 364 transitions. Word has length 287 [2018-10-14 16:25:54,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:25:54,080 INFO L481 AbstractCegarLoop]: Abstraction has 359 states and 364 transitions. [2018-10-14 16:25:54,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-14 16:25:54,081 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 364 transitions. [2018-10-14 16:25:54,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2018-10-14 16:25:54,085 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:25:54,085 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:25:54,086 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:25:54,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:25:54,086 INFO L82 PathProgramCache]: Analyzing trace with hash -105768181, now seen corresponding path program 8 times [2018-10-14 16:25:54,087 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:25:54,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:25:55,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1412 backedges. 0 proven. 1283 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2018-10-14 16:25:55,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:25:55,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-14 16:25:55,399 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-14 16:25:55,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-14 16:25:55,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=761, Unknown=0, NotChecked=0, Total=870 [2018-10-14 16:25:55,400 INFO L87 Difference]: Start difference. First operand 359 states and 364 transitions. Second operand 30 states. [2018-10-14 16:25:58,761 WARN L179 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2018-10-14 16:26:00,573 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2018-10-14 16:26:01,894 WARN L179 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2018-10-14 16:26:03,838 WARN L179 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-10-14 16:26:04,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:26:04,655 INFO L93 Difference]: Finished difference Result 614 states and 623 transitions. [2018-10-14 16:26:04,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-14 16:26:04,656 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 358 [2018-10-14 16:26:04,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:26:04,659 INFO L225 Difference]: With dead ends: 614 [2018-10-14 16:26:04,659 INFO L226 Difference]: Without dead ends: 614 [2018-10-14 16:26:04,663 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3850 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=2133, Invalid=10299, Unknown=0, NotChecked=0, Total=12432 [2018-10-14 16:26:04,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2018-10-14 16:26:04,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 430. [2018-10-14 16:26:04,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-10-14 16:26:04,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 436 transitions. [2018-10-14 16:26:04,671 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 436 transitions. Word has length 358 [2018-10-14 16:26:04,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:26:04,672 INFO L481 AbstractCegarLoop]: Abstraction has 430 states and 436 transitions. [2018-10-14 16:26:04,672 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-14 16:26:04,672 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 436 transitions. [2018-10-14 16:26:04,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2018-10-14 16:26:04,675 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:26:04,675 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:26:04,675 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:26:04,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:26:04,676 INFO L82 PathProgramCache]: Analyzing trace with hash -268663502, now seen corresponding path program 9 times [2018-10-14 16:26:04,676 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:26:04,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:26:05,742 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-14 16:26:06,350 INFO L134 CoverageAnalysis]: Checked inductivity of 2178 backedges. 0 proven. 2001 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2018-10-14 16:26:06,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:26:06,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-14 16:26:06,351 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-14 16:26:06,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-14 16:26:06,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=866, Unknown=0, NotChecked=0, Total=992 [2018-10-14 16:26:06,352 INFO L87 Difference]: Start difference. First operand 430 states and 436 transitions. Second operand 32 states. [2018-10-14 16:26:08,165 WARN L179 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2018-10-14 16:26:10,098 WARN L179 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2018-10-14 16:26:13,139 WARN L179 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2018-10-14 16:26:15,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:26:15,584 INFO L93 Difference]: Finished difference Result 685 states and 695 transitions. [2018-10-14 16:26:15,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-10-14 16:26:15,585 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 429 [2018-10-14 16:26:15,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:26:15,589 INFO L225 Difference]: With dead ends: 685 [2018-10-14 16:26:15,589 INFO L226 Difference]: Without dead ends: 685 [2018-10-14 16:26:15,594 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4977 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=2630, Invalid=12870, Unknown=0, NotChecked=0, Total=15500 [2018-10-14 16:26:15,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2018-10-14 16:26:15,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 501. [2018-10-14 16:26:15,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2018-10-14 16:26:15,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 508 transitions. [2018-10-14 16:26:15,603 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 508 transitions. Word has length 429 [2018-10-14 16:26:15,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:26:15,604 INFO L481 AbstractCegarLoop]: Abstraction has 501 states and 508 transitions. [2018-10-14 16:26:15,604 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-14 16:26:15,604 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 508 transitions. [2018-10-14 16:26:15,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2018-10-14 16:26:15,607 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:26:15,607 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:26:15,608 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:26:15,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:26:15,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1253599531, now seen corresponding path program 10 times [2018-10-14 16:26:15,609 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:26:15,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:26:17,180 INFO L134 CoverageAnalysis]: Checked inductivity of 3111 backedges. 0 proven. 2886 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-10-14 16:26:17,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:26:17,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-14 16:26:17,182 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-14 16:26:17,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-14 16:26:17,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=977, Unknown=0, NotChecked=0, Total=1122 [2018-10-14 16:26:17,182 INFO L87 Difference]: Start difference. First operand 501 states and 508 transitions. Second operand 34 states. [2018-10-14 16:26:19,605 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2018-10-14 16:26:26,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:26:26,524 INFO L93 Difference]: Finished difference Result 756 states and 767 transitions. [2018-10-14 16:26:26,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-10-14 16:26:26,525 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 500 [2018-10-14 16:26:26,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:26:26,529 INFO L225 Difference]: With dead ends: 756 [2018-10-14 16:26:26,529 INFO L226 Difference]: Without dead ends: 756 [2018-10-14 16:26:26,535 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6256 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=3186, Invalid=15720, Unknown=0, NotChecked=0, Total=18906 [2018-10-14 16:26:26,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2018-10-14 16:26:26,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 572. [2018-10-14 16:26:26,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572 states. [2018-10-14 16:26:26,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 580 transitions. [2018-10-14 16:26:26,548 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 580 transitions. Word has length 500 [2018-10-14 16:26:26,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:26:26,549 INFO L481 AbstractCegarLoop]: Abstraction has 572 states and 580 transitions. [2018-10-14 16:26:26,549 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-14 16:26:26,549 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 580 transitions. [2018-10-14 16:26:26,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2018-10-14 16:26:26,553 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:26:26,553 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:26:26,554 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:26:26,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:26:26,554 INFO L82 PathProgramCache]: Analyzing trace with hash -928443630, now seen corresponding path program 11 times [2018-10-14 16:26:26,555 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:26:26,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:26:28,373 INFO L134 CoverageAnalysis]: Checked inductivity of 4211 backedges. 0 proven. 3938 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2018-10-14 16:26:28,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:26:28,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-14 16:26:28,374 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-14 16:26:28,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-14 16:26:28,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1094, Unknown=0, NotChecked=0, Total=1260 [2018-10-14 16:26:28,375 INFO L87 Difference]: Start difference. First operand 572 states and 580 transitions. Second operand 36 states. [2018-10-14 16:26:38,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:26:38,761 INFO L93 Difference]: Finished difference Result 827 states and 839 transitions. [2018-10-14 16:26:38,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-10-14 16:26:38,761 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 571 [2018-10-14 16:26:38,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:26:38,765 INFO L225 Difference]: With dead ends: 827 [2018-10-14 16:26:38,766 INFO L226 Difference]: Without dead ends: 827 [2018-10-14 16:26:38,768 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7687 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=3801, Invalid=18849, Unknown=0, NotChecked=0, Total=22650 [2018-10-14 16:26:38,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2018-10-14 16:26:38,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 643. [2018-10-14 16:26:38,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2018-10-14 16:26:38,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 652 transitions. [2018-10-14 16:26:38,779 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 652 transitions. Word has length 571 [2018-10-14 16:26:38,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:26:38,780 INFO L481 AbstractCegarLoop]: Abstraction has 643 states and 652 transitions. [2018-10-14 16:26:38,781 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-14 16:26:38,781 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 652 transitions. [2018-10-14 16:26:38,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 643 [2018-10-14 16:26:38,785 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:26:38,786 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:26:38,786 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:26:38,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:26:38,786 INFO L82 PathProgramCache]: Analyzing trace with hash 529104715, now seen corresponding path program 12 times [2018-10-14 16:26:38,787 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:26:38,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:26:39,927 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-14 16:26:42,200 INFO L134 CoverageAnalysis]: Checked inductivity of 5478 backedges. 0 proven. 5157 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2018-10-14 16:26:42,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:26:42,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-14 16:26:42,202 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-14 16:26:42,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-14 16:26:42,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1217, Unknown=0, NotChecked=0, Total=1406 [2018-10-14 16:26:42,202 INFO L87 Difference]: Start difference. First operand 643 states and 652 transitions. Second operand 38 states. [2018-10-14 16:26:53,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:26:53,647 INFO L93 Difference]: Finished difference Result 898 states and 911 transitions. [2018-10-14 16:26:53,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-10-14 16:26:53,647 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 642 [2018-10-14 16:26:53,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:26:53,652 INFO L225 Difference]: With dead ends: 898 [2018-10-14 16:26:53,652 INFO L226 Difference]: Without dead ends: 898 [2018-10-14 16:26:53,655 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9270 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=4475, Invalid=22257, Unknown=0, NotChecked=0, Total=26732 [2018-10-14 16:26:53,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2018-10-14 16:26:53,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 714. [2018-10-14 16:26:53,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 714 states. [2018-10-14 16:26:53,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 724 transitions. [2018-10-14 16:26:53,666 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 724 transitions. Word has length 642 [2018-10-14 16:26:53,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:26:53,667 INFO L481 AbstractCegarLoop]: Abstraction has 714 states and 724 transitions. [2018-10-14 16:26:53,667 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-14 16:26:53,667 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 724 transitions. [2018-10-14 16:26:53,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 714 [2018-10-14 16:26:53,672 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:26:53,673 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:26:53,673 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:26:53,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:26:53,673 INFO L82 PathProgramCache]: Analyzing trace with hash -744892174, now seen corresponding path program 13 times [2018-10-14 16:26:53,674 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:26:53,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:26:57,285 INFO L134 CoverageAnalysis]: Checked inductivity of 6912 backedges. 0 proven. 6543 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2018-10-14 16:26:57,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:26:57,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-14 16:26:57,286 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-14 16:26:57,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-14 16:26:57,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=1346, Unknown=0, NotChecked=0, Total=1560 [2018-10-14 16:26:57,287 INFO L87 Difference]: Start difference. First operand 714 states and 724 transitions. Second operand 40 states. [2018-10-14 16:27:09,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:27:09,512 INFO L93 Difference]: Finished difference Result 969 states and 983 transitions. [2018-10-14 16:27:09,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-10-14 16:27:09,512 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 713 [2018-10-14 16:27:09,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:27:09,516 INFO L225 Difference]: With dead ends: 969 [2018-10-14 16:27:09,516 INFO L226 Difference]: Without dead ends: 969 [2018-10-14 16:27:09,520 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11005 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=5208, Invalid=25944, Unknown=0, NotChecked=0, Total=31152 [2018-10-14 16:27:09,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2018-10-14 16:27:09,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 785. [2018-10-14 16:27:09,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2018-10-14 16:27:09,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 796 transitions. [2018-10-14 16:27:09,532 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 796 transitions. Word has length 713 [2018-10-14 16:27:09,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:27:09,532 INFO L481 AbstractCegarLoop]: Abstraction has 785 states and 796 transitions. [2018-10-14 16:27:09,533 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-14 16:27:09,533 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 796 transitions. [2018-10-14 16:27:09,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 785 [2018-10-14 16:27:09,539 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:27:09,539 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:27:09,540 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:27:09,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:27:09,540 INFO L82 PathProgramCache]: Analyzing trace with hash -450405013, now seen corresponding path program 14 times [2018-10-14 16:27:09,541 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:27:09,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:27:13,799 INFO L134 CoverageAnalysis]: Checked inductivity of 8513 backedges. 0 proven. 8096 refuted. 0 times theorem prover too weak. 417 trivial. 0 not checked. [2018-10-14 16:27:13,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:27:13,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-14 16:27:13,800 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-14 16:27:13,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-14 16:27:13,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=1481, Unknown=0, NotChecked=0, Total=1722 [2018-10-14 16:27:13,801 INFO L87 Difference]: Start difference. First operand 785 states and 796 transitions. Second operand 42 states. [2018-10-14 16:27:27,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:27:27,990 INFO L93 Difference]: Finished difference Result 1040 states and 1055 transitions. [2018-10-14 16:27:27,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2018-10-14 16:27:27,991 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 784 [2018-10-14 16:27:27,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:27:27,994 INFO L225 Difference]: With dead ends: 1040 [2018-10-14 16:27:27,995 INFO L226 Difference]: Without dead ends: 1040 [2018-10-14 16:27:27,998 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12892 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=6000, Invalid=29910, Unknown=0, NotChecked=0, Total=35910 [2018-10-14 16:27:27,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2018-10-14 16:27:28,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 856. [2018-10-14 16:27:28,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-10-14 16:27:28,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 868 transitions. [2018-10-14 16:27:28,009 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 868 transitions. Word has length 784 [2018-10-14 16:27:28,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:27:28,010 INFO L481 AbstractCegarLoop]: Abstraction has 856 states and 868 transitions. [2018-10-14 16:27:28,010 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-14 16:27:28,010 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 868 transitions. [2018-10-14 16:27:28,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 856 [2018-10-14 16:27:28,016 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:27:28,017 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:27:28,017 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:27:28,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:27:28,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1837946578, now seen corresponding path program 15 times [2018-10-14 16:27:28,019 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:27:28,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:27:29,492 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-14 16:27:32,918 INFO L134 CoverageAnalysis]: Checked inductivity of 10281 backedges. 0 proven. 9816 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2018-10-14 16:27:32,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:27:32,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-14 16:27:32,920 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-14 16:27:32,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-14 16:27:32,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=1622, Unknown=0, NotChecked=0, Total=1892 [2018-10-14 16:27:32,921 INFO L87 Difference]: Start difference. First operand 856 states and 868 transitions. Second operand 44 states. [2018-10-14 16:27:39,466 WARN L179 SmtUtils]: Spent 717.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2018-10-14 16:27:49,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:27:49,141 INFO L93 Difference]: Finished difference Result 1111 states and 1127 transitions. [2018-10-14 16:27:49,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2018-10-14 16:27:49,141 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 855 [2018-10-14 16:27:49,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:27:49,146 INFO L225 Difference]: With dead ends: 1111 [2018-10-14 16:27:49,146 INFO L226 Difference]: Without dead ends: 1111 [2018-10-14 16:27:49,151 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14931 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=6851, Invalid=34155, Unknown=0, NotChecked=0, Total=41006 [2018-10-14 16:27:49,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1111 states. [2018-10-14 16:27:49,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1111 to 927. [2018-10-14 16:27:49,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2018-10-14 16:27:49,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 940 transitions. [2018-10-14 16:27:49,164 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 940 transitions. Word has length 855 [2018-10-14 16:27:49,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:27:49,165 INFO L481 AbstractCegarLoop]: Abstraction has 927 states and 940 transitions. [2018-10-14 16:27:49,165 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-14 16:27:49,165 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 940 transitions. [2018-10-14 16:27:49,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 927 [2018-10-14 16:27:49,174 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:27:49,174 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:27:49,174 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:27:49,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:27:49,175 INFO L82 PathProgramCache]: Analyzing trace with hash -49020021, now seen corresponding path program 16 times [2018-10-14 16:27:49,176 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:27:49,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:27:53,495 INFO L134 CoverageAnalysis]: Checked inductivity of 12216 backedges. 0 proven. 11703 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2018-10-14 16:27:53,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:27:53,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-14 16:27:53,496 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-14 16:27:53,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-14 16:27:53,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=1769, Unknown=0, NotChecked=0, Total=2070 [2018-10-14 16:27:53,497 INFO L87 Difference]: Start difference. First operand 927 states and 940 transitions. Second operand 46 states. [2018-10-14 16:28:10,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:28:10,591 INFO L93 Difference]: Finished difference Result 1182 states and 1199 transitions. [2018-10-14 16:28:10,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2018-10-14 16:28:10,591 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 926 [2018-10-14 16:28:10,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:28:10,595 INFO L225 Difference]: With dead ends: 1182 [2018-10-14 16:28:10,595 INFO L226 Difference]: Without dead ends: 1182 [2018-10-14 16:28:10,597 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17122 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=7761, Invalid=38679, Unknown=0, NotChecked=0, Total=46440 [2018-10-14 16:28:10,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2018-10-14 16:28:10,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 998. [2018-10-14 16:28:10,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states. [2018-10-14 16:28:10,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1012 transitions. [2018-10-14 16:28:10,610 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1012 transitions. Word has length 926 [2018-10-14 16:28:10,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:28:10,610 INFO L481 AbstractCegarLoop]: Abstraction has 998 states and 1012 transitions. [2018-10-14 16:28:10,611 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-14 16:28:10,611 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1012 transitions. [2018-10-14 16:28:10,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 998 [2018-10-14 16:28:10,619 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:28:10,620 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:28:10,620 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:28:10,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:28:10,621 INFO L82 PathProgramCache]: Analyzing trace with hash -289403726, now seen corresponding path program 17 times [2018-10-14 16:28:10,621 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:28:10,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:28:15,841 INFO L134 CoverageAnalysis]: Checked inductivity of 14318 backedges. 0 proven. 13757 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2018-10-14 16:28:15,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:28:15,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-14 16:28:15,842 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-14 16:28:15,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-14 16:28:15,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=334, Invalid=1922, Unknown=0, NotChecked=0, Total=2256 [2018-10-14 16:28:15,843 INFO L87 Difference]: Start difference. First operand 998 states and 1012 transitions. Second operand 48 states. [2018-10-14 16:28:28,298 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2018-10-14 16:28:33,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:28:33,517 INFO L93 Difference]: Finished difference Result 1253 states and 1271 transitions. [2018-10-14 16:28:33,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2018-10-14 16:28:33,517 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 997 [2018-10-14 16:28:33,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:28:33,521 INFO L225 Difference]: With dead ends: 1253 [2018-10-14 16:28:33,522 INFO L226 Difference]: Without dead ends: 1253 [2018-10-14 16:28:33,524 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19465 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=8730, Invalid=43482, Unknown=0, NotChecked=0, Total=52212 [2018-10-14 16:28:33,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2018-10-14 16:28:33,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 1069. [2018-10-14 16:28:33,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1069 states. [2018-10-14 16:28:33,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 1084 transitions. [2018-10-14 16:28:33,536 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 1084 transitions. Word has length 997 [2018-10-14 16:28:33,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:28:33,537 INFO L481 AbstractCegarLoop]: Abstraction has 1069 states and 1084 transitions. [2018-10-14 16:28:33,537 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-14 16:28:33,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1084 transitions. [2018-10-14 16:28:33,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1069 [2018-10-14 16:28:33,547 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:28:33,547 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:28:33,548 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:28:33,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:28:33,548 INFO L82 PathProgramCache]: Analyzing trace with hash -581865045, now seen corresponding path program 18 times [2018-10-14 16:28:33,549 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:28:33,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:28:38,363 INFO L134 CoverageAnalysis]: Checked inductivity of 16587 backedges. 0 proven. 15978 refuted. 0 times theorem prover too weak. 609 trivial. 0 not checked. [2018-10-14 16:28:38,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:28:38,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-14 16:28:38,364 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-14 16:28:38,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-14 16:28:38,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=369, Invalid=2081, Unknown=0, NotChecked=0, Total=2450 [2018-10-14 16:28:38,365 INFO L87 Difference]: Start difference. First operand 1069 states and 1084 transitions. Second operand 50 states. [2018-10-14 16:28:58,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:28:58,474 INFO L93 Difference]: Finished difference Result 1324 states and 1343 transitions. [2018-10-14 16:28:58,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2018-10-14 16:28:58,474 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 1068 [2018-10-14 16:28:58,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:28:58,478 INFO L225 Difference]: With dead ends: 1324 [2018-10-14 16:28:58,478 INFO L226 Difference]: Without dead ends: 1324 [2018-10-14 16:28:58,482 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21960 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=9758, Invalid=48564, Unknown=0, NotChecked=0, Total=58322 [2018-10-14 16:28:58,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1324 states. [2018-10-14 16:28:58,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1324 to 1140. [2018-10-14 16:28:58,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1140 states. [2018-10-14 16:28:58,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 1156 transitions. [2018-10-14 16:28:58,495 INFO L78 Accepts]: Start accepts. Automaton has 1140 states and 1156 transitions. Word has length 1068 [2018-10-14 16:28:58,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:28:58,496 INFO L481 AbstractCegarLoop]: Abstraction has 1140 states and 1156 transitions. [2018-10-14 16:28:58,496 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-14 16:28:58,496 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1156 transitions. [2018-10-14 16:28:58,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1140 [2018-10-14 16:28:58,507 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:28:58,508 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:28:58,508 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:28:58,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:28:58,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1963885934, now seen corresponding path program 19 times [2018-10-14 16:28:58,510 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:28:58,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:29:03,888 INFO L134 CoverageAnalysis]: Checked inductivity of 19023 backedges. 0 proven. 18366 refuted. 0 times theorem prover too weak. 657 trivial. 0 not checked. [2018-10-14 16:29:03,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:29:03,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-14 16:29:03,890 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-14 16:29:03,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-14 16:29:03,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=2246, Unknown=0, NotChecked=0, Total=2652 [2018-10-14 16:29:03,891 INFO L87 Difference]: Start difference. First operand 1140 states and 1156 transitions. Second operand 52 states. [2018-10-14 16:29:09,449 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2018-10-14 16:29:25,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:29:25,867 INFO L93 Difference]: Finished difference Result 1395 states and 1415 transitions. [2018-10-14 16:29:25,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 209 states. [2018-10-14 16:29:25,867 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 1139 [2018-10-14 16:29:25,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:29:25,872 INFO L225 Difference]: With dead ends: 1395 [2018-10-14 16:29:25,872 INFO L226 Difference]: Without dead ends: 1395 [2018-10-14 16:29:25,875 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24607 ImplicationChecksByTransitivity, 19.8s TimeCoverageRelationStatistics Valid=10845, Invalid=53925, Unknown=0, NotChecked=0, Total=64770 [2018-10-14 16:29:25,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2018-10-14 16:29:25,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 1211. [2018-10-14 16:29:25,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1211 states. [2018-10-14 16:29:25,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 1211 states and 1228 transitions. [2018-10-14 16:29:25,888 INFO L78 Accepts]: Start accepts. Automaton has 1211 states and 1228 transitions. Word has length 1139 [2018-10-14 16:29:25,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:29:25,889 INFO L481 AbstractCegarLoop]: Abstraction has 1211 states and 1228 transitions. [2018-10-14 16:29:25,889 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-14 16:29:25,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 1228 transitions. [2018-10-14 16:29:25,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1211 [2018-10-14 16:29:25,902 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:29:25,903 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:29:25,903 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:29:25,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:29:25,904 INFO L82 PathProgramCache]: Analyzing trace with hash 811706315, now seen corresponding path program 20 times [2018-10-14 16:29:25,904 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:29:25,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:29:27,300 INFO L134 CoverageAnalysis]: Checked inductivity of 21626 backedges. 7367 proven. 452 refuted. 0 times theorem prover too weak. 13807 trivial. 0 not checked. [2018-10-14 16:29:27,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:29:27,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-14 16:29:27,302 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-14 16:29:27,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-14 16:29:27,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2018-10-14 16:29:27,302 INFO L87 Difference]: Start difference. First operand 1211 states and 1228 transitions. Second operand 20 states. [2018-10-14 16:29:28,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:29:28,214 INFO L93 Difference]: Finished difference Result 1421 states and 1438 transitions. [2018-10-14 16:29:28,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-14 16:29:28,215 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 1210 [2018-10-14 16:29:28,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:29:28,219 INFO L225 Difference]: With dead ends: 1421 [2018-10-14 16:29:28,219 INFO L226 Difference]: Without dead ends: 1421 [2018-10-14 16:29:28,220 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=375, Invalid=1517, Unknown=0, NotChecked=0, Total=1892 [2018-10-14 16:29:28,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2018-10-14 16:29:28,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 1421. [2018-10-14 16:29:28,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1421 states. [2018-10-14 16:29:28,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1421 states and 1438 transitions. [2018-10-14 16:29:28,233 INFO L78 Accepts]: Start accepts. Automaton has 1421 states and 1438 transitions. Word has length 1210 [2018-10-14 16:29:28,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:29:28,233 INFO L481 AbstractCegarLoop]: Abstraction has 1421 states and 1438 transitions. [2018-10-14 16:29:28,234 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-14 16:29:28,234 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 1438 transitions. [2018-10-14 16:29:28,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1421 [2018-10-14 16:29:28,249 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:29:28,250 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:29:28,250 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:29:28,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:29:28,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1413142415, now seen corresponding path program 21 times [2018-10-14 16:29:28,251 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:29:28,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:29:35,557 INFO L134 CoverageAnalysis]: Checked inductivity of 33323 backedges. 0 proven. 31990 refuted. 0 times theorem prover too weak. 1333 trivial. 0 not checked. [2018-10-14 16:29:35,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:29:35,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-14 16:29:35,558 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-14 16:29:35,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-14 16:29:35,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=445, Invalid=2417, Unknown=0, NotChecked=0, Total=2862 [2018-10-14 16:29:35,558 INFO L87 Difference]: Start difference. First operand 1421 states and 1438 transitions. Second operand 54 states. [2018-10-14 16:29:59,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:29:59,100 INFO L93 Difference]: Finished difference Result 1706 states and 1727 transitions. [2018-10-14 16:29:59,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 220 states. [2018-10-14 16:29:59,100 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 1420 [2018-10-14 16:29:59,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:29:59,105 INFO L225 Difference]: With dead ends: 1706 [2018-10-14 16:29:59,106 INFO L226 Difference]: Without dead ends: 1706 [2018-10-14 16:29:59,109 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 266 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27406 ImplicationChecksByTransitivity, 21.4s TimeCoverageRelationStatistics Valid=11991, Invalid=59565, Unknown=0, NotChecked=0, Total=71556 [2018-10-14 16:29:59,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2018-10-14 16:29:59,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1507. [2018-10-14 16:29:59,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1507 states. [2018-10-14 16:29:59,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1525 transitions. [2018-10-14 16:29:59,125 INFO L78 Accepts]: Start accepts. Automaton has 1507 states and 1525 transitions. Word has length 1420 [2018-10-14 16:29:59,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:29:59,126 INFO L481 AbstractCegarLoop]: Abstraction has 1507 states and 1525 transitions. [2018-10-14 16:29:59,126 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-14 16:29:59,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 1525 transitions. [2018-10-14 16:29:59,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1507 [2018-10-14 16:29:59,144 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:29:59,145 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:29:59,146 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:29:59,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:29:59,146 INFO L82 PathProgramCache]: Analyzing trace with hash 2031502445, now seen corresponding path program 22 times [2018-10-14 16:29:59,147 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:29:59,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:30:07,247 INFO L134 CoverageAnalysis]: Checked inductivity of 37731 backedges. 0 proven. 36304 refuted. 0 times theorem prover too weak. 1427 trivial. 0 not checked. [2018-10-14 16:30:07,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:30:07,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-10-14 16:30:07,248 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-14 16:30:07,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-14 16:30:07,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=486, Invalid=2594, Unknown=0, NotChecked=0, Total=3080 [2018-10-14 16:30:07,249 INFO L87 Difference]: Start difference. First operand 1507 states and 1525 transitions. Second operand 56 states. [2018-10-14 16:30:24,511 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2018-10-14 16:30:31,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:30:31,873 INFO L93 Difference]: Finished difference Result 1792 states and 1814 transitions. [2018-10-14 16:30:31,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 231 states. [2018-10-14 16:30:31,874 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 1506 [2018-10-14 16:30:31,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:30:31,879 INFO L225 Difference]: With dead ends: 1792 [2018-10-14 16:30:31,879 INFO L226 Difference]: Without dead ends: 1792 [2018-10-14 16:30:31,883 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 279 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30357 ImplicationChecksByTransitivity, 23.2s TimeCoverageRelationStatistics Valid=13196, Invalid=65484, Unknown=0, NotChecked=0, Total=78680 [2018-10-14 16:30:31,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1792 states. [2018-10-14 16:30:31,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1792 to 1593. [2018-10-14 16:30:31,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1593 states. [2018-10-14 16:30:31,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 1612 transitions. [2018-10-14 16:30:31,899 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 1612 transitions. Word has length 1506 [2018-10-14 16:30:31,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:30:31,900 INFO L481 AbstractCegarLoop]: Abstraction has 1593 states and 1612 transitions. [2018-10-14 16:30:31,900 INFO L482 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-14 16:30:31,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 1612 transitions. [2018-10-14 16:30:31,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1593 [2018-10-14 16:30:31,919 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:30:31,920 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:30:31,920 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:30:31,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:30:31,921 INFO L82 PathProgramCache]: Analyzing trace with hash 874096331, now seen corresponding path program 23 times [2018-10-14 16:30:31,921 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:30:32,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:30:33,010 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-14 16:30:40,735 INFO L134 CoverageAnalysis]: Checked inductivity of 42413 backedges. 0 proven. 40892 refuted. 0 times theorem prover too weak. 1521 trivial. 0 not checked. [2018-10-14 16:30:40,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:30:40,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-10-14 16:30:40,736 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-14 16:30:40,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-14 16:30:40,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=529, Invalid=2777, Unknown=0, NotChecked=0, Total=3306 [2018-10-14 16:30:40,737 INFO L87 Difference]: Start difference. First operand 1593 states and 1612 transitions. Second operand 58 states. [2018-10-14 16:31:08,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:31:08,667 INFO L93 Difference]: Finished difference Result 1878 states and 1901 transitions. [2018-10-14 16:31:08,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 242 states. [2018-10-14 16:31:08,667 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 1592 [2018-10-14 16:31:08,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:31:08,673 INFO L225 Difference]: With dead ends: 1878 [2018-10-14 16:31:08,673 INFO L226 Difference]: Without dead ends: 1878 [2018-10-14 16:31:08,677 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 292 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33460 ImplicationChecksByTransitivity, 25.4s TimeCoverageRelationStatistics Valid=14460, Invalid=71682, Unknown=0, NotChecked=0, Total=86142 [2018-10-14 16:31:08,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1878 states. [2018-10-14 16:31:08,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1878 to 1679. [2018-10-14 16:31:08,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1679 states. [2018-10-14 16:31:08,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1679 states to 1679 states and 1699 transitions. [2018-10-14 16:31:08,690 INFO L78 Accepts]: Start accepts. Automaton has 1679 states and 1699 transitions. Word has length 1592 [2018-10-14 16:31:08,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:31:08,691 INFO L481 AbstractCegarLoop]: Abstraction has 1679 states and 1699 transitions. [2018-10-14 16:31:08,691 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-14 16:31:08,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1679 states and 1699 transitions. [2018-10-14 16:31:08,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1679 [2018-10-14 16:31:08,712 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:31:08,713 INFO L375 BasicCegarLoop]: trace histogram [74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:31:08,713 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:31:08,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:31:08,714 INFO L82 PathProgramCache]: Analyzing trace with hash 756014761, now seen corresponding path program 24 times [2018-10-14 16:31:08,714 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:31:08,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:31:18,359 INFO L134 CoverageAnalysis]: Checked inductivity of 47369 backedges. 0 proven. 45754 refuted. 0 times theorem prover too weak. 1615 trivial. 0 not checked. [2018-10-14 16:31:18,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:31:18,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-10-14 16:31:18,361 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-14 16:31:18,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-14 16:31:18,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=574, Invalid=2966, Unknown=0, NotChecked=0, Total=3540 [2018-10-14 16:31:18,361 INFO L87 Difference]: Start difference. First operand 1679 states and 1699 transitions. Second operand 60 states. [2018-10-14 16:31:47,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:31:47,243 INFO L93 Difference]: Finished difference Result 1964 states and 1988 transitions. [2018-10-14 16:31:47,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 253 states. [2018-10-14 16:31:47,244 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 1678 [2018-10-14 16:31:47,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:31:47,250 INFO L225 Difference]: With dead ends: 1964 [2018-10-14 16:31:47,250 INFO L226 Difference]: Without dead ends: 1964 [2018-10-14 16:31:47,254 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 305 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36715 ImplicationChecksByTransitivity, 26.5s TimeCoverageRelationStatistics Valid=15783, Invalid=78159, Unknown=0, NotChecked=0, Total=93942 [2018-10-14 16:31:47,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2018-10-14 16:31:47,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1765. [2018-10-14 16:31:47,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1765 states. [2018-10-14 16:31:47,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1765 states to 1765 states and 1786 transitions. [2018-10-14 16:31:47,268 INFO L78 Accepts]: Start accepts. Automaton has 1765 states and 1786 transitions. Word has length 1678 [2018-10-14 16:31:47,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:31:47,269 INFO L481 AbstractCegarLoop]: Abstraction has 1765 states and 1786 transitions. [2018-10-14 16:31:47,269 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-14 16:31:47,269 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 1786 transitions. [2018-10-14 16:31:47,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1765 [2018-10-14 16:31:47,293 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:31:47,294 INFO L375 BasicCegarLoop]: trace histogram [78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:31:47,295 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:31:47,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:31:47,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1755591673, now seen corresponding path program 25 times [2018-10-14 16:31:47,296 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:31:47,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:31:57,629 INFO L134 CoverageAnalysis]: Checked inductivity of 52599 backedges. 0 proven. 50890 refuted. 0 times theorem prover too weak. 1709 trivial. 0 not checked. [2018-10-14 16:31:57,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:31:57,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-10-14 16:31:57,631 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-14 16:31:57,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-14 16:31:57,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=621, Invalid=3161, Unknown=0, NotChecked=0, Total=3782 [2018-10-14 16:31:57,632 INFO L87 Difference]: Start difference. First operand 1765 states and 1786 transitions. Second operand 62 states. [2018-10-14 16:32:28,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:32:28,419 INFO L93 Difference]: Finished difference Result 2050 states and 2075 transitions. [2018-10-14 16:32:28,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 264 states. [2018-10-14 16:32:28,419 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 1764 [2018-10-14 16:32:28,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:32:28,426 INFO L225 Difference]: With dead ends: 2050 [2018-10-14 16:32:28,427 INFO L226 Difference]: Without dead ends: 2050 [2018-10-14 16:32:28,430 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 318 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40122 ImplicationChecksByTransitivity, 28.0s TimeCoverageRelationStatistics Valid=17165, Invalid=84915, Unknown=0, NotChecked=0, Total=102080 [2018-10-14 16:32:28,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2050 states. [2018-10-14 16:32:28,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2050 to 1851. [2018-10-14 16:32:28,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1851 states. [2018-10-14 16:32:28,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1851 states to 1851 states and 1873 transitions. [2018-10-14 16:32:28,444 INFO L78 Accepts]: Start accepts. Automaton has 1851 states and 1873 transitions. Word has length 1764 [2018-10-14 16:32:28,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:32:28,445 INFO L481 AbstractCegarLoop]: Abstraction has 1851 states and 1873 transitions. [2018-10-14 16:32:28,445 INFO L482 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-14 16:32:28,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1851 states and 1873 transitions. [2018-10-14 16:32:28,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1851 [2018-10-14 16:32:28,466 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:32:28,467 INFO L375 BasicCegarLoop]: trace histogram [82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:32:28,467 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:32:28,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:32:28,468 INFO L82 PathProgramCache]: Analyzing trace with hash 804802277, now seen corresponding path program 26 times [2018-10-14 16:32:28,469 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:32:28,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:32:39,285 INFO L134 CoverageAnalysis]: Checked inductivity of 58103 backedges. 0 proven. 56300 refuted. 0 times theorem prover too weak. 1803 trivial. 0 not checked. [2018-10-14 16:32:39,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:32:39,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-10-14 16:32:39,287 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-14 16:32:39,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-14 16:32:39,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=670, Invalid=3362, Unknown=0, NotChecked=0, Total=4032 [2018-10-14 16:32:39,288 INFO L87 Difference]: Start difference. First operand 1851 states and 1873 transitions. Second operand 64 states. [2018-10-14 16:33:08,077 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2018-10-14 16:33:11,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:33:11,744 INFO L93 Difference]: Finished difference Result 2136 states and 2162 transitions. [2018-10-14 16:33:11,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 275 states. [2018-10-14 16:33:11,745 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 1850 [2018-10-14 16:33:11,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:33:11,751 INFO L225 Difference]: With dead ends: 2136 [2018-10-14 16:33:11,751 INFO L226 Difference]: Without dead ends: 2136 [2018-10-14 16:33:11,755 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 331 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43681 ImplicationChecksByTransitivity, 29.5s TimeCoverageRelationStatistics Valid=18606, Invalid=91950, Unknown=0, NotChecked=0, Total=110556 [2018-10-14 16:33:11,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2136 states. [2018-10-14 16:33:11,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2136 to 1937. [2018-10-14 16:33:11,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1937 states. [2018-10-14 16:33:11,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1937 states to 1937 states and 1960 transitions. [2018-10-14 16:33:11,768 INFO L78 Accepts]: Start accepts. Automaton has 1937 states and 1960 transitions. Word has length 1850 [2018-10-14 16:33:11,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:33:11,769 INFO L481 AbstractCegarLoop]: Abstraction has 1937 states and 1960 transitions. [2018-10-14 16:33:11,769 INFO L482 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-14 16:33:11,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1937 states and 1960 transitions. [2018-10-14 16:33:11,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1937 [2018-10-14 16:33:11,789 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:33:11,790 INFO L375 BasicCegarLoop]: trace histogram [86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:33:11,790 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:33:11,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:33:11,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1149745341, now seen corresponding path program 27 times [2018-10-14 16:33:11,791 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:33:11,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:33:23,560 INFO L134 CoverageAnalysis]: Checked inductivity of 63881 backedges. 0 proven. 61984 refuted. 0 times theorem prover too weak. 1897 trivial. 0 not checked. [2018-10-14 16:33:23,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:33:23,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-10-14 16:33:23,562 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-14 16:33:23,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-14 16:33:23,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=721, Invalid=3569, Unknown=0, NotChecked=0, Total=4290 [2018-10-14 16:33:23,562 INFO L87 Difference]: Start difference. First operand 1937 states and 1960 transitions. Second operand 66 states. [2018-10-14 16:33:57,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:33:57,916 INFO L93 Difference]: Finished difference Result 2222 states and 2249 transitions. [2018-10-14 16:33:57,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 286 states. [2018-10-14 16:33:57,916 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 1936 [2018-10-14 16:33:57,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:33:57,923 INFO L225 Difference]: With dead ends: 2222 [2018-10-14 16:33:57,923 INFO L226 Difference]: Without dead ends: 2222 [2018-10-14 16:33:57,929 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 344 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47392 ImplicationChecksByTransitivity, 31.1s TimeCoverageRelationStatistics Valid=20106, Invalid=99264, Unknown=0, NotChecked=0, Total=119370 [2018-10-14 16:33:57,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2222 states. [2018-10-14 16:33:57,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2222 to 2023. [2018-10-14 16:33:57,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2023 states. [2018-10-14 16:33:57,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2023 states to 2023 states and 2047 transitions. [2018-10-14 16:33:57,943 INFO L78 Accepts]: Start accepts. Automaton has 2023 states and 2047 transitions. Word has length 1936 [2018-10-14 16:33:57,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:33:57,944 INFO L481 AbstractCegarLoop]: Abstraction has 2023 states and 2047 transitions. [2018-10-14 16:33:57,944 INFO L482 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-14 16:33:57,944 INFO L276 IsEmpty]: Start isEmpty. Operand 2023 states and 2047 transitions. [2018-10-14 16:33:57,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2023 [2018-10-14 16:33:57,966 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:33:57,967 INFO L375 BasicCegarLoop]: trace histogram [90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:33:57,967 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:33:57,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:33:57,968 INFO L82 PathProgramCache]: Analyzing trace with hash 67540257, now seen corresponding path program 28 times [2018-10-14 16:33:57,968 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:33:58,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat