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_true-valid-memsafety_true-termination.c_10.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-093a8c0 [2018-10-14 16:30:58,438 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-14 16:30:58,440 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-14 16:30:58,453 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-14 16:30:58,453 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-14 16:30:58,454 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-14 16:30:58,456 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-14 16:30:58,458 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-14 16:30:58,462 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-14 16:30:58,463 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-14 16:30:58,472 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-14 16:30:58,472 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-14 16:30:58,473 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-14 16:30:58,474 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-14 16:30:58,478 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-14 16:30:58,479 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-14 16:30:58,481 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-14 16:30:58,484 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-14 16:30:58,489 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-14 16:30:58,490 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-14 16:30:58,493 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-14 16:30:58,495 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-14 16:30:58,497 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-14 16:30:58,497 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-14 16:30:58,497 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-14 16:30:58,498 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-14 16:30:58,499 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-14 16:30:58,500 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-14 16:30:58,501 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-14 16:30:58,502 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-14 16:30:58,502 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-14 16:30:58,503 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-14 16:30:58,503 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-14 16:30:58,503 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-14 16:30:58,504 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-14 16:30:58,505 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-14 16:30:58,505 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-14 16:30:58,515 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-14 16:30:58,515 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-14 16:30:58,516 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-14 16:30:58,516 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-14 16:30:58,516 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-14 16:30:58,517 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-14 16:30:58,517 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-14 16:30:58,518 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-14 16:30:58,518 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-14 16:30:58,518 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-14 16:30:58,518 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-14 16:30:58,519 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-14 16:30:58,519 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-14 16:30:58,520 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-14 16:30:58,520 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-14 16:30:58,595 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-14 16:30:58,614 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-14 16:30:58,620 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-14 16:30:58,622 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-14 16:30:58,622 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-14 16:30:58,623 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_10.bpl [2018-10-14 16:30:58,623 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_10.bpl' [2018-10-14 16:30:58,708 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-14 16:30:58,710 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-14 16:30:58,711 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-14 16:30:58,711 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-14 16:30:58,711 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-14 16:30:58,739 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:30:58" (1/1) ... [2018-10-14 16:30:58,741 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:30:58" (1/1) ... [2018-10-14 16:30:58,758 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:30:58" (1/1) ... [2018-10-14 16:30:58,759 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:30:58" (1/1) ... [2018-10-14 16:30:58,768 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:30:58" (1/1) ... [2018-10-14 16:30:58,770 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:30:58" (1/1) ... [2018-10-14 16:30:58,776 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:30:58" (1/1) ... [2018-10-14 16:30:58,779 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-14 16:30:58,780 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-14 16:30:58,780 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-14 16:30:58,780 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-14 16:30:58,782 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:30:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-14 16:30:58,855 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-14 16:30:58,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-14 16:30:58,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-14 16:30:59,404 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-14 16:30:59,405 INFO L202 PluginConnector]: Adding new model ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:30:59 BoogieIcfgContainer [2018-10-14 16:30:59,405 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-14 16:30:59,406 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-14 16:30:59,406 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-14 16:30:59,409 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-14 16:30:59,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:30:58" (1/2) ... [2018-10-14 16:30:59,410 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b3ae109 and model type ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:30:59, skipping insertion in model container [2018-10-14 16:30:59,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:30:59" (2/2) ... [2018-10-14 16:30:59,413 INFO L112 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_10.bpl [2018-10-14 16:30:59,422 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-14 16:30:59,431 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-14 16:30:59,448 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-14 16:30:59,481 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-14 16:30:59,482 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-14 16:30:59,482 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-14 16:30:59,482 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-14 16:30:59,482 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-14 16:30:59,482 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-14 16:30:59,482 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-14 16:30:59,483 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-14 16:30:59,483 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-14 16:30:59,502 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2018-10-14 16:30:59,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-14 16:30:59,512 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:30:59,513 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-14 16:30:59,514 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:30:59,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:30:59,520 INFO L82 PathProgramCache]: Analyzing trace with hash -2107550204, now seen corresponding path program 1 times [2018-10-14 16:30:59,573 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:30:59,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:30:59,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:30:59,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 16:30:59,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-14 16:30:59,839 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-14 16:30:59,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-14 16:30:59,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-14 16:30:59,858 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 6 states. [2018-10-14 16:31:00,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:31:00,341 INFO L93 Difference]: Finished difference Result 127 states and 129 transitions. [2018-10-14 16:31:00,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-14 16:31:00,343 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2018-10-14 16:31:00,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:31:00,355 INFO L225 Difference]: With dead ends: 127 [2018-10-14 16:31:00,355 INFO L226 Difference]: Without dead ends: 127 [2018-10-14 16:31:00,358 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-10-14 16:31:00,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-10-14 16:31:00,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 78. [2018-10-14 16:31:00,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-10-14 16:31:00,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2018-10-14 16:31:00,404 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 45 [2018-10-14 16:31:00,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:31:00,405 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2018-10-14 16:31:00,405 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-14 16:31:00,405 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2018-10-14 16:31:00,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-14 16:31:00,407 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:31:00,408 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-14 16:31:00,408 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:31:00,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:31:00,409 INFO L82 PathProgramCache]: Analyzing trace with hash -477820300, now seen corresponding path program 1 times [2018-10-14 16:31:00,410 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:31:00,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:31:00,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-14 16:31:00,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 16:31:00,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-14 16:31:00,997 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-14 16:31:00,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-14 16:31:00,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-10-14 16:31:00,999 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 12 states. [2018-10-14 16:31:01,272 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-14 16:31:02,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:31:02,338 INFO L93 Difference]: Finished difference Result 137 states and 140 transitions. [2018-10-14 16:31:02,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-14 16:31:02,341 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2018-10-14 16:31:02,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:31:02,346 INFO L225 Difference]: With dead ends: 137 [2018-10-14 16:31:02,346 INFO L226 Difference]: Without dead ends: 137 [2018-10-14 16:31:02,348 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2018-10-14 16:31:02,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-10-14 16:31:02,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 100. [2018-10-14 16:31:02,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-10-14 16:31:02,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2018-10-14 16:31:02,362 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 60 [2018-10-14 16:31:02,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:31:02,365 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2018-10-14 16:31:02,365 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-14 16:31:02,365 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2018-10-14 16:31:02,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-14 16:31:02,369 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:31:02,369 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:31:02,369 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:31:02,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:31:02,370 INFO L82 PathProgramCache]: Analyzing trace with hash -344888071, now seen corresponding path program 1 times [2018-10-14 16:31:02,371 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:31:02,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:31:02,601 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-14 16:31:02,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:31:02,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-14 16:31:02,603 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-14 16:31:02,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-14 16:31:02,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-14 16:31:02,604 INFO L87 Difference]: Start difference. First operand 100 states and 102 transitions. Second operand 8 states. [2018-10-14 16:31:02,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:31:02,930 INFO L93 Difference]: Finished difference Result 167 states and 170 transitions. [2018-10-14 16:31:02,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-14 16:31:02,931 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 85 [2018-10-14 16:31:02,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:31:02,933 INFO L225 Difference]: With dead ends: 167 [2018-10-14 16:31:02,933 INFO L226 Difference]: Without dead ends: 167 [2018-10-14 16:31:02,934 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-10-14 16:31:02,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-10-14 16:31:02,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 118. [2018-10-14 16:31:02,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-10-14 16:31:02,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 120 transitions. [2018-10-14 16:31:02,944 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 120 transitions. Word has length 85 [2018-10-14 16:31:02,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:31:02,945 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 120 transitions. [2018-10-14 16:31:02,945 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-14 16:31:02,945 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 120 transitions. [2018-10-14 16:31:02,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-14 16:31:02,948 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:31:02,948 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-14 16:31:02,949 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:31:02,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:31:02,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1574991137, now seen corresponding path program 2 times [2018-10-14 16:31:02,950 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:31:02,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:31:03,200 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-14 16:31:03,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:31:03,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-14 16:31:03,201 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-14 16:31:03,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-14 16:31:03,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-10-14 16:31:03,202 INFO L87 Difference]: Start difference. First operand 118 states and 120 transitions. Second operand 10 states. [2018-10-14 16:31:03,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:31:03,553 INFO L93 Difference]: Finished difference Result 169 states and 172 transitions. [2018-10-14 16:31:03,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-14 16:31:03,553 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 100 [2018-10-14 16:31:03,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:31:03,556 INFO L225 Difference]: With dead ends: 169 [2018-10-14 16:31:03,556 INFO L226 Difference]: Without dead ends: 169 [2018-10-14 16:31:03,557 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2018-10-14 16:31:03,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-10-14 16:31:03,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 133. [2018-10-14 16:31:03,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-10-14 16:31:03,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 135 transitions. [2018-10-14 16:31:03,567 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 135 transitions. Word has length 100 [2018-10-14 16:31:03,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:31:03,568 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 135 transitions. [2018-10-14 16:31:03,568 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-14 16:31:03,568 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 135 transitions. [2018-10-14 16:31:03,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-14 16:31:03,570 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:31:03,570 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-14 16:31:03,571 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:31:03,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:31:03,571 INFO L82 PathProgramCache]: Analyzing trace with hash 685843513, now seen corresponding path program 3 times [2018-10-14 16:31:03,572 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:31:03,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:31:04,071 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-14 16:31:04,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:31:04,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-14 16:31:04,072 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-14 16:31:04,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-14 16:31:04,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-10-14 16:31:04,073 INFO L87 Difference]: Start difference. First operand 133 states and 135 transitions. Second operand 15 states. [2018-10-14 16:31:05,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:31:05,412 INFO L93 Difference]: Finished difference Result 192 states and 196 transitions. [2018-10-14 16:31:05,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-14 16:31:05,413 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 115 [2018-10-14 16:31:05,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:31:05,415 INFO L225 Difference]: With dead ends: 192 [2018-10-14 16:31:05,415 INFO L226 Difference]: Without dead ends: 192 [2018-10-14 16:31:05,416 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=192, Invalid=738, Unknown=0, NotChecked=0, Total=930 [2018-10-14 16:31:05,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-10-14 16:31:05,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 155. [2018-10-14 16:31:05,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-10-14 16:31:05,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 158 transitions. [2018-10-14 16:31:05,427 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 158 transitions. Word has length 115 [2018-10-14 16:31:05,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:31:05,428 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 158 transitions. [2018-10-14 16:31:05,428 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-14 16:31:05,428 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 158 transitions. [2018-10-14 16:31:05,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-14 16:31:05,431 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:31:05,431 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-14 16:31:05,432 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:31:05,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:31:05,432 INFO L82 PathProgramCache]: Analyzing trace with hash -890213676, now seen corresponding path program 4 times [2018-10-14 16:31:05,433 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:31:05,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:31:05,682 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 17 proven. 78 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-14 16:31:05,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:31:05,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-14 16:31:05,684 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-14 16:31:05,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-14 16:31:05,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-10-14 16:31:05,685 INFO L87 Difference]: Start difference. First operand 155 states and 158 transitions. Second operand 10 states. [2018-10-14 16:31:06,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:31:06,055 INFO L93 Difference]: Finished difference Result 181 states and 184 transitions. [2018-10-14 16:31:06,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-14 16:31:06,055 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 140 [2018-10-14 16:31:06,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:31:06,057 INFO L225 Difference]: With dead ends: 181 [2018-10-14 16:31:06,057 INFO L226 Difference]: Without dead ends: 181 [2018-10-14 16:31:06,057 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2018-10-14 16:31:06,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-10-14 16:31:06,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 156. [2018-10-14 16:31:06,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-10-14 16:31:06,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 159 transitions. [2018-10-14 16:31:06,074 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 159 transitions. Word has length 140 [2018-10-14 16:31:06,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:31:06,078 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 159 transitions. [2018-10-14 16:31:06,078 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-14 16:31:06,079 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 159 transitions. [2018-10-14 16:31:06,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-14 16:31:06,082 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:31:06,082 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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-14 16:31:06,082 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:31:06,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:31:06,086 INFO L82 PathProgramCache]: Analyzing trace with hash 921680804, now seen corresponding path program 5 times [2018-10-14 16:31:06,087 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:31:06,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:31:06,402 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 17 proven. 126 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-14 16:31:06,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:31:06,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-14 16:31:06,403 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-14 16:31:06,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-14 16:31:06,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-10-14 16:31:06,403 INFO L87 Difference]: Start difference. First operand 156 states and 159 transitions. Second operand 12 states. [2018-10-14 16:31:06,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:31:06,903 INFO L93 Difference]: Finished difference Result 196 states and 199 transitions. [2018-10-14 16:31:06,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-14 16:31:06,904 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 155 [2018-10-14 16:31:06,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:31:06,906 INFO L225 Difference]: With dead ends: 196 [2018-10-14 16:31:06,906 INFO L226 Difference]: Without dead ends: 196 [2018-10-14 16:31:06,907 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2018-10-14 16:31:06,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-10-14 16:31:06,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 171. [2018-10-14 16:31:06,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-10-14 16:31:06,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 174 transitions. [2018-10-14 16:31:06,913 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 174 transitions. Word has length 155 [2018-10-14 16:31:06,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:31:06,913 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 174 transitions. [2018-10-14 16:31:06,913 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-14 16:31:06,913 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 174 transitions. [2018-10-14 16:31:06,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-14 16:31:06,916 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:31:06,917 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-14 16:31:06,917 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:31:06,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:31:06,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1223340244, now seen corresponding path program 6 times [2018-10-14 16:31:06,918 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:31:06,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:31:07,697 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 17 proven. 189 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-14 16:31:07,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:31:07,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-14 16:31:07,698 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-14 16:31:07,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-14 16:31:07,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-10-14 16:31:07,699 INFO L87 Difference]: Start difference. First operand 171 states and 174 transitions. Second operand 14 states. [2018-10-14 16:31:08,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:31:08,276 INFO L93 Difference]: Finished difference Result 198 states and 201 transitions. [2018-10-14 16:31:08,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-14 16:31:08,277 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 170 [2018-10-14 16:31:08,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:31:08,279 INFO L225 Difference]: With dead ends: 198 [2018-10-14 16:31:08,279 INFO L226 Difference]: Without dead ends: 198 [2018-10-14 16:31:08,280 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=181, Invalid=689, Unknown=0, NotChecked=0, Total=870 [2018-10-14 16:31:08,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-10-14 16:31:08,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 186. [2018-10-14 16:31:08,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-10-14 16:31:08,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 189 transitions. [2018-10-14 16:31:08,285 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 189 transitions. Word has length 170 [2018-10-14 16:31:08,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:31:08,286 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 189 transitions. [2018-10-14 16:31:08,286 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-14 16:31:08,286 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 189 transitions. [2018-10-14 16:31:08,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-10-14 16:31:08,288 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:31:08,289 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-14 16:31:08,289 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:31:08,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:31:08,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1470057052, now seen corresponding path program 7 times [2018-10-14 16:31:08,290 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:31:08,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:31:08,888 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-14 16:31:09,872 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 0 proven. 236 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-10-14 16:31:09,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:31:09,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-14 16:31:09,873 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-14 16:31:09,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-14 16:31:09,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2018-10-14 16:31:09,873 INFO L87 Difference]: Start difference. First operand 186 states and 189 transitions. Second operand 18 states. [2018-10-14 16:31:11,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:31:11,301 INFO L93 Difference]: Finished difference Result 324 states and 329 transitions. [2018-10-14 16:31:11,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-14 16:31:11,308 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 185 [2018-10-14 16:31:11,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:31:11,310 INFO L225 Difference]: With dead ends: 324 [2018-10-14 16:31:11,310 INFO L226 Difference]: Without dead ends: 324 [2018-10-14 16:31:11,311 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=242, Invalid=1090, Unknown=0, NotChecked=0, Total=1332 [2018-10-14 16:31:11,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-10-14 16:31:11,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 256. [2018-10-14 16:31:11,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-10-14 16:31:11,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 260 transitions. [2018-10-14 16:31:11,319 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 260 transitions. Word has length 185 [2018-10-14 16:31:11,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:31:11,319 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 260 transitions. [2018-10-14 16:31:11,319 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-14 16:31:11,319 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 260 transitions. [2018-10-14 16:31:11,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-10-14 16:31:11,326 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:31:11,327 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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-14 16:31:11,327 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:31:11,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:31:11,327 INFO L82 PathProgramCache]: Analyzing trace with hash -2006224177, now seen corresponding path program 8 times [2018-10-14 16:31:11,331 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:31:11,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:31:12,072 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 588 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-10-14 16:31:12,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:31:12,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-14 16:31:12,073 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-14 16:31:12,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-14 16:31:12,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2018-10-14 16:31:12,074 INFO L87 Difference]: Start difference. First operand 256 states and 260 transitions. Second operand 22 states. [2018-10-14 16:31:13,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:31:13,933 INFO L93 Difference]: Finished difference Result 394 states and 400 transitions. [2018-10-14 16:31:13,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-14 16:31:13,933 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 255 [2018-10-14 16:31:13,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:31:13,936 INFO L225 Difference]: With dead ends: 394 [2018-10-14 16:31:13,936 INFO L226 Difference]: Without dead ends: 394 [2018-10-14 16:31:13,938 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=390, Invalid=1590, Unknown=0, NotChecked=0, Total=1980 [2018-10-14 16:31:13,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-10-14 16:31:13,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 326. [2018-10-14 16:31:13,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-10-14 16:31:13,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 331 transitions. [2018-10-14 16:31:13,944 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 331 transitions. Word has length 255 [2018-10-14 16:31:13,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:31:13,945 INFO L481 AbstractCegarLoop]: Abstraction has 326 states and 331 transitions. [2018-10-14 16:31:13,945 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-14 16:31:13,945 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 331 transitions. [2018-10-14 16:31:13,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2018-10-14 16:31:13,947 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:31:13,947 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 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-14 16:31:13,948 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:31:13,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:31:13,948 INFO L82 PathProgramCache]: Analyzing trace with hash -727479366, now seen corresponding path program 9 times [2018-10-14 16:31:13,949 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:31:13,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:31:14,663 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 14 [2018-10-14 16:31:15,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1268 backedges. 0 proven. 1106 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-10-14 16:31:15,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:31:15,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-14 16:31:15,352 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-14 16:31:15,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-14 16:31:15,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2018-10-14 16:31:15,353 INFO L87 Difference]: Start difference. First operand 326 states and 331 transitions. Second operand 22 states. [2018-10-14 16:31:17,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:31:17,702 INFO L93 Difference]: Finished difference Result 464 states and 471 transitions. [2018-10-14 16:31:17,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-14 16:31:17,703 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 325 [2018-10-14 16:31:17,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:31:17,705 INFO L225 Difference]: With dead ends: 464 [2018-10-14 16:31:17,705 INFO L226 Difference]: Without dead ends: 464 [2018-10-14 16:31:17,707 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=328, Invalid=1834, Unknown=0, NotChecked=0, Total=2162 [2018-10-14 16:31:17,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-10-14 16:31:17,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 396. [2018-10-14 16:31:17,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-10-14 16:31:17,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 402 transitions. [2018-10-14 16:31:17,714 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 402 transitions. Word has length 325 [2018-10-14 16:31:17,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:31:17,715 INFO L481 AbstractCegarLoop]: Abstraction has 396 states and 402 transitions. [2018-10-14 16:31:17,715 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-14 16:31:17,715 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 402 transitions. [2018-10-14 16:31:17,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2018-10-14 16:31:17,717 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:31:17,717 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 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-14 16:31:17,718 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:31:17,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:31:17,718 INFO L82 PathProgramCache]: Analyzing trace with hash -121163675, now seen corresponding path program 10 times [2018-10-14 16:31:17,719 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:31:17,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:31:18,875 INFO L134 CoverageAnalysis]: Checked inductivity of 2000 backedges. 0 proven. 1790 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-10-14 16:31:18,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:31:18,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-14 16:31:18,876 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-14 16:31:18,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-14 16:31:18,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2018-10-14 16:31:18,877 INFO L87 Difference]: Start difference. First operand 396 states and 402 transitions. Second operand 24 states. [2018-10-14 16:31:19,717 WARN L179 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-10-14 16:31:21,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:31:21,973 INFO L93 Difference]: Finished difference Result 534 states and 542 transitions. [2018-10-14 16:31:21,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-14 16:31:21,976 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 395 [2018-10-14 16:31:21,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:31:21,979 INFO L225 Difference]: With dead ends: 534 [2018-10-14 16:31:21,979 INFO L226 Difference]: Without dead ends: 534 [2018-10-14 16:31:21,980 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=371, Invalid=2281, Unknown=0, NotChecked=0, Total=2652 [2018-10-14 16:31:21,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2018-10-14 16:31:21,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 466. [2018-10-14 16:31:21,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2018-10-14 16:31:21,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 473 transitions. [2018-10-14 16:31:21,990 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 473 transitions. Word has length 395 [2018-10-14 16:31:21,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:31:21,991 INFO L481 AbstractCegarLoop]: Abstraction has 466 states and 473 transitions. [2018-10-14 16:31:21,991 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-14 16:31:21,991 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 473 transitions. [2018-10-14 16:31:21,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2018-10-14 16:31:21,994 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:31:21,994 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 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-14 16:31:21,995 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:31:21,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:31:21,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1538298064, now seen corresponding path program 11 times [2018-10-14 16:31:21,996 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:31:22,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:31:22,738 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-14 16:31:22,931 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-14 16:31:24,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 0 proven. 2640 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2018-10-14 16:31:24,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:31:24,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-14 16:31:24,780 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-14 16:31:24,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-14 16:31:24,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=580, Unknown=0, NotChecked=0, Total=650 [2018-10-14 16:31:24,781 INFO L87 Difference]: Start difference. First operand 466 states and 473 transitions. Second operand 26 states. [2018-10-14 16:31:25,521 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-10-14 16:31:29,998 WARN L179 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2018-10-14 16:31:30,935 WARN L179 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2018-10-14 16:31:31,658 WARN L179 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 29 [2018-10-14 16:31:32,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:31:32,563 INFO L93 Difference]: Finished difference Result 604 states and 613 transitions. [2018-10-14 16:31:32,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-14 16:31:32,565 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 465 [2018-10-14 16:31:32,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:31:32,568 INFO L225 Difference]: With dead ends: 604 [2018-10-14 16:31:32,568 INFO L226 Difference]: Without dead ends: 604 [2018-10-14 16:31:32,570 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=414, Invalid=2778, Unknown=0, NotChecked=0, Total=3192 [2018-10-14 16:31:32,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2018-10-14 16:31:32,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 536. [2018-10-14 16:31:32,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2018-10-14 16:31:32,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 544 transitions. [2018-10-14 16:31:32,579 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 544 transitions. Word has length 465 [2018-10-14 16:31:32,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:31:32,580 INFO L481 AbstractCegarLoop]: Abstraction has 536 states and 544 transitions. [2018-10-14 16:31:32,580 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-14 16:31:32,580 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 544 transitions. [2018-10-14 16:31:32,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2018-10-14 16:31:32,583 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:31:32,584 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 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-14 16:31:32,584 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:31:32,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:31:32,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1168777989, now seen corresponding path program 12 times [2018-10-14 16:31:32,586 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:31:32,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:31:34,535 INFO L134 CoverageAnalysis]: Checked inductivity of 3962 backedges. 0 proven. 3656 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2018-10-14 16:31:34,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:31:34,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-14 16:31:34,536 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-14 16:31:34,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-14 16:31:34,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=680, Unknown=0, NotChecked=0, Total=756 [2018-10-14 16:31:34,537 INFO L87 Difference]: Start difference. First operand 536 states and 544 transitions. Second operand 28 states. [2018-10-14 16:31:35,745 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2018-10-14 16:31:38,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:31:38,274 INFO L93 Difference]: Finished difference Result 674 states and 684 transitions. [2018-10-14 16:31:38,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-14 16:31:38,275 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 535 [2018-10-14 16:31:38,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:31:38,278 INFO L225 Difference]: With dead ends: 674 [2018-10-14 16:31:38,279 INFO L226 Difference]: Without dead ends: 674 [2018-10-14 16:31:38,280 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 734 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=457, Invalid=3325, Unknown=0, NotChecked=0, Total=3782 [2018-10-14 16:31:38,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2018-10-14 16:31:38,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 606. [2018-10-14 16:31:38,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2018-10-14 16:31:38,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 615 transitions. [2018-10-14 16:31:38,290 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 615 transitions. Word has length 535 [2018-10-14 16:31:38,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:31:38,291 INFO L481 AbstractCegarLoop]: Abstraction has 606 states and 615 transitions. [2018-10-14 16:31:38,291 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-14 16:31:38,291 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 615 transitions. [2018-10-14 16:31:38,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 606 [2018-10-14 16:31:38,295 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:31:38,296 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 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-14 16:31:38,296 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:31:38,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:31:38,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1120486630, now seen corresponding path program 13 times [2018-10-14 16:31:38,297 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:31:38,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:31:40,405 INFO L134 CoverageAnalysis]: Checked inductivity of 5192 backedges. 0 proven. 4838 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2018-10-14 16:31:40,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:31:40,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-14 16:31:40,406 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-14 16:31:40,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-14 16:31:40,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=788, Unknown=0, NotChecked=0, Total=870 [2018-10-14 16:31:40,407 INFO L87 Difference]: Start difference. First operand 606 states and 615 transitions. Second operand 30 states. [2018-10-14 16:31:44,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:31:44,717 INFO L93 Difference]: Finished difference Result 744 states and 755 transitions. [2018-10-14 16:31:44,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-14 16:31:44,718 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 605 [2018-10-14 16:31:44,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:31:44,722 INFO L225 Difference]: With dead ends: 744 [2018-10-14 16:31:44,722 INFO L226 Difference]: Without dead ends: 744 [2018-10-14 16:31:44,724 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 858 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=500, Invalid=3922, Unknown=0, NotChecked=0, Total=4422 [2018-10-14 16:31:44,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2018-10-14 16:31:44,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 676. [2018-10-14 16:31:44,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676 states. [2018-10-14 16:31:44,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 686 transitions. [2018-10-14 16:31:44,734 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 686 transitions. Word has length 605 [2018-10-14 16:31:44,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:31:44,735 INFO L481 AbstractCegarLoop]: Abstraction has 676 states and 686 transitions. [2018-10-14 16:31:44,735 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-14 16:31:44,735 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 686 transitions. [2018-10-14 16:31:44,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 676 [2018-10-14 16:31:44,740 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:31:44,740 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 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-14 16:31:44,741 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:31:44,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:31:44,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1866004625, now seen corresponding path program 14 times [2018-10-14 16:31:44,742 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:31:44,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:31:45,818 INFO L134 CoverageAnalysis]: Checked inductivity of 6588 backedges. 4677 proven. 1377 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2018-10-14 16:31:45,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:31:45,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-14 16:31:45,820 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-14 16:31:45,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-14 16:31:45,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650 [2018-10-14 16:31:45,821 INFO L87 Difference]: Start difference. First operand 676 states and 686 transitions. Second operand 26 states. [2018-10-14 16:31:47,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:31:47,233 INFO L93 Difference]: Finished difference Result 760 states and 770 transitions. [2018-10-14 16:31:47,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-14 16:31:47,234 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 675 [2018-10-14 16:31:47,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:31:47,238 INFO L225 Difference]: With dead ends: 760 [2018-10-14 16:31:47,238 INFO L226 Difference]: Without dead ends: 760 [2018-10-14 16:31:47,239 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=540, Invalid=2216, Unknown=0, NotChecked=0, Total=2756 [2018-10-14 16:31:47,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2018-10-14 16:31:47,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 721. [2018-10-14 16:31:47,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2018-10-14 16:31:47,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 731 transitions. [2018-10-14 16:31:47,250 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 731 transitions. Word has length 675 [2018-10-14 16:31:47,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:31:47,251 INFO L481 AbstractCegarLoop]: Abstraction has 721 states and 731 transitions. [2018-10-14 16:31:47,254 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-14 16:31:47,254 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 731 transitions. [2018-10-14 16:31:47,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 721 [2018-10-14 16:31:47,259 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:31:47,260 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 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-14 16:31:47,260 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:31:47,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:31:47,261 INFO L82 PathProgramCache]: Analyzing trace with hash 740421757, now seen corresponding path program 15 times [2018-10-14 16:31:47,262 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:31:47,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:31:49,003 WARN L179 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 13 [2018-10-14 16:31:49,331 WARN L179 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2018-10-14 16:31:49,873 WARN L179 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2018-10-14 16:31:52,222 INFO L134 CoverageAnalysis]: Checked inductivity of 7878 backedges. 0 proven. 7338 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2018-10-14 16:31:52,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:31:52,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-14 16:31:52,223 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-14 16:31:52,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-14 16:31:52,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=904, Unknown=0, NotChecked=0, Total=992 [2018-10-14 16:31:52,224 INFO L87 Difference]: Start difference. First operand 721 states and 731 transitions. Second operand 32 states. [2018-10-14 16:31:57,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:31:57,340 INFO L93 Difference]: Finished difference Result 889 states and 901 transitions. [2018-10-14 16:31:57,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-14 16:31:57,341 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 720 [2018-10-14 16:31:57,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:31:57,345 INFO L225 Difference]: With dead ends: 889 [2018-10-14 16:31:57,345 INFO L226 Difference]: Without dead ends: 889 [2018-10-14 16:31:57,347 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1007 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=543, Invalid=4569, Unknown=0, NotChecked=0, Total=5112 [2018-10-14 16:31:57,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2018-10-14 16:31:57,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 806. [2018-10-14 16:31:57,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2018-10-14 16:31:57,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 817 transitions. [2018-10-14 16:31:57,358 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 817 transitions. Word has length 720 [2018-10-14 16:31:57,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:31:57,359 INFO L481 AbstractCegarLoop]: Abstraction has 806 states and 817 transitions. [2018-10-14 16:31:57,359 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-14 16:31:57,359 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 817 transitions. [2018-10-14 16:31:57,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 806 [2018-10-14 16:31:57,366 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:31:57,367 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 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-14 16:31:57,367 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:31:57,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:31:57,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1059922672, now seen corresponding path program 16 times [2018-10-14 16:31:57,368 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:31:57,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:32:00,754 INFO L134 CoverageAnalysis]: Checked inductivity of 10084 backedges. 0 proven. 9450 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2018-10-14 16:32:00,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:32:00,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-14 16:32:00,755 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-14 16:32:00,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-14 16:32:00,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=1028, Unknown=0, NotChecked=0, Total=1122 [2018-10-14 16:32:00,756 INFO L87 Difference]: Start difference. First operand 806 states and 817 transitions. Second operand 34 states. [2018-10-14 16:32:06,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:32:06,239 INFO L93 Difference]: Finished difference Result 974 states and 987 transitions. [2018-10-14 16:32:06,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-14 16:32:06,239 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 805 [2018-10-14 16:32:06,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:32:06,244 INFO L225 Difference]: With dead ends: 974 [2018-10-14 16:32:06,244 INFO L226 Difference]: Without dead ends: 974 [2018-10-14 16:32:06,246 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1133 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=586, Invalid=5266, Unknown=0, NotChecked=0, Total=5852 [2018-10-14 16:32:06,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2018-10-14 16:32:06,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 891. [2018-10-14 16:32:06,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 891 states. [2018-10-14 16:32:06,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 903 transitions. [2018-10-14 16:32:06,258 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 903 transitions. Word has length 805 [2018-10-14 16:32:06,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:32:06,259 INFO L481 AbstractCegarLoop]: Abstraction has 891 states and 903 transitions. [2018-10-14 16:32:06,259 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-14 16:32:06,259 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 903 transitions. [2018-10-14 16:32:06,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 891 [2018-10-14 16:32:06,266 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:32:06,267 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 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-14 16:32:06,267 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:32:06,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:32:06,267 INFO L82 PathProgramCache]: Analyzing trace with hash 522629725, now seen corresponding path program 17 times [2018-10-14 16:32:06,268 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:32:06,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:32:06,859 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-14 16:32:10,694 INFO L134 CoverageAnalysis]: Checked inductivity of 12563 backedges. 0 proven. 11835 refuted. 0 times theorem prover too weak. 728 trivial. 0 not checked. [2018-10-14 16:32:10,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:32:10,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-14 16:32:10,696 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-14 16:32:10,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-14 16:32:10,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1160, Unknown=0, NotChecked=0, Total=1260 [2018-10-14 16:32:10,697 INFO L87 Difference]: Start difference. First operand 891 states and 903 transitions. Second operand 36 states. [2018-10-14 16:32:17,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:32:17,155 INFO L93 Difference]: Finished difference Result 1059 states and 1073 transitions. [2018-10-14 16:32:17,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-14 16:32:17,155 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 890 [2018-10-14 16:32:17,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:32:17,159 INFO L225 Difference]: With dead ends: 1059 [2018-10-14 16:32:17,159 INFO L226 Difference]: Without dead ends: 1059 [2018-10-14 16:32:17,161 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1284 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=629, Invalid=6013, Unknown=0, NotChecked=0, Total=6642 [2018-10-14 16:32:17,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2018-10-14 16:32:17,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 976. [2018-10-14 16:32:17,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 976 states. [2018-10-14 16:32:17,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 989 transitions. [2018-10-14 16:32:17,173 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 989 transitions. Word has length 890 [2018-10-14 16:32:17,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:32:17,174 INFO L481 AbstractCegarLoop]: Abstraction has 976 states and 989 transitions. [2018-10-14 16:32:17,174 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-14 16:32:17,174 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 989 transitions. [2018-10-14 16:32:17,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 976 [2018-10-14 16:32:17,185 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:32:17,186 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 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-14 16:32:17,186 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:32:17,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:32:17,187 INFO L82 PathProgramCache]: Analyzing trace with hash 950208304, now seen corresponding path program 18 times [2018-10-14 16:32:17,187 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:32:17,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:32:21,533 INFO L134 CoverageAnalysis]: Checked inductivity of 15315 backedges. 0 proven. 14493 refuted. 0 times theorem prover too weak. 822 trivial. 0 not checked. [2018-10-14 16:32:21,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:32:21,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-14 16:32:21,534 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-14 16:32:21,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-14 16:32:21,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1300, Unknown=0, NotChecked=0, Total=1406 [2018-10-14 16:32:21,535 INFO L87 Difference]: Start difference. First operand 976 states and 989 transitions. Second operand 38 states. [2018-10-14 16:32:22,520 WARN L179 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2018-10-14 16:32:29,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:32:29,625 INFO L93 Difference]: Finished difference Result 1144 states and 1159 transitions. [2018-10-14 16:32:29,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-14 16:32:29,626 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 975 [2018-10-14 16:32:29,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:32:29,630 INFO L225 Difference]: With dead ends: 1144 [2018-10-14 16:32:29,630 INFO L226 Difference]: Without dead ends: 1144 [2018-10-14 16:32:29,632 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1444 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=672, Invalid=6810, Unknown=0, NotChecked=0, Total=7482 [2018-10-14 16:32:29,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2018-10-14 16:32:29,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 1061. [2018-10-14 16:32:29,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1061 states. [2018-10-14 16:32:29,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1075 transitions. [2018-10-14 16:32:29,644 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1075 transitions. Word has length 975 [2018-10-14 16:32:29,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:32:29,645 INFO L481 AbstractCegarLoop]: Abstraction has 1061 states and 1075 transitions. [2018-10-14 16:32:29,645 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-14 16:32:29,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1075 transitions. [2018-10-14 16:32:29,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1061 [2018-10-14 16:32:29,655 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:32:29,656 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 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-14 16:32:29,656 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:32:29,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:32:29,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1382882365, now seen corresponding path program 19 times [2018-10-14 16:32:29,657 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:32:29,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:32:30,416 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-14 16:32:35,956 INFO L134 CoverageAnalysis]: Checked inductivity of 18340 backedges. 0 proven. 17424 refuted. 0 times theorem prover too weak. 916 trivial. 0 not checked. [2018-10-14 16:32:35,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:32:35,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-14 16:32:35,957 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-14 16:32:35,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-14 16:32:35,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1448, Unknown=0, NotChecked=0, Total=1560 [2018-10-14 16:32:35,958 INFO L87 Difference]: Start difference. First operand 1061 states and 1075 transitions. Second operand 40 states. [2018-10-14 16:32:36,898 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2018-10-14 16:32:38,713 WARN L179 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2018-10-14 16:32:44,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:32:44,964 INFO L93 Difference]: Finished difference Result 1229 states and 1245 transitions. [2018-10-14 16:32:44,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-14 16:32:44,965 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 1060 [2018-10-14 16:32:44,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:32:44,969 INFO L225 Difference]: With dead ends: 1229 [2018-10-14 16:32:44,970 INFO L226 Difference]: Without dead ends: 1229 [2018-10-14 16:32:44,971 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1613 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=715, Invalid=7657, Unknown=0, NotChecked=0, Total=8372 [2018-10-14 16:32:44,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2018-10-14 16:32:44,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1146. [2018-10-14 16:32:44,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1146 states. [2018-10-14 16:32:44,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 1161 transitions. [2018-10-14 16:32:44,983 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 1161 transitions. Word has length 1060 [2018-10-14 16:32:44,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:32:44,984 INFO L481 AbstractCegarLoop]: Abstraction has 1146 states and 1161 transitions. [2018-10-14 16:32:44,984 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-14 16:32:44,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1161 transitions. [2018-10-14 16:32:44,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1146 [2018-10-14 16:32:44,996 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:32:44,996 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 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-14 16:32:44,997 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:32:44,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:32:44,997 INFO L82 PathProgramCache]: Analyzing trace with hash 780831056, now seen corresponding path program 20 times [2018-10-14 16:32:44,998 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:32:45,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:32:50,548 INFO L134 CoverageAnalysis]: Checked inductivity of 21638 backedges. 0 proven. 20628 refuted. 0 times theorem prover too weak. 1010 trivial. 0 not checked. [2018-10-14 16:32:50,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:32:50,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-14 16:32:50,549 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-14 16:32:50,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-14 16:32:50,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1604, Unknown=0, NotChecked=0, Total=1722 [2018-10-14 16:32:50,550 INFO L87 Difference]: Start difference. First operand 1146 states and 1161 transitions. Second operand 42 states. [2018-10-14 16:32:59,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:32:59,633 INFO L93 Difference]: Finished difference Result 1314 states and 1331 transitions. [2018-10-14 16:32:59,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-14 16:32:59,635 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 1145 [2018-10-14 16:32:59,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:32:59,639 INFO L225 Difference]: With dead ends: 1314 [2018-10-14 16:32:59,639 INFO L226 Difference]: Without dead ends: 1314 [2018-10-14 16:32:59,640 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-14 16:32:59,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2018-10-14 16:32:59,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1231. [2018-10-14 16:32:59,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1231 states. [2018-10-14 16:32:59,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 1247 transitions. [2018-10-14 16:32:59,652 INFO L78 Accepts]: Start accepts. Automaton has 1231 states and 1247 transitions. Word has length 1145 [2018-10-14 16:32:59,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:32:59,653 INFO L481 AbstractCegarLoop]: Abstraction has 1231 states and 1247 transitions. [2018-10-14 16:32:59,653 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-14 16:32:59,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 1247 transitions. [2018-10-14 16:32:59,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1231 [2018-10-14 16:32:59,665 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:32:59,666 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 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-14 16:32:59,666 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:32:59,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:32:59,667 INFO L82 PathProgramCache]: Analyzing trace with hash 853749277, now seen corresponding path program 21 times [2018-10-14 16:32:59,668 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:32:59,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:33:00,892 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-14 16:33:01,489 WARN L179 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 13 [2018-10-14 16:33:01,806 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2018-10-14 16:33:07,644 INFO L134 CoverageAnalysis]: Checked inductivity of 25209 backedges. 0 proven. 24105 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2018-10-14 16:33:07,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:33:07,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-14 16:33:07,645 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-14 16:33:07,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-14 16:33:07,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1768, Unknown=0, NotChecked=0, Total=1892 [2018-10-14 16:33:07,646 INFO L87 Difference]: Start difference. First operand 1231 states and 1247 transitions. Second operand 44 states. [2018-10-14 16:33:17,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:33:17,940 INFO L93 Difference]: Finished difference Result 1399 states and 1417 transitions. [2018-10-14 16:33:17,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-14 16:33:17,940 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 1230 [2018-10-14 16:33:17,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:33:17,945 INFO L225 Difference]: With dead ends: 1399 [2018-10-14 16:33:17,945 INFO L226 Difference]: Without dead ends: 1399 [2018-10-14 16:33:17,946 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1994 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=801, Invalid=9501, Unknown=0, NotChecked=0, Total=10302 [2018-10-14 16:33:17,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2018-10-14 16:33:17,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 1316. [2018-10-14 16:33:17,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1316 states. [2018-10-14 16:33:17,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 1333 transitions. [2018-10-14 16:33:17,959 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 1333 transitions. Word has length 1230 [2018-10-14 16:33:17,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:33:17,960 INFO L481 AbstractCegarLoop]: Abstraction has 1316 states and 1333 transitions. [2018-10-14 16:33:17,960 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-14 16:33:17,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1333 transitions. [2018-10-14 16:33:17,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1316 [2018-10-14 16:33:17,974 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:33:17,975 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 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-14 16:33:17,975 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:33:17,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:33:17,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1503960208, now seen corresponding path program 22 times [2018-10-14 16:33:17,977 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:33:18,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:33:19,919 WARN L179 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 13 [2018-10-14 16:33:20,320 WARN L179 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2018-10-14 16:33:20,870 WARN L179 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2018-10-14 16:33:27,265 INFO L134 CoverageAnalysis]: Checked inductivity of 29053 backedges. 0 proven. 27855 refuted. 0 times theorem prover too weak. 1198 trivial. 0 not checked. [2018-10-14 16:33:27,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:33:27,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-14 16:33:27,267 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-14 16:33:27,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-14 16:33:27,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1940, Unknown=0, NotChecked=0, Total=2070 [2018-10-14 16:33:27,268 INFO L87 Difference]: Start difference. First operand 1316 states and 1333 transitions. Second operand 46 states. [2018-10-14 16:33:38,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:33:38,366 INFO L93 Difference]: Finished difference Result 1484 states and 1503 transitions. [2018-10-14 16:33:38,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-14 16:33:38,366 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 1315 [2018-10-14 16:33:38,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:33:38,372 INFO L225 Difference]: With dead ends: 1484 [2018-10-14 16:33:38,372 INFO L226 Difference]: Without dead ends: 1484 [2018-10-14 16:33:38,373 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2190 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=844, Invalid=10498, Unknown=0, NotChecked=0, Total=11342 [2018-10-14 16:33:38,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states. [2018-10-14 16:33:38,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 1401. [2018-10-14 16:33:38,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1401 states. [2018-10-14 16:33:38,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 1419 transitions. [2018-10-14 16:33:38,387 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 1419 transitions. Word has length 1315 [2018-10-14 16:33:38,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:33:38,388 INFO L481 AbstractCegarLoop]: Abstraction has 1401 states and 1419 transitions. [2018-10-14 16:33:38,388 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-14 16:33:38,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 1419 transitions. [2018-10-14 16:33:38,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1401 [2018-10-14 16:33:38,404 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:33:38,405 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 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-14 16:33:38,405 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:33:38,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:33:38,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1140254717, now seen corresponding path program 23 times [2018-10-14 16:33:38,406 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:33:38,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:33:46,567 INFO L134 CoverageAnalysis]: Checked inductivity of 33170 backedges. 0 proven. 31878 refuted. 0 times theorem prover too weak. 1292 trivial. 0 not checked. [2018-10-14 16:33:46,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:33:46,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-14 16:33:46,568 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-14 16:33:46,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-14 16:33:46,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=2120, Unknown=0, NotChecked=0, Total=2256 [2018-10-14 16:33:46,569 INFO L87 Difference]: Start difference. First operand 1401 states and 1419 transitions. Second operand 48 states. [2018-10-14 16:33:59,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:33:59,348 INFO L93 Difference]: Finished difference Result 1569 states and 1589 transitions. [2018-10-14 16:33:59,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-14 16:33:59,348 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 1400 [2018-10-14 16:33:59,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:33:59,353 INFO L225 Difference]: With dead ends: 1569 [2018-10-14 16:33:59,353 INFO L226 Difference]: Without dead ends: 1569 [2018-10-14 16:33:59,355 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2379 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=887, Invalid=11545, Unknown=0, NotChecked=0, Total=12432 [2018-10-14 16:33:59,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2018-10-14 16:33:59,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 1486. [2018-10-14 16:33:59,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1486 states. [2018-10-14 16:33:59,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 1486 states and 1505 transitions. [2018-10-14 16:33:59,370 INFO L78 Accepts]: Start accepts. Automaton has 1486 states and 1505 transitions. Word has length 1400 [2018-10-14 16:33:59,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:33:59,371 INFO L481 AbstractCegarLoop]: Abstraction has 1486 states and 1505 transitions. [2018-10-14 16:33:59,371 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-14 16:33:59,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 1505 transitions. [2018-10-14 16:33:59,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1486 [2018-10-14 16:33:59,389 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:33:59,390 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 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-14 16:33:59,390 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:33:59,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:33:59,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1654155888, now seen corresponding path program 24 times [2018-10-14 16:33:59,391 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:33:59,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:34:08,330 INFO L134 CoverageAnalysis]: Checked inductivity of 37560 backedges. 0 proven. 36174 refuted. 0 times theorem prover too weak. 1386 trivial. 0 not checked. [2018-10-14 16:34:08,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:34:08,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-14 16:34:08,331 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-14 16:34:08,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-14 16:34:08,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=2308, Unknown=0, NotChecked=0, Total=2450 [2018-10-14 16:34:08,332 INFO L87 Difference]: Start difference. First operand 1486 states and 1505 transitions. Second operand 50 states. [2018-10-14 16:34:22,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:34:22,153 INFO L93 Difference]: Finished difference Result 1654 states and 1675 transitions. [2018-10-14 16:34:22,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-14 16:34:22,154 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 1485 [2018-10-14 16:34:22,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:34:22,159 INFO L225 Difference]: With dead ends: 1654 [2018-10-14 16:34:22,159 INFO L226 Difference]: Without dead ends: 1654 [2018-10-14 16:34:22,160 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2593 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=930, Invalid=12642, Unknown=0, NotChecked=0, Total=13572 [2018-10-14 16:34:22,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1654 states. [2018-10-14 16:34:22,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1654 to 1571. [2018-10-14 16:34:22,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2018-10-14 16:34:22,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 1591 transitions. [2018-10-14 16:34:22,174 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 1591 transitions. Word has length 1485 [2018-10-14 16:34:22,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:34:22,175 INFO L481 AbstractCegarLoop]: Abstraction has 1571 states and 1591 transitions. [2018-10-14 16:34:22,175 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-14 16:34:22,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 1591 transitions. [2018-10-14 16:34:22,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1571 [2018-10-14 16:34:22,194 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:34:22,195 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 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-14 16:34:22,195 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:34:22,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:34:22,196 INFO L82 PathProgramCache]: Analyzing trace with hash -6927907, now seen corresponding path program 25 times [2018-10-14 16:34:22,196 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:34:22,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:34:31,391 INFO L134 CoverageAnalysis]: Checked inductivity of 42223 backedges. 0 proven. 40743 refuted. 0 times theorem prover too weak. 1480 trivial. 0 not checked. [2018-10-14 16:34:31,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:34:31,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-14 16:34:31,392 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-14 16:34:31,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-14 16:34:31,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=2504, Unknown=0, NotChecked=0, Total=2652 [2018-10-14 16:34:31,392 INFO L87 Difference]: Start difference. First operand 1571 states and 1591 transitions. Second operand 52 states. [2018-10-14 16:34:46,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:34:46,477 INFO L93 Difference]: Finished difference Result 1739 states and 1761 transitions. [2018-10-14 16:34:46,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-14 16:34:46,477 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 1570 [2018-10-14 16:34:46,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:34:46,483 INFO L225 Difference]: With dead ends: 1739 [2018-10-14 16:34:46,483 INFO L226 Difference]: Without dead ends: 1739 [2018-10-14 16:34:46,484 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2816 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=973, Invalid=13789, Unknown=0, NotChecked=0, Total=14762 [2018-10-14 16:34:46,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2018-10-14 16:34:46,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1656. [2018-10-14 16:34:46,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1656 states. [2018-10-14 16:34:46,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1656 states to 1656 states and 1677 transitions. [2018-10-14 16:34:46,496 INFO L78 Accepts]: Start accepts. Automaton has 1656 states and 1677 transitions. Word has length 1570 [2018-10-14 16:34:46,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:34:46,497 INFO L481 AbstractCegarLoop]: Abstraction has 1656 states and 1677 transitions. [2018-10-14 16:34:46,498 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-14 16:34:46,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1656 states and 1677 transitions. [2018-10-14 16:34:46,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1656 [2018-10-14 16:34:46,518 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:34:46,519 INFO L375 BasicCegarLoop]: trace histogram [74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 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-14 16:34:46,519 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:34:46,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:34:46,520 INFO L82 PathProgramCache]: Analyzing trace with hash 713105328, now seen corresponding path program 26 times [2018-10-14 16:34:46,521 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:34:46,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:34:56,497 INFO L134 CoverageAnalysis]: Checked inductivity of 47159 backedges. 0 proven. 45585 refuted. 0 times theorem prover too weak. 1574 trivial. 0 not checked. [2018-10-14 16:34:56,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:34:56,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-14 16:34:56,498 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-14 16:34:56,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-14 16:34:56,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=2708, Unknown=0, NotChecked=0, Total=2862 [2018-10-14 16:34:56,499 INFO L87 Difference]: Start difference. First operand 1656 states and 1677 transitions. Second operand 54 states. [2018-10-14 16:35:12,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:35:12,804 INFO L93 Difference]: Finished difference Result 1824 states and 1847 transitions. [2018-10-14 16:35:12,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-14 16:35:12,804 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 1655 [2018-10-14 16:35:12,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:35:12,809 INFO L225 Difference]: With dead ends: 1824 [2018-10-14 16:35:12,809 INFO L226 Difference]: Without dead ends: 1824 [2018-10-14 16:35:12,810 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3048 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=1016, Invalid=14986, Unknown=0, NotChecked=0, Total=16002 [2018-10-14 16:35:12,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1824 states. [2018-10-14 16:35:12,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1824 to 1741. [2018-10-14 16:35:12,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1741 states. [2018-10-14 16:35:12,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1741 states to 1741 states and 1763 transitions. [2018-10-14 16:35:12,825 INFO L78 Accepts]: Start accepts. Automaton has 1741 states and 1763 transitions. Word has length 1655 [2018-10-14 16:35:12,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:35:12,827 INFO L481 AbstractCegarLoop]: Abstraction has 1741 states and 1763 transitions. [2018-10-14 16:35:12,827 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-14 16:35:12,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1741 states and 1763 transitions. [2018-10-14 16:35:12,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1741 [2018-10-14 16:35:12,847 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:35:12,848 INFO L375 BasicCegarLoop]: trace histogram [78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 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-14 16:35:12,848 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:35:12,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:35:12,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1238412355, now seen corresponding path program 27 times [2018-10-14 16:35:12,850 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:35:12,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:35:23,806 INFO L134 CoverageAnalysis]: Checked inductivity of 52368 backedges. 0 proven. 50700 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2018-10-14 16:35:23,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:35:23,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-10-14 16:35:23,808 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-14 16:35:23,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-14 16:35:23,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=2920, Unknown=0, NotChecked=0, Total=3080 [2018-10-14 16:35:23,809 INFO L87 Difference]: Start difference. First operand 1741 states and 1763 transitions. Second operand 56 states. [2018-10-14 16:35:40,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:35:40,943 INFO L93 Difference]: Finished difference Result 1909 states and 1933 transitions. [2018-10-14 16:35:40,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-14 16:35:40,944 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 1740 [2018-10-14 16:35:40,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:35:40,951 INFO L225 Difference]: With dead ends: 1909 [2018-10-14 16:35:40,951 INFO L226 Difference]: Without dead ends: 1909 [2018-10-14 16:35:40,953 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3289 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=1059, Invalid=16233, Unknown=0, NotChecked=0, Total=17292 [2018-10-14 16:35:40,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1909 states. [2018-10-14 16:35:40,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1909 to 1826. [2018-10-14 16:35:40,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1826 states. [2018-10-14 16:35:40,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1826 states to 1826 states and 1849 transitions. [2018-10-14 16:35:40,966 INFO L78 Accepts]: Start accepts. Automaton has 1826 states and 1849 transitions. Word has length 1740 [2018-10-14 16:35:40,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:35:40,967 INFO L481 AbstractCegarLoop]: Abstraction has 1826 states and 1849 transitions. [2018-10-14 16:35:40,967 INFO L482 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-14 16:35:40,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1826 states and 1849 transitions. [2018-10-14 16:35:40,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1826 [2018-10-14 16:35:40,985 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:35:40,986 INFO L375 BasicCegarLoop]: trace histogram [82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 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-14 16:35:40,986 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:35:40,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:35:40,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1644559920, now seen corresponding path program 28 times [2018-10-14 16:35:40,987 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:35:41,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:35:53,103 INFO L134 CoverageAnalysis]: Checked inductivity of 57850 backedges. 0 proven. 56088 refuted. 0 times theorem prover too weak. 1762 trivial. 0 not checked. [2018-10-14 16:35:53,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:35:53,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-10-14 16:35:53,105 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-14 16:35:53,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-14 16:35:53,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=3140, Unknown=0, NotChecked=0, Total=3306 [2018-10-14 16:35:53,105 INFO L87 Difference]: Start difference. First operand 1826 states and 1849 transitions. Second operand 58 states. [2018-10-14 16:36:11,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:36:11,893 INFO L93 Difference]: Finished difference Result 1994 states and 2019 transitions. [2018-10-14 16:36:11,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-14 16:36:11,893 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 1825 [2018-10-14 16:36:11,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:36:11,899 INFO L225 Difference]: With dead ends: 1994 [2018-10-14 16:36:11,899 INFO L226 Difference]: Without dead ends: 1994 [2018-10-14 16:36:11,901 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3539 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=1102, Invalid=17530, Unknown=0, NotChecked=0, Total=18632 [2018-10-14 16:36:11,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1994 states. [2018-10-14 16:36:11,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1994 to 1911. [2018-10-14 16:36:11,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1911 states. [2018-10-14 16:36:11,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1911 states to 1911 states and 1935 transitions. [2018-10-14 16:36:11,913 INFO L78 Accepts]: Start accepts. Automaton has 1911 states and 1935 transitions. Word has length 1825 [2018-10-14 16:36:11,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:36:11,914 INFO L481 AbstractCegarLoop]: Abstraction has 1911 states and 1935 transitions. [2018-10-14 16:36:11,914 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-14 16:36:11,914 INFO L276 IsEmpty]: Start isEmpty. Operand 1911 states and 1935 transitions. [2018-10-14 16:36:11,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1911 [2018-10-14 16:36:11,934 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:36:11,934 INFO L375 BasicCegarLoop]: trace histogram [86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 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-14 16:36:11,935 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:36:11,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:36:11,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1857029533, now seen corresponding path program 29 times [2018-10-14 16:36:11,936 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:36:12,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:36:25,042 INFO L134 CoverageAnalysis]: Checked inductivity of 63605 backedges. 0 proven. 61749 refuted. 0 times theorem prover too weak. 1856 trivial. 0 not checked. [2018-10-14 16:36:25,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:36:25,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-10-14 16:36:25,044 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-14 16:36:25,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-14 16:36:25,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=3368, Unknown=0, NotChecked=0, Total=3540 [2018-10-14 16:36:25,044 INFO L87 Difference]: Start difference. First operand 1911 states and 1935 transitions. Second operand 60 states. [2018-10-14 16:36:30,270 WARN L179 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2018-10-14 16:36:46,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:36:46,439 INFO L93 Difference]: Finished difference Result 2079 states and 2105 transitions. [2018-10-14 16:36:46,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-14 16:36:46,439 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 1910 [2018-10-14 16:36:46,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:36:46,445 INFO L225 Difference]: With dead ends: 2079 [2018-10-14 16:36:46,446 INFO L226 Difference]: Without dead ends: 2079 [2018-10-14 16:36:46,446 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3798 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=1145, Invalid=18877, Unknown=0, NotChecked=0, Total=20022 [2018-10-14 16:36:46,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2079 states. [2018-10-14 16:36:46,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2079 to 1996. [2018-10-14 16:36:46,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1996 states. [2018-10-14 16:36:46,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1996 states to 1996 states and 2021 transitions. [2018-10-14 16:36:46,461 INFO L78 Accepts]: Start accepts. Automaton has 1996 states and 2021 transitions. Word has length 1910 [2018-10-14 16:36:46,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:36:46,461 INFO L481 AbstractCegarLoop]: Abstraction has 1996 states and 2021 transitions. [2018-10-14 16:36:46,462 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-14 16:36:46,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1996 states and 2021 transitions. [2018-10-14 16:36:46,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1996 [2018-10-14 16:36:46,484 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:36:46,485 INFO L375 BasicCegarLoop]: trace histogram [90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 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-14 16:36:46,485 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:36:46,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:36:46,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1583072272, now seen corresponding path program 30 times [2018-10-14 16:36:46,486 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:36:46,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:37:00,278 INFO L134 CoverageAnalysis]: Checked inductivity of 69633 backedges. 0 proven. 67683 refuted. 0 times theorem prover too weak. 1950 trivial. 0 not checked. [2018-10-14 16:37:00,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:37:00,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-10-14 16:37:00,280 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-14 16:37:00,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-14 16:37:00,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=3604, Unknown=0, NotChecked=0, Total=3782 [2018-10-14 16:37:00,281 INFO L87 Difference]: Start difference. First operand 1996 states and 2021 transitions. Second operand 62 states. [2018-10-14 16:37:22,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:37:22,294 INFO L93 Difference]: Finished difference Result 2164 states and 2191 transitions. [2018-10-14 16:37:22,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-10-14 16:37:22,295 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 1995 [2018-10-14 16:37:22,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:37:22,302 INFO L225 Difference]: With dead ends: 2164 [2018-10-14 16:37:22,303 INFO L226 Difference]: Without dead ends: 2164 [2018-10-14 16:37:22,304 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4066 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=1188, Invalid=20274, Unknown=0, NotChecked=0, Total=21462 [2018-10-14 16:37:22,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2164 states. [2018-10-14 16:37:22,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2164 to 2081. [2018-10-14 16:37:22,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2081 states. [2018-10-14 16:37:22,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2081 states to 2081 states and 2107 transitions. [2018-10-14 16:37:22,325 INFO L78 Accepts]: Start accepts. Automaton has 2081 states and 2107 transitions. Word has length 1995 [2018-10-14 16:37:22,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:37:22,326 INFO L481 AbstractCegarLoop]: Abstraction has 2081 states and 2107 transitions. [2018-10-14 16:37:22,326 INFO L482 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-14 16:37:22,326 INFO L276 IsEmpty]: Start isEmpty. Operand 2081 states and 2107 transitions. [2018-10-14 16:37:22,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2081 [2018-10-14 16:37:22,350 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:37:22,351 INFO L375 BasicCegarLoop]: trace histogram [94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 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-14 16:37:22,351 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:37:22,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:37:22,352 INFO L82 PathProgramCache]: Analyzing trace with hash -964272259, now seen corresponding path program 31 times [2018-10-14 16:37:22,352 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:37:22,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:37:37,555 INFO L134 CoverageAnalysis]: Checked inductivity of 75934 backedges. 0 proven. 73890 refuted. 0 times theorem prover too weak. 2044 trivial. 0 not checked. [2018-10-14 16:37:37,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:37:37,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-10-14 16:37:37,557 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-14 16:37:37,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-14 16:37:37,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=3848, Unknown=0, NotChecked=0, Total=4032 [2018-10-14 16:37:37,558 INFO L87 Difference]: Start difference. First operand 2081 states and 2107 transitions. Second operand 64 states. [2018-10-14 16:38:00,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:38:00,801 INFO L93 Difference]: Finished difference Result 2249 states and 2277 transitions. [2018-10-14 16:38:00,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-10-14 16:38:00,802 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 2080 [2018-10-14 16:38:00,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:38:00,809 INFO L225 Difference]: With dead ends: 2249 [2018-10-14 16:38:00,809 INFO L226 Difference]: Without dead ends: 2249 [2018-10-14 16:38:00,811 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4343 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=1231, Invalid=21721, Unknown=0, NotChecked=0, Total=22952 [2018-10-14 16:38:00,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2249 states. [2018-10-14 16:38:00,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2249 to 2166. [2018-10-14 16:38:00,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2166 states. [2018-10-14 16:38:00,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2166 states to 2166 states and 2193 transitions. [2018-10-14 16:38:00,829 INFO L78 Accepts]: Start accepts. Automaton has 2166 states and 2193 transitions. Word has length 2080 [2018-10-14 16:38:00,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:38:00,830 INFO L481 AbstractCegarLoop]: Abstraction has 2166 states and 2193 transitions. [2018-10-14 16:38:00,831 INFO L482 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-14 16:38:00,831 INFO L276 IsEmpty]: Start isEmpty. Operand 2166 states and 2193 transitions. [2018-10-14 16:38:00,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2166 [2018-10-14 16:38:00,857 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:38:00,858 INFO L375 BasicCegarLoop]: trace histogram [98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 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-14 16:38:00,858 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:38:00,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:38:00,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1490144784, now seen corresponding path program 32 times [2018-10-14 16:38:00,860 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:38:01,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:38:17,341 INFO L134 CoverageAnalysis]: Checked inductivity of 82508 backedges. 0 proven. 80370 refuted. 0 times theorem prover too weak. 2138 trivial. 0 not checked. [2018-10-14 16:38:17,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:38:17,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-10-14 16:38:17,343 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-14 16:38:17,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-14 16:38:17,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=4100, Unknown=0, NotChecked=0, Total=4290 [2018-10-14 16:38:17,344 INFO L87 Difference]: Start difference. First operand 2166 states and 2193 transitions. Second operand 66 states. [2018-10-14 16:38:42,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:38:42,619 INFO L93 Difference]: Finished difference Result 2334 states and 2363 transitions. [2018-10-14 16:38:42,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-10-14 16:38:42,619 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 2165 [2018-10-14 16:38:42,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:38:42,625 INFO L225 Difference]: With dead ends: 2334 [2018-10-14 16:38:42,625 INFO L226 Difference]: Without dead ends: 2334 [2018-10-14 16:38:42,627 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4629 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=1274, Invalid=23218, Unknown=0, NotChecked=0, Total=24492 [2018-10-14 16:38:42,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2334 states. [2018-10-14 16:38:42,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2334 to 2251. [2018-10-14 16:38:42,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2251 states. [2018-10-14 16:38:42,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2251 states to 2251 states and 2279 transitions. [2018-10-14 16:38:42,645 INFO L78 Accepts]: Start accepts. Automaton has 2251 states and 2279 transitions. Word has length 2165 [2018-10-14 16:38:42,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:38:42,646 INFO L481 AbstractCegarLoop]: Abstraction has 2251 states and 2279 transitions. [2018-10-14 16:38:42,646 INFO L482 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-14 16:38:42,646 INFO L276 IsEmpty]: Start isEmpty. Operand 2251 states and 2279 transitions. [2018-10-14 16:38:42,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2251 [2018-10-14 16:38:42,674 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:38:42,675 INFO L375 BasicCegarLoop]: trace histogram [102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 27, 27, 27, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:38:42,675 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:38:42,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:38:42,675 INFO L82 PathProgramCache]: Analyzing trace with hash -778018467, now seen corresponding path program 33 times [2018-10-14 16:38:42,676 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:38:42,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:39:00,719 INFO L134 CoverageAnalysis]: Checked inductivity of 89355 backedges. 0 proven. 87123 refuted. 0 times theorem prover too weak. 2232 trivial. 0 not checked. [2018-10-14 16:39:00,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:39:00,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-10-14 16:39:00,720 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-14 16:39:00,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-14 16:39:00,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=4360, Unknown=0, NotChecked=0, Total=4556 [2018-10-14 16:39:00,721 INFO L87 Difference]: Start difference. First operand 2251 states and 2279 transitions. Second operand 68 states. [2018-10-14 16:39:27,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:39:27,316 INFO L93 Difference]: Finished difference Result 2419 states and 2449 transitions. [2018-10-14 16:39:27,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-10-14 16:39:27,317 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 2250 [2018-10-14 16:39:27,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:39:27,321 INFO L225 Difference]: With dead ends: 2419 [2018-10-14 16:39:27,321 INFO L226 Difference]: Without dead ends: 2419 [2018-10-14 16:39:27,323 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4940 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=1317, Invalid=24765, Unknown=0, NotChecked=0, Total=26082 [2018-10-14 16:39:27,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2419 states. [2018-10-14 16:39:27,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2419 to 2336. [2018-10-14 16:39:27,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2336 states. [2018-10-14 16:39:27,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2336 states to 2336 states and 2365 transitions. [2018-10-14 16:39:27,337 INFO L78 Accepts]: Start accepts. Automaton has 2336 states and 2365 transitions. Word has length 2250 [2018-10-14 16:39:27,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:39:27,338 INFO L481 AbstractCegarLoop]: Abstraction has 2336 states and 2365 transitions. [2018-10-14 16:39:27,338 INFO L482 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-14 16:39:27,338 INFO L276 IsEmpty]: Start isEmpty. Operand 2336 states and 2365 transitions. [2018-10-14 16:39:27,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2336 [2018-10-14 16:39:27,366 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:39:27,367 INFO L375 BasicCegarLoop]: trace histogram [106, 106, 106, 106, 106, 106, 106, 106, 106, 106, 106, 106, 106, 106, 106, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 28, 28, 28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:39:27,367 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:39:27,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:39:27,368 INFO L82 PathProgramCache]: Analyzing trace with hash -2141931472, now seen corresponding path program 34 times [2018-10-14 16:39:27,368 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:39:27,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat