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/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-502d2f4 [2018-10-12 20:50:26,375 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-12 20:50:26,378 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-12 20:50:26,394 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-12 20:50:26,395 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-12 20:50:26,397 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-12 20:50:26,398 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-12 20:50:26,400 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-12 20:50:26,402 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-12 20:50:26,403 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-12 20:50:26,411 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-12 20:50:26,411 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-12 20:50:26,412 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-12 20:50:26,413 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-12 20:50:26,414 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-12 20:50:26,415 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-12 20:50:26,416 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-12 20:50:26,419 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-12 20:50:26,420 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-12 20:50:26,423 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-12 20:50:26,427 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-12 20:50:26,429 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-12 20:50:26,431 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-12 20:50:26,431 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-12 20:50:26,431 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-12 20:50:26,432 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-12 20:50:26,433 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-12 20:50:26,434 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-12 20:50:26,435 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-12 20:50:26,438 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-12 20:50:26,438 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-12 20:50:26,439 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-12 20:50:26,439 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-12 20:50:26,439 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-12 20:50:26,441 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-12 20:50:26,444 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-12 20:50:26,444 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-12 20:50:26,462 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-12 20:50:26,462 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-12 20:50:26,463 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-12 20:50:26,463 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-12 20:50:26,464 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-12 20:50:26,464 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-12 20:50:26,465 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-12 20:50:26,465 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-12 20:50:26,466 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-12 20:50:26,466 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-12 20:50:26,466 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-12 20:50:26,466 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-12 20:50:26,466 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-12 20:50:26,467 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-12 20:50:26,467 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-12 20:50:26,536 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-12 20:50:26,549 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-12 20:50:26,553 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-12 20:50:26,554 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-12 20:50:26,555 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-12 20:50:26,556 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl [2018-10-12 20:50:26,556 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl' [2018-10-12 20:50:26,616 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-12 20:50:26,618 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-12 20:50:26,618 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-12 20:50:26,619 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-12 20:50:26,619 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-12 20:50:26,645 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:50:26" (1/1) ... [2018-10-12 20:50:26,647 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:50:26" (1/1) ... [2018-10-12 20:50:26,662 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:50:26" (1/1) ... [2018-10-12 20:50:26,662 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:50:26" (1/1) ... [2018-10-12 20:50:26,667 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:50:26" (1/1) ... [2018-10-12 20:50:26,669 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:50:26" (1/1) ... [2018-10-12 20:50:26,670 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:50:26" (1/1) ... [2018-10-12 20:50:26,673 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-12 20:50:26,674 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-12 20:50:26,674 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-12 20:50:26,674 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-12 20:50:26,675 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:50:26" (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-12 20:50:26,741 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-12 20:50:26,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-12 20:50:26,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-12 20:50:27,292 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-12 20:50:27,293 INFO L202 PluginConnector]: Adding new model ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:50:27 BoogieIcfgContainer [2018-10-12 20:50:27,293 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-12 20:50:27,294 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-12 20:50:27,294 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-12 20:50:27,298 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-12 20:50:27,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:50:26" (1/2) ... [2018-10-12 20:50:27,299 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f2a4e10 and model type ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:50:27, skipping insertion in model container [2018-10-12 20:50:27,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:50:27" (2/2) ... [2018-10-12 20:50:27,301 INFO L112 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl [2018-10-12 20:50:27,311 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-12 20:50:27,320 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-12 20:50:27,338 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-12 20:50:27,374 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-12 20:50:27,375 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-12 20:50:27,375 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-12 20:50:27,375 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-12 20:50:27,376 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-12 20:50:27,376 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-12 20:50:27,376 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-12 20:50:27,376 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-12 20:50:27,376 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-12 20:50:27,400 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2018-10-12 20:50:27,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-12 20:50:27,420 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:50:27,421 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] [2018-10-12 20:50:27,423 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:50:27,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:50:27,429 INFO L82 PathProgramCache]: Analyzing trace with hash -2107550204, now seen corresponding path program 1 times [2018-10-12 20:50:27,494 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:50:27,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:50:27,761 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-12 20:50:27,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-12 20:50:27,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-12 20:50:27,770 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-12 20:50:27,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-12 20:50:27,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-12 20:50:27,790 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 6 states. [2018-10-12 20:50:28,358 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-12 20:50:28,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:50:28,520 INFO L93 Difference]: Finished difference Result 127 states and 129 transitions. [2018-10-12 20:50:28,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-12 20:50:28,522 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2018-10-12 20:50:28,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:50:28,536 INFO L225 Difference]: With dead ends: 127 [2018-10-12 20:50:28,536 INFO L226 Difference]: Without dead ends: 127 [2018-10-12 20:50:28,539 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-10-12 20:50:28,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-10-12 20:50:28,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 78. [2018-10-12 20:50:28,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-10-12 20:50:28,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2018-10-12 20:50:28,585 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 45 [2018-10-12 20:50:28,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:50:28,586 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2018-10-12 20:50:28,587 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-12 20:50:28,587 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2018-10-12 20:50:28,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-12 20:50:28,589 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:50:28,589 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:50:28,590 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:50:28,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:50:28,590 INFO L82 PathProgramCache]: Analyzing trace with hash -477820300, now seen corresponding path program 1 times [2018-10-12 20:50:28,591 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:50:28,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:50:28,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:50:28,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:50:28,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-12 20:50:28,921 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-12 20:50:28,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-12 20:50:28,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-10-12 20:50:28,922 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 8 states. [2018-10-12 20:50:29,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:50:29,528 INFO L93 Difference]: Finished difference Result 129 states and 131 transitions. [2018-10-12 20:50:29,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-12 20:50:29,529 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2018-10-12 20:50:29,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:50:29,531 INFO L225 Difference]: With dead ends: 129 [2018-10-12 20:50:29,532 INFO L226 Difference]: Without dead ends: 129 [2018-10-12 20:50:29,534 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2018-10-12 20:50:29,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-10-12 20:50:29,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 93. [2018-10-12 20:50:29,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-10-12 20:50:29,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2018-10-12 20:50:29,547 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 60 [2018-10-12 20:50:29,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:50:29,548 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2018-10-12 20:50:29,548 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-12 20:50:29,549 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2018-10-12 20:50:29,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-12 20:50:29,551 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:50:29,551 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-12 20:50:29,552 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:50:29,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:50:29,552 INFO L82 PathProgramCache]: Analyzing trace with hash -137107452, now seen corresponding path program 2 times [2018-10-12 20:50:29,553 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:50:29,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:50:30,084 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-12 20:50:30,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-12 20:50:30,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-12 20:50:30,086 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-12 20:50:30,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-12 20:50:30,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-10-12 20:50:30,087 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 12 states. [2018-10-12 20:50:30,887 WARN L178 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-10-12 20:50:31,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:50:31,023 INFO L93 Difference]: Finished difference Result 152 states and 155 transitions. [2018-10-12 20:50:31,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-12 20:50:31,029 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 75 [2018-10-12 20:50:31,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:50:31,032 INFO L225 Difference]: With dead ends: 152 [2018-10-12 20:50:31,032 INFO L226 Difference]: Without dead ends: 152 [2018-10-12 20:50:31,033 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2018-10-12 20:50:31,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-10-12 20:50:31,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 115. [2018-10-12 20:50:31,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-12 20:50:31,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 117 transitions. [2018-10-12 20:50:31,043 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 117 transitions. Word has length 75 [2018-10-12 20:50:31,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:50:31,044 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 117 transitions. [2018-10-12 20:50:31,044 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-12 20:50:31,044 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 117 transitions. [2018-10-12 20:50:31,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-12 20:50:31,048 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:50:31,048 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:50:31,048 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:50:31,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:50:31,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1373892969, now seen corresponding path program 1 times [2018-10-12 20:50:31,050 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:50:31,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:50:31,398 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-12 20:50:31,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:50:31,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-12 20:50:31,399 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-12 20:50:31,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-12 20:50:31,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-12 20:50:31,400 INFO L87 Difference]: Start difference. First operand 115 states and 117 transitions. Second operand 8 states. [2018-10-12 20:50:31,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:50:31,663 INFO L93 Difference]: Finished difference Result 182 states and 185 transitions. [2018-10-12 20:50:31,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-12 20:50:31,664 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 100 [2018-10-12 20:50:31,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:50:31,667 INFO L225 Difference]: With dead ends: 182 [2018-10-12 20:50:31,668 INFO L226 Difference]: Without dead ends: 182 [2018-10-12 20:50:31,669 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-12 20:50:31,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-10-12 20:50:31,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 133. [2018-10-12 20:50:31,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-10-12 20:50:31,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 135 transitions. [2018-10-12 20:50:31,679 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 135 transitions. Word has length 100 [2018-10-12 20:50:31,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:50:31,679 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 135 transitions. [2018-10-12 20:50:31,679 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-12 20:50:31,680 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 135 transitions. [2018-10-12 20:50:31,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-12 20:50:31,682 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:50:31,682 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:50:31,683 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:50:31,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:50:31,683 INFO L82 PathProgramCache]: Analyzing trace with hash 799381615, now seen corresponding path program 2 times [2018-10-12 20:50:31,684 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:50:31,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:50:31,880 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 7 proven. 44 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-12 20:50:31,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:50:31,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-12 20:50:31,881 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-12 20:50:31,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-12 20:50:31,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-10-12 20:50:31,882 INFO L87 Difference]: Start difference. First operand 133 states and 135 transitions. Second operand 10 states. [2018-10-12 20:50:32,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:50:32,236 INFO L93 Difference]: Finished difference Result 197 states and 200 transitions. [2018-10-12 20:50:32,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-12 20:50:32,239 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 115 [2018-10-12 20:50:32,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:50:32,241 INFO L225 Difference]: With dead ends: 197 [2018-10-12 20:50:32,241 INFO L226 Difference]: Without dead ends: 197 [2018-10-12 20:50:32,242 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2018-10-12 20:50:32,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-10-12 20:50:32,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 148. [2018-10-12 20:50:32,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-10-12 20:50:32,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 150 transitions. [2018-10-12 20:50:32,252 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 150 transitions. Word has length 115 [2018-10-12 20:50:32,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:50:32,253 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 150 transitions. [2018-10-12 20:50:32,253 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-12 20:50:32,253 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 150 transitions. [2018-10-12 20:50:32,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-12 20:50:32,256 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:50:32,256 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-10-12 20:50:32,257 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:50:32,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:50:32,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1760314537, now seen corresponding path program 3 times [2018-10-12 20:50:32,258 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:50:32,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:50:32,555 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 7 proven. 91 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-12 20:50:32,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:50:32,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-12 20:50:32,557 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-12 20:50:32,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-12 20:50:32,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-10-12 20:50:32,558 INFO L87 Difference]: Start difference. First operand 148 states and 150 transitions. Second operand 12 states. [2018-10-12 20:50:33,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:50:33,067 INFO L93 Difference]: Finished difference Result 199 states and 202 transitions. [2018-10-12 20:50:33,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-12 20:50:33,068 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 130 [2018-10-12 20:50:33,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:50:33,070 INFO L225 Difference]: With dead ends: 199 [2018-10-12 20:50:33,070 INFO L226 Difference]: Without dead ends: 199 [2018-10-12 20:50:33,071 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2018-10-12 20:50:33,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-10-12 20:50:33,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 163. [2018-10-12 20:50:33,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-10-12 20:50:33,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 165 transitions. [2018-10-12 20:50:33,080 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 165 transitions. Word has length 130 [2018-10-12 20:50:33,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:50:33,080 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 165 transitions. [2018-10-12 20:50:33,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-12 20:50:33,081 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 165 transitions. [2018-10-12 20:50:33,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-12 20:50:33,083 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:50:33,084 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2018-10-12 20:50:33,084 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:50:33,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:50:33,085 INFO L82 PathProgramCache]: Analyzing trace with hash -687579857, now seen corresponding path program 4 times [2018-10-12 20:50:33,085 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:50:33,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:50:33,586 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-10-12 20:50:33,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:50:33,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-12 20:50:33,587 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-12 20:50:33,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-12 20:50:33,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-10-12 20:50:33,588 INFO L87 Difference]: Start difference. First operand 163 states and 165 transitions. Second operand 15 states. [2018-10-12 20:50:34,335 WARN L178 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2018-10-12 20:50:35,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:50:35,059 INFO L93 Difference]: Finished difference Result 222 states and 226 transitions. [2018-10-12 20:50:35,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-12 20:50:35,063 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 145 [2018-10-12 20:50:35,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:50:35,065 INFO L225 Difference]: With dead ends: 222 [2018-10-12 20:50:35,065 INFO L226 Difference]: Without dead ends: 222 [2018-10-12 20:50:35,066 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-12 20:50:35,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-10-12 20:50:35,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 185. [2018-10-12 20:50:35,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-10-12 20:50:35,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 188 transitions. [2018-10-12 20:50:35,073 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 188 transitions. Word has length 145 [2018-10-12 20:50:35,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:50:35,074 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 188 transitions. [2018-10-12 20:50:35,074 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-12 20:50:35,074 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 188 transitions. [2018-10-12 20:50:35,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-12 20:50:35,077 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:50:35,077 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2018-10-12 20:50:35,077 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:50:35,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:50:35,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1959652706, now seen corresponding path program 5 times [2018-10-12 20:50:35,079 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:50:35,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:50:35,294 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 17 proven. 142 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-10-12 20:50:35,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:50:35,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-12 20:50:35,295 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-12 20:50:35,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-12 20:50:35,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-10-12 20:50:35,295 INFO L87 Difference]: Start difference. First operand 185 states and 188 transitions. Second operand 10 states. [2018-10-12 20:50:35,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:50:35,502 INFO L93 Difference]: Finished difference Result 211 states and 214 transitions. [2018-10-12 20:50:35,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-12 20:50:35,503 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 170 [2018-10-12 20:50:35,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:50:35,504 INFO L225 Difference]: With dead ends: 211 [2018-10-12 20:50:35,504 INFO L226 Difference]: Without dead ends: 211 [2018-10-12 20:50:35,505 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-12 20:50:35,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-10-12 20:50:35,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 186. [2018-10-12 20:50:35,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-10-12 20:50:35,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 189 transitions. [2018-10-12 20:50:35,510 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 189 transitions. Word has length 170 [2018-10-12 20:50:35,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:50:35,511 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 189 transitions. [2018-10-12 20:50:35,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-12 20:50:35,511 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 189 transitions. [2018-10-12 20:50:35,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-10-12 20:50:35,514 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:50:35,514 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2018-10-12 20:50:35,515 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:50:35,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:50:35,515 INFO L82 PathProgramCache]: Analyzing trace with hash -245086566, now seen corresponding path program 6 times [2018-10-12 20:50:35,516 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:50:35,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:50:36,513 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 17 proven. 220 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-10-12 20:50:36,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:50:36,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-12 20:50:36,514 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-12 20:50:36,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-12 20:50:36,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-10-12 20:50:36,515 INFO L87 Difference]: Start difference. First operand 186 states and 189 transitions. Second operand 12 states. [2018-10-12 20:50:36,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:50:36,947 INFO L93 Difference]: Finished difference Result 226 states and 229 transitions. [2018-10-12 20:50:36,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-12 20:50:36,948 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 185 [2018-10-12 20:50:36,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:50:36,950 INFO L225 Difference]: With dead ends: 226 [2018-10-12 20:50:36,950 INFO L226 Difference]: Without dead ends: 226 [2018-10-12 20:50:36,951 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2018-10-12 20:50:36,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-10-12 20:50:36,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 201. [2018-10-12 20:50:36,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-10-12 20:50:36,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 204 transitions. [2018-10-12 20:50:36,957 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 204 transitions. Word has length 185 [2018-10-12 20:50:36,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:50:36,957 INFO L481 AbstractCegarLoop]: Abstraction has 201 states and 204 transitions. [2018-10-12 20:50:36,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-12 20:50:36,958 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 204 transitions. [2018-10-12 20:50:36,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-10-12 20:50:36,960 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:50:36,960 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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] [2018-10-12 20:50:36,960 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:50:36,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:50:36,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1002183454, now seen corresponding path program 7 times [2018-10-12 20:50:36,962 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:50:36,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:50:37,280 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 17 proven. 313 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-10-12 20:50:37,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:50:37,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-12 20:50:37,281 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-12 20:50:37,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-12 20:50:37,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-10-12 20:50:37,282 INFO L87 Difference]: Start difference. First operand 201 states and 204 transitions. Second operand 14 states. [2018-10-12 20:50:37,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:50:37,733 INFO L93 Difference]: Finished difference Result 241 states and 244 transitions. [2018-10-12 20:50:37,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-12 20:50:37,734 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 200 [2018-10-12 20:50:37,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:50:37,736 INFO L225 Difference]: With dead ends: 241 [2018-10-12 20:50:37,736 INFO L226 Difference]: Without dead ends: 241 [2018-10-12 20:50:37,737 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=590, Unknown=0, NotChecked=0, Total=756 [2018-10-12 20:50:37,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-10-12 20:50:37,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 216. [2018-10-12 20:50:37,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-10-12 20:50:37,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 219 transitions. [2018-10-12 20:50:37,742 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 219 transitions. Word has length 200 [2018-10-12 20:50:37,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:50:37,742 INFO L481 AbstractCegarLoop]: Abstraction has 216 states and 219 transitions. [2018-10-12 20:50:37,742 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-12 20:50:37,742 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 219 transitions. [2018-10-12 20:50:37,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-10-12 20:50:37,745 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:50:37,745 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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] [2018-10-12 20:50:37,745 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:50:37,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:50:37,746 INFO L82 PathProgramCache]: Analyzing trace with hash 863514138, now seen corresponding path program 8 times [2018-10-12 20:50:37,746 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:50:37,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:50:38,106 INFO L134 CoverageAnalysis]: Checked inductivity of 503 backedges. 17 proven. 421 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-10-12 20:50:38,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:50:38,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-12 20:50:38,107 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-12 20:50:38,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-12 20:50:38,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-10-12 20:50:38,108 INFO L87 Difference]: Start difference. First operand 216 states and 219 transitions. Second operand 16 states. [2018-10-12 20:50:38,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:50:38,790 INFO L93 Difference]: Finished difference Result 243 states and 246 transitions. [2018-10-12 20:50:38,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-12 20:50:38,791 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 215 [2018-10-12 20:50:38,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:50:38,793 INFO L225 Difference]: With dead ends: 243 [2018-10-12 20:50:38,793 INFO L226 Difference]: Without dead ends: 243 [2018-10-12 20:50:38,795 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=253, Invalid=937, Unknown=0, NotChecked=0, Total=1190 [2018-10-12 20:50:38,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-10-12 20:50:38,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 231. [2018-10-12 20:50:38,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-10-12 20:50:38,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 234 transitions. [2018-10-12 20:50:38,800 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 234 transitions. Word has length 215 [2018-10-12 20:50:38,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:50:38,800 INFO L481 AbstractCegarLoop]: Abstraction has 231 states and 234 transitions. [2018-10-12 20:50:38,800 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-12 20:50:38,801 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 234 transitions. [2018-10-12 20:50:38,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-12 20:50:38,802 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:50:38,802 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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] [2018-10-12 20:50:38,802 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:50:38,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:50:38,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1720958050, now seen corresponding path program 9 times [2018-10-12 20:50:38,804 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:50:38,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:50:40,366 INFO L134 CoverageAnalysis]: Checked inductivity of 626 backedges. 0 proven. 467 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2018-10-12 20:50:40,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:50:40,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-12 20:50:40,368 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-12 20:50:40,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-12 20:50:40,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2018-10-12 20:50:40,368 INFO L87 Difference]: Start difference. First operand 231 states and 234 transitions. Second operand 18 states. [2018-10-12 20:50:41,260 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2018-10-12 20:50:41,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:50:41,806 INFO L93 Difference]: Finished difference Result 399 states and 404 transitions. [2018-10-12 20:50:41,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-12 20:50:41,807 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 230 [2018-10-12 20:50:41,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:50:41,809 INFO L225 Difference]: With dead ends: 399 [2018-10-12 20:50:41,809 INFO L226 Difference]: Without dead ends: 399 [2018-10-12 20:50:41,810 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=242, Invalid=1090, Unknown=0, NotChecked=0, Total=1332 [2018-10-12 20:50:41,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-10-12 20:50:41,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 316. [2018-10-12 20:50:41,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-10-12 20:50:41,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 320 transitions. [2018-10-12 20:50:41,816 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 320 transitions. Word has length 230 [2018-10-12 20:50:41,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:50:41,817 INFO L481 AbstractCegarLoop]: Abstraction has 316 states and 320 transitions. [2018-10-12 20:50:41,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-12 20:50:41,817 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 320 transitions. [2018-10-12 20:50:41,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2018-10-12 20:50:41,819 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:50:41,819 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 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] [2018-10-12 20:50:41,819 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:50:41,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:50:41,820 INFO L82 PathProgramCache]: Analyzing trace with hash -131334001, now seen corresponding path program 10 times [2018-10-12 20:50:41,820 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:50:41,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:50:42,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1348 backedges. 0 proven. 1095 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-10-12 20:50:42,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:50:42,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-12 20:50:42,684 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-12 20:50:42,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-12 20:50:42,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2018-10-12 20:50:42,685 INFO L87 Difference]: Start difference. First operand 316 states and 320 transitions. Second operand 22 states. [2018-10-12 20:50:44,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:50:44,344 INFO L93 Difference]: Finished difference Result 484 states and 490 transitions. [2018-10-12 20:50:44,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-12 20:50:44,344 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 315 [2018-10-12 20:50:44,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:50:44,347 INFO L225 Difference]: With dead ends: 484 [2018-10-12 20:50:44,348 INFO L226 Difference]: Without dead ends: 484 [2018-10-12 20:50:44,349 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=390, Invalid=1590, Unknown=0, NotChecked=0, Total=1980 [2018-10-12 20:50:44,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2018-10-12 20:50:44,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 401. [2018-10-12 20:50:44,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-10-12 20:50:44,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 406 transitions. [2018-10-12 20:50:44,357 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 406 transitions. Word has length 315 [2018-10-12 20:50:44,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:50:44,357 INFO L481 AbstractCegarLoop]: Abstraction has 401 states and 406 transitions. [2018-10-12 20:50:44,357 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-12 20:50:44,357 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 406 transitions. [2018-10-12 20:50:44,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2018-10-12 20:50:44,360 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:50:44,360 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 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] [2018-10-12 20:50:44,360 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:50:44,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:50:44,361 INFO L82 PathProgramCache]: Analyzing trace with hash 143227966, now seen corresponding path program 11 times [2018-10-12 20:50:44,362 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:50:44,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:50:44,968 INFO L134 CoverageAnalysis]: Checked inductivity of 2343 backedges. 1133 proven. 950 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-10-12 20:50:44,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:50:44,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-12 20:50:44,969 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-12 20:50:44,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-12 20:50:44,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2018-10-12 20:50:44,970 INFO L87 Difference]: Start difference. First operand 401 states and 406 transitions. Second operand 20 states. [2018-10-12 20:50:46,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:50:46,044 INFO L93 Difference]: Finished difference Result 431 states and 436 transitions. [2018-10-12 20:50:46,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-12 20:50:46,048 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 400 [2018-10-12 20:50:46,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:50:46,051 INFO L225 Difference]: With dead ends: 431 [2018-10-12 20:50:46,051 INFO L226 Difference]: Without dead ends: 431 [2018-10-12 20:50:46,052 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=402, Invalid=1578, Unknown=0, NotChecked=0, Total=1980 [2018-10-12 20:50:46,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-10-12 20:50:46,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 431. [2018-10-12 20:50:46,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2018-10-12 20:50:46,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 436 transitions. [2018-10-12 20:50:46,061 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 436 transitions. Word has length 400 [2018-10-12 20:50:46,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:50:46,062 INFO L481 AbstractCegarLoop]: Abstraction has 431 states and 436 transitions. [2018-10-12 20:50:46,062 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-12 20:50:46,062 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 436 transitions. [2018-10-12 20:50:46,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2018-10-12 20:50:46,065 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:50:46,066 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 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] [2018-10-12 20:50:46,066 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:50:46,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:50:46,067 INFO L82 PathProgramCache]: Analyzing trace with hash 482425844, now seen corresponding path program 12 times [2018-10-12 20:50:46,068 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:50:46,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:50:47,592 INFO L134 CoverageAnalysis]: Checked inductivity of 2878 backedges. 0 proven. 2409 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2018-10-12 20:50:47,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:50:47,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-12 20:50:47,593 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-12 20:50:47,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-12 20:50:47,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2018-10-12 20:50:47,594 INFO L87 Difference]: Start difference. First operand 431 states and 436 transitions. Second operand 22 states. [2018-10-12 20:50:48,865 WARN L178 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-10-12 20:50:49,652 WARN L178 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2018-10-12 20:50:51,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:50:51,157 INFO L93 Difference]: Finished difference Result 629 states and 636 transitions. [2018-10-12 20:50:51,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-12 20:50:51,158 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 430 [2018-10-12 20:50:51,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:50:51,161 INFO L225 Difference]: With dead ends: 629 [2018-10-12 20:50:51,162 INFO L226 Difference]: Without dead ends: 629 [2018-10-12 20:50:51,163 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=328, Invalid=1834, Unknown=0, NotChecked=0, Total=2162 [2018-10-12 20:50:51,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-10-12 20:50:51,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 531. [2018-10-12 20:50:51,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531 states. [2018-10-12 20:50:51,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 537 transitions. [2018-10-12 20:50:51,172 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 537 transitions. Word has length 430 [2018-10-12 20:50:51,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:50:51,173 INFO L481 AbstractCegarLoop]: Abstraction has 531 states and 537 transitions. [2018-10-12 20:50:51,173 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-12 20:50:51,173 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 537 transitions. [2018-10-12 20:50:51,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2018-10-12 20:50:51,176 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:50:51,177 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 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] [2018-10-12 20:50:51,177 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:50:51,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:50:51,177 INFO L82 PathProgramCache]: Analyzing trace with hash -599200289, now seen corresponding path program 13 times [2018-10-12 20:50:51,178 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:50:51,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:50:53,813 INFO L134 CoverageAnalysis]: Checked inductivity of 4619 backedges. 0 proven. 3995 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2018-10-12 20:50:53,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:50:53,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-12 20:50:53,814 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-12 20:50:53,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-12 20:50:53,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2018-10-12 20:50:53,815 INFO L87 Difference]: Start difference. First operand 531 states and 537 transitions. Second operand 24 states. [2018-10-12 20:50:56,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:50:56,906 INFO L93 Difference]: Finished difference Result 729 states and 737 transitions. [2018-10-12 20:50:56,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-12 20:50:56,906 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 530 [2018-10-12 20:50:56,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:50:56,910 INFO L225 Difference]: With dead ends: 729 [2018-10-12 20:50:56,910 INFO L226 Difference]: Without dead ends: 729 [2018-10-12 20:50:56,911 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=371, Invalid=2281, Unknown=0, NotChecked=0, Total=2652 [2018-10-12 20:50:56,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2018-10-12 20:50:56,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 631. [2018-10-12 20:50:56,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2018-10-12 20:50:56,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 638 transitions. [2018-10-12 20:50:56,921 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 638 transitions. Word has length 530 [2018-10-12 20:50:56,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:50:56,922 INFO L481 AbstractCegarLoop]: Abstraction has 631 states and 638 transitions. [2018-10-12 20:50:56,922 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-12 20:50:56,922 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 638 transitions. [2018-10-12 20:50:56,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 631 [2018-10-12 20:50:56,927 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:50:56,927 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 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] [2018-10-12 20:50:56,928 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:50:56,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:50:56,928 INFO L82 PathProgramCache]: Analyzing trace with hash 2028105290, now seen corresponding path program 14 times [2018-10-12 20:50:56,929 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:50:56,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:50:59,348 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-12 20:50:59,669 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-12 20:51:00,037 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-12 20:51:01,195 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-12 20:51:02,849 INFO L134 CoverageAnalysis]: Checked inductivity of 6770 backedges. 0 proven. 5991 refuted. 0 times theorem prover too weak. 779 trivial. 0 not checked. [2018-10-12 20:51:02,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:51:02,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-12 20:51:02,850 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-12 20:51:02,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-12 20:51:02,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=580, Unknown=0, NotChecked=0, Total=650 [2018-10-12 20:51:02,851 INFO L87 Difference]: Start difference. First operand 631 states and 638 transitions. Second operand 26 states. [2018-10-12 20:51:05,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:51:05,801 INFO L93 Difference]: Finished difference Result 829 states and 838 transitions. [2018-10-12 20:51:05,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-12 20:51:05,804 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 630 [2018-10-12 20:51:05,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:51:05,808 INFO L225 Difference]: With dead ends: 829 [2018-10-12 20:51:05,809 INFO L226 Difference]: Without dead ends: 829 [2018-10-12 20:51:05,810 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=414, Invalid=2778, Unknown=0, NotChecked=0, Total=3192 [2018-10-12 20:51:05,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2018-10-12 20:51:05,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 731. [2018-10-12 20:51:05,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2018-10-12 20:51:05,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 739 transitions. [2018-10-12 20:51:05,820 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 739 transitions. Word has length 630 [2018-10-12 20:51:05,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:51:05,821 INFO L481 AbstractCegarLoop]: Abstraction has 731 states and 739 transitions. [2018-10-12 20:51:05,821 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-12 20:51:05,821 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 739 transitions. [2018-10-12 20:51:05,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 731 [2018-10-12 20:51:05,826 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:51:05,827 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 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] [2018-10-12 20:51:05,827 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:51:05,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:51:05,828 INFO L82 PathProgramCache]: Analyzing trace with hash 309624117, now seen corresponding path program 15 times [2018-10-12 20:51:05,828 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:51:05,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:51:08,465 INFO L134 CoverageAnalysis]: Checked inductivity of 9331 backedges. 0 proven. 8397 refuted. 0 times theorem prover too weak. 934 trivial. 0 not checked. [2018-10-12 20:51:08,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:51:08,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-12 20:51:08,466 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-12 20:51:08,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-12 20:51:08,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=680, Unknown=0, NotChecked=0, Total=756 [2018-10-12 20:51:08,467 INFO L87 Difference]: Start difference. First operand 731 states and 739 transitions. Second operand 28 states. [2018-10-12 20:51:12,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:51:12,253 INFO L93 Difference]: Finished difference Result 929 states and 939 transitions. [2018-10-12 20:51:12,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-12 20:51:12,254 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 730 [2018-10-12 20:51:12,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:51:12,259 INFO L225 Difference]: With dead ends: 929 [2018-10-12 20:51:12,259 INFO L226 Difference]: Without dead ends: 929 [2018-10-12 20:51:12,260 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 734 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=457, Invalid=3325, Unknown=0, NotChecked=0, Total=3782 [2018-10-12 20:51:12,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2018-10-12 20:51:12,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 831. [2018-10-12 20:51:12,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2018-10-12 20:51:12,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 840 transitions. [2018-10-12 20:51:12,272 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 840 transitions. Word has length 730 [2018-10-12 20:51:12,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:51:12,273 INFO L481 AbstractCegarLoop]: Abstraction has 831 states and 840 transitions. [2018-10-12 20:51:12,273 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-12 20:51:12,273 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 840 transitions. [2018-10-12 20:51:12,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 831 [2018-10-12 20:51:12,279 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:51:12,280 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 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] [2018-10-12 20:51:12,280 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:51:12,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:51:12,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1769612640, now seen corresponding path program 16 times [2018-10-12 20:51:12,281 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:51:12,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:51:15,456 INFO L134 CoverageAnalysis]: Checked inductivity of 12302 backedges. 0 proven. 11213 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2018-10-12 20:51:15,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:51:15,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-12 20:51:15,457 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-12 20:51:15,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-12 20:51:15,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=788, Unknown=0, NotChecked=0, Total=870 [2018-10-12 20:51:15,458 INFO L87 Difference]: Start difference. First operand 831 states and 840 transitions. Second operand 30 states. [2018-10-12 20:51:19,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:51:19,867 INFO L93 Difference]: Finished difference Result 1029 states and 1040 transitions. [2018-10-12 20:51:19,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-12 20:51:19,868 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 830 [2018-10-12 20:51:19,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:51:19,871 INFO L225 Difference]: With dead ends: 1029 [2018-10-12 20:51:19,871 INFO L226 Difference]: Without dead ends: 1029 [2018-10-12 20:51:19,873 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 858 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=500, Invalid=3922, Unknown=0, NotChecked=0, Total=4422 [2018-10-12 20:51:19,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2018-10-12 20:51:19,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 931. [2018-10-12 20:51:19,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 931 states. [2018-10-12 20:51:19,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 941 transitions. [2018-10-12 20:51:19,885 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 941 transitions. Word has length 830 [2018-10-12 20:51:19,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:51:19,886 INFO L481 AbstractCegarLoop]: Abstraction has 931 states and 941 transitions. [2018-10-12 20:51:19,886 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-12 20:51:19,886 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 941 transitions. [2018-10-12 20:51:19,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 931 [2018-10-12 20:51:19,894 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:51:19,894 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 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] [2018-10-12 20:51:19,895 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:51:19,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:51:19,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1883063947, now seen corresponding path program 17 times [2018-10-12 20:51:19,896 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:51:19,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:51:23,969 INFO L134 CoverageAnalysis]: Checked inductivity of 15683 backedges. 0 proven. 14439 refuted. 0 times theorem prover too weak. 1244 trivial. 0 not checked. [2018-10-12 20:51:23,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:51:23,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-12 20:51:23,971 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-12 20:51:23,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-12 20:51:23,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=904, Unknown=0, NotChecked=0, Total=992 [2018-10-12 20:51:23,972 INFO L87 Difference]: Start difference. First operand 931 states and 941 transitions. Second operand 32 states. [2018-10-12 20:51:28,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:51:28,930 INFO L93 Difference]: Finished difference Result 1129 states and 1141 transitions. [2018-10-12 20:51:28,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-12 20:51:28,930 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 930 [2018-10-12 20:51:28,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:51:28,935 INFO L225 Difference]: With dead ends: 1129 [2018-10-12 20:51:28,935 INFO L226 Difference]: Without dead ends: 1129 [2018-10-12 20:51:28,937 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 991 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=543, Invalid=4569, Unknown=0, NotChecked=0, Total=5112 [2018-10-12 20:51:28,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2018-10-12 20:51:28,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 1031. [2018-10-12 20:51:28,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1031 states. [2018-10-12 20:51:28,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1042 transitions. [2018-10-12 20:51:28,950 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1042 transitions. Word has length 930 [2018-10-12 20:51:28,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:51:28,951 INFO L481 AbstractCegarLoop]: Abstraction has 1031 states and 1042 transitions. [2018-10-12 20:51:28,951 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-12 20:51:28,952 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1042 transitions. [2018-10-12 20:51:28,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1031 [2018-10-12 20:51:28,962 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:51:28,963 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 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] [2018-10-12 20:51:28,963 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:51:28,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:51:28,964 INFO L82 PathProgramCache]: Analyzing trace with hash 945914102, now seen corresponding path program 18 times [2018-10-12 20:51:28,965 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:51:29,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:51:30,088 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-12 20:51:30,518 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-12 20:51:31,327 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-12 20:51:35,170 INFO L134 CoverageAnalysis]: Checked inductivity of 19474 backedges. 0 proven. 18075 refuted. 0 times theorem prover too weak. 1399 trivial. 0 not checked. [2018-10-12 20:51:35,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:51:35,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-12 20:51:35,171 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-12 20:51:35,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-12 20:51:35,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=1028, Unknown=0, NotChecked=0, Total=1122 [2018-10-12 20:51:35,172 INFO L87 Difference]: Start difference. First operand 1031 states and 1042 transitions. Second operand 34 states. [2018-10-12 20:51:40,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:51:40,764 INFO L93 Difference]: Finished difference Result 1229 states and 1242 transitions. [2018-10-12 20:51:40,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-12 20:51:40,765 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 1030 [2018-10-12 20:51:40,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:51:40,769 INFO L225 Difference]: With dead ends: 1229 [2018-10-12 20:51:40,769 INFO L226 Difference]: Without dead ends: 1229 [2018-10-12 20:51:40,771 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1133 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=586, Invalid=5266, Unknown=0, NotChecked=0, Total=5852 [2018-10-12 20:51:40,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2018-10-12 20:51:40,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1131. [2018-10-12 20:51:40,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1131 states. [2018-10-12 20:51:40,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1143 transitions. [2018-10-12 20:51:40,784 INFO L78 Accepts]: Start accepts. Automaton has 1131 states and 1143 transitions. Word has length 1030 [2018-10-12 20:51:40,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:51:40,785 INFO L481 AbstractCegarLoop]: Abstraction has 1131 states and 1143 transitions. [2018-10-12 20:51:40,785 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-12 20:51:40,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1143 transitions. [2018-10-12 20:51:40,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1131 [2018-10-12 20:51:40,795 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:51:40,796 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 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] [2018-10-12 20:51:40,796 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:51:40,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:51:40,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1700350433, now seen corresponding path program 19 times [2018-10-12 20:51:40,798 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:51:40,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:51:46,111 INFO L134 CoverageAnalysis]: Checked inductivity of 23675 backedges. 0 proven. 22121 refuted. 0 times theorem prover too weak. 1554 trivial. 0 not checked. [2018-10-12 20:51:46,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:51:46,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-12 20:51:46,113 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-12 20:51:46,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-12 20:51:46,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1160, Unknown=0, NotChecked=0, Total=1260 [2018-10-12 20:51:46,114 INFO L87 Difference]: Start difference. First operand 1131 states and 1143 transitions. Second operand 36 states. [2018-10-12 20:51:52,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:51:52,957 INFO L93 Difference]: Finished difference Result 1329 states and 1343 transitions. [2018-10-12 20:51:52,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-12 20:51:52,959 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 1130 [2018-10-12 20:51:52,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:51:52,963 INFO L225 Difference]: With dead ends: 1329 [2018-10-12 20:51:52,963 INFO L226 Difference]: Without dead ends: 1329 [2018-10-12 20:51:52,965 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1284 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=629, Invalid=6013, Unknown=0, NotChecked=0, Total=6642 [2018-10-12 20:51:52,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2018-10-12 20:51:52,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 1231. [2018-10-12 20:51:52,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1231 states. [2018-10-12 20:51:52,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 1244 transitions. [2018-10-12 20:51:52,979 INFO L78 Accepts]: Start accepts. Automaton has 1231 states and 1244 transitions. Word has length 1130 [2018-10-12 20:51:52,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:51:52,980 INFO L481 AbstractCegarLoop]: Abstraction has 1231 states and 1244 transitions. [2018-10-12 20:51:52,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-12 20:51:52,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 1244 transitions. [2018-10-12 20:51:52,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1231 [2018-10-12 20:51:52,992 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:51:52,993 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 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] [2018-10-12 20:51:52,993 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:51:52,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:51:52,993 INFO L82 PathProgramCache]: Analyzing trace with hash -81043124, now seen corresponding path program 20 times [2018-10-12 20:51:52,994 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:51:53,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:51:59,128 INFO L134 CoverageAnalysis]: Checked inductivity of 28286 backedges. 0 proven. 26577 refuted. 0 times theorem prover too weak. 1709 trivial. 0 not checked. [2018-10-12 20:51:59,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:51:59,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-12 20:51:59,129 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-12 20:51:59,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-12 20:51:59,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1300, Unknown=0, NotChecked=0, Total=1406 [2018-10-12 20:51:59,130 INFO L87 Difference]: Start difference. First operand 1231 states and 1244 transitions. Second operand 38 states. [2018-10-12 20:52:06,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:52:06,970 INFO L93 Difference]: Finished difference Result 1429 states and 1444 transitions. [2018-10-12 20:52:06,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-12 20:52:06,971 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 1230 [2018-10-12 20:52:06,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:52:06,975 INFO L225 Difference]: With dead ends: 1429 [2018-10-12 20:52:06,975 INFO L226 Difference]: Without dead ends: 1429 [2018-10-12 20:52:06,977 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1444 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=672, Invalid=6810, Unknown=0, NotChecked=0, Total=7482 [2018-10-12 20:52:06,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2018-10-12 20:52:06,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 1331. [2018-10-12 20:52:06,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1331 states. [2018-10-12 20:52:06,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 1345 transitions. [2018-10-12 20:52:06,992 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 1345 transitions. Word has length 1230 [2018-10-12 20:52:06,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:52:06,993 INFO L481 AbstractCegarLoop]: Abstraction has 1331 states and 1345 transitions. [2018-10-12 20:52:06,994 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-12 20:52:06,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 1345 transitions. [2018-10-12 20:52:07,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1331 [2018-10-12 20:52:07,009 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:52:07,010 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 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] [2018-10-12 20:52:07,010 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:52:07,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:52:07,011 INFO L82 PathProgramCache]: Analyzing trace with hash 998147895, now seen corresponding path program 21 times [2018-10-12 20:52:07,011 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:52:07,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:52:14,480 INFO L134 CoverageAnalysis]: Checked inductivity of 33307 backedges. 0 proven. 31443 refuted. 0 times theorem prover too weak. 1864 trivial. 0 not checked. [2018-10-12 20:52:14,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:52:14,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-12 20:52:14,481 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-12 20:52:14,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-12 20:52:14,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1448, Unknown=0, NotChecked=0, Total=1560 [2018-10-12 20:52:14,482 INFO L87 Difference]: Start difference. First operand 1331 states and 1345 transitions. Second operand 40 states. [2018-10-12 20:52:22,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:52:22,604 INFO L93 Difference]: Finished difference Result 1529 states and 1545 transitions. [2018-10-12 20:52:22,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-12 20:52:22,605 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 1330 [2018-10-12 20:52:22,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:52:22,610 INFO L225 Difference]: With dead ends: 1529 [2018-10-12 20:52:22,610 INFO L226 Difference]: Without dead ends: 1529 [2018-10-12 20:52:22,612 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1613 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=715, Invalid=7657, Unknown=0, NotChecked=0, Total=8372 [2018-10-12 20:52:22,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1529 states. [2018-10-12 20:52:22,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1529 to 1431. [2018-10-12 20:52:22,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1431 states. [2018-10-12 20:52:22,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1431 states and 1446 transitions. [2018-10-12 20:52:22,626 INFO L78 Accepts]: Start accepts. Automaton has 1431 states and 1446 transitions. Word has length 1330 [2018-10-12 20:52:22,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:52:22,627 INFO L481 AbstractCegarLoop]: Abstraction has 1431 states and 1446 transitions. [2018-10-12 20:52:22,627 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-12 20:52:22,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 1446 transitions. [2018-10-12 20:52:22,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1431 [2018-10-12 20:52:22,643 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:52:22,644 INFO L375 BasicCegarLoop]: trace histogram [69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 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] [2018-10-12 20:52:22,644 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:52:22,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:52:22,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1436122018, now seen corresponding path program 22 times [2018-10-12 20:52:22,646 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:52:22,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:52:30,447 INFO L134 CoverageAnalysis]: Checked inductivity of 38738 backedges. 0 proven. 36719 refuted. 0 times theorem prover too weak. 2019 trivial. 0 not checked. [2018-10-12 20:52:30,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:52:30,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-12 20:52:30,448 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-12 20:52:30,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-12 20:52:30,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1604, Unknown=0, NotChecked=0, Total=1722 [2018-10-12 20:52:30,449 INFO L87 Difference]: Start difference. First operand 1431 states and 1446 transitions. Second operand 42 states. [2018-10-12 20:52:39,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:52:39,729 INFO L93 Difference]: Finished difference Result 1629 states and 1646 transitions. [2018-10-12 20:52:39,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-12 20:52:39,730 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 1430 [2018-10-12 20:52:39,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:52:39,734 INFO L225 Difference]: With dead ends: 1629 [2018-10-12 20:52:39,735 INFO L226 Difference]: Without dead ends: 1629 [2018-10-12 20:52:39,735 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1791 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=758, Invalid=8554, Unknown=0, NotChecked=0, Total=9312 [2018-10-12 20:52:39,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2018-10-12 20:52:39,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1531. [2018-10-12 20:52:39,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1531 states. [2018-10-12 20:52:39,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1531 states to 1531 states and 1547 transitions. [2018-10-12 20:52:39,749 INFO L78 Accepts]: Start accepts. Automaton has 1531 states and 1547 transitions. Word has length 1430 [2018-10-12 20:52:39,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:52:39,750 INFO L481 AbstractCegarLoop]: Abstraction has 1531 states and 1547 transitions. [2018-10-12 20:52:39,751 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-12 20:52:39,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1531 states and 1547 transitions. [2018-10-12 20:52:39,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1531 [2018-10-12 20:52:39,769 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:52:39,770 INFO L375 BasicCegarLoop]: trace histogram [74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 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] [2018-10-12 20:52:39,770 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:52:39,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:52:39,771 INFO L82 PathProgramCache]: Analyzing trace with hash 375586445, now seen corresponding path program 23 times [2018-10-12 20:52:39,772 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:52:39,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:52:49,803 INFO L134 CoverageAnalysis]: Checked inductivity of 44579 backedges. 0 proven. 42405 refuted. 0 times theorem prover too weak. 2174 trivial. 0 not checked. [2018-10-12 20:52:49,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:52:49,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-12 20:52:49,805 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-12 20:52:49,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-12 20:52:49,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1768, Unknown=0, NotChecked=0, Total=1892 [2018-10-12 20:52:49,805 INFO L87 Difference]: Start difference. First operand 1531 states and 1547 transitions. Second operand 44 states. [2018-10-12 20:52:59,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:52:59,911 INFO L93 Difference]: Finished difference Result 1729 states and 1747 transitions. [2018-10-12 20:52:59,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-12 20:52:59,911 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 1530 [2018-10-12 20:52:59,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:52:59,917 INFO L225 Difference]: With dead ends: 1729 [2018-10-12 20:52:59,917 INFO L226 Difference]: Without dead ends: 1729 [2018-10-12 20:52:59,918 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1978 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=801, Invalid=9501, Unknown=0, NotChecked=0, Total=10302 [2018-10-12 20:52:59,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1729 states. [2018-10-12 20:52:59,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1729 to 1631. [2018-10-12 20:52:59,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1631 states. [2018-10-12 20:52:59,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 1648 transitions. [2018-10-12 20:52:59,930 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 1648 transitions. Word has length 1530 [2018-10-12 20:52:59,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:52:59,930 INFO L481 AbstractCegarLoop]: Abstraction has 1631 states and 1648 transitions. [2018-10-12 20:52:59,931 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-12 20:52:59,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 1648 transitions. [2018-10-12 20:52:59,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1631 [2018-10-12 20:52:59,949 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:52:59,950 INFO L375 BasicCegarLoop]: trace histogram [79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 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] [2018-10-12 20:52:59,950 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:52:59,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:52:59,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1738420232, now seen corresponding path program 24 times [2018-10-12 20:52:59,952 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:53:00,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:53:01,172 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-12 20:53:09,998 INFO L134 CoverageAnalysis]: Checked inductivity of 50830 backedges. 0 proven. 48501 refuted. 0 times theorem prover too weak. 2329 trivial. 0 not checked. [2018-10-12 20:53:09,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:53:09,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-12 20:53:10,000 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-12 20:53:10,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-12 20:53:10,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1940, Unknown=0, NotChecked=0, Total=2070 [2018-10-12 20:53:10,000 INFO L87 Difference]: Start difference. First operand 1631 states and 1648 transitions. Second operand 46 states. [2018-10-12 20:53:21,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:53:21,264 INFO L93 Difference]: Finished difference Result 1829 states and 1848 transitions. [2018-10-12 20:53:21,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-12 20:53:21,265 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 1630 [2018-10-12 20:53:21,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:53:21,270 INFO L225 Difference]: With dead ends: 1829 [2018-10-12 20:53:21,270 INFO L226 Difference]: Without dead ends: 1829 [2018-10-12 20:53:21,272 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2174 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=844, Invalid=10498, Unknown=0, NotChecked=0, Total=11342 [2018-10-12 20:53:21,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1829 states. [2018-10-12 20:53:21,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1829 to 1731. [2018-10-12 20:53:21,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1731 states. [2018-10-12 20:53:21,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1731 states to 1731 states and 1749 transitions. [2018-10-12 20:53:21,288 INFO L78 Accepts]: Start accepts. Automaton has 1731 states and 1749 transitions. Word has length 1630 [2018-10-12 20:53:21,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:53:21,289 INFO L481 AbstractCegarLoop]: Abstraction has 1731 states and 1749 transitions. [2018-10-12 20:53:21,289 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-12 20:53:21,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1731 states and 1749 transitions. [2018-10-12 20:53:21,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1731 [2018-10-12 20:53:21,313 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:53:21,313 INFO L375 BasicCegarLoop]: trace histogram [84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 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] [2018-10-12 20:53:21,314 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:53:21,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:53:21,314 INFO L82 PathProgramCache]: Analyzing trace with hash -205738013, now seen corresponding path program 25 times [2018-10-12 20:53:21,315 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:53:21,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:53:22,621 WARN L178 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 14 [2018-10-12 20:53:22,944 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 16 [2018-10-12 20:53:33,224 INFO L134 CoverageAnalysis]: Checked inductivity of 57491 backedges. 0 proven. 55007 refuted. 0 times theorem prover too weak. 2484 trivial. 0 not checked. [2018-10-12 20:53:33,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:53:33,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-12 20:53:33,226 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-12 20:53:33,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-12 20:53:33,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=2120, Unknown=0, NotChecked=0, Total=2256 [2018-10-12 20:53:33,227 INFO L87 Difference]: Start difference. First operand 1731 states and 1749 transitions. Second operand 48 states. [2018-10-12 20:53:45,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:53:45,906 INFO L93 Difference]: Finished difference Result 1929 states and 1949 transitions. [2018-10-12 20:53:45,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-12 20:53:45,907 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 1730 [2018-10-12 20:53:45,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:53:45,912 INFO L225 Difference]: With dead ends: 1929 [2018-10-12 20:53:45,912 INFO L226 Difference]: Without dead ends: 1929 [2018-10-12 20:53:45,913 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2395 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=887, Invalid=11545, Unknown=0, NotChecked=0, Total=12432 [2018-10-12 20:53:45,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1929 states. [2018-10-12 20:53:45,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1929 to 1831. [2018-10-12 20:53:45,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1831 states. [2018-10-12 20:53:45,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1831 states to 1831 states and 1850 transitions. [2018-10-12 20:53:45,926 INFO L78 Accepts]: Start accepts. Automaton has 1831 states and 1850 transitions. Word has length 1730 [2018-10-12 20:53:45,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:53:45,927 INFO L481 AbstractCegarLoop]: Abstraction has 1831 states and 1850 transitions. [2018-10-12 20:53:45,927 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-12 20:53:45,927 INFO L276 IsEmpty]: Start isEmpty. Operand 1831 states and 1850 transitions. [2018-10-12 20:53:45,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1831 [2018-10-12 20:53:45,945 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:53:45,945 INFO L375 BasicCegarLoop]: trace histogram [89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 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] [2018-10-12 20:53:45,946 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:53:45,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:53:45,946 INFO L82 PathProgramCache]: Analyzing trace with hash -298164658, now seen corresponding path program 26 times [2018-10-12 20:53:45,947 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:53:46,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:53:59,891 INFO L134 CoverageAnalysis]: Checked inductivity of 64562 backedges. 0 proven. 61923 refuted. 0 times theorem prover too weak. 2639 trivial. 0 not checked. [2018-10-12 20:53:59,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:53:59,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-12 20:53:59,892 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-12 20:53:59,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-12 20:53:59,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=2308, Unknown=0, NotChecked=0, Total=2450 [2018-10-12 20:53:59,893 INFO L87 Difference]: Start difference. First operand 1831 states and 1850 transitions. Second operand 50 states. [2018-10-12 20:54:12,370 WARN L178 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2018-10-12 20:54:14,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:54:14,155 INFO L93 Difference]: Finished difference Result 2029 states and 2050 transitions. [2018-10-12 20:54:14,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-12 20:54:14,155 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 1830 [2018-10-12 20:54:14,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:54:14,161 INFO L225 Difference]: With dead ends: 2029 [2018-10-12 20:54:14,161 INFO L226 Difference]: Without dead ends: 2029 [2018-10-12 20:54:14,162 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2609 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=930, Invalid=12642, Unknown=0, NotChecked=0, Total=13572 [2018-10-12 20:54:14,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2029 states. [2018-10-12 20:54:14,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2029 to 1931. [2018-10-12 20:54:14,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1931 states. [2018-10-12 20:54:14,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1931 states to 1931 states and 1951 transitions. [2018-10-12 20:54:14,177 INFO L78 Accepts]: Start accepts. Automaton has 1931 states and 1951 transitions. Word has length 1830 [2018-10-12 20:54:14,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:54:14,178 INFO L481 AbstractCegarLoop]: Abstraction has 1931 states and 1951 transitions. [2018-10-12 20:54:14,178 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-12 20:54:14,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 1951 transitions. [2018-10-12 20:54:14,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1931 [2018-10-12 20:54:14,198 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:54:14,199 INFO L375 BasicCegarLoop]: trace histogram [94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 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] [2018-10-12 20:54:14,199 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:54:14,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:54:14,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1421763783, now seen corresponding path program 27 times [2018-10-12 20:54:14,200 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:54:14,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:54:28,104 INFO L134 CoverageAnalysis]: Checked inductivity of 72043 backedges. 0 proven. 69249 refuted. 0 times theorem prover too weak. 2794 trivial. 0 not checked. [2018-10-12 20:54:28,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:54:28,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-12 20:54:28,105 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-12 20:54:28,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-12 20:54:28,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=2504, Unknown=0, NotChecked=0, Total=2652 [2018-10-12 20:54:28,106 INFO L87 Difference]: Start difference. First operand 1931 states and 1951 transitions. Second operand 52 states. [2018-10-12 20:54:43,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:54:43,195 INFO L93 Difference]: Finished difference Result 2129 states and 2151 transitions. [2018-10-12 20:54:43,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-12 20:54:43,196 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 1930 [2018-10-12 20:54:43,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:54:43,202 INFO L225 Difference]: With dead ends: 2129 [2018-10-12 20:54:43,202 INFO L226 Difference]: Without dead ends: 2129 [2018-10-12 20:54:43,203 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2816 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=973, Invalid=13789, Unknown=0, NotChecked=0, Total=14762 [2018-10-12 20:54:43,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2129 states. [2018-10-12 20:54:43,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2129 to 2031. [2018-10-12 20:54:43,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2031 states. [2018-10-12 20:54:43,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2031 states to 2031 states and 2052 transitions. [2018-10-12 20:54:43,217 INFO L78 Accepts]: Start accepts. Automaton has 2031 states and 2052 transitions. Word has length 1930 [2018-10-12 20:54:43,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:54:43,217 INFO L481 AbstractCegarLoop]: Abstraction has 2031 states and 2052 transitions. [2018-10-12 20:54:43,218 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-12 20:54:43,218 INFO L276 IsEmpty]: Start isEmpty. Operand 2031 states and 2052 transitions. [2018-10-12 20:54:43,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2031 [2018-10-12 20:54:43,239 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:54:43,240 INFO L375 BasicCegarLoop]: trace histogram [99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 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] [2018-10-12 20:54:43,240 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:54:43,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:54:43,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1540957860, now seen corresponding path program 28 times [2018-10-12 20:54:43,241 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:54:43,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:54:58,197 INFO L134 CoverageAnalysis]: Checked inductivity of 79934 backedges. 0 proven. 76985 refuted. 0 times theorem prover too weak. 2949 trivial. 0 not checked. [2018-10-12 20:54:58,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:54:58,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-12 20:54:58,199 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-12 20:54:58,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-12 20:54:58,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=2708, Unknown=0, NotChecked=0, Total=2862 [2018-10-12 20:54:58,199 INFO L87 Difference]: Start difference. First operand 2031 states and 2052 transitions. Second operand 54 states. [2018-10-12 20:55:14,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:55:14,755 INFO L93 Difference]: Finished difference Result 2229 states and 2252 transitions. [2018-10-12 20:55:14,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-12 20:55:14,755 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 2030 [2018-10-12 20:55:14,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:55:14,762 INFO L225 Difference]: With dead ends: 2229 [2018-10-12 20:55:14,762 INFO L226 Difference]: Without dead ends: 2229 [2018-10-12 20:55:14,763 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3048 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=1016, Invalid=14986, Unknown=0, NotChecked=0, Total=16002 [2018-10-12 20:55:14,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2229 states. [2018-10-12 20:55:14,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2229 to 2131. [2018-10-12 20:55:14,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2131 states. [2018-10-12 20:55:14,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2131 states to 2131 states and 2153 transitions. [2018-10-12 20:55:14,784 INFO L78 Accepts]: Start accepts. Automaton has 2131 states and 2153 transitions. Word has length 2030 [2018-10-12 20:55:14,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:55:14,785 INFO L481 AbstractCegarLoop]: Abstraction has 2131 states and 2153 transitions. [2018-10-12 20:55:14,785 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-12 20:55:14,785 INFO L276 IsEmpty]: Start isEmpty. Operand 2131 states and 2153 transitions. [2018-10-12 20:55:14,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2131 [2018-10-12 20:55:14,820 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:55:14,821 INFO L375 BasicCegarLoop]: trace histogram [104, 104, 104, 104, 104, 104, 104, 104, 104, 104, 104, 104, 104, 104, 104, 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] [2018-10-12 20:55:14,821 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:55:14,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:55:14,822 INFO L82 PathProgramCache]: Analyzing trace with hash -290996081, now seen corresponding path program 29 times [2018-10-12 20:55:14,822 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:55:14,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:55:31,150 INFO L134 CoverageAnalysis]: Checked inductivity of 88235 backedges. 0 proven. 85131 refuted. 0 times theorem prover too weak. 3104 trivial. 0 not checked. [2018-10-12 20:55:31,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:55:31,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-10-12 20:55:31,152 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-12 20:55:31,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-12 20:55:31,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=2920, Unknown=0, NotChecked=0, Total=3080 [2018-10-12 20:55:31,153 INFO L87 Difference]: Start difference. First operand 2131 states and 2153 transitions. Second operand 56 states. [2018-10-12 20:55:48,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:55:48,705 INFO L93 Difference]: Finished difference Result 2329 states and 2353 transitions. [2018-10-12 20:55:48,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-12 20:55:48,705 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 2130 [2018-10-12 20:55:48,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:55:48,713 INFO L225 Difference]: With dead ends: 2329 [2018-10-12 20:55:48,713 INFO L226 Difference]: Without dead ends: 2329 [2018-10-12 20:55:48,715 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3289 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=1059, Invalid=16233, Unknown=0, NotChecked=0, Total=17292 [2018-10-12 20:55:48,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2329 states. [2018-10-12 20:55:48,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2329 to 2231. [2018-10-12 20:55:48,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2231 states. [2018-10-12 20:55:48,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2231 states to 2231 states and 2254 transitions. [2018-10-12 20:55:48,732 INFO L78 Accepts]: Start accepts. Automaton has 2231 states and 2254 transitions. Word has length 2130 [2018-10-12 20:55:48,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:55:48,733 INFO L481 AbstractCegarLoop]: Abstraction has 2231 states and 2254 transitions. [2018-10-12 20:55:48,733 INFO L482 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-12 20:55:48,733 INFO L276 IsEmpty]: Start isEmpty. Operand 2231 states and 2254 transitions. [2018-10-12 20:55:48,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2231 [2018-10-12 20:55:48,760 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:55:48,760 INFO L375 BasicCegarLoop]: trace histogram [109, 109, 109, 109, 109, 109, 109, 109, 109, 109, 109, 109, 109, 109, 109, 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] [2018-10-12 20:55:48,761 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:55:48,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:55:48,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1074517766, now seen corresponding path program 30 times [2018-10-12 20:55:48,762 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:55:48,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:56:05,992 INFO L134 CoverageAnalysis]: Checked inductivity of 96946 backedges. 0 proven. 93687 refuted. 0 times theorem prover too weak. 3259 trivial. 0 not checked. [2018-10-12 20:56:05,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:56:05,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-10-12 20:56:05,994 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-12 20:56:05,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-12 20:56:05,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=3140, Unknown=0, NotChecked=0, Total=3306 [2018-10-12 20:56:05,995 INFO L87 Difference]: Start difference. First operand 2231 states and 2254 transitions. Second operand 58 states. [2018-10-12 20:56:25,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:56:25,107 INFO L93 Difference]: Finished difference Result 2429 states and 2454 transitions. [2018-10-12 20:56:25,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-12 20:56:25,107 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 2230 [2018-10-12 20:56:25,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:56:25,114 INFO L225 Difference]: With dead ends: 2429 [2018-10-12 20:56:25,114 INFO L226 Difference]: Without dead ends: 2429 [2018-10-12 20:56:25,116 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3539 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=1102, Invalid=17530, Unknown=0, NotChecked=0, Total=18632 [2018-10-12 20:56:25,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2429 states. [2018-10-12 20:56:25,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2429 to 2331. [2018-10-12 20:56:25,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2331 states. [2018-10-12 20:56:25,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2331 states to 2331 states and 2355 transitions. [2018-10-12 20:56:25,135 INFO L78 Accepts]: Start accepts. Automaton has 2331 states and 2355 transitions. Word has length 2230 [2018-10-12 20:56:25,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:56:25,136 INFO L481 AbstractCegarLoop]: Abstraction has 2331 states and 2355 transitions. [2018-10-12 20:56:25,136 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-12 20:56:25,137 INFO L276 IsEmpty]: Start isEmpty. Operand 2331 states and 2355 transitions. [2018-10-12 20:56:25,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2331 [2018-10-12 20:56:25,174 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:56:25,175 INFO L375 BasicCegarLoop]: trace histogram [114, 114, 114, 114, 114, 114, 114, 114, 114, 114, 114, 114, 114, 114, 114, 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] [2018-10-12 20:56:25,175 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:56:25,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:56:25,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1235558373, now seen corresponding path program 31 times [2018-10-12 20:56:25,176 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:56:25,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:56:44,564 INFO L134 CoverageAnalysis]: Checked inductivity of 106067 backedges. 0 proven. 102653 refuted. 0 times theorem prover too weak. 3414 trivial. 0 not checked. [2018-10-12 20:56:44,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:56:44,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-10-12 20:56:44,566 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-12 20:56:44,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-12 20:56:44,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=3368, Unknown=0, NotChecked=0, Total=3540 [2018-10-12 20:56:44,566 INFO L87 Difference]: Start difference. First operand 2331 states and 2355 transitions. Second operand 60 states. [2018-10-12 20:57:06,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:57:06,051 INFO L93 Difference]: Finished difference Result 2529 states and 2555 transitions. [2018-10-12 20:57:06,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-12 20:57:06,051 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 2330 [2018-10-12 20:57:06,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:57:06,055 INFO L225 Difference]: With dead ends: 2529 [2018-10-12 20:57:06,056 INFO L226 Difference]: Without dead ends: 2529 [2018-10-12 20:57:06,057 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3798 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=1145, Invalid=18877, Unknown=0, NotChecked=0, Total=20022 [2018-10-12 20:57:06,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2529 states. [2018-10-12 20:57:06,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2529 to 2431. [2018-10-12 20:57:06,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2431 states. [2018-10-12 20:57:06,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2431 states to 2431 states and 2456 transitions. [2018-10-12 20:57:06,078 INFO L78 Accepts]: Start accepts. Automaton has 2431 states and 2456 transitions. Word has length 2330 [2018-10-12 20:57:06,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:57:06,079 INFO L481 AbstractCegarLoop]: Abstraction has 2431 states and 2456 transitions. [2018-10-12 20:57:06,079 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-12 20:57:06,079 INFO L276 IsEmpty]: Start isEmpty. Operand 2431 states and 2456 transitions. [2018-10-12 20:57:06,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2431 [2018-10-12 20:57:06,109 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:57:06,110 INFO L375 BasicCegarLoop]: trace histogram [119, 119, 119, 119, 119, 119, 119, 119, 119, 119, 119, 119, 119, 119, 119, 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] [2018-10-12 20:57:06,110 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:57:06,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:57:06,110 INFO L82 PathProgramCache]: Analyzing trace with hash -750688944, now seen corresponding path program 32 times [2018-10-12 20:57:06,111 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:57:06,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:57:26,330 INFO L134 CoverageAnalysis]: Checked inductivity of 115598 backedges. 0 proven. 112029 refuted. 0 times theorem prover too weak. 3569 trivial. 0 not checked. [2018-10-12 20:57:26,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:57:26,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-10-12 20:57:26,332 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-12 20:57:26,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-12 20:57:26,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=3604, Unknown=0, NotChecked=0, Total=3782 [2018-10-12 20:57:26,333 INFO L87 Difference]: Start difference. First operand 2431 states and 2456 transitions. Second operand 62 states. [2018-10-12 20:57:48,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:57:48,784 INFO L93 Difference]: Finished difference Result 2629 states and 2656 transitions. [2018-10-12 20:57:48,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-10-12 20:57:48,784 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 2430 [2018-10-12 20:57:48,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:57:48,790 INFO L225 Difference]: With dead ends: 2629 [2018-10-12 20:57:48,790 INFO L226 Difference]: Without dead ends: 2629 [2018-10-12 20:57:48,791 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4066 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=1188, Invalid=20274, Unknown=0, NotChecked=0, Total=21462 [2018-10-12 20:57:48,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2629 states. [2018-10-12 20:57:48,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2629 to 2531. [2018-10-12 20:57:48,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2531 states. [2018-10-12 20:57:48,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2531 states to 2531 states and 2557 transitions. [2018-10-12 20:57:48,805 INFO L78 Accepts]: Start accepts. Automaton has 2531 states and 2557 transitions. Word has length 2430 [2018-10-12 20:57:48,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:57:48,806 INFO L481 AbstractCegarLoop]: Abstraction has 2531 states and 2557 transitions. [2018-10-12 20:57:48,806 INFO L482 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-12 20:57:48,806 INFO L276 IsEmpty]: Start isEmpty. Operand 2531 states and 2557 transitions. [2018-10-12 20:57:48,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2531 [2018-10-12 20:57:48,857 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:57:48,858 INFO L375 BasicCegarLoop]: trace histogram [124, 124, 124, 124, 124, 124, 124, 124, 124, 124, 124, 124, 124, 124, 124, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:57:48,858 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:57:48,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:57:48,859 INFO L82 PathProgramCache]: Analyzing trace with hash 569358651, now seen corresponding path program 33 times [2018-10-12 20:57:48,859 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:57:48,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:58:10,781 INFO L134 CoverageAnalysis]: Checked inductivity of 125539 backedges. 0 proven. 121815 refuted. 0 times theorem prover too weak. 3724 trivial. 0 not checked. [2018-10-12 20:58:10,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:58:10,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-10-12 20:58:10,782 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-12 20:58:10,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-12 20:58:10,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=3848, Unknown=0, NotChecked=0, Total=4032 [2018-10-12 20:58:10,783 INFO L87 Difference]: Start difference. First operand 2531 states and 2557 transitions. Second operand 64 states. [2018-10-12 20:58:34,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:58:34,957 INFO L93 Difference]: Finished difference Result 2729 states and 2757 transitions. [2018-10-12 20:58:34,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-10-12 20:58:34,957 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 2530 [2018-10-12 20:58:34,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:58:34,962 INFO L225 Difference]: With dead ends: 2729 [2018-10-12 20:58:34,962 INFO L226 Difference]: Without dead ends: 2729 [2018-10-12 20:58:34,964 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4343 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=1231, Invalid=21721, Unknown=0, NotChecked=0, Total=22952 [2018-10-12 20:58:34,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2729 states. [2018-10-12 20:58:34,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2729 to 2631. [2018-10-12 20:58:34,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2631 states. [2018-10-12 20:58:34,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2631 states to 2631 states and 2658 transitions. [2018-10-12 20:58:34,980 INFO L78 Accepts]: Start accepts. Automaton has 2631 states and 2658 transitions. Word has length 2530 [2018-10-12 20:58:34,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:58:34,981 INFO L481 AbstractCegarLoop]: Abstraction has 2631 states and 2658 transitions. [2018-10-12 20:58:34,981 INFO L482 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-12 20:58:34,981 INFO L276 IsEmpty]: Start isEmpty. Operand 2631 states and 2658 transitions. [2018-10-12 20:58:35,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2631 [2018-10-12 20:58:35,017 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:58:35,018 INFO L375 BasicCegarLoop]: trace histogram [129, 129, 129, 129, 129, 129, 129, 129, 129, 129, 129, 129, 129, 129, 129, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:58:35,018 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:58:35,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:58:35,019 INFO L82 PathProgramCache]: Analyzing trace with hash 678878118, now seen corresponding path program 34 times [2018-10-12 20:58:35,020 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:58:35,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:58:58,531 INFO L134 CoverageAnalysis]: Checked inductivity of 135890 backedges. 0 proven. 132011 refuted. 0 times theorem prover too weak. 3879 trivial. 0 not checked. [2018-10-12 20:58:58,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:58:58,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-10-12 20:58:58,533 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-12 20:58:58,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-12 20:58:58,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=4100, Unknown=0, NotChecked=0, Total=4290 [2018-10-12 20:58:58,534 INFO L87 Difference]: Start difference. First operand 2631 states and 2658 transitions. Second operand 66 states.