java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-502d2f4 [2018-10-12 20:45:03,660 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-12 20:45:03,662 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-12 20:45:03,673 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-12 20:45:03,674 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-12 20:45:03,675 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-12 20:45:03,676 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-12 20:45:03,678 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-12 20:45:03,680 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-12 20:45:03,680 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-12 20:45:03,681 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-12 20:45:03,682 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-12 20:45:03,683 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-12 20:45:03,684 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-12 20:45:03,685 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-12 20:45:03,686 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-12 20:45:03,686 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-12 20:45:03,688 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-12 20:45:03,690 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-12 20:45:03,692 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-12 20:45:03,693 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-12 20:45:03,694 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-12 20:45:03,697 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-12 20:45:03,697 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-12 20:45:03,698 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-12 20:45:03,699 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-12 20:45:03,703 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-12 20:45:03,704 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-12 20:45:03,704 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-12 20:45:03,707 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-12 20:45:03,708 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-12 20:45:03,709 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-12 20:45:03,709 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-12 20:45:03,709 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-12 20:45:03,712 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-12 20:45:03,713 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-12 20:45:03,713 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-12 20:45:03,731 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-12 20:45:03,732 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-12 20:45:03,733 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-12 20:45:03,735 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-12 20:45:03,735 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-12 20:45:03,736 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-12 20:45:03,737 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-12 20:45:03,737 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-12 20:45:03,737 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-12 20:45:03,737 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-12 20:45:03,737 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-12 20:45:03,738 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-12 20:45:03,738 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-12 20:45:03,739 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-12 20:45:03,740 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-12 20:45:03,790 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-12 20:45:03,806 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-12 20:45:03,811 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-12 20:45:03,812 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-12 20:45:03,813 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-12 20:45:03,814 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl [2018-10-12 20:45:03,814 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl' [2018-10-12 20:45:03,893 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-12 20:45:03,895 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-12 20:45:03,896 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-12 20:45:03,896 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-12 20:45:03,897 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-12 20:45:03,925 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:45:03" (1/1) ... [2018-10-12 20:45:03,927 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:45:03" (1/1) ... [2018-10-12 20:45:03,944 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:45:03" (1/1) ... [2018-10-12 20:45:03,944 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:45:03" (1/1) ... [2018-10-12 20:45:03,951 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:45:03" (1/1) ... [2018-10-12 20:45:03,959 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:45:03" (1/1) ... [2018-10-12 20:45:03,961 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:45:03" (1/1) ... [2018-10-12 20:45:03,968 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-12 20:45:03,969 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-12 20:45:03,969 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-12 20:45:03,969 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-12 20:45:03,970 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:45:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-12 20:45:04,050 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-12 20:45:04,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-12 20:45:04,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-12 20:45:04,564 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-12 20:45:04,565 INFO L202 PluginConnector]: Adding new model ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:45:04 BoogieIcfgContainer [2018-10-12 20:45:04,566 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-12 20:45:04,567 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-12 20:45:04,568 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-12 20:45:04,571 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-12 20:45:04,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:45:03" (1/2) ... [2018-10-12 20:45:04,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@651471a5 and model type ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:45:04, skipping insertion in model container [2018-10-12 20:45:04,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:45:04" (2/2) ... [2018-10-12 20:45:04,574 INFO L112 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl [2018-10-12 20:45:04,584 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-12 20:45:04,592 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-12 20:45:04,609 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-12 20:45:04,640 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-12 20:45:04,640 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-12 20:45:04,641 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-12 20:45:04,641 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-12 20:45:04,641 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-12 20:45:04,641 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-12 20:45:04,641 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-12 20:45:04,642 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-12 20:45:04,642 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-12 20:45:04,664 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2018-10-12 20:45:04,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-12 20:45:04,682 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:04,684 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] [2018-10-12 20:45:04,685 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:04,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:04,692 INFO L82 PathProgramCache]: Analyzing trace with hash 631576572, now seen corresponding path program 1 times [2018-10-12 20:45:04,746 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:04,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:04,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:45:04,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-12 20:45:04,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-12 20:45:04,985 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-12 20:45:05,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-12 20:45:05,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-12 20:45:05,004 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 6 states. [2018-10-12 20:45:05,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:05,432 INFO L93 Difference]: Finished difference Result 102 states and 103 transitions. [2018-10-12 20:45:05,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-12 20:45:05,434 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-10-12 20:45:05,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:05,447 INFO L225 Difference]: With dead ends: 102 [2018-10-12 20:45:05,448 INFO L226 Difference]: Without dead ends: 102 [2018-10-12 20:45:05,451 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-10-12 20:45:05,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-10-12 20:45:05,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 82. [2018-10-12 20:45:05,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-10-12 20:45:05,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2018-10-12 20:45:05,501 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 42 [2018-10-12 20:45:05,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:05,502 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2018-10-12 20:45:05,502 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-12 20:45:05,502 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2018-10-12 20:45:05,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-12 20:45:05,504 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:05,505 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-12 20:45:05,505 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:05,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:05,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1779054223, now seen corresponding path program 1 times [2018-10-12 20:45:05,507 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:05,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:05,861 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:45:05,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:05,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-12 20:45:05,864 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-12 20:45:05,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-12 20:45:05,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-12 20:45:05,865 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand 9 states. [2018-10-12 20:45:06,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:06,932 INFO L93 Difference]: Finished difference Result 210 states and 214 transitions. [2018-10-12 20:45:06,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-12 20:45:06,934 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2018-10-12 20:45:06,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:06,937 INFO L225 Difference]: With dead ends: 210 [2018-10-12 20:45:06,937 INFO L226 Difference]: Without dead ends: 210 [2018-10-12 20:45:06,939 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2018-10-12 20:45:06,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-10-12 20:45:06,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 84. [2018-10-12 20:45:06,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-10-12 20:45:06,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2018-10-12 20:45:06,951 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 68 [2018-10-12 20:45:06,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:06,952 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2018-10-12 20:45:06,952 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-12 20:45:06,952 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2018-10-12 20:45:06,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-10-12 20:45:06,955 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:06,955 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:45:06,956 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:06,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:06,956 INFO L82 PathProgramCache]: Analyzing trace with hash 681413385, now seen corresponding path program 1 times [2018-10-12 20:45:06,957 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:06,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:07,268 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:45:07,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:07,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-12 20:45:07,269 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-12 20:45:07,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-12 20:45:07,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-10-12 20:45:07,270 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand 10 states. [2018-10-12 20:45:07,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:07,917 INFO L93 Difference]: Finished difference Result 165 states and 168 transitions. [2018-10-12 20:45:07,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-12 20:45:07,917 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 83 [2018-10-12 20:45:07,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:07,921 INFO L225 Difference]: With dead ends: 165 [2018-10-12 20:45:07,923 INFO L226 Difference]: Without dead ends: 165 [2018-10-12 20:45:07,924 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=197, Invalid=505, Unknown=0, NotChecked=0, Total=702 [2018-10-12 20:45:07,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-10-12 20:45:07,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 125. [2018-10-12 20:45:07,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-10-12 20:45:07,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 128 transitions. [2018-10-12 20:45:07,934 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 128 transitions. Word has length 83 [2018-10-12 20:45:07,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:07,935 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 128 transitions. [2018-10-12 20:45:07,935 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-12 20:45:07,936 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 128 transitions. [2018-10-12 20:45:07,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-12 20:45:07,939 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:07,940 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:45:07,940 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:07,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:07,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1966058966, now seen corresponding path program 2 times [2018-10-12 20:45:07,942 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:07,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:08,103 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 39 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-12 20:45:08,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:08,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-12 20:45:08,105 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-12 20:45:08,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-12 20:45:08,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-12 20:45:08,106 INFO L87 Difference]: Start difference. First operand 125 states and 128 transitions. Second operand 8 states. [2018-10-12 20:45:08,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:08,317 INFO L93 Difference]: Finished difference Result 145 states and 147 transitions. [2018-10-12 20:45:08,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-12 20:45:08,317 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 109 [2018-10-12 20:45:08,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:08,319 INFO L225 Difference]: With dead ends: 145 [2018-10-12 20:45:08,319 INFO L226 Difference]: Without dead ends: 145 [2018-10-12 20:45:08,319 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-10-12 20:45:08,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-10-12 20:45:08,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 125. [2018-10-12 20:45:08,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-10-12 20:45:08,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 127 transitions. [2018-10-12 20:45:08,329 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 127 transitions. Word has length 109 [2018-10-12 20:45:08,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:08,330 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 127 transitions. [2018-10-12 20:45:08,330 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-12 20:45:08,330 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 127 transitions. [2018-10-12 20:45:08,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-12 20:45:08,332 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:08,332 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:45:08,333 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:08,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:08,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1280955748, now seen corresponding path program 3 times [2018-10-12 20:45:08,334 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:08,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:08,481 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-10-12 20:45:08,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:08,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-12 20:45:08,482 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-12 20:45:08,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-12 20:45:08,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-12 20:45:08,483 INFO L87 Difference]: Start difference. First operand 125 states and 127 transitions. Second operand 5 states. [2018-10-12 20:45:08,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:08,591 INFO L93 Difference]: Finished difference Result 192 states and 195 transitions. [2018-10-12 20:45:08,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-12 20:45:08,592 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 124 [2018-10-12 20:45:08,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:08,593 INFO L225 Difference]: With dead ends: 192 [2018-10-12 20:45:08,593 INFO L226 Difference]: Without dead ends: 192 [2018-10-12 20:45:08,594 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-12 20:45:08,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-10-12 20:45:08,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 140. [2018-10-12 20:45:08,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-10-12 20:45:08,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 143 transitions. [2018-10-12 20:45:08,605 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 143 transitions. Word has length 124 [2018-10-12 20:45:08,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:08,605 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 143 transitions. [2018-10-12 20:45:08,605 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-12 20:45:08,606 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 143 transitions. [2018-10-12 20:45:08,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-12 20:45:08,608 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:08,608 INFO L375 BasicCegarLoop]: trace histogram [4, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:45:08,608 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:08,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:08,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1853662372, now seen corresponding path program 4 times [2018-10-12 20:45:08,610 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:08,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:09,003 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 5 proven. 99 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-12 20:45:09,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:09,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-12 20:45:09,004 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-12 20:45:09,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-12 20:45:09,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-10-12 20:45:09,005 INFO L87 Difference]: Start difference. First operand 140 states and 143 transitions. Second operand 14 states. [2018-10-12 20:45:10,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:10,051 INFO L93 Difference]: Finished difference Result 236 states and 241 transitions. [2018-10-12 20:45:10,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-12 20:45:10,053 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 139 [2018-10-12 20:45:10,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:10,055 INFO L225 Difference]: With dead ends: 236 [2018-10-12 20:45:10,055 INFO L226 Difference]: Without dead ends: 236 [2018-10-12 20:45:10,057 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=434, Invalid=1458, Unknown=0, NotChecked=0, Total=1892 [2018-10-12 20:45:10,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-10-12 20:45:10,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 196. [2018-10-12 20:45:10,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-10-12 20:45:10,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 201 transitions. [2018-10-12 20:45:10,069 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 201 transitions. Word has length 139 [2018-10-12 20:45:10,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:10,069 INFO L481 AbstractCegarLoop]: Abstraction has 196 states and 201 transitions. [2018-10-12 20:45:10,070 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-12 20:45:10,070 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 201 transitions. [2018-10-12 20:45:10,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-10-12 20:45:10,073 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:10,073 INFO L375 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:45:10,073 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:10,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:10,074 INFO L82 PathProgramCache]: Analyzing trace with hash -981238097, now seen corresponding path program 5 times [2018-10-12 20:45:10,075 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:10,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:10,330 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 105 proven. 46 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-12 20:45:10,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:10,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-12 20:45:10,331 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-12 20:45:10,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-12 20:45:10,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-10-12 20:45:10,332 INFO L87 Difference]: Start difference. First operand 196 states and 201 transitions. Second operand 10 states. [2018-10-12 20:45:10,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:10,977 INFO L93 Difference]: Finished difference Result 196 states and 199 transitions. [2018-10-12 20:45:10,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-12 20:45:10,978 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 165 [2018-10-12 20:45:10,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:10,980 INFO L225 Difference]: With dead ends: 196 [2018-10-12 20:45:10,981 INFO L226 Difference]: Without dead ends: 196 [2018-10-12 20:45:10,981 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2018-10-12 20:45:10,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-10-12 20:45:10,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2018-10-12 20:45:10,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-10-12 20:45:10,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 199 transitions. [2018-10-12 20:45:10,991 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 199 transitions. Word has length 165 [2018-10-12 20:45:10,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:10,992 INFO L481 AbstractCegarLoop]: Abstraction has 196 states and 199 transitions. [2018-10-12 20:45:10,992 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-12 20:45:10,992 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 199 transitions. [2018-10-12 20:45:10,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-12 20:45:10,995 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:10,995 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:45:10,995 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:10,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:10,996 INFO L82 PathProgramCache]: Analyzing trace with hash -366729745, now seen corresponding path program 6 times [2018-10-12 20:45:10,997 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:11,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:11,708 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 137 proven. 64 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-12 20:45:11,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:11,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-12 20:45:11,709 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-12 20:45:11,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-12 20:45:11,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-10-12 20:45:11,710 INFO L87 Difference]: Start difference. First operand 196 states and 199 transitions. Second operand 12 states. [2018-10-12 20:45:12,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:12,117 INFO L93 Difference]: Finished difference Result 196 states and 197 transitions. [2018-10-12 20:45:12,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-12 20:45:12,118 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 180 [2018-10-12 20:45:12,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:12,120 INFO L225 Difference]: With dead ends: 196 [2018-10-12 20:45:12,120 INFO L226 Difference]: Without dead ends: 196 [2018-10-12 20:45:12,121 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=119, Invalid=433, Unknown=0, NotChecked=0, Total=552 [2018-10-12 20:45:12,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-10-12 20:45:12,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2018-10-12 20:45:12,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-10-12 20:45:12,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 197 transitions. [2018-10-12 20:45:12,127 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 197 transitions. Word has length 180 [2018-10-12 20:45:12,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:12,128 INFO L481 AbstractCegarLoop]: Abstraction has 196 states and 197 transitions. [2018-10-12 20:45:12,128 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-12 20:45:12,128 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 197 transitions. [2018-10-12 20:45:12,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-10-12 20:45:12,131 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:12,131 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:45:12,131 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:12,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:12,132 INFO L82 PathProgramCache]: Analyzing trace with hash 2109216431, now seen corresponding path program 7 times [2018-10-12 20:45:12,133 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:12,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:12,861 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 105 proven. 19 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-10-12 20:45:12,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:12,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-12 20:45:12,862 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-12 20:45:12,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-12 20:45:12,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-12 20:45:12,863 INFO L87 Difference]: Start difference. First operand 196 states and 197 transitions. Second operand 7 states. [2018-10-12 20:45:13,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:13,499 INFO L93 Difference]: Finished difference Result 243 states and 245 transitions. [2018-10-12 20:45:13,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-12 20:45:13,499 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 195 [2018-10-12 20:45:13,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:13,502 INFO L225 Difference]: With dead ends: 243 [2018-10-12 20:45:13,502 INFO L226 Difference]: Without dead ends: 243 [2018-10-12 20:45:13,503 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-10-12 20:45:13,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-10-12 20:45:13,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 211. [2018-10-12 20:45:13,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-10-12 20:45:13,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 213 transitions. [2018-10-12 20:45:13,509 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 213 transitions. Word has length 195 [2018-10-12 20:45:13,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:13,509 INFO L481 AbstractCegarLoop]: Abstraction has 211 states and 213 transitions. [2018-10-12 20:45:13,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-12 20:45:13,509 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 213 transitions. [2018-10-12 20:45:13,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-10-12 20:45:13,512 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:13,512 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:45:13,512 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:13,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:13,513 INFO L82 PathProgramCache]: Analyzing trace with hash 2041538281, now seen corresponding path program 8 times [2018-10-12 20:45:13,514 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:13,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:13,830 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 0 proven. 331 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-10-12 20:45:13,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:13,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-12 20:45:13,831 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-12 20:45:13,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-12 20:45:13,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-10-12 20:45:13,832 INFO L87 Difference]: Start difference. First operand 211 states and 213 transitions. Second operand 15 states. [2018-10-12 20:45:14,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:14,802 INFO L93 Difference]: Finished difference Result 303 states and 307 transitions. [2018-10-12 20:45:14,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-12 20:45:14,804 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 210 [2018-10-12 20:45:14,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:14,805 INFO L225 Difference]: With dead ends: 303 [2018-10-12 20:45:14,805 INFO L226 Difference]: Without dead ends: 303 [2018-10-12 20:45:14,807 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=535, Invalid=1915, Unknown=0, NotChecked=0, Total=2450 [2018-10-12 20:45:14,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-10-12 20:45:14,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 267. [2018-10-12 20:45:14,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-10-12 20:45:14,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 270 transitions. [2018-10-12 20:45:14,812 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 270 transitions. Word has length 210 [2018-10-12 20:45:14,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:14,813 INFO L481 AbstractCegarLoop]: Abstraction has 267 states and 270 transitions. [2018-10-12 20:45:14,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-12 20:45:14,813 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 270 transitions. [2018-10-12 20:45:14,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-10-12 20:45:14,816 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:14,816 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:45:14,816 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:14,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:14,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1689063370, now seen corresponding path program 9 times [2018-10-12 20:45:14,818 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:14,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:15,607 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 403 proven. 196 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-10-12 20:45:15,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:15,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-12 20:45:15,608 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-12 20:45:15,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-12 20:45:15,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-10-12 20:45:15,609 INFO L87 Difference]: Start difference. First operand 267 states and 270 transitions. Second operand 16 states. [2018-10-12 20:45:16,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:16,290 INFO L93 Difference]: Finished difference Result 282 states and 284 transitions. [2018-10-12 20:45:16,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-12 20:45:16,291 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 266 [2018-10-12 20:45:16,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:16,293 INFO L225 Difference]: With dead ends: 282 [2018-10-12 20:45:16,294 INFO L226 Difference]: Without dead ends: 282 [2018-10-12 20:45:16,295 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=228, Invalid=894, Unknown=0, NotChecked=0, Total=1122 [2018-10-12 20:45:16,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-10-12 20:45:16,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2018-10-12 20:45:16,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-10-12 20:45:16,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 284 transitions. [2018-10-12 20:45:16,300 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 284 transitions. Word has length 266 [2018-10-12 20:45:16,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:16,301 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 284 transitions. [2018-10-12 20:45:16,301 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-12 20:45:16,301 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 284 transitions. [2018-10-12 20:45:16,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2018-10-12 20:45:16,302 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:16,303 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:45:16,303 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:16,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:16,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1594975556, now seen corresponding path program 10 times [2018-10-12 20:45:16,304 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:16,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:16,570 INFO L134 CoverageAnalysis]: Checked inductivity of 794 backedges. 298 proven. 51 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2018-10-12 20:45:16,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:16,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-12 20:45:16,571 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-12 20:45:16,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-12 20:45:16,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-12 20:45:16,572 INFO L87 Difference]: Start difference. First operand 282 states and 284 transitions. Second operand 9 states. [2018-10-12 20:45:16,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:16,982 INFO L93 Difference]: Finished difference Result 357 states and 361 transitions. [2018-10-12 20:45:16,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-12 20:45:16,983 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 281 [2018-10-12 20:45:16,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:16,986 INFO L225 Difference]: With dead ends: 357 [2018-10-12 20:45:16,986 INFO L226 Difference]: Without dead ends: 357 [2018-10-12 20:45:16,987 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-10-12 20:45:16,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-10-12 20:45:16,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 297. [2018-10-12 20:45:16,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-10-12 20:45:16,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 300 transitions. [2018-10-12 20:45:16,993 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 300 transitions. Word has length 281 [2018-10-12 20:45:16,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:16,994 INFO L481 AbstractCegarLoop]: Abstraction has 297 states and 300 transitions. [2018-10-12 20:45:16,994 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-12 20:45:16,994 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 300 transitions. [2018-10-12 20:45:16,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-10-12 20:45:16,996 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:16,996 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:45:16,997 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:16,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:16,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1854449468, now seen corresponding path program 11 times [2018-10-12 20:45:16,998 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:17,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:17,427 INFO L134 CoverageAnalysis]: Checked inductivity of 935 backedges. 0 proven. 821 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-10-12 20:45:17,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:17,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-12 20:45:17,428 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-12 20:45:17,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-12 20:45:17,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2018-10-12 20:45:17,429 INFO L87 Difference]: Start difference. First operand 297 states and 300 transitions. Second operand 17 states. [2018-10-12 20:45:18,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:18,641 INFO L93 Difference]: Finished difference Result 404 states and 409 transitions. [2018-10-12 20:45:18,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-12 20:45:18,642 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 296 [2018-10-12 20:45:18,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:18,646 INFO L225 Difference]: With dead ends: 404 [2018-10-12 20:45:18,646 INFO L226 Difference]: Without dead ends: 404 [2018-10-12 20:45:18,648 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1170 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=809, Invalid=2973, Unknown=0, NotChecked=0, Total=3782 [2018-10-12 20:45:18,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2018-10-12 20:45:18,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 368. [2018-10-12 20:45:18,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-10-12 20:45:18,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 372 transitions. [2018-10-12 20:45:18,655 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 372 transitions. Word has length 296 [2018-10-12 20:45:18,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:18,656 INFO L481 AbstractCegarLoop]: Abstraction has 368 states and 372 transitions. [2018-10-12 20:45:18,656 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-12 20:45:18,657 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 372 transitions. [2018-10-12 20:45:18,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2018-10-12 20:45:18,659 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:18,660 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:45:18,660 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:18,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:18,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1773481265, now seen corresponding path program 12 times [2018-10-12 20:45:18,661 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:18,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:19,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1576 backedges. 0 proven. 1414 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-10-12 20:45:19,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:19,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-12 20:45:19,480 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-12 20:45:19,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-12 20:45:19,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2018-10-12 20:45:19,481 INFO L87 Difference]: Start difference. First operand 368 states and 372 transitions. Second operand 19 states. [2018-10-12 20:45:21,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:21,612 INFO L93 Difference]: Finished difference Result 475 states and 481 transitions. [2018-10-12 20:45:21,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-12 20:45:21,612 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 367 [2018-10-12 20:45:21,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:21,616 INFO L225 Difference]: With dead ends: 475 [2018-10-12 20:45:21,616 INFO L226 Difference]: Without dead ends: 475 [2018-10-12 20:45:21,618 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1772 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1137, Invalid=4265, Unknown=0, NotChecked=0, Total=5402 [2018-10-12 20:45:21,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2018-10-12 20:45:21,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 439. [2018-10-12 20:45:21,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2018-10-12 20:45:21,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 444 transitions. [2018-10-12 20:45:21,626 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 444 transitions. Word has length 367 [2018-10-12 20:45:21,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:21,626 INFO L481 AbstractCegarLoop]: Abstraction has 439 states and 444 transitions. [2018-10-12 20:45:21,626 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-12 20:45:21,627 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 444 transitions. [2018-10-12 20:45:21,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2018-10-12 20:45:21,629 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:21,629 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:45:21,630 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:21,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:21,630 INFO L82 PathProgramCache]: Analyzing trace with hash -40885284, now seen corresponding path program 13 times [2018-10-12 20:45:21,631 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:21,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:22,900 INFO L134 CoverageAnalysis]: Checked inductivity of 2384 backedges. 1504 proven. 452 refuted. 0 times theorem prover too weak. 428 trivial. 0 not checked. [2018-10-12 20:45:22,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:22,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-12 20:45:22,901 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-12 20:45:22,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-12 20:45:22,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2018-10-12 20:45:22,901 INFO L87 Difference]: Start difference. First operand 439 states and 444 transitions. Second operand 20 states. [2018-10-12 20:45:23,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:23,965 INFO L93 Difference]: Finished difference Result 469 states and 473 transitions. [2018-10-12 20:45:23,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-12 20:45:23,965 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 438 [2018-10-12 20:45:23,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:23,969 INFO L225 Difference]: With dead ends: 469 [2018-10-12 20:45:23,970 INFO L226 Difference]: Without dead ends: 469 [2018-10-12 20:45:23,971 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=375, Invalid=1517, Unknown=0, NotChecked=0, Total=1892 [2018-10-12 20:45:23,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2018-10-12 20:45:23,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 469. [2018-10-12 20:45:23,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2018-10-12 20:45:23,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 473 transitions. [2018-10-12 20:45:23,977 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 473 transitions. Word has length 438 [2018-10-12 20:45:23,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:23,978 INFO L481 AbstractCegarLoop]: Abstraction has 469 states and 473 transitions. [2018-10-12 20:45:23,978 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-12 20:45:23,978 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 473 transitions. [2018-10-12 20:45:23,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2018-10-12 20:45:23,980 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:23,981 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:45:23,981 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:23,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:23,982 INFO L82 PathProgramCache]: Analyzing trace with hash -448487646, now seen corresponding path program 14 times [2018-10-12 20:45:23,982 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:24,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:26,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2895 backedges. 0 proven. 2593 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2018-10-12 20:45:26,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:26,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-12 20:45:26,873 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-12 20:45:26,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-12 20:45:26,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2018-10-12 20:45:26,874 INFO L87 Difference]: Start difference. First operand 469 states and 473 transitions. Second operand 21 states. [2018-10-12 20:45:27,724 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 18 [2018-10-12 20:45:29,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:29,149 INFO L93 Difference]: Finished difference Result 576 states and 581 transitions. [2018-10-12 20:45:29,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-12 20:45:29,149 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 468 [2018-10-12 20:45:29,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:29,154 INFO L225 Difference]: With dead ends: 576 [2018-10-12 20:45:29,154 INFO L226 Difference]: Without dead ends: 576 [2018-10-12 20:45:29,157 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2499 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1519, Invalid=5791, Unknown=0, NotChecked=0, Total=7310 [2018-10-12 20:45:29,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2018-10-12 20:45:29,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 555. [2018-10-12 20:45:29,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2018-10-12 20:45:29,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 560 transitions. [2018-10-12 20:45:29,164 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 560 transitions. Word has length 468 [2018-10-12 20:45:29,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:29,165 INFO L481 AbstractCegarLoop]: Abstraction has 555 states and 560 transitions. [2018-10-12 20:45:29,165 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-12 20:45:29,165 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 560 transitions. [2018-10-12 20:45:29,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 555 [2018-10-12 20:45:29,169 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:29,169 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:45:29,169 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:29,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:29,170 INFO L82 PathProgramCache]: Analyzing trace with hash -868829515, now seen corresponding path program 15 times [2018-10-12 20:45:29,171 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:29,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:30,010 INFO L134 CoverageAnalysis]: Checked inductivity of 4286 backedges. 0 proven. 3890 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2018-10-12 20:45:30,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:30,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-12 20:45:30,011 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-12 20:45:30,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-12 20:45:30,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2018-10-12 20:45:30,012 INFO L87 Difference]: Start difference. First operand 555 states and 560 transitions. Second operand 23 states. [2018-10-12 20:45:32,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:32,068 INFO L93 Difference]: Finished difference Result 662 states and 668 transitions. [2018-10-12 20:45:32,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-12 20:45:32,069 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 554 [2018-10-12 20:45:32,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:32,074 INFO L225 Difference]: With dead ends: 662 [2018-10-12 20:45:32,074 INFO L226 Difference]: Without dead ends: 662 [2018-10-12 20:45:32,077 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3351 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1955, Invalid=7551, Unknown=0, NotChecked=0, Total=9506 [2018-10-12 20:45:32,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2018-10-12 20:45:32,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 641. [2018-10-12 20:45:32,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2018-10-12 20:45:32,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 647 transitions. [2018-10-12 20:45:32,086 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 647 transitions. Word has length 554 [2018-10-12 20:45:32,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:32,086 INFO L481 AbstractCegarLoop]: Abstraction has 641 states and 647 transitions. [2018-10-12 20:45:32,086 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-12 20:45:32,087 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 647 transitions. [2018-10-12 20:45:32,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 641 [2018-10-12 20:45:32,091 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:32,091 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:45:32,092 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:32,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:32,092 INFO L82 PathProgramCache]: Analyzing trace with hash 465860104, now seen corresponding path program 16 times [2018-10-12 20:45:32,093 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:32,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:33,018 INFO L134 CoverageAnalysis]: Checked inductivity of 5951 backedges. 43 proven. 5415 refuted. 0 times theorem prover too weak. 493 trivial. 0 not checked. [2018-10-12 20:45:33,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:33,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-12 20:45:33,019 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-12 20:45:33,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-12 20:45:33,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=485, Unknown=0, NotChecked=0, Total=600 [2018-10-12 20:45:33,020 INFO L87 Difference]: Start difference. First operand 641 states and 647 transitions. Second operand 25 states. [2018-10-12 20:45:35,496 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-12 20:45:35,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:35,811 INFO L93 Difference]: Finished difference Result 748 states and 755 transitions. [2018-10-12 20:45:35,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-10-12 20:45:35,811 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 640 [2018-10-12 20:45:35,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:35,816 INFO L225 Difference]: With dead ends: 748 [2018-10-12 20:45:35,816 INFO L226 Difference]: Without dead ends: 748 [2018-10-12 20:45:35,819 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4123 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2543, Invalid=8799, Unknown=0, NotChecked=0, Total=11342 [2018-10-12 20:45:35,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2018-10-12 20:45:35,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 727. [2018-10-12 20:45:35,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2018-10-12 20:45:35,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 734 transitions. [2018-10-12 20:45:35,828 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 734 transitions. Word has length 640 [2018-10-12 20:45:35,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:35,829 INFO L481 AbstractCegarLoop]: Abstraction has 727 states and 734 transitions. [2018-10-12 20:45:35,829 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-12 20:45:35,829 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 734 transitions. [2018-10-12 20:45:35,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 727 [2018-10-12 20:45:35,834 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:35,835 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:45:35,835 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:35,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:35,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1195085083, now seen corresponding path program 17 times [2018-10-12 20:45:35,836 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:35,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:37,096 INFO L134 CoverageAnalysis]: Checked inductivity of 7890 backedges. 0 proven. 7337 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2018-10-12 20:45:37,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:37,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-12 20:45:37,097 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-12 20:45:37,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-12 20:45:37,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=675, Unknown=0, NotChecked=0, Total=812 [2018-10-12 20:45:37,098 INFO L87 Difference]: Start difference. First operand 727 states and 734 transitions. Second operand 29 states. [2018-10-12 20:45:42,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:42,354 INFO L93 Difference]: Finished difference Result 834 states and 842 transitions. [2018-10-12 20:45:42,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-10-12 20:45:42,355 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 726 [2018-10-12 20:45:42,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:42,359 INFO L225 Difference]: With dead ends: 834 [2018-10-12 20:45:42,360 INFO L226 Difference]: Without dead ends: 834 [2018-10-12 20:45:42,365 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9471 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=4336, Invalid=19844, Unknown=0, NotChecked=0, Total=24180 [2018-10-12 20:45:42,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2018-10-12 20:45:42,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 813. [2018-10-12 20:45:42,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2018-10-12 20:45:42,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 821 transitions. [2018-10-12 20:45:42,375 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 821 transitions. Word has length 726 [2018-10-12 20:45:42,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:42,376 INFO L481 AbstractCegarLoop]: Abstraction has 813 states and 821 transitions. [2018-10-12 20:45:42,376 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-12 20:45:42,376 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 821 transitions. [2018-10-12 20:45:42,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 813 [2018-10-12 20:45:42,383 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:42,383 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:45:42,383 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:42,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:42,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1912230930, now seen corresponding path program 18 times [2018-10-12 20:45:42,385 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:42,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:43,605 INFO L134 CoverageAnalysis]: Checked inductivity of 10103 backedges. 0 proven. 9425 refuted. 0 times theorem prover too weak. 678 trivial. 0 not checked. [2018-10-12 20:45:43,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:43,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-12 20:45:43,606 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-12 20:45:43,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-12 20:45:43,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=656, Unknown=0, NotChecked=0, Total=812 [2018-10-12 20:45:43,607 INFO L87 Difference]: Start difference. First operand 813 states and 821 transitions. Second operand 29 states. [2018-10-12 20:45:46,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:46,952 INFO L93 Difference]: Finished difference Result 920 states and 929 transitions. [2018-10-12 20:45:46,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-10-12 20:45:46,953 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 812 [2018-10-12 20:45:46,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:46,958 INFO L225 Difference]: With dead ends: 920 [2018-10-12 20:45:46,958 INFO L226 Difference]: Without dead ends: 920 [2018-10-12 20:45:46,960 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6657 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3587, Invalid=14235, Unknown=0, NotChecked=0, Total=17822 [2018-10-12 20:45:46,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2018-10-12 20:45:46,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 899. [2018-10-12 20:45:46,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2018-10-12 20:45:46,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 908 transitions. [2018-10-12 20:45:46,971 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 908 transitions. Word has length 812 [2018-10-12 20:45:46,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:46,972 INFO L481 AbstractCegarLoop]: Abstraction has 899 states and 908 transitions. [2018-10-12 20:45:46,972 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-12 20:45:46,972 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 908 transitions. [2018-10-12 20:45:46,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 899 [2018-10-12 20:45:46,979 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:46,980 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:45:46,980 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:46,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:46,981 INFO L82 PathProgramCache]: Analyzing trace with hash -559381887, now seen corresponding path program 19 times [2018-10-12 20:45:46,982 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:47,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:49,985 INFO L134 CoverageAnalysis]: Checked inductivity of 12590 backedges. 0 proven. 11818 refuted. 0 times theorem prover too weak. 772 trivial. 0 not checked. [2018-10-12 20:45:49,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:49,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-12 20:45:49,986 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-12 20:45:49,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-12 20:45:49,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=749, Unknown=0, NotChecked=0, Total=930 [2018-10-12 20:45:49,987 INFO L87 Difference]: Start difference. First operand 899 states and 908 transitions. Second operand 31 states. [2018-10-12 20:45:53,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:53,881 INFO L93 Difference]: Finished difference Result 1006 states and 1016 transitions. [2018-10-12 20:45:53,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-10-12 20:45:53,882 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 898 [2018-10-12 20:45:53,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:53,887 INFO L225 Difference]: With dead ends: 1006 [2018-10-12 20:45:53,887 INFO L226 Difference]: Without dead ends: 1006 [2018-10-12 20:45:53,890 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8009 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=4239, Invalid=16931, Unknown=0, NotChecked=0, Total=21170 [2018-10-12 20:45:53,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2018-10-12 20:45:53,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 985. [2018-10-12 20:45:53,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 985 states. [2018-10-12 20:45:53,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 995 transitions. [2018-10-12 20:45:53,900 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 995 transitions. Word has length 898 [2018-10-12 20:45:53,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:53,901 INFO L481 AbstractCegarLoop]: Abstraction has 985 states and 995 transitions. [2018-10-12 20:45:53,901 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-12 20:45:53,901 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 995 transitions. [2018-10-12 20:45:53,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 985 [2018-10-12 20:45:53,910 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:53,910 INFO L375 BasicCegarLoop]: trace histogram [43, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:45:53,911 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:53,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:53,911 INFO L82 PathProgramCache]: Analyzing trace with hash 2043003092, now seen corresponding path program 20 times [2018-10-12 20:45:53,912 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:53,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:56,151 INFO L134 CoverageAnalysis]: Checked inductivity of 15351 backedges. 9237 proven. 1162 refuted. 0 times theorem prover too weak. 4952 trivial. 0 not checked. [2018-10-12 20:45:56,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:56,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-12 20:45:56,153 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-12 20:45:56,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-12 20:45:56,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2018-10-12 20:45:56,153 INFO L87 Difference]: Start difference. First operand 985 states and 995 transitions. Second operand 26 states. [2018-10-12 20:45:57,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:57,143 INFO L93 Difference]: Finished difference Result 1182 states and 1192 transitions. [2018-10-12 20:45:57,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-12 20:45:57,144 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 984 [2018-10-12 20:45:57,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:57,148 INFO L225 Difference]: With dead ends: 1182 [2018-10-12 20:45:57,149 INFO L226 Difference]: Without dead ends: 1182 [2018-10-12 20:45:57,149 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=554, Invalid=2308, Unknown=0, NotChecked=0, Total=2862 [2018-10-12 20:45:57,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2018-10-12 20:45:57,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 1089. [2018-10-12 20:45:57,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1089 states. [2018-10-12 20:45:57,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 1089 states and 1099 transitions. [2018-10-12 20:45:57,160 INFO L78 Accepts]: Start accepts. Automaton has 1089 states and 1099 transitions. Word has length 984 [2018-10-12 20:45:57,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:57,161 INFO L481 AbstractCegarLoop]: Abstraction has 1089 states and 1099 transitions. [2018-10-12 20:45:57,161 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-12 20:45:57,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1089 states and 1099 transitions. [2018-10-12 20:45:57,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1075 [2018-10-12 20:45:57,170 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:57,171 INFO L375 BasicCegarLoop]: trace histogram [49, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:45:57,171 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:57,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:57,172 INFO L82 PathProgramCache]: Analyzing trace with hash -543143870, now seen corresponding path program 21 times [2018-10-12 20:45:57,173 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:57,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:58,523 INFO L134 CoverageAnalysis]: Checked inductivity of 19440 backedges. 12625 proven. 1862 refuted. 0 times theorem prover too weak. 4953 trivial. 0 not checked. [2018-10-12 20:45:58,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:58,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-12 20:45:58,524 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-12 20:45:58,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-12 20:45:58,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=750, Unknown=0, NotChecked=0, Total=870 [2018-10-12 20:45:58,525 INFO L87 Difference]: Start difference. First operand 1089 states and 1099 transitions. Second operand 30 states. [2018-10-12 20:46:00,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:46:00,249 INFO L93 Difference]: Finished difference Result 1261 states and 1271 transitions. [2018-10-12 20:46:00,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-12 20:46:00,249 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 1074 [2018-10-12 20:46:00,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:46:00,254 INFO L225 Difference]: With dead ends: 1261 [2018-10-12 20:46:00,254 INFO L226 Difference]: Without dead ends: 1261 [2018-10-12 20:46:00,255 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 822 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=750, Invalid=3156, Unknown=0, NotChecked=0, Total=3906 [2018-10-12 20:46:00,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2018-10-12 20:46:00,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 1179. [2018-10-12 20:46:00,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1179 states. [2018-10-12 20:46:00,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 1179 states and 1190 transitions. [2018-10-12 20:46:00,267 INFO L78 Accepts]: Start accepts. Automaton has 1179 states and 1190 transitions. Word has length 1074 [2018-10-12 20:46:00,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:46:00,268 INFO L481 AbstractCegarLoop]: Abstraction has 1179 states and 1190 transitions. [2018-10-12 20:46:00,268 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-12 20:46:00,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1190 transitions. [2018-10-12 20:46:00,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1150 [2018-10-12 20:46:00,279 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:46:00,280 INFO L375 BasicCegarLoop]: trace histogram [54, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:46:00,280 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:46:00,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:46:00,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1731378808, now seen corresponding path program 22 times [2018-10-12 20:46:00,282 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:46:00,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:46:01,944 INFO L134 CoverageAnalysis]: Checked inductivity of 23260 backedges. 0 proven. 21648 refuted. 0 times theorem prover too weak. 1612 trivial. 0 not checked. [2018-10-12 20:46:01,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:46:01,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-12 20:46:01,945 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-12 20:46:01,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-12 20:46:01,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=848, Unknown=0, NotChecked=0, Total=1056 [2018-10-12 20:46:01,946 INFO L87 Difference]: Start difference. First operand 1179 states and 1190 transitions. Second operand 33 states. [2018-10-12 20:46:06,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:46:06,370 INFO L93 Difference]: Finished difference Result 1315 states and 1327 transitions. [2018-10-12 20:46:06,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-10-12 20:46:06,370 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 1149 [2018-10-12 20:46:06,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:46:06,376 INFO L225 Difference]: With dead ends: 1315 [2018-10-12 20:46:06,376 INFO L226 Difference]: Without dead ends: 1315 [2018-10-12 20:46:06,379 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9486 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4945, Invalid=19861, Unknown=0, NotChecked=0, Total=24806 [2018-10-12 20:46:06,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1315 states. [2018-10-12 20:46:06,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1315 to 1295. [2018-10-12 20:46:06,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1295 states. [2018-10-12 20:46:06,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1295 states to 1295 states and 1307 transitions. [2018-10-12 20:46:06,395 INFO L78 Accepts]: Start accepts. Automaton has 1295 states and 1307 transitions. Word has length 1149 [2018-10-12 20:46:06,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:46:06,396 INFO L481 AbstractCegarLoop]: Abstraction has 1295 states and 1307 transitions. [2018-10-12 20:46:06,396 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-12 20:46:06,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states and 1307 transitions. [2018-10-12 20:46:06,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1266 [2018-10-12 20:46:06,415 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:46:06,415 INFO L375 BasicCegarLoop]: trace histogram [60, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:46:06,416 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:46:06,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:46:06,416 INFO L82 PathProgramCache]: Analyzing trace with hash 247266203, now seen corresponding path program 23 times [2018-10-12 20:46:06,417 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:46:06,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:46:08,330 INFO L134 CoverageAnalysis]: Checked inductivity of 28721 backedges. 43 proven. 26832 refuted. 0 times theorem prover too weak. 1846 trivial. 0 not checked. [2018-10-12 20:46:08,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:46:08,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-12 20:46:08,332 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-12 20:46:08,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-12 20:46:08,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=950, Unknown=0, NotChecked=0, Total=1190 [2018-10-12 20:46:08,333 INFO L87 Difference]: Start difference. First operand 1295 states and 1307 transitions. Second operand 35 states. [2018-10-12 20:46:12,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:46:12,679 INFO L93 Difference]: Finished difference Result 1431 states and 1444 transitions. [2018-10-12 20:46:12,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-10-12 20:46:12,680 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 1265 [2018-10-12 20:46:12,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:46:12,686 INFO L225 Difference]: With dead ends: 1431 [2018-10-12 20:46:12,686 INFO L226 Difference]: Without dead ends: 1431 [2018-10-12 20:46:12,689 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10853 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=6033, Invalid=21689, Unknown=0, NotChecked=0, Total=27722 [2018-10-12 20:46:12,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2018-10-12 20:46:12,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 1411. [2018-10-12 20:46:12,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1411 states. [2018-10-12 20:46:12,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 1424 transitions. [2018-10-12 20:46:12,701 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 1424 transitions. Word has length 1265 [2018-10-12 20:46:12,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:46:12,702 INFO L481 AbstractCegarLoop]: Abstraction has 1411 states and 1424 transitions. [2018-10-12 20:46:12,702 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-12 20:46:12,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 1424 transitions. [2018-10-12 20:46:12,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1382 [2018-10-12 20:46:12,718 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:46:12,719 INFO L375 BasicCegarLoop]: trace histogram [66, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:46:12,719 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:46:12,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:46:12,720 INFO L82 PathProgramCache]: Analyzing trace with hash -29308370, now seen corresponding path program 24 times [2018-10-12 20:46:12,720 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:46:12,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:46:15,534 INFO L134 CoverageAnalysis]: Checked inductivity of 34760 backedges. 27091 proven. 5776 refuted. 0 times theorem prover too weak. 1893 trivial. 0 not checked. [2018-10-12 20:46:15,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:46:15,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-12 20:46:15,535 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-12 20:46:15,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-12 20:46:15,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=1625, Unknown=0, NotChecked=0, Total=1892 [2018-10-12 20:46:15,536 INFO L87 Difference]: Start difference. First operand 1411 states and 1424 transitions. Second operand 44 states. [2018-10-12 20:46:18,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:46:18,593 INFO L93 Difference]: Finished difference Result 1473 states and 1485 transitions. [2018-10-12 20:46:18,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-12 20:46:18,594 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 1381 [2018-10-12 20:46:18,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:46:18,599 INFO L225 Difference]: With dead ends: 1473 [2018-10-12 20:46:18,599 INFO L226 Difference]: Without dead ends: 1473 [2018-10-12 20:46:18,600 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1892 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1626, Invalid=6746, Unknown=0, NotChecked=0, Total=8372 [2018-10-12 20:46:18,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1473 states. [2018-10-12 20:46:18,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473 to 1441. [2018-10-12 20:46:18,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1441 states. [2018-10-12 20:46:18,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1441 states to 1441 states and 1455 transitions. [2018-10-12 20:46:18,612 INFO L78 Accepts]: Start accepts. Automaton has 1441 states and 1455 transitions. Word has length 1381 [2018-10-12 20:46:18,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:46:18,613 INFO L481 AbstractCegarLoop]: Abstraction has 1441 states and 1455 transitions. [2018-10-12 20:46:18,613 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-12 20:46:18,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1441 states and 1455 transitions. [2018-10-12 20:46:18,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1397 [2018-10-12 20:46:18,630 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:46:18,631 INFO L375 BasicCegarLoop]: trace histogram [67, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:46:18,631 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:46:18,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:46:18,632 INFO L82 PathProgramCache]: Analyzing trace with hash 509279760, now seen corresponding path program 25 times [2018-10-12 20:46:18,633 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:46:18,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:46:21,028 INFO L134 CoverageAnalysis]: Checked inductivity of 35751 backedges. 26580 proven. 4003 refuted. 0 times theorem prover too weak. 5168 trivial. 0 not checked. [2018-10-12 20:46:21,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:46:21,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-12 20:46:21,029 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-12 20:46:21,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-12 20:46:21,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1214, Unknown=0, NotChecked=0, Total=1406 [2018-10-12 20:46:21,030 INFO L87 Difference]: Start difference. First operand 1441 states and 1455 transitions. Second operand 38 states. [2018-10-12 20:46:23,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:46:23,356 INFO L93 Difference]: Finished difference Result 1557 states and 1569 transitions. [2018-10-12 20:46:23,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-12 20:46:23,356 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 1396 [2018-10-12 20:46:23,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:46:23,363 INFO L225 Difference]: With dead ends: 1557 [2018-10-12 20:46:23,363 INFO L226 Difference]: Without dead ends: 1557 [2018-10-12 20:46:23,363 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1406 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1206, Invalid=5114, Unknown=0, NotChecked=0, Total=6320 [2018-10-12 20:46:23,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1557 states. [2018-10-12 20:46:23,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1557 to 1486. [2018-10-12 20:46:23,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1486 states. [2018-10-12 20:46:23,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 1486 states and 1500 transitions. [2018-10-12 20:46:23,375 INFO L78 Accepts]: Start accepts. Automaton has 1486 states and 1500 transitions. Word has length 1396 [2018-10-12 20:46:23,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:46:23,376 INFO L481 AbstractCegarLoop]: Abstraction has 1486 states and 1500 transitions. [2018-10-12 20:46:23,376 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-12 20:46:23,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 1500 transitions. [2018-10-12 20:46:23,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1442 [2018-10-12 20:46:23,392 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:46:23,393 INFO L375 BasicCegarLoop]: trace histogram [70, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:46:23,393 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:46:23,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:46:23,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1768861730, now seen corresponding path program 26 times [2018-10-12 20:46:23,394 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:46:23,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:46:25,793 INFO L134 CoverageAnalysis]: Checked inductivity of 38814 backedges. 0 proven. 36407 refuted. 0 times theorem prover too weak. 2407 trivial. 0 not checked. [2018-10-12 20:46:25,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:46:25,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-12 20:46:25,794 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-12 20:46:25,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-12 20:46:25,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=1210, Unknown=0, NotChecked=0, Total=1482 [2018-10-12 20:46:25,795 INFO L87 Difference]: Start difference. First operand 1486 states and 1500 transitions. Second operand 39 states. [2018-10-12 20:46:34,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:46:34,424 INFO L93 Difference]: Finished difference Result 1637 states and 1652 transitions. [2018-10-12 20:46:34,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 203 states. [2018-10-12 20:46:34,424 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 1441 [2018-10-12 20:46:34,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:46:34,430 INFO L225 Difference]: With dead ends: 1637 [2018-10-12 20:46:34,431 INFO L226 Difference]: Without dead ends: 1637 [2018-10-12 20:46:34,435 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23266 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=9856, Invalid=45604, Unknown=0, NotChecked=0, Total=55460 [2018-10-12 20:46:34,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1637 states. [2018-10-12 20:46:34,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1637 to 1617. [2018-10-12 20:46:34,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1617 states. [2018-10-12 20:46:34,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 1632 transitions. [2018-10-12 20:46:34,447 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 1632 transitions. Word has length 1441 [2018-10-12 20:46:34,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:46:34,448 INFO L481 AbstractCegarLoop]: Abstraction has 1617 states and 1632 transitions. [2018-10-12 20:46:34,448 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-12 20:46:34,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 1632 transitions. [2018-10-12 20:46:34,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1573 [2018-10-12 20:46:34,470 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:46:34,471 INFO L375 BasicCegarLoop]: trace histogram [77, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:46:34,471 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:46:34,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:46:34,472 INFO L82 PathProgramCache]: Analyzing trace with hash -316696535, now seen corresponding path program 27 times [2018-10-12 20:46:34,473 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:46:34,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:46:37,123 INFO L134 CoverageAnalysis]: Checked inductivity of 46937 backedges. 36509 proven. 6237 refuted. 0 times theorem prover too weak. 4191 trivial. 0 not checked. [2018-10-12 20:46:37,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:46:37,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-12 20:46:37,125 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-12 20:46:37,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-12 20:46:37,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=1635, Unknown=0, NotChecked=0, Total=1892 [2018-10-12 20:46:37,125 INFO L87 Difference]: Start difference. First operand 1617 states and 1632 transitions. Second operand 44 states. [2018-10-12 20:46:40,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:46:40,430 INFO L93 Difference]: Finished difference Result 1737 states and 1750 transitions. [2018-10-12 20:46:40,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-12 20:46:40,431 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 1572 [2018-10-12 20:46:40,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:46:40,438 INFO L225 Difference]: With dead ends: 1737 [2018-10-12 20:46:40,438 INFO L226 Difference]: Without dead ends: 1737 [2018-10-12 20:46:40,439 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1953 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1631, Invalid=6925, Unknown=0, NotChecked=0, Total=8556 [2018-10-12 20:46:40,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1737 states. [2018-10-12 20:46:40,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1737 to 1677. [2018-10-12 20:46:40,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1677 states. [2018-10-12 20:46:40,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1677 states to 1677 states and 1693 transitions. [2018-10-12 20:46:40,451 INFO L78 Accepts]: Start accepts. Automaton has 1677 states and 1693 transitions. Word has length 1572 [2018-10-12 20:46:40,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:46:40,451 INFO L481 AbstractCegarLoop]: Abstraction has 1677 states and 1693 transitions. [2018-10-12 20:46:40,452 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-12 20:46:40,452 INFO L276 IsEmpty]: Start isEmpty. Operand 1677 states and 1693 transitions. [2018-10-12 20:46:40,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1618 [2018-10-12 20:46:40,470 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:46:40,470 INFO L375 BasicCegarLoop]: trace histogram [80, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:46:40,471 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:46:40,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:46:40,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1277651717, now seen corresponding path program 28 times [2018-10-12 20:46:40,473 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:46:40,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:46:43,370 INFO L134 CoverageAnalysis]: Checked inductivity of 50453 backedges. 0 proven. 47375 refuted. 0 times theorem prover too weak. 3078 trivial. 0 not checked. [2018-10-12 20:46:43,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:46:43,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-12 20:46:43,371 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-12 20:46:43,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-12 20:46:43,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=1181, Unknown=0, NotChecked=0, Total=1482 [2018-10-12 20:46:43,372 INFO L87 Difference]: Start difference. First operand 1677 states and 1693 transitions. Second operand 39 states. [2018-10-12 20:46:48,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:46:48,842 INFO L93 Difference]: Finished difference Result 1843 states and 1860 transitions. [2018-10-12 20:46:48,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2018-10-12 20:46:48,842 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 1617 [2018-10-12 20:46:48,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:46:48,850 INFO L225 Difference]: With dead ends: 1843 [2018-10-12 20:46:48,850 INFO L226 Difference]: Without dead ends: 1843 [2018-10-12 20:46:48,852 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14667 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7387, Invalid=30055, Unknown=0, NotChecked=0, Total=37442 [2018-10-12 20:46:48,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1843 states. [2018-10-12 20:46:48,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 1823. [2018-10-12 20:46:48,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1823 states. [2018-10-12 20:46:48,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1823 states to 1823 states and 1840 transitions. [2018-10-12 20:46:48,865 INFO L78 Accepts]: Start accepts. Automaton has 1823 states and 1840 transitions. Word has length 1617 [2018-10-12 20:46:48,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:46:48,866 INFO L481 AbstractCegarLoop]: Abstraction has 1823 states and 1840 transitions. [2018-10-12 20:46:48,866 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-12 20:46:48,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1823 states and 1840 transitions. [2018-10-12 20:46:48,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1764 [2018-10-12 20:46:48,882 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:46:48,883 INFO L375 BasicCegarLoop]: trace histogram [88, 87, 87, 87, 87, 87, 87, 87, 87, 87, 87, 87, 87, 87, 87, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:46:48,883 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:46:48,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:46:48,884 INFO L82 PathProgramCache]: Analyzing trace with hash -936359090, now seen corresponding path program 29 times [2018-10-12 20:46:48,884 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:46:49,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:46:51,168 INFO L134 CoverageAnalysis]: Checked inductivity of 60977 backedges. 18214 proven. 877 refuted. 0 times theorem prover too weak. 41886 trivial. 0 not checked. [2018-10-12 20:46:51,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:46:51,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-12 20:46:51,170 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-12 20:46:51,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-12 20:46:51,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2018-10-12 20:46:51,171 INFO L87 Difference]: Start difference. First operand 1823 states and 1840 transitions. Second operand 24 states. [2018-10-12 20:46:52,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:46:52,410 INFO L93 Difference]: Finished difference Result 1838 states and 1855 transitions. [2018-10-12 20:46:52,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-12 20:46:52,410 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1763 [2018-10-12 20:46:52,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:46:52,416 INFO L225 Difference]: With dead ends: 1838 [2018-10-12 20:46:52,416 INFO L226 Difference]: Without dead ends: 1838 [2018-10-12 20:46:52,417 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=560, Invalid=2302, Unknown=0, NotChecked=0, Total=2862 [2018-10-12 20:46:52,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2018-10-12 20:46:52,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1838. [2018-10-12 20:46:52,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2018-10-12 20:46:52,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 1855 transitions. [2018-10-12 20:46:52,429 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 1855 transitions. Word has length 1763 [2018-10-12 20:46:52,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:46:52,430 INFO L481 AbstractCegarLoop]: Abstraction has 1838 states and 1855 transitions. [2018-10-12 20:46:52,430 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-12 20:46:52,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 1855 transitions. [2018-10-12 20:46:52,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1779 [2018-10-12 20:46:52,449 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:46:52,450 INFO L375 BasicCegarLoop]: trace histogram [89, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:46:52,450 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:46:52,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:46:52,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1554094956, now seen corresponding path program 30 times [2018-10-12 20:46:52,452 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:46:52,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:46:55,623 INFO L134 CoverageAnalysis]: Checked inductivity of 62300 backedges. 75 proven. 58687 refuted. 0 times theorem prover too weak. 3538 trivial. 0 not checked. [2018-10-12 20:46:55,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:46:55,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-12 20:46:55,624 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-12 20:46:55,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-12 20:46:55,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=348, Invalid=1458, Unknown=0, NotChecked=0, Total=1806 [2018-10-12 20:46:55,625 INFO L87 Difference]: Start difference. First operand 1838 states and 1855 transitions. Second operand 43 states. [2018-10-12 20:47:02,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:47:02,973 INFO L93 Difference]: Finished difference Result 2004 states and 2022 transitions. [2018-10-12 20:47:02,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 209 states. [2018-10-12 20:47:02,973 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 1778 [2018-10-12 20:47:02,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:47:02,981 INFO L225 Difference]: With dead ends: 2004 [2018-10-12 20:47:02,981 INFO L226 Difference]: Without dead ends: 2004 [2018-10-12 20:47:02,985 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26337 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=12454, Invalid=48802, Unknown=0, NotChecked=0, Total=61256 [2018-10-12 20:47:02,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2004 states. [2018-10-12 20:47:02,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2004 to 1984. [2018-10-12 20:47:02,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1984 states. [2018-10-12 20:47:02,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1984 states to 1984 states and 2002 transitions. [2018-10-12 20:47:02,997 INFO L78 Accepts]: Start accepts. Automaton has 1984 states and 2002 transitions. Word has length 1778 [2018-10-12 20:47:02,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:47:02,998 INFO L481 AbstractCegarLoop]: Abstraction has 1984 states and 2002 transitions. [2018-10-12 20:47:02,998 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-12 20:47:02,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1984 states and 2002 transitions. [2018-10-12 20:47:03,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1925 [2018-10-12 20:47:03,015 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:47:03,016 INFO L375 BasicCegarLoop]: trace histogram [97, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:47:03,016 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:47:03,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:47:03,017 INFO L82 PathProgramCache]: Analyzing trace with hash 453392039, now seen corresponding path program 31 times [2018-10-12 20:47:03,017 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:47:03,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:47:05,671 INFO L134 CoverageAnalysis]: Checked inductivity of 73947 backedges. 32990 proven. 2322 refuted. 0 times theorem prover too weak. 38635 trivial. 0 not checked. [2018-10-12 20:47:05,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:47:05,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-12 20:47:05,673 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-12 20:47:05,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-12 20:47:05,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=857, Unknown=0, NotChecked=0, Total=992 [2018-10-12 20:47:05,673 INFO L87 Difference]: Start difference. First operand 1984 states and 2002 transitions. Second operand 32 states. [2018-10-12 20:47:07,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:47:07,802 INFO L93 Difference]: Finished difference Result 2033 states and 2049 transitions. [2018-10-12 20:47:07,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-12 20:47:07,802 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 1924 [2018-10-12 20:47:07,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:47:07,810 INFO L225 Difference]: With dead ends: 2033 [2018-10-12 20:47:07,810 INFO L226 Difference]: Without dead ends: 2033 [2018-10-12 20:47:07,811 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1133 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1044, Invalid=4358, Unknown=0, NotChecked=0, Total=5402 [2018-10-12 20:47:07,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2033 states. [2018-10-12 20:47:07,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2033 to 2029. [2018-10-12 20:47:07,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2029 states. [2018-10-12 20:47:07,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2029 states to 2029 states and 2047 transitions. [2018-10-12 20:47:07,824 INFO L78 Accepts]: Start accepts. Automaton has 2029 states and 2047 transitions. Word has length 1924 [2018-10-12 20:47:07,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:47:07,825 INFO L481 AbstractCegarLoop]: Abstraction has 2029 states and 2047 transitions. [2018-10-12 20:47:07,825 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-12 20:47:07,825 INFO L276 IsEmpty]: Start isEmpty. Operand 2029 states and 2047 transitions. [2018-10-12 20:47:07,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1970 [2018-10-12 20:47:07,844 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:47:07,845 INFO L375 BasicCegarLoop]: trace histogram [100, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:47:07,845 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:47:07,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:47:07,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1345881893, now seen corresponding path program 32 times [2018-10-12 20:47:07,846 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:47:08,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:47:10,868 INFO L134 CoverageAnalysis]: Checked inductivity of 78369 backedges. 41282 proven. 3509 refuted. 0 times theorem prover too weak. 33578 trivial. 0 not checked. [2018-10-12 20:47:10,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:47:10,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-12 20:47:10,870 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-12 20:47:10,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-12 20:47:10,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1091, Unknown=0, NotChecked=0, Total=1260 [2018-10-12 20:47:10,870 INFO L87 Difference]: Start difference. First operand 2029 states and 2047 transitions. Second operand 36 states. [2018-10-12 20:47:13,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:47:13,519 INFO L93 Difference]: Finished difference Result 2095 states and 2110 transitions. [2018-10-12 20:47:13,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-12 20:47:13,519 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 1969 [2018-10-12 20:47:13,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:47:13,528 INFO L225 Difference]: With dead ends: 2095 [2018-10-12 20:47:13,528 INFO L226 Difference]: Without dead ends: 2095 [2018-10-12 20:47:13,529 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1499 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1343, Invalid=5629, Unknown=0, NotChecked=0, Total=6972 [2018-10-12 20:47:13,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2095 states. [2018-10-12 20:47:13,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2095 to 2089. [2018-10-12 20:47:13,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2089 states. [2018-10-12 20:47:13,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2089 states to 2089 states and 2107 transitions. [2018-10-12 20:47:13,546 INFO L78 Accepts]: Start accepts. Automaton has 2089 states and 2107 transitions. Word has length 1969 [2018-10-12 20:47:13,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:47:13,546 INFO L481 AbstractCegarLoop]: Abstraction has 2089 states and 2107 transitions. [2018-10-12 20:47:13,546 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-12 20:47:13,546 INFO L276 IsEmpty]: Start isEmpty. Operand 2089 states and 2107 transitions. [2018-10-12 20:47:13,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2030 [2018-10-12 20:47:13,567 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:47:13,568 INFO L375 BasicCegarLoop]: trace histogram [104, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:47:13,568 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:47:13,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:47:13,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1252517017, now seen corresponding path program 33 times [2018-10-12 20:47:13,569 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:47:13,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:47:18,242 INFO L134 CoverageAnalysis]: Checked inductivity of 84475 backedges. 0 proven. 79783 refuted. 0 times theorem prover too weak. 4692 trivial. 0 not checked. [2018-10-12 20:47:18,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:47:18,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-12 20:47:18,244 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-12 20:47:18,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-12 20:47:18,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=373, Invalid=1433, Unknown=0, NotChecked=0, Total=1806 [2018-10-12 20:47:18,244 INFO L87 Difference]: Start difference. First operand 2089 states and 2107 transitions. Second operand 43 states. [2018-10-12 20:47:25,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:47:25,060 INFO L93 Difference]: Finished difference Result 2255 states and 2274 transitions. [2018-10-12 20:47:25,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2018-10-12 20:47:25,060 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 2029 [2018-10-12 20:47:25,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:47:25,068 INFO L225 Difference]: With dead ends: 2255 [2018-10-12 20:47:25,068 INFO L226 Difference]: Without dead ends: 2255 [2018-10-12 20:47:25,073 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18746 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=9285, Invalid=38021, Unknown=0, NotChecked=0, Total=47306 [2018-10-12 20:47:25,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2255 states. [2018-10-12 20:47:25,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2255 to 2235. [2018-10-12 20:47:25,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2235 states. [2018-10-12 20:47:25,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2235 states to 2235 states and 2254 transitions. [2018-10-12 20:47:25,090 INFO L78 Accepts]: Start accepts. Automaton has 2235 states and 2254 transitions. Word has length 2029 [2018-10-12 20:47:25,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:47:25,092 INFO L481 AbstractCegarLoop]: Abstraction has 2235 states and 2254 transitions. [2018-10-12 20:47:25,092 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-12 20:47:25,092 INFO L276 IsEmpty]: Start isEmpty. Operand 2235 states and 2254 transitions. [2018-10-12 20:47:25,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2176 [2018-10-12 20:47:25,116 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:47:25,117 INFO L375 BasicCegarLoop]: trace histogram [112, 111, 111, 111, 111, 111, 111, 111, 111, 111, 111, 111, 111, 111, 111, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:47:25,117 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:47:25,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:47:25,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1482215098, now seen corresponding path program 34 times [2018-10-12 20:47:25,118 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:47:25,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:47:30,027 INFO L134 CoverageAnalysis]: Checked inductivity of 97971 backedges. 0 proven. 92851 refuted. 0 times theorem prover too weak. 5120 trivial. 0 not checked. [2018-10-12 20:47:30,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:47:30,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-12 20:47:30,028 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-12 20:47:30,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-12 20:47:30,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=412, Invalid=1568, Unknown=0, NotChecked=0, Total=1980 [2018-10-12 20:47:30,029 INFO L87 Difference]: Start difference. First operand 2235 states and 2254 transitions. Second operand 45 states. [2018-10-12 20:47:37,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:47:37,452 INFO L93 Difference]: Finished difference Result 2401 states and 2421 transitions. [2018-10-12 20:47:37,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2018-10-12 20:47:37,453 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 2175 [2018-10-12 20:47:37,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:47:37,459 INFO L225 Difference]: With dead ends: 2401 [2018-10-12 20:47:37,459 INFO L226 Difference]: Without dead ends: 2401 [2018-10-12 20:47:37,465 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20973 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=10315, Invalid=42355, Unknown=0, NotChecked=0, Total=52670 [2018-10-12 20:47:37,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2401 states. [2018-10-12 20:47:37,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2401 to 2381. [2018-10-12 20:47:37,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2381 states. [2018-10-12 20:47:37,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2381 states to 2381 states and 2401 transitions. [2018-10-12 20:47:37,481 INFO L78 Accepts]: Start accepts. Automaton has 2381 states and 2401 transitions. Word has length 2175 [2018-10-12 20:47:37,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:47:37,482 INFO L481 AbstractCegarLoop]: Abstraction has 2381 states and 2401 transitions. [2018-10-12 20:47:37,482 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-12 20:47:37,482 INFO L276 IsEmpty]: Start isEmpty. Operand 2381 states and 2401 transitions. [2018-10-12 20:47:37,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2322 [2018-10-12 20:47:37,512 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:47:37,513 INFO L375 BasicCegarLoop]: trace histogram [120, 119, 119, 119, 119, 119, 119, 119, 119, 119, 119, 119, 119, 119, 119, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:47:37,513 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:47:37,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:47:37,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1269546163, now seen corresponding path program 35 times [2018-10-12 20:47:37,514 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:47:37,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:47:42,130 INFO L134 CoverageAnalysis]: Checked inductivity of 112469 backedges. 0 proven. 106921 refuted. 0 times theorem prover too weak. 5548 trivial. 0 not checked. [2018-10-12 20:47:42,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:47:42,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-12 20:47:42,131 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-12 20:47:42,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-12 20:47:42,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=453, Invalid=1709, Unknown=0, NotChecked=0, Total=2162 [2018-10-12 20:47:42,132 INFO L87 Difference]: Start difference. First operand 2381 states and 2401 transitions. Second operand 47 states. [2018-10-12 20:47:50,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:47:50,194 INFO L93 Difference]: Finished difference Result 2547 states and 2568 transitions. [2018-10-12 20:47:50,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2018-10-12 20:47:50,195 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 2321 [2018-10-12 20:47:50,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:47:50,201 INFO L225 Difference]: With dead ends: 2547 [2018-10-12 20:47:50,201 INFO L226 Difference]: Without dead ends: 2547 [2018-10-12 20:47:50,206 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23325 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=11399, Invalid=46923, Unknown=0, NotChecked=0, Total=58322 [2018-10-12 20:47:50,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2547 states. [2018-10-12 20:47:50,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2547 to 2527. [2018-10-12 20:47:50,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2527 states. [2018-10-12 20:47:50,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2527 states to 2527 states and 2548 transitions. [2018-10-12 20:47:50,221 INFO L78 Accepts]: Start accepts. Automaton has 2527 states and 2548 transitions. Word has length 2321 [2018-10-12 20:47:50,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:47:50,222 INFO L481 AbstractCegarLoop]: Abstraction has 2527 states and 2548 transitions. [2018-10-12 20:47:50,222 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-12 20:47:50,222 INFO L276 IsEmpty]: Start isEmpty. Operand 2527 states and 2548 transitions. [2018-10-12 20:47:50,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2468 [2018-10-12 20:47:50,255 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:47:50,256 INFO L375 BasicCegarLoop]: trace histogram [128, 127, 127, 127, 127, 127, 127, 127, 127, 127, 127, 127, 127, 127, 127, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:47:50,257 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:47:50,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:47:50,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1933530848, now seen corresponding path program 36 times [2018-10-12 20:47:50,258 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:47:50,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:47:55,770 INFO L134 CoverageAnalysis]: Checked inductivity of 127969 backedges. 0 proven. 121993 refuted. 0 times theorem prover too weak. 5976 trivial. 0 not checked. [2018-10-12 20:47:55,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:47:55,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-12 20:47:55,771 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-12 20:47:55,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-12 20:47:55,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=1856, Unknown=0, NotChecked=0, Total=2352 [2018-10-12 20:47:55,772 INFO L87 Difference]: Start difference. First operand 2527 states and 2548 transitions. Second operand 49 states. [2018-10-12 20:48:04,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:48:04,630 INFO L93 Difference]: Finished difference Result 2693 states and 2715 transitions. [2018-10-12 20:48:04,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 210 states. [2018-10-12 20:48:04,631 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 2467 [2018-10-12 20:48:04,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:48:04,638 INFO L225 Difference]: With dead ends: 2693 [2018-10-12 20:48:04,638 INFO L226 Difference]: Without dead ends: 2693 [2018-10-12 20:48:04,644 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25802 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=12537, Invalid=51725, Unknown=0, NotChecked=0, Total=64262 [2018-10-12 20:48:04,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2693 states. [2018-10-12 20:48:04,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2693 to 2673. [2018-10-12 20:48:04,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2673 states. [2018-10-12 20:48:04,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2673 states to 2673 states and 2695 transitions. [2018-10-12 20:48:04,664 INFO L78 Accepts]: Start accepts. Automaton has 2673 states and 2695 transitions. Word has length 2467 [2018-10-12 20:48:04,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:48:04,665 INFO L481 AbstractCegarLoop]: Abstraction has 2673 states and 2695 transitions. [2018-10-12 20:48:04,666 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-12 20:48:04,666 INFO L276 IsEmpty]: Start isEmpty. Operand 2673 states and 2695 transitions. [2018-10-12 20:48:04,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2614 [2018-10-12 20:48:04,709 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:48:04,711 INFO L375 BasicCegarLoop]: trace histogram [136, 135, 135, 135, 135, 135, 135, 135, 135, 135, 135, 135, 135, 135, 135, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:48:04,711 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:48:04,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:48:04,712 INFO L82 PathProgramCache]: Analyzing trace with hash 317206579, now seen corresponding path program 37 times [2018-10-12 20:48:04,712 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:48:04,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:48:10,396 INFO L134 CoverageAnalysis]: Checked inductivity of 144471 backedges. 0 proven. 138067 refuted. 0 times theorem prover too weak. 6404 trivial. 0 not checked. [2018-10-12 20:48:10,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:48:10,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-12 20:48:10,398 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-12 20:48:10,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-12 20:48:10,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=541, Invalid=2009, Unknown=0, NotChecked=0, Total=2550 [2018-10-12 20:48:10,398 INFO L87 Difference]: Start difference. First operand 2673 states and 2695 transitions. Second operand 51 states. [2018-10-12 20:48:20,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:48:20,063 INFO L93 Difference]: Finished difference Result 2839 states and 2862 transitions. [2018-10-12 20:48:20,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 220 states. [2018-10-12 20:48:20,063 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 2613 [2018-10-12 20:48:20,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:48:20,069 INFO L225 Difference]: With dead ends: 2839 [2018-10-12 20:48:20,070 INFO L226 Difference]: Without dead ends: 2839 [2018-10-12 20:48:20,076 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28404 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=13729, Invalid=56761, Unknown=0, NotChecked=0, Total=70490 [2018-10-12 20:48:20,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2839 states. [2018-10-12 20:48:20,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2839 to 2819. [2018-10-12 20:48:20,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2819 states. [2018-10-12 20:48:20,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2819 states to 2819 states and 2842 transitions. [2018-10-12 20:48:20,096 INFO L78 Accepts]: Start accepts. Automaton has 2819 states and 2842 transitions. Word has length 2613 [2018-10-12 20:48:20,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:48:20,098 INFO L481 AbstractCegarLoop]: Abstraction has 2819 states and 2842 transitions. [2018-10-12 20:48:20,098 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-12 20:48:20,098 INFO L276 IsEmpty]: Start isEmpty. Operand 2819 states and 2842 transitions. [2018-10-12 20:48:20,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2760 [2018-10-12 20:48:20,146 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:48:20,147 INFO L375 BasicCegarLoop]: trace histogram [144, 143, 143, 143, 143, 143, 143, 143, 143, 143, 143, 143, 143, 143, 143, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:48:20,148 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:48:20,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:48:20,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1491667078, now seen corresponding path program 38 times [2018-10-12 20:48:20,149 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:48:20,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:48:26,634 INFO L134 CoverageAnalysis]: Checked inductivity of 161975 backedges. 0 proven. 155143 refuted. 0 times theorem prover too weak. 6832 trivial. 0 not checked. [2018-10-12 20:48:26,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:48:26,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-12 20:48:26,636 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-12 20:48:26,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-12 20:48:26,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=588, Invalid=2168, Unknown=0, NotChecked=0, Total=2756 [2018-10-12 20:48:26,636 INFO L87 Difference]: Start difference. First operand 2819 states and 2842 transitions. Second operand 53 states. [2018-10-12 20:48:36,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:48:36,893 INFO L93 Difference]: Finished difference Result 2985 states and 3009 transitions. [2018-10-12 20:48:36,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 230 states. [2018-10-12 20:48:36,894 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 2759 [2018-10-12 20:48:36,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:48:36,899 INFO L225 Difference]: With dead ends: 2985 [2018-10-12 20:48:36,899 INFO L226 Difference]: Without dead ends: 2985 [2018-10-12 20:48:36,907 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 276 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31131 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=14975, Invalid=62031, Unknown=0, NotChecked=0, Total=77006 [2018-10-12 20:48:36,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2985 states. [2018-10-12 20:48:36,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2985 to 2965. [2018-10-12 20:48:36,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2965 states. [2018-10-12 20:48:36,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2965 states to 2965 states and 2989 transitions. [2018-10-12 20:48:36,929 INFO L78 Accepts]: Start accepts. Automaton has 2965 states and 2989 transitions. Word has length 2759 [2018-10-12 20:48:36,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:48:36,931 INFO L481 AbstractCegarLoop]: Abstraction has 2965 states and 2989 transitions. [2018-10-12 20:48:36,931 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-12 20:48:36,931 INFO L276 IsEmpty]: Start isEmpty. Operand 2965 states and 2989 transitions. [2018-10-12 20:48:36,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2906 [2018-10-12 20:48:36,986 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:48:36,987 INFO L375 BasicCegarLoop]: trace histogram [152, 151, 151, 151, 151, 151, 151, 151, 151, 151, 151, 151, 151, 151, 151, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:48:36,987 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:48:36,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:48:36,988 INFO L82 PathProgramCache]: Analyzing trace with hash 78995993, now seen corresponding path program 39 times [2018-10-12 20:48:36,988 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:48:37,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:48:40,859 INFO L134 CoverageAnalysis]: Checked inductivity of 180481 backedges. 9229 proven. 98 refuted. 0 times theorem prover too weak. 171154 trivial. 0 not checked. [2018-10-12 20:48:40,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:48:40,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-12 20:48:40,861 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-12 20:48:40,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-12 20:48:40,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-10-12 20:48:40,861 INFO L87 Difference]: Start difference. First operand 2965 states and 2989 transitions. Second operand 11 states. [2018-10-12 20:48:41,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:48:41,269 INFO L93 Difference]: Finished difference Result 3122 states and 3148 transitions. [2018-10-12 20:48:41,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-12 20:48:41,269 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 2905 [2018-10-12 20:48:41,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:48:41,272 INFO L225 Difference]: With dead ends: 3122 [2018-10-12 20:48:41,272 INFO L226 Difference]: Without dead ends: 3122 [2018-10-12 20:48:41,272 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-10-12 20:48:41,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3122 states. [2018-10-12 20:48:41,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3122 to 2965. [2018-10-12 20:48:41,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2965 states. [2018-10-12 20:48:41,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2965 states to 2965 states and 2988 transitions. [2018-10-12 20:48:41,293 INFO L78 Accepts]: Start accepts. Automaton has 2965 states and 2988 transitions. Word has length 2905 [2018-10-12 20:48:41,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:48:41,294 INFO L481 AbstractCegarLoop]: Abstraction has 2965 states and 2988 transitions. [2018-10-12 20:48:41,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-12 20:48:41,294 INFO L276 IsEmpty]: Start isEmpty. Operand 2965 states and 2988 transitions. [2018-10-12 20:48:41,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2921 [2018-10-12 20:48:41,359 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:48:41,360 INFO L375 BasicCegarLoop]: trace histogram [153, 152, 152, 152, 152, 152, 152, 152, 152, 152, 152, 152, 152, 152, 152, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:48:41,360 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:48:41,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:48:41,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1686595009, now seen corresponding path program 40 times [2018-10-12 20:48:41,362 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:48:41,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:48:48,616 INFO L134 CoverageAnalysis]: Checked inductivity of 182771 backedges. 57 proven. 175404 refuted. 0 times theorem prover too weak. 7310 trivial. 0 not checked. [2018-10-12 20:48:48,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:48:48,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-12 20:48:48,617 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-12 20:48:48,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-12 20:48:48,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=640, Invalid=2330, Unknown=0, NotChecked=0, Total=2970 [2018-10-12 20:48:48,618 INFO L87 Difference]: Start difference. First operand 2965 states and 2988 transitions. Second operand 55 states. [2018-10-12 20:48:58,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:48:58,817 INFO L93 Difference]: Finished difference Result 3131 states and 3155 transitions. [2018-10-12 20:48:58,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 236 states. [2018-10-12 20:48:58,818 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 2920 [2018-10-12 20:48:58,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:48:58,822 INFO L225 Difference]: With dead ends: 3131 [2018-10-12 20:48:58,822 INFO L226 Difference]: Without dead ends: 3131 [2018-10-12 20:48:58,829 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33913 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=17438, Invalid=64644, Unknown=0, NotChecked=0, Total=82082 [2018-10-12 20:48:58,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3131 states. [2018-10-12 20:48:58,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3131 to 3111. [2018-10-12 20:48:58,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3111 states. [2018-10-12 20:48:58,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3111 states to 3111 states and 3135 transitions. [2018-10-12 20:48:58,851 INFO L78 Accepts]: Start accepts. Automaton has 3111 states and 3135 transitions. Word has length 2920 [2018-10-12 20:48:58,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:48:58,852 INFO L481 AbstractCegarLoop]: Abstraction has 3111 states and 3135 transitions. [2018-10-12 20:48:58,852 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-12 20:48:58,853 INFO L276 IsEmpty]: Start isEmpty. Operand 3111 states and 3135 transitions. [2018-10-12 20:48:58,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3067 [2018-10-12 20:48:58,901 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:48:58,902 INFO L375 BasicCegarLoop]: trace histogram [161, 160, 160, 160, 160, 160, 160, 160, 160, 160, 160, 160, 160, 160, 160, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:48:58,903 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:48:58,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:48:58,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1287704820, now seen corresponding path program 41 times [2018-10-12 20:48:58,904 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:48:59,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:49:06,701 INFO L134 CoverageAnalysis]: Checked inductivity of 202400 backedges. 0 proven. 194666 refuted. 0 times theorem prover too weak. 7734 trivial. 0 not checked. [2018-10-12 20:49:06,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:49:06,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-12 20:49:06,703 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-12 20:49:06,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-12 20:49:06,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=688, Invalid=2504, Unknown=0, NotChecked=0, Total=3192 [2018-10-12 20:49:06,704 INFO L87 Difference]: Start difference. First operand 3111 states and 3135 transitions. Second operand 57 states. [2018-10-12 20:49:18,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:49:18,764 INFO L93 Difference]: Finished difference Result 3277 states and 3302 transitions. [2018-10-12 20:49:18,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 250 states. [2018-10-12 20:49:18,765 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 3066 [2018-10-12 20:49:18,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:49:18,769 INFO L225 Difference]: With dead ends: 3277 [2018-10-12 20:49:18,769 INFO L226 Difference]: Without dead ends: 3277 [2018-10-12 20:49:18,772 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 300 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36960 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=17629, Invalid=73273, Unknown=0, NotChecked=0, Total=90902 [2018-10-12 20:49:18,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3277 states. [2018-10-12 20:49:18,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3277 to 3257. [2018-10-12 20:49:18,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3257 states. [2018-10-12 20:49:18,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3257 states to 3257 states and 3282 transitions. [2018-10-12 20:49:18,788 INFO L78 Accepts]: Start accepts. Automaton has 3257 states and 3282 transitions. Word has length 3066 [2018-10-12 20:49:18,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:49:18,789 INFO L481 AbstractCegarLoop]: Abstraction has 3257 states and 3282 transitions. [2018-10-12 20:49:18,789 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-12 20:49:18,789 INFO L276 IsEmpty]: Start isEmpty. Operand 3257 states and 3282 transitions. [2018-10-12 20:49:18,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3213 [2018-10-12 20:49:18,836 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:49:18,837 INFO L375 BasicCegarLoop]: trace histogram [169, 168, 168, 168, 168, 168, 168, 168, 168, 168, 168, 168, 168, 168, 168, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 25, 25, 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, 1, 1] [2018-10-12 20:49:18,838 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:49:18,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:49:18,839 INFO L82 PathProgramCache]: Analyzing trace with hash 250821273, now seen corresponding path program 42 times [2018-10-12 20:49:18,839 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:49:19,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:49:27,760 INFO L134 CoverageAnalysis]: Checked inductivity of 223031 backedges. 0 proven. 214869 refuted. 0 times theorem prover too weak. 8162 trivial. 0 not checked. [2018-10-12 20:49:27,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:49:27,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-12 20:49:27,762 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-12 20:49:27,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-12 20:49:27,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=2681, Unknown=0, NotChecked=0, Total=3422 [2018-10-12 20:49:27,762 INFO L87 Difference]: Start difference. First operand 3257 states and 3282 transitions. Second operand 59 states. [2018-10-12 20:49:35,415 WARN L178 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-12 20:49:40,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:49:40,600 INFO L93 Difference]: Finished difference Result 3423 states and 3449 transitions. [2018-10-12 20:49:40,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 260 states. [2018-10-12 20:49:40,601 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 3212 [2018-10-12 20:49:40,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:49:40,604 INFO L225 Difference]: With dead ends: 3423 [2018-10-12 20:49:40,604 INFO L226 Difference]: Without dead ends: 3423 [2018-10-12 20:49:40,608 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 312 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40062 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=19037, Invalid=79245, Unknown=0, NotChecked=0, Total=98282 [2018-10-12 20:49:40,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3423 states. [2018-10-12 20:49:40,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3423 to 3403. [2018-10-12 20:49:40,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3403 states. [2018-10-12 20:49:40,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3403 states to 3403 states and 3429 transitions. [2018-10-12 20:49:40,624 INFO L78 Accepts]: Start accepts. Automaton has 3403 states and 3429 transitions. Word has length 3212 [2018-10-12 20:49:40,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:49:40,625 INFO L481 AbstractCegarLoop]: Abstraction has 3403 states and 3429 transitions. [2018-10-12 20:49:40,625 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-12 20:49:40,625 INFO L276 IsEmpty]: Start isEmpty. Operand 3403 states and 3429 transitions. [2018-10-12 20:49:40,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3359 [2018-10-12 20:49:40,683 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:49:40,684 INFO L375 BasicCegarLoop]: trace histogram [177, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 26, 26, 26, 26, 26, 26, 26, 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, 1, 1] [2018-10-12 20:49:40,685 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:49:40,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:49:40,685 INFO L82 PathProgramCache]: Analyzing trace with hash -352285466, now seen corresponding path program 43 times [2018-10-12 20:49:40,686 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:49:40,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:49:49,916 INFO L134 CoverageAnalysis]: Checked inductivity of 244664 backedges. 0 proven. 236074 refuted. 0 times theorem prover too weak. 8590 trivial. 0 not checked. [2018-10-12 20:49:49,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:49:49,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-12 20:49:49,918 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-12 20:49:49,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-12 20:49:49,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=796, Invalid=2864, Unknown=0, NotChecked=0, Total=3660 [2018-10-12 20:49:49,919 INFO L87 Difference]: Start difference. First operand 3403 states and 3429 transitions. Second operand 61 states. [2018-10-12 20:50:03,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:50:03,522 INFO L93 Difference]: Finished difference Result 3569 states and 3596 transitions. [2018-10-12 20:50:03,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 270 states. [2018-10-12 20:50:03,522 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 3358 [2018-10-12 20:50:03,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:50:03,526 INFO L225 Difference]: With dead ends: 3569 [2018-10-12 20:50:03,526 INFO L226 Difference]: Without dead ends: 3569 [2018-10-12 20:50:03,534 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 324 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43289 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=20499, Invalid=85451, Unknown=0, NotChecked=0, Total=105950 [2018-10-12 20:50:03,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3569 states. [2018-10-12 20:50:03,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3569 to 3549. [2018-10-12 20:50:03,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3549 states. [2018-10-12 20:50:03,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3549 states to 3549 states and 3576 transitions. [2018-10-12 20:50:03,553 INFO L78 Accepts]: Start accepts. Automaton has 3549 states and 3576 transitions. Word has length 3358 [2018-10-12 20:50:03,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:50:03,554 INFO L481 AbstractCegarLoop]: Abstraction has 3549 states and 3576 transitions. [2018-10-12 20:50:03,555 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-12 20:50:03,555 INFO L276 IsEmpty]: Start isEmpty. Operand 3549 states and 3576 transitions. [2018-10-12 20:50:03,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3505 [2018-10-12 20:50:03,609 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:50:03,610 INFO L375 BasicCegarLoop]: trace histogram [185, 184, 184, 184, 184, 184, 184, 184, 184, 184, 184, 184, 184, 184, 184, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 27, 27, 27, 27, 27, 27, 27, 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, 1, 1] [2018-10-12 20:50:03,610 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:50:03,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:50:03,611 INFO L82 PathProgramCache]: Analyzing trace with hash -2122385933, now seen corresponding path program 44 times [2018-10-12 20:50:03,612 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:50:03,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:50:13,730 INFO L134 CoverageAnalysis]: Checked inductivity of 267299 backedges. 0 proven. 258281 refuted. 0 times theorem prover too weak. 9018 trivial. 0 not checked. [2018-10-12 20:50:13,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:50:13,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-12 20:50:13,732 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-12 20:50:13,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-12 20:50:13,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=853, Invalid=3053, Unknown=0, NotChecked=0, Total=3906 [2018-10-12 20:50:13,733 INFO L87 Difference]: Start difference. First operand 3549 states and 3576 transitions. Second operand 63 states. [2018-10-12 20:50:27,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:50:27,997 INFO L93 Difference]: Finished difference Result 3715 states and 3743 transitions. [2018-10-12 20:50:27,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 280 states. [2018-10-12 20:50:27,998 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 3504 [2018-10-12 20:50:28,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:50:28,002 INFO L225 Difference]: With dead ends: 3715 [2018-10-12 20:50:28,003 INFO L226 Difference]: Without dead ends: 3715 [2018-10-12 20:50:28,008 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 336 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46641 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=22015, Invalid=91891, Unknown=0, NotChecked=0, Total=113906 [2018-10-12 20:50:28,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3715 states. [2018-10-12 20:50:28,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3715 to 3695. [2018-10-12 20:50:28,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3695 states. [2018-10-12 20:50:28,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3695 states to 3695 states and 3723 transitions. [2018-10-12 20:50:28,025 INFO L78 Accepts]: Start accepts. Automaton has 3695 states and 3723 transitions. Word has length 3504 [2018-10-12 20:50:28,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:50:28,026 INFO L481 AbstractCegarLoop]: Abstraction has 3695 states and 3723 transitions. [2018-10-12 20:50:28,026 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-12 20:50:28,026 INFO L276 IsEmpty]: Start isEmpty. Operand 3695 states and 3723 transitions. [2018-10-12 20:50:28,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3651 [2018-10-12 20:50:28,090 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:50:28,092 INFO L375 BasicCegarLoop]: trace histogram [193, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 28, 28, 28, 28, 28, 28, 28, 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, 1, 1] [2018-10-12 20:50:28,092 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:50:28,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:50:28,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1221442112, now seen corresponding path program 45 times [2018-10-12 20:50:28,094 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:50:28,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:50:39,742 INFO L134 CoverageAnalysis]: Checked inductivity of 290936 backedges. 0 proven. 281490 refuted. 0 times theorem prover too weak. 9446 trivial. 0 not checked. [2018-10-12 20:50:39,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:50:39,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-12 20:50:39,744 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-12 20:50:39,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-12 20:50:39,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=912, Invalid=3248, Unknown=0, NotChecked=0, Total=4160 [2018-10-12 20:50:39,745 INFO L87 Difference]: Start difference. First operand 3695 states and 3723 transitions. Second operand 65 states. [2018-10-12 20:50:54,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:50:54,510 INFO L93 Difference]: Finished difference Result 3861 states and 3890 transitions. [2018-10-12 20:50:54,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 290 states. [2018-10-12 20:50:54,511 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 3650 [2018-10-12 20:50:54,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:50:54,515 INFO L225 Difference]: With dead ends: 3861 [2018-10-12 20:50:54,515 INFO L226 Difference]: Without dead ends: 3861 [2018-10-12 20:50:54,520 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 348 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50118 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=23585, Invalid=98565, Unknown=0, NotChecked=0, Total=122150 [2018-10-12 20:50:54,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3861 states. [2018-10-12 20:50:54,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3861 to 3841. [2018-10-12 20:50:54,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3841 states. [2018-10-12 20:50:54,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3841 states to 3841 states and 3870 transitions. [2018-10-12 20:50:54,539 INFO L78 Accepts]: Start accepts. Automaton has 3841 states and 3870 transitions. Word has length 3650 [2018-10-12 20:50:54,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:50:54,541 INFO L481 AbstractCegarLoop]: Abstraction has 3841 states and 3870 transitions. [2018-10-12 20:50:54,541 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-12 20:50:54,541 INFO L276 IsEmpty]: Start isEmpty. Operand 3841 states and 3870 transitions. [2018-10-12 20:50:54,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3797 [2018-10-12 20:50:54,610 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:50:54,610 INFO L375 BasicCegarLoop]: trace histogram [201, 200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:50:54,611 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:50:54,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:50:54,611 INFO L82 PathProgramCache]: Analyzing trace with hash -2004202419, now seen corresponding path program 46 times [2018-10-12 20:50:54,612 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:50:55,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:51:06,243 INFO L134 CoverageAnalysis]: Checked inductivity of 315575 backedges. 0 proven. 305701 refuted. 0 times theorem prover too weak. 9874 trivial. 0 not checked. [2018-10-12 20:51:06,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:51:06,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-12 20:51:06,245 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-12 20:51:06,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-12 20:51:06,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=973, Invalid=3449, Unknown=0, NotChecked=0, Total=4422 [2018-10-12 20:51:06,245 INFO L87 Difference]: Start difference. First operand 3841 states and 3870 transitions. Second operand 67 states. [2018-10-12 20:51:22,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:51:22,126 INFO L93 Difference]: Finished difference Result 4007 states and 4037 transitions. [2018-10-12 20:51:22,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 300 states. [2018-10-12 20:51:22,126 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 3796 [2018-10-12 20:51:22,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:51:22,131 INFO L225 Difference]: With dead ends: 4007 [2018-10-12 20:51:22,131 INFO L226 Difference]: Without dead ends: 4007 [2018-10-12 20:51:22,136 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 360 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53720 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=25209, Invalid=105473, Unknown=0, NotChecked=0, Total=130682 [2018-10-12 20:51:22,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4007 states. [2018-10-12 20:51:22,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4007 to 3987. [2018-10-12 20:51:22,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3987 states. [2018-10-12 20:51:22,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3987 states to 3987 states and 4017 transitions. [2018-10-12 20:51:22,152 INFO L78 Accepts]: Start accepts. Automaton has 3987 states and 4017 transitions. Word has length 3796 [2018-10-12 20:51:22,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:51:22,154 INFO L481 AbstractCegarLoop]: Abstraction has 3987 states and 4017 transitions. [2018-10-12 20:51:22,154 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-12 20:51:22,154 INFO L276 IsEmpty]: Start isEmpty. Operand 3987 states and 4017 transitions. [2018-10-12 20:51:22,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3943 [2018-10-12 20:51:22,226 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:51:22,227 INFO L375 BasicCegarLoop]: trace histogram [209, 208, 208, 208, 208, 208, 208, 208, 208, 208, 208, 208, 208, 208, 208, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:51:22,227 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:51:22,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:51:22,228 INFO L82 PathProgramCache]: Analyzing trace with hash 916642202, now seen corresponding path program 47 times [2018-10-12 20:51:22,228 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:51:22,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:51:32,914 INFO L134 CoverageAnalysis]: Checked inductivity of 341216 backedges. 264501 proven. 15215 refuted. 0 times theorem prover too weak. 61500 trivial. 0 not checked. [2018-10-12 20:51:32,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:51:32,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-10-12 20:51:32,915 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-12 20:51:32,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-12 20:51:32,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=507, Invalid=3033, Unknown=0, NotChecked=0, Total=3540 [2018-10-12 20:51:32,916 INFO L87 Difference]: Start difference. First operand 3987 states and 4017 transitions. Second operand 60 states. [2018-10-12 20:51:37,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:51:37,188 INFO L93 Difference]: Finished difference Result 4331 states and 4359 transitions. [2018-10-12 20:51:37,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-12 20:51:37,189 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 3942 [2018-10-12 20:51:37,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:51:37,193 INFO L225 Difference]: With dead ends: 4331 [2018-10-12 20:51:37,193 INFO L226 Difference]: Without dead ends: 4331 [2018-10-12 20:51:37,195 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3678 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3102, Invalid=12648, Unknown=0, NotChecked=0, Total=15750 [2018-10-12 20:51:37,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4331 states. [2018-10-12 20:51:37,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4331 to 4167. [2018-10-12 20:51:37,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4167 states. [2018-10-12 20:51:37,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4167 states to 4167 states and 4198 transitions. [2018-10-12 20:51:37,216 INFO L78 Accepts]: Start accepts. Automaton has 4167 states and 4198 transitions. Word has length 3942 [2018-10-12 20:51:37,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:51:37,217 INFO L481 AbstractCegarLoop]: Abstraction has 4167 states and 4198 transitions. [2018-10-12 20:51:37,217 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-12 20:51:37,217 INFO L276 IsEmpty]: Start isEmpty. Operand 4167 states and 4198 transitions. [2018-10-12 20:51:37,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4108 [2018-10-12 20:51:37,334 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:51:37,335 INFO L375 BasicCegarLoop]: trace histogram [220, 219, 219, 219, 219, 219, 219, 219, 219, 219, 219, 219, 219, 219, 219, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:51:37,335 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:51:37,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:51:37,336 INFO L82 PathProgramCache]: Analyzing trace with hash 2122296186, now seen corresponding path program 48 times [2018-10-12 20:51:37,336 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:51:37,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:51:51,804 INFO L134 CoverageAnalysis]: Checked inductivity of 376713 backedges. 0 proven. 365080 refuted. 0 times theorem prover too weak. 11633 trivial. 0 not checked. [2018-10-12 20:51:51,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:51:51,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-12 20:51:51,806 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-12 20:51:51,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-12 20:51:51,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1036, Invalid=3656, Unknown=0, NotChecked=0, Total=4692 [2018-10-12 20:51:51,806 INFO L87 Difference]: Start difference. First operand 4167 states and 4198 transitions. Second operand 69 states. [2018-10-12 20:52:08,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:52:08,663 INFO L93 Difference]: Finished difference Result 4348 states and 4380 transitions. [2018-10-12 20:52:08,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 310 states. [2018-10-12 20:52:08,664 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 4107 [2018-10-12 20:52:08,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:52:08,668 INFO L225 Difference]: With dead ends: 4348 [2018-10-12 20:52:08,668 INFO L226 Difference]: Without dead ends: 4348 [2018-10-12 20:52:08,674 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 372 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57447 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=26887, Invalid=112615, Unknown=0, NotChecked=0, Total=139502 [2018-10-12 20:52:08,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4348 states. [2018-10-12 20:52:08,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4348 to 4328. [2018-10-12 20:52:08,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4328 states. [2018-10-12 20:52:08,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4328 states to 4328 states and 4360 transitions. [2018-10-12 20:52:08,694 INFO L78 Accepts]: Start accepts. Automaton has 4328 states and 4360 transitions. Word has length 4107 [2018-10-12 20:52:08,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:52:08,696 INFO L481 AbstractCegarLoop]: Abstraction has 4328 states and 4360 transitions. [2018-10-12 20:52:08,696 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-12 20:52:08,696 INFO L276 IsEmpty]: Start isEmpty. Operand 4328 states and 4360 transitions. [2018-10-12 20:52:08,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4269 [2018-10-12 20:52:08,780 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:52:08,781 INFO L375 BasicCegarLoop]: trace histogram [229, 228, 228, 228, 228, 228, 228, 228, 228, 228, 228, 228, 228, 228, 228, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:52:08,781 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:52:08,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:52:08,782 INFO L82 PathProgramCache]: Analyzing trace with hash -708811317, now seen corresponding path program 49 times [2018-10-12 20:52:08,782 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:52:09,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:52:20,599 INFO L134 CoverageAnalysis]: Checked inductivity of 408125 backedges. 302137 proven. 17080 refuted. 0 times theorem prover too weak. 88908 trivial. 0 not checked. [2018-10-12 20:52:20,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:52:20,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-10-12 20:52:20,600 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-12 20:52:20,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-12 20:52:20,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=3254, Unknown=0, NotChecked=0, Total=3782 [2018-10-12 20:52:20,601 INFO L87 Difference]: Start difference. First operand 4328 states and 4360 transitions. Second operand 62 states. [2018-10-12 20:52:25,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:52:25,239 INFO L93 Difference]: Finished difference Result 4702 states and 4731 transitions. [2018-10-12 20:52:25,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-10-12 20:52:25,239 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 4268 [2018-10-12 20:52:25,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:52:25,243 INFO L225 Difference]: With dead ends: 4702 [2018-10-12 20:52:25,243 INFO L226 Difference]: Without dead ends: 4702 [2018-10-12 20:52:25,245 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4022 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3306, Invalid=13724, Unknown=0, NotChecked=0, Total=17030 [2018-10-12 20:52:25,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4702 states. [2018-10-12 20:52:25,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4702 to 4523. [2018-10-12 20:52:25,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4523 states. [2018-10-12 20:52:25,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4523 states to 4523 states and 4556 transitions. [2018-10-12 20:52:25,265 INFO L78 Accepts]: Start accepts. Automaton has 4523 states and 4556 transitions. Word has length 4268 [2018-10-12 20:52:25,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:52:25,266 INFO L481 AbstractCegarLoop]: Abstraction has 4523 states and 4556 transitions. [2018-10-12 20:52:25,266 INFO L482 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-12 20:52:25,266 INFO L276 IsEmpty]: Start isEmpty. Operand 4523 states and 4556 transitions. [2018-10-12 20:52:25,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4449 [2018-10-12 20:52:25,353 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:52:25,354 INFO L375 BasicCegarLoop]: trace histogram [241, 240, 240, 240, 240, 240, 240, 240, 240, 240, 240, 240, 240, 240, 240, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:52:25,354 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:52:25,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:52:25,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1516728615, now seen corresponding path program 50 times [2018-10-12 20:52:25,355 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:52:25,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:52:42,709 INFO L134 CoverageAnalysis]: Checked inductivity of 450551 backedges. 57 proven. 436676 refuted. 0 times theorem prover too weak. 13818 trivial. 0 not checked. [2018-10-12 20:52:42,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:52:42,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-12 20:52:42,710 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-12 20:52:42,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-12 20:52:42,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1104, Invalid=3866, Unknown=0, NotChecked=0, Total=4970 [2018-10-12 20:52:42,711 INFO L87 Difference]: Start difference. First operand 4523 states and 4556 transitions. Second operand 71 states. [2018-10-12 20:52:59,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:52:59,150 INFO L93 Difference]: Finished difference Result 4537 states and 4566 transitions. [2018-10-12 20:52:59,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 315 states. [2018-10-12 20:52:59,150 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 4448 [2018-10-12 20:52:59,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:52:59,153 INFO L225 Difference]: With dead ends: 4537 [2018-10-12 20:52:59,153 INFO L226 Difference]: Without dead ends: 0 [2018-10-12 20:52:59,159 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 381 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61577 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=30810, Invalid=115496, Unknown=0, NotChecked=0, Total=146306 [2018-10-12 20:52:59,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-12 20:52:59,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-12 20:52:59,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-12 20:52:59,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-12 20:52:59,160 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4448 [2018-10-12 20:52:59,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:52:59,161 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-12 20:52:59,161 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-12 20:52:59,161 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-12 20:52:59,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-12 20:52:59,165 INFO L202 PluginConnector]: Adding new model ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 08:52:59 BoogieIcfgContainer [2018-10-12 20:52:59,166 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-12 20:52:59,166 INFO L168 Benchmark]: Toolchain (without parser) took 475272.23 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: -911.9 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-10-12 20:52:59,168 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-12 20:52:59,168 INFO L168 Benchmark]: Boogie Preprocessor took 72.05 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-12 20:52:59,168 INFO L168 Benchmark]: RCFGBuilder took 597.30 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-12 20:52:59,169 INFO L168 Benchmark]: TraceAbstraction took 474598.31 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -943.6 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-10-12 20:52:59,172 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 72.05 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 597.30 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 474598.31 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -943.6 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 144]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 73 locations, 1 error locations. SAFE Result, 474.5s OverallTime, 52 OverallIterations, 241 TraceHistogramMax, 266.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8146 SDtfs, 78669 SDslu, 135481 SDs, 0 SdLazy, 53674 SolverSat, 7230 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 41.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7580 GetRequests, 104 SyntacticMatches, 3 SemanticMatches, 7473 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 713369 ImplicationChecksByTransitivity, 253.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4523occurred in iteration=51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 52 MinimizatonAttempts, 1852 StatesRemovedByMinimization, 46 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 5.8s SatisfiabilityAnalysisTime, 60.2s InterpolantComputationTime, 83914 NumberOfCodeBlocks, 83914 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 83862 ConstructedInterpolants, 0 QuantifiedInterpolants, 619723540 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 52 InterpolantComputations, 1 PerfectInterpolantSequences, 1377444/4833541 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-10-12_20-52-59-182.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength5_true-valid-memsafety.c_11.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-12_20-52-59-182.csv Received shutdown request...