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/ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-502d2f4 [2018-10-12 20:44:36,912 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-12 20:44:36,914 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-12 20:44:36,927 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-12 20:44:36,928 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-12 20:44:36,929 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-12 20:44:36,930 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-12 20:44:36,932 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-12 20:44:36,935 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-12 20:44:36,936 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-12 20:44:36,938 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-12 20:44:36,938 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-12 20:44:36,939 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-12 20:44:36,940 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-12 20:44:36,941 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-12 20:44:36,942 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-12 20:44:36,943 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-12 20:44:36,945 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-12 20:44:36,947 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-12 20:44:36,949 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-12 20:44:36,950 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-12 20:44:36,951 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-12 20:44:36,953 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-12 20:44:36,954 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-12 20:44:36,954 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-12 20:44:36,955 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-12 20:44:36,956 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-12 20:44:36,957 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-12 20:44:36,958 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-12 20:44:36,959 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-12 20:44:36,959 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-12 20:44:36,960 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-12 20:44:36,960 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-12 20:44:36,960 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-12 20:44:36,961 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-12 20:44:36,962 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-12 20:44:36,963 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:44:36,984 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-12 20:44:36,985 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-12 20:44:36,986 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-12 20:44:36,986 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-12 20:44:36,986 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-12 20:44:36,986 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-12 20:44:36,987 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-12 20:44:36,987 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-12 20:44:36,987 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-12 20:44:36,988 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-12 20:44:36,988 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-12 20:44:36,988 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-12 20:44:36,988 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-12 20:44:36,991 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-12 20:44:36,991 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-12 20:44:37,061 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-12 20:44:37,076 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-12 20:44:37,079 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-12 20:44:37,081 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-12 20:44:37,081 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-12 20:44:37,082 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl [2018-10-12 20:44:37,083 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl' [2018-10-12 20:44:37,149 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-12 20:44:37,150 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-12 20:44:37,151 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-12 20:44:37,151 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-12 20:44:37,151 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-12 20:44:37,178 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:44:37" (1/1) ... [2018-10-12 20:44:37,180 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:44:37" (1/1) ... [2018-10-12 20:44:37,196 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:44:37" (1/1) ... [2018-10-12 20:44:37,197 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:44:37" (1/1) ... [2018-10-12 20:44:37,203 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:44:37" (1/1) ... [2018-10-12 20:44:37,205 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:44:37" (1/1) ... [2018-10-12 20:44:37,207 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:44:37" (1/1) ... [2018-10-12 20:44:37,210 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-12 20:44:37,211 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-12 20:44:37,211 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-12 20:44:37,211 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-12 20:44:37,212 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:44:37" (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:44:37,283 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-12 20:44:37,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-12 20:44:37,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-12 20:44:38,026 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-12 20:44:38,027 INFO L202 PluginConnector]: Adding new model ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:44:38 BoogieIcfgContainer [2018-10-12 20:44:38,027 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-12 20:44:38,029 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-12 20:44:38,029 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-12 20:44:38,032 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-12 20:44:38,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:44:37" (1/2) ... [2018-10-12 20:44:38,034 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29242e5d and model type ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:44:38, skipping insertion in model container [2018-10-12 20:44:38,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:44:38" (2/2) ... [2018-10-12 20:44:38,036 INFO L112 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl [2018-10-12 20:44:38,049 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-12 20:44:38,057 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-12 20:44:38,075 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-12 20:44:38,109 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-12 20:44:38,110 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-12 20:44:38,110 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-12 20:44:38,110 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-12 20:44:38,110 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-12 20:44:38,110 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-12 20:44:38,110 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-12 20:44:38,111 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-12 20:44:38,111 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-12 20:44:38,131 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states. [2018-10-12 20:44:38,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-12 20:44:38,141 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:38,142 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] [2018-10-12 20:44:38,143 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:38,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:38,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1733824129, now seen corresponding path program 1 times [2018-10-12 20:44:38,197 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:38,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:38,558 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:44:38,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-12 20:44:38,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-12 20:44:38,566 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-12 20:44:38,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-12 20:44:38,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-12 20:44:38,588 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 6 states. [2018-10-12 20:44:39,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:39,030 INFO L93 Difference]: Finished difference Result 177 states and 180 transitions. [2018-10-12 20:44:39,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-12 20:44:39,032 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2018-10-12 20:44:39,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:39,046 INFO L225 Difference]: With dead ends: 177 [2018-10-12 20:44:39,047 INFO L226 Difference]: Without dead ends: 177 [2018-10-12 20:44:39,049 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-10-12 20:44:39,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-10-12 20:44:39,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 126. [2018-10-12 20:44:39,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-10-12 20:44:39,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 128 transitions. [2018-10-12 20:44:39,100 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 128 transitions. Word has length 41 [2018-10-12 20:44:39,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:39,101 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 128 transitions. [2018-10-12 20:44:39,101 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-12 20:44:39,101 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 128 transitions. [2018-10-12 20:44:39,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-12 20:44:39,105 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:39,105 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:44:39,106 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:39,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:39,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1786245376, now seen corresponding path program 1 times [2018-10-12 20:44:39,108 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:39,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:40,551 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-12 20:44:40,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:44:40,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-12 20:44:40,554 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-12 20:44:40,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-12 20:44:40,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-10-12 20:44:40,555 INFO L87 Difference]: Start difference. First operand 126 states and 128 transitions. Second operand 19 states. [2018-10-12 20:44:43,177 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-10-12 20:44:43,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:43,300 INFO L93 Difference]: Finished difference Result 246 states and 252 transitions. [2018-10-12 20:44:43,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-12 20:44:43,301 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 95 [2018-10-12 20:44:43,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:43,305 INFO L225 Difference]: With dead ends: 246 [2018-10-12 20:44:43,305 INFO L226 Difference]: Without dead ends: 246 [2018-10-12 20:44:43,307 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=461, Invalid=1891, Unknown=0, NotChecked=0, Total=2352 [2018-10-12 20:44:43,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-10-12 20:44:43,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 130. [2018-10-12 20:44:43,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-10-12 20:44:43,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 133 transitions. [2018-10-12 20:44:43,321 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 133 transitions. Word has length 95 [2018-10-12 20:44:43,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:43,322 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 133 transitions. [2018-10-12 20:44:43,322 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-12 20:44:43,323 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 133 transitions. [2018-10-12 20:44:43,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-12 20:44:43,327 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:43,327 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:43,328 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:43,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:43,328 INFO L82 PathProgramCache]: Analyzing trace with hash -656087443, now seen corresponding path program 1 times [2018-10-12 20:44:43,329 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:43,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:43,566 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:44:43,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:44:43,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-12 20:44:43,567 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-12 20:44:43,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-12 20:44:43,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-10-12 20:44:43,568 INFO L87 Difference]: Start difference. First operand 130 states and 133 transitions. Second operand 10 states. [2018-10-12 20:44:44,074 WARN L178 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2018-10-12 20:44:44,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:44,382 INFO L93 Difference]: Finished difference Result 320 states and 327 transitions. [2018-10-12 20:44:44,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-12 20:44:44,382 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 116 [2018-10-12 20:44:44,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:44,386 INFO L225 Difference]: With dead ends: 320 [2018-10-12 20:44:44,387 INFO L226 Difference]: Without dead ends: 320 [2018-10-12 20:44:44,387 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=197, Invalid=505, Unknown=0, NotChecked=0, Total=702 [2018-10-12 20:44:44,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-10-12 20:44:44,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 218. [2018-10-12 20:44:44,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-10-12 20:44:44,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 223 transitions. [2018-10-12 20:44:44,408 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 223 transitions. Word has length 116 [2018-10-12 20:44:44,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:44,409 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 223 transitions. [2018-10-12 20:44:44,409 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-12 20:44:44,409 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 223 transitions. [2018-10-12 20:44:44,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-12 20:44:44,413 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:44,413 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:44:44,413 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:44,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:44,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1275902322, now seen corresponding path program 2 times [2018-10-12 20:44:44,415 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:44,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:44,611 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 76 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-12 20:44:44,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:44:44,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-12 20:44:44,613 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-12 20:44:44,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-12 20:44:44,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-12 20:44:44,613 INFO L87 Difference]: Start difference. First operand 218 states and 223 transitions. Second operand 8 states. [2018-10-12 20:44:44,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:44,847 INFO L93 Difference]: Finished difference Result 269 states and 274 transitions. [2018-10-12 20:44:44,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-12 20:44:44,847 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 170 [2018-10-12 20:44:44,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:44,850 INFO L225 Difference]: With dead ends: 269 [2018-10-12 20:44:44,851 INFO L226 Difference]: Without dead ends: 269 [2018-10-12 20:44:44,851 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:44:44,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-10-12 20:44:44,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 218. [2018-10-12 20:44:44,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-10-12 20:44:44,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 222 transitions. [2018-10-12 20:44:44,863 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 222 transitions. Word has length 170 [2018-10-12 20:44:44,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:44,864 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 222 transitions. [2018-10-12 20:44:44,864 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-12 20:44:44,864 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 222 transitions. [2018-10-12 20:44:44,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-10-12 20:44:44,868 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:44,868 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:44:44,868 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:44,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:44,869 INFO L82 PathProgramCache]: Analyzing trace with hash -61766911, now seen corresponding path program 3 times [2018-10-12 20:44:44,870 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:44,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:45,122 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 92 proven. 30 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-12 20:44:45,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:44:45,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-12 20:44:45,123 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-12 20:44:45,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-12 20:44:45,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-10-12 20:44:45,124 INFO L87 Difference]: Start difference. First operand 218 states and 222 transitions. Second operand 10 states. [2018-10-12 20:44:45,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:45,527 INFO L93 Difference]: Finished difference Result 327 states and 334 transitions. [2018-10-12 20:44:45,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-12 20:44:45,527 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 191 [2018-10-12 20:44:45,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:45,529 INFO L225 Difference]: With dead ends: 327 [2018-10-12 20:44:45,529 INFO L226 Difference]: Without dead ends: 327 [2018-10-12 20:44:45,530 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2018-10-12 20:44:45,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-10-12 20:44:45,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 227. [2018-10-12 20:44:45,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-10-12 20:44:45,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 231 transitions. [2018-10-12 20:44:45,543 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 231 transitions. Word has length 191 [2018-10-12 20:44:45,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:45,543 INFO L481 AbstractCegarLoop]: Abstraction has 227 states and 231 transitions. [2018-10-12 20:44:45,544 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-12 20:44:45,544 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 231 transitions. [2018-10-12 20:44:45,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-10-12 20:44:45,547 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:45,548 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:44:45,548 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:45,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:45,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1555615578, now seen corresponding path program 1 times [2018-10-12 20:44:45,549 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:45,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:46,426 WARN L178 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 19 [2018-10-12 20:44:47,077 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-12 20:44:47,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:44:47,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-12 20:44:47,078 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-12 20:44:47,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-12 20:44:47,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2018-10-12 20:44:47,079 INFO L87 Difference]: Start difference. First operand 227 states and 231 transitions. Second operand 23 states. [2018-10-12 20:44:48,058 WARN L178 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-10-12 20:44:49,435 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2018-10-12 20:44:50,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:50,319 INFO L93 Difference]: Finished difference Result 552 states and 565 transitions. [2018-10-12 20:44:50,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-12 20:44:50,319 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 205 [2018-10-12 20:44:50,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:50,324 INFO L225 Difference]: With dead ends: 552 [2018-10-12 20:44:50,324 INFO L226 Difference]: Without dead ends: 552 [2018-10-12 20:44:50,326 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 886 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=480, Invalid=3060, Unknown=0, NotChecked=0, Total=3540 [2018-10-12 20:44:50,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2018-10-12 20:44:50,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 306. [2018-10-12 20:44:50,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-10-12 20:44:50,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 312 transitions. [2018-10-12 20:44:50,348 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 312 transitions. Word has length 205 [2018-10-12 20:44:50,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:50,350 INFO L481 AbstractCegarLoop]: Abstraction has 306 states and 312 transitions. [2018-10-12 20:44:50,350 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-12 20:44:50,350 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 312 transitions. [2018-10-12 20:44:50,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-10-12 20:44:50,355 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:50,356 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 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] [2018-10-12 20:44:50,356 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:50,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:50,356 INFO L82 PathProgramCache]: Analyzing trace with hash 293495891, now seen corresponding path program 2 times [2018-10-12 20:44:50,362 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:50,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:52,231 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 11 proven. 164 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-12 20:44:52,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:44:52,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-12 20:44:52,232 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-12 20:44:52,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-12 20:44:52,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-10-12 20:44:52,233 INFO L87 Difference]: Start difference. First operand 306 states and 312 transitions. Second operand 14 states. [2018-10-12 20:44:52,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:52,954 INFO L93 Difference]: Finished difference Result 430 states and 439 transitions. [2018-10-12 20:44:52,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-12 20:44:52,954 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 226 [2018-10-12 20:44:52,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:52,958 INFO L225 Difference]: With dead ends: 430 [2018-10-12 20:44:52,958 INFO L226 Difference]: Without dead ends: 430 [2018-10-12 20:44:52,959 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=434, Invalid=1458, Unknown=0, NotChecked=0, Total=1892 [2018-10-12 20:44:52,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2018-10-12 20:44:52,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 328. [2018-10-12 20:44:52,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-10-12 20:44:52,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 335 transitions. [2018-10-12 20:44:52,967 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 335 transitions. Word has length 226 [2018-10-12 20:44:52,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:52,968 INFO L481 AbstractCegarLoop]: Abstraction has 328 states and 335 transitions. [2018-10-12 20:44:52,968 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-12 20:44:52,968 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 335 transitions. [2018-10-12 20:44:52,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-10-12 20:44:52,970 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:52,970 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 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] [2018-10-12 20:44:52,971 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:52,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:52,971 INFO L82 PathProgramCache]: Analyzing trace with hash -337896517, now seen corresponding path program 3 times [2018-10-12 20:44:52,972 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:52,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:53,302 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 160 proven. 94 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-12 20:44:53,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:44:53,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-12 20:44:53,303 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-12 20:44:53,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-12 20:44:53,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-10-12 20:44:53,304 INFO L87 Difference]: Start difference. First operand 328 states and 335 transitions. Second operand 10 states. [2018-10-12 20:44:53,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:53,555 INFO L93 Difference]: Finished difference Result 344 states and 349 transitions. [2018-10-12 20:44:53,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-12 20:44:53,556 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 259 [2018-10-12 20:44:53,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:53,559 INFO L225 Difference]: With dead ends: 344 [2018-10-12 20:44:53,559 INFO L226 Difference]: Without dead ends: 344 [2018-10-12 20:44:53,559 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:44:53,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-10-12 20:44:53,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 328. [2018-10-12 20:44:53,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-10-12 20:44:53,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 333 transitions. [2018-10-12 20:44:53,566 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 333 transitions. Word has length 259 [2018-10-12 20:44:53,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:53,567 INFO L481 AbstractCegarLoop]: Abstraction has 328 states and 333 transitions. [2018-10-12 20:44:53,567 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-12 20:44:53,567 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 333 transitions. [2018-10-12 20:44:53,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-10-12 20:44:53,568 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:53,569 INFO L375 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1] [2018-10-12 20:44:53,569 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:53,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:53,570 INFO L82 PathProgramCache]: Analyzing trace with hash 791780340, now seen corresponding path program 4 times [2018-10-12 20:44:53,570 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:53,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:53,793 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 185 proven. 118 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-12 20:44:53,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:44:53,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-12 20:44:53,794 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-12 20:44:53,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-12 20:44:53,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-10-12 20:44:53,795 INFO L87 Difference]: Start difference. First operand 328 states and 333 transitions. Second operand 12 states. [2018-10-12 20:44:54,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:54,140 INFO L93 Difference]: Finished difference Result 346 states and 350 transitions. [2018-10-12 20:44:54,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-12 20:44:54,141 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 280 [2018-10-12 20:44:54,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:54,143 INFO L225 Difference]: With dead ends: 346 [2018-10-12 20:44:54,144 INFO L226 Difference]: Without dead ends: 346 [2018-10-12 20:44:54,144 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=433, Unknown=0, NotChecked=0, Total=552 [2018-10-12 20:44:54,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-10-12 20:44:54,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2018-10-12 20:44:54,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-10-12 20:44:54,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 350 transitions. [2018-10-12 20:44:54,152 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 350 transitions. Word has length 280 [2018-10-12 20:44:54,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:54,153 INFO L481 AbstractCegarLoop]: Abstraction has 346 states and 350 transitions. [2018-10-12 20:44:54,153 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-12 20:44:54,153 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 350 transitions. [2018-10-12 20:44:54,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-10-12 20:44:54,155 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:54,156 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 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, 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, 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, 1, 1] [2018-10-12 20:44:54,156 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:54,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:54,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1810716325, now seen corresponding path program 5 times [2018-10-12 20:44:54,157 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:54,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:54,571 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 191 proven. 159 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-12 20:44:54,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:44:54,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-12 20:44:54,572 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-12 20:44:54,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-12 20:44:54,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-10-12 20:44:54,573 INFO L87 Difference]: Start difference. First operand 346 states and 350 transitions. Second operand 12 states. [2018-10-12 20:44:55,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:55,018 INFO L93 Difference]: Finished difference Result 362 states and 366 transitions. [2018-10-12 20:44:55,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-12 20:44:55,019 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 301 [2018-10-12 20:44:55,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:55,022 INFO L225 Difference]: With dead ends: 362 [2018-10-12 20:44:55,022 INFO L226 Difference]: Without dead ends: 362 [2018-10-12 20:44:55,023 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2018-10-12 20:44:55,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2018-10-12 20:44:55,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 347. [2018-10-12 20:44:55,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-10-12 20:44:55,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 351 transitions. [2018-10-12 20:44:55,030 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 351 transitions. Word has length 301 [2018-10-12 20:44:55,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:55,030 INFO L481 AbstractCegarLoop]: Abstraction has 347 states and 351 transitions. [2018-10-12 20:44:55,030 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-12 20:44:55,030 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 351 transitions. [2018-10-12 20:44:55,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2018-10-12 20:44:55,032 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:55,032 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:44:55,033 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:55,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:55,033 INFO L82 PathProgramCache]: Analyzing trace with hash -140324812, now seen corresponding path program 6 times [2018-10-12 20:44:55,034 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:55,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:55,637 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 191 proven. 176 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-12 20:44:55,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:44:55,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-12 20:44:55,638 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-12 20:44:55,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-12 20:44:55,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-10-12 20:44:55,638 INFO L87 Difference]: Start difference. First operand 347 states and 351 transitions. Second operand 14 states. [2018-10-12 20:44:57,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:57,558 INFO L93 Difference]: Finished difference Result 364 states and 368 transitions. [2018-10-12 20:44:57,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-12 20:44:57,559 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 315 [2018-10-12 20:44:57,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:57,562 INFO L225 Difference]: With dead ends: 364 [2018-10-12 20:44:57,562 INFO L226 Difference]: Without dead ends: 364 [2018-10-12 20:44:57,563 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=181, Invalid=689, Unknown=0, NotChecked=0, Total=870 [2018-10-12 20:44:57,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2018-10-12 20:44:57,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 361. [2018-10-12 20:44:57,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-10-12 20:44:57,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 365 transitions. [2018-10-12 20:44:57,570 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 365 transitions. Word has length 315 [2018-10-12 20:44:57,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:57,570 INFO L481 AbstractCegarLoop]: Abstraction has 361 states and 365 transitions. [2018-10-12 20:44:57,570 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-12 20:44:57,571 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 365 transitions. [2018-10-12 20:44:57,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2018-10-12 20:44:57,572 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:57,573 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:44:57,573 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:57,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:57,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1678407859, now seen corresponding path program 7 times [2018-10-12 20:44:57,574 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:57,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:58,567 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 121 proven. 286 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-12 20:44:58,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:44:58,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-12 20:44:58,568 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-12 20:44:58,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-12 20:44:58,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2018-10-12 20:44:58,569 INFO L87 Difference]: Start difference. First operand 361 states and 365 transitions. Second operand 26 states. [2018-10-12 20:45:02,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:02,280 INFO L93 Difference]: Finished difference Result 459 states and 465 transitions. [2018-10-12 20:45:02,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-12 20:45:02,281 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 329 [2018-10-12 20:45:02,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:02,284 INFO L225 Difference]: With dead ends: 459 [2018-10-12 20:45:02,284 INFO L226 Difference]: Without dead ends: 459 [2018-10-12 20:45:02,286 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 865 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=849, Invalid=3441, Unknown=0, NotChecked=0, Total=4290 [2018-10-12 20:45:02,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-10-12 20:45:02,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 364. [2018-10-12 20:45:02,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-10-12 20:45:02,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 368 transitions. [2018-10-12 20:45:02,292 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 368 transitions. Word has length 329 [2018-10-12 20:45:02,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:02,293 INFO L481 AbstractCegarLoop]: Abstraction has 364 states and 368 transitions. [2018-10-12 20:45:02,293 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-12 20:45:02,293 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 368 transitions. [2018-10-12 20:45:02,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-10-12 20:45:02,295 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:02,295 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-10-12 20:45:02,296 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:02,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:02,296 INFO L82 PathProgramCache]: Analyzing trace with hash 958018112, now seen corresponding path program 8 times [2018-10-12 20:45:02,297 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:02,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:03,285 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 121 proven. 377 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-12 20:45:03,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:03,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-12 20:45:03,286 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-12 20:45:03,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-12 20:45:03,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=724, Unknown=0, NotChecked=0, Total=812 [2018-10-12 20:45:03,287 INFO L87 Difference]: Start difference. First operand 364 states and 368 transitions. Second operand 29 states. [2018-10-12 20:45:04,523 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-12 20:45:09,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:09,246 INFO L93 Difference]: Finished difference Result 546 states and 554 transitions. [2018-10-12 20:45:09,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-12 20:45:09,246 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 350 [2018-10-12 20:45:09,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:09,250 INFO L225 Difference]: With dead ends: 546 [2018-10-12 20:45:09,250 INFO L226 Difference]: Without dead ends: 546 [2018-10-12 20:45:09,252 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1333 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1139, Invalid=4867, Unknown=0, NotChecked=0, Total=6006 [2018-10-12 20:45:09,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2018-10-12 20:45:09,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 385. [2018-10-12 20:45:09,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-10-12 20:45:09,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 390 transitions. [2018-10-12 20:45:09,259 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 390 transitions. Word has length 350 [2018-10-12 20:45:09,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:09,260 INFO L481 AbstractCegarLoop]: Abstraction has 385 states and 390 transitions. [2018-10-12 20:45:09,260 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-12 20:45:09,260 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 390 transitions. [2018-10-12 20:45:09,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2018-10-12 20:45:09,262 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:09,263 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-10-12 20:45:09,263 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:09,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:09,264 INFO L82 PathProgramCache]: Analyzing trace with hash 2035543341, now seen corresponding path program 9 times [2018-10-12 20:45:09,264 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:09,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:09,686 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 43 proven. 546 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-10-12 20:45:09,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:09,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-12 20:45:09,687 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-12 20:45:09,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-12 20:45:09,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-10-12 20:45:09,688 INFO L87 Difference]: Start difference. First operand 385 states and 390 transitions. Second operand 18 states. [2018-10-12 20:45:10,635 WARN L178 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-12 20:45:11,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:11,169 INFO L93 Difference]: Finished difference Result 596 states and 604 transitions. [2018-10-12 20:45:11,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-12 20:45:11,171 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 371 [2018-10-12 20:45:11,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:11,174 INFO L225 Difference]: With dead ends: 596 [2018-10-12 20:45:11,175 INFO L226 Difference]: Without dead ends: 596 [2018-10-12 20:45:11,176 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1034 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=733, Invalid=2807, Unknown=0, NotChecked=0, Total=3540 [2018-10-12 20:45:11,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2018-10-12 20:45:11,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 530. [2018-10-12 20:45:11,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2018-10-12 20:45:11,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 537 transitions. [2018-10-12 20:45:11,185 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 537 transitions. Word has length 371 [2018-10-12 20:45:11,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:11,186 INFO L481 AbstractCegarLoop]: Abstraction has 530 states and 537 transitions. [2018-10-12 20:45:11,186 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-12 20:45:11,186 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 537 transitions. [2018-10-12 20:45:11,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2018-10-12 20:45:11,189 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:11,189 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-10-12 20:45:11,190 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:11,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:11,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1529603808, now seen corresponding path program 10 times [2018-10-12 20:45:11,191 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:11,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:12,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 758 proven. 326 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-10-12 20:45:12,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:12,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-12 20:45:12,590 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-12 20:45:12,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-12 20:45:12,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-10-12 20:45:12,591 INFO L87 Difference]: Start difference. First operand 530 states and 537 transitions. Second operand 16 states. [2018-10-12 20:45:13,375 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-12 20:45:13,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:13,451 INFO L93 Difference]: Finished difference Result 530 states and 535 transitions. [2018-10-12 20:45:13,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-12 20:45:13,451 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 495 [2018-10-12 20:45:13,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:13,455 INFO L225 Difference]: With dead ends: 530 [2018-10-12 20:45:13,455 INFO L226 Difference]: Without dead ends: 530 [2018-10-12 20:45:13,456 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=228, Invalid=894, Unknown=0, NotChecked=0, Total=1122 [2018-10-12 20:45:13,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2018-10-12 20:45:13,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2018-10-12 20:45:13,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2018-10-12 20:45:13,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 535 transitions. [2018-10-12 20:45:13,464 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 535 transitions. Word has length 495 [2018-10-12 20:45:13,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:13,464 INFO L481 AbstractCegarLoop]: Abstraction has 530 states and 535 transitions. [2018-10-12 20:45:13,464 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-12 20:45:13,465 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 535 transitions. [2018-10-12 20:45:13,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2018-10-12 20:45:13,468 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:13,468 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-10-12 20:45:13,468 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:13,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:13,469 INFO L82 PathProgramCache]: Analyzing trace with hash -768765037, now seen corresponding path program 11 times [2018-10-12 20:45:13,470 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:13,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:14,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1392 backedges. 895 proven. 80 refuted. 0 times theorem prover too weak. 417 trivial. 0 not checked. [2018-10-12 20:45:14,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:14,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-12 20:45:14,332 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-12 20:45:14,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-12 20:45:14,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-10-12 20:45:14,333 INFO L87 Difference]: Start difference. First operand 530 states and 535 transitions. Second operand 15 states. [2018-10-12 20:45:15,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:15,735 INFO L93 Difference]: Finished difference Result 547 states and 552 transitions. [2018-10-12 20:45:15,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-12 20:45:15,735 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 516 [2018-10-12 20:45:15,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:15,739 INFO L225 Difference]: With dead ends: 547 [2018-10-12 20:45:15,739 INFO L226 Difference]: Without dead ends: 547 [2018-10-12 20:45:15,740 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=324, Invalid=1398, Unknown=0, NotChecked=0, Total=1722 [2018-10-12 20:45:15,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2018-10-12 20:45:15,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 544. [2018-10-12 20:45:15,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2018-10-12 20:45:15,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 549 transitions. [2018-10-12 20:45:15,748 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 549 transitions. Word has length 516 [2018-10-12 20:45:15,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:15,748 INFO L481 AbstractCegarLoop]: Abstraction has 544 states and 549 transitions. [2018-10-12 20:45:15,748 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-12 20:45:15,748 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 549 transitions. [2018-10-12 20:45:15,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2018-10-12 20:45:15,752 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:15,752 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 6, 6, 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, 5, 5, 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, 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] [2018-10-12 20:45:15,753 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:15,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:15,753 INFO L82 PathProgramCache]: Analyzing trace with hash -84541140, now seen corresponding path program 12 times [2018-10-12 20:45:15,754 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:15,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:17,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1466 backedges. 553 proven. 811 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-10-12 20:45:17,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:17,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-12 20:45:17,332 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-12 20:45:17,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-12 20:45:17,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=949, Unknown=0, NotChecked=0, Total=1056 [2018-10-12 20:45:17,333 INFO L87 Difference]: Start difference. First operand 544 states and 549 transitions. Second operand 33 states. [2018-10-12 20:45:23,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:23,226 INFO L93 Difference]: Finished difference Result 754 states and 763 transitions. [2018-10-12 20:45:23,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-12 20:45:23,226 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 530 [2018-10-12 20:45:23,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:23,230 INFO L225 Difference]: With dead ends: 754 [2018-10-12 20:45:23,231 INFO L226 Difference]: Without dead ends: 754 [2018-10-12 20:45:23,233 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1796 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1371, Invalid=6285, Unknown=0, NotChecked=0, Total=7656 [2018-10-12 20:45:23,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2018-10-12 20:45:23,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 565. [2018-10-12 20:45:23,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2018-10-12 20:45:23,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 571 transitions. [2018-10-12 20:45:23,241 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 571 transitions. Word has length 530 [2018-10-12 20:45:23,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:23,242 INFO L481 AbstractCegarLoop]: Abstraction has 565 states and 571 transitions. [2018-10-12 20:45:23,242 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-12 20:45:23,242 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 571 transitions. [2018-10-12 20:45:23,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 552 [2018-10-12 20:45:23,246 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:23,246 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 6, 6, 6, 6, 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, 5, 5, 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, 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] [2018-10-12 20:45:23,247 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:23,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:23,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1647515199, now seen corresponding path program 13 times [2018-10-12 20:45:23,248 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:23,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:23,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1663 backedges. 99 proven. 1412 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2018-10-12 20:45:23,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:23,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-12 20:45:23,901 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-12 20:45:23,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-12 20:45:23,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2018-10-12 20:45:23,901 INFO L87 Difference]: Start difference. First operand 565 states and 571 transitions. Second operand 22 states. [2018-10-12 20:45:25,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:25,523 INFO L93 Difference]: Finished difference Result 825 states and 834 transitions. [2018-10-12 20:45:25,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-12 20:45:25,523 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 551 [2018-10-12 20:45:25,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:25,528 INFO L225 Difference]: With dead ends: 825 [2018-10-12 20:45:25,528 INFO L226 Difference]: Without dead ends: 825 [2018-10-12 20:45:25,531 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2157 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1251, Invalid=5391, Unknown=0, NotChecked=0, Total=6642 [2018-10-12 20:45:25,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2018-10-12 20:45:25,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 745. [2018-10-12 20:45:25,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2018-10-12 20:45:25,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 753 transitions. [2018-10-12 20:45:25,541 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 753 transitions. Word has length 551 [2018-10-12 20:45:25,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:25,541 INFO L481 AbstractCegarLoop]: Abstraction has 745 states and 753 transitions. [2018-10-12 20:45:25,541 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-12 20:45:25,541 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 753 transitions. [2018-10-12 20:45:25,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 711 [2018-10-12 20:45:25,546 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:25,547 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2018-10-12 20:45:25,547 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:25,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:25,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1096065984, now seen corresponding path program 14 times [2018-10-12 20:45:25,549 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:25,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:28,080 INFO L134 CoverageAnalysis]: Checked inductivity of 2944 backedges. 1592 proven. 992 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2018-10-12 20:45:28,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:28,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-12 20:45:28,082 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-12 20:45:28,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-12 20:45:28,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2018-10-12 20:45:28,083 INFO L87 Difference]: Start difference. First operand 745 states and 753 transitions. Second operand 22 states. [2018-10-12 20:45:29,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:29,111 INFO L93 Difference]: Finished difference Result 762 states and 770 transitions. [2018-10-12 20:45:29,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-12 20:45:29,112 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 710 [2018-10-12 20:45:29,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:29,116 INFO L225 Difference]: With dead ends: 762 [2018-10-12 20:45:29,116 INFO L226 Difference]: Without dead ends: 762 [2018-10-12 20:45:29,117 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=473, Invalid=1977, Unknown=0, NotChecked=0, Total=2450 [2018-10-12 20:45:29,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2018-10-12 20:45:29,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 759. [2018-10-12 20:45:29,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2018-10-12 20:45:29,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 767 transitions. [2018-10-12 20:45:29,126 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 767 transitions. Word has length 710 [2018-10-12 20:45:29,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:29,127 INFO L481 AbstractCegarLoop]: Abstraction has 759 states and 767 transitions. [2018-10-12 20:45:29,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-12 20:45:29,127 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 767 transitions. [2018-10-12 20:45:29,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 725 [2018-10-12 20:45:29,132 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:29,133 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2018-10-12 20:45:29,133 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:29,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:29,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1918285255, now seen corresponding path program 15 times [2018-10-12 20:45:29,134 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:29,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:30,443 INFO L134 CoverageAnalysis]: Checked inductivity of 3075 backedges. 1867 proven. 93 refuted. 0 times theorem prover too weak. 1115 trivial. 0 not checked. [2018-10-12 20:45:30,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:30,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-12 20:45:30,444 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-12 20:45:30,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-12 20:45:30,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-10-12 20:45:30,444 INFO L87 Difference]: Start difference. First operand 759 states and 767 transitions. Second operand 19 states. [2018-10-12 20:45:32,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:32,419 INFO L93 Difference]: Finished difference Result 972 states and 981 transitions. [2018-10-12 20:45:32,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-12 20:45:32,420 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 724 [2018-10-12 20:45:32,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:32,425 INFO L225 Difference]: With dead ends: 972 [2018-10-12 20:45:32,425 INFO L226 Difference]: Without dead ends: 918 [2018-10-12 20:45:32,428 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3509 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1659, Invalid=8043, Unknown=0, NotChecked=0, Total=9702 [2018-10-12 20:45:32,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2018-10-12 20:45:32,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 830. [2018-10-12 20:45:32,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2018-10-12 20:45:32,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 838 transitions. [2018-10-12 20:45:32,439 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 838 transitions. Word has length 724 [2018-10-12 20:45:32,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:32,440 INFO L481 AbstractCegarLoop]: Abstraction has 830 states and 838 transitions. [2018-10-12 20:45:32,440 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-12 20:45:32,440 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 838 transitions. [2018-10-12 20:45:32,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 746 [2018-10-12 20:45:32,446 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:32,446 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2018-10-12 20:45:32,447 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:32,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:32,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1746512612, now seen corresponding path program 16 times [2018-10-12 20:45:32,448 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:32,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:34,502 INFO L134 CoverageAnalysis]: Checked inductivity of 3357 backedges. 1582 proven. 1484 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2018-10-12 20:45:34,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:34,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-12 20:45:34,503 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-12 20:45:34,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-12 20:45:34,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1204, Unknown=0, NotChecked=0, Total=1332 [2018-10-12 20:45:34,504 INFO L87 Difference]: Start difference. First operand 830 states and 838 transitions. Second operand 37 states. [2018-10-12 20:45:41,037 WARN L178 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2018-10-12 20:45:41,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:41,641 INFO L93 Difference]: Finished difference Result 1068 states and 1080 transitions. [2018-10-12 20:45:41,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-12 20:45:41,641 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 745 [2018-10-12 20:45:41,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:41,645 INFO L225 Difference]: With dead ends: 1068 [2018-10-12 20:45:41,645 INFO L226 Difference]: Without dead ends: 1068 [2018-10-12 20:45:41,646 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2319 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1629, Invalid=7877, Unknown=0, NotChecked=0, Total=9506 [2018-10-12 20:45:41,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2018-10-12 20:45:41,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 851. [2018-10-12 20:45:41,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 851 states. [2018-10-12 20:45:41,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 860 transitions. [2018-10-12 20:45:41,656 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 860 transitions. Word has length 745 [2018-10-12 20:45:41,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:41,657 INFO L481 AbstractCegarLoop]: Abstraction has 851 states and 860 transitions. [2018-10-12 20:45:41,657 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-12 20:45:41,657 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 860 transitions. [2018-10-12 20:45:41,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 767 [2018-10-12 20:45:41,663 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:41,663 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2018-10-12 20:45:41,664 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:41,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:41,664 INFO L82 PathProgramCache]: Analyzing trace with hash -272798767, now seen corresponding path program 17 times [2018-10-12 20:45:41,665 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:41,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:42,533 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 179 proven. 3111 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2018-10-12 20:45:42,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:42,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-12 20:45:42,534 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-12 20:45:42,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-12 20:45:42,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2018-10-12 20:45:42,535 INFO L87 Difference]: Start difference. First operand 851 states and 860 transitions. Second operand 26 states. [2018-10-12 20:45:44,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:44,907 INFO L93 Difference]: Finished difference Result 1160 states and 1172 transitions. [2018-10-12 20:45:44,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-12 20:45:44,909 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 766 [2018-10-12 20:45:44,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:44,913 INFO L225 Difference]: With dead ends: 1160 [2018-10-12 20:45:44,914 INFO L226 Difference]: Without dead ends: 1160 [2018-10-12 20:45:44,915 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3966 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1991, Invalid=9351, Unknown=0, NotChecked=0, Total=11342 [2018-10-12 20:45:44,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2018-10-12 20:45:44,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1066. [2018-10-12 20:45:44,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1066 states. [2018-10-12 20:45:44,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066 states to 1066 states and 1077 transitions. [2018-10-12 20:45:44,927 INFO L78 Accepts]: Start accepts. Automaton has 1066 states and 1077 transitions. Word has length 766 [2018-10-12 20:45:44,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:44,928 INFO L481 AbstractCegarLoop]: Abstraction has 1066 states and 1077 transitions. [2018-10-12 20:45:44,928 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-12 20:45:44,928 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1077 transitions. [2018-10-12 20:45:44,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 961 [2018-10-12 20:45:44,937 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:44,938 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2018-10-12 20:45:44,938 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:44,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:44,938 INFO L82 PathProgramCache]: Analyzing trace with hash 294351382, now seen corresponding path program 18 times [2018-10-12 20:45:44,939 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:44,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:46,180 INFO L134 CoverageAnalysis]: Checked inductivity of 6069 backedges. 4057 proven. 1324 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2018-10-12 20:45:46,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:46,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-12 20:45:46,181 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-12 20:45:46,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-12 20:45:46,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2018-10-12 20:45:46,181 INFO L87 Difference]: Start difference. First operand 1066 states and 1077 transitions. Second operand 24 states. [2018-10-12 20:45:47,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:47,482 INFO L93 Difference]: Finished difference Result 1066 states and 1075 transitions. [2018-10-12 20:45:47,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-12 20:45:47,482 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 960 [2018-10-12 20:45:47,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:47,487 INFO L225 Difference]: With dead ends: 1066 [2018-10-12 20:45:47,487 INFO L226 Difference]: Without dead ends: 1066 [2018-10-12 20:45:47,488 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=560, Invalid=2302, Unknown=0, NotChecked=0, Total=2862 [2018-10-12 20:45:47,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2018-10-12 20:45:47,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 1066. [2018-10-12 20:45:47,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1066 states. [2018-10-12 20:45:47,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066 states to 1066 states and 1075 transitions. [2018-10-12 20:45:47,500 INFO L78 Accepts]: Start accepts. Automaton has 1066 states and 1075 transitions. Word has length 960 [2018-10-12 20:45:47,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:47,500 INFO L481 AbstractCegarLoop]: Abstraction has 1066 states and 1075 transitions. [2018-10-12 20:45:47,500 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-12 20:45:47,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1075 transitions. [2018-10-12 20:45:47,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 982 [2018-10-12 20:45:47,509 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:47,510 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2018-10-12 20:45:47,510 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:47,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:47,510 INFO L82 PathProgramCache]: Analyzing trace with hash -2073225279, now seen corresponding path program 19 times [2018-10-12 20:45:47,511 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:47,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:48,352 INFO L134 CoverageAnalysis]: Checked inductivity of 6478 backedges. 3704 proven. 234 refuted. 0 times theorem prover too weak. 2540 trivial. 0 not checked. [2018-10-12 20:45:48,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:48,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-12 20:45:48,353 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-12 20:45:48,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-12 20:45:48,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2018-10-12 20:45:48,354 INFO L87 Difference]: Start difference. First operand 1066 states and 1075 transitions. Second operand 23 states. [2018-10-12 20:45:50,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:50,259 INFO L93 Difference]: Finished difference Result 1083 states and 1092 transitions. [2018-10-12 20:45:50,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-12 20:45:50,260 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 981 [2018-10-12 20:45:50,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:50,265 INFO L225 Difference]: With dead ends: 1083 [2018-10-12 20:45:50,265 INFO L226 Difference]: Without dead ends: 1083 [2018-10-12 20:45:50,266 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1082 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=812, Invalid=3744, Unknown=0, NotChecked=0, Total=4556 [2018-10-12 20:45:50,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2018-10-12 20:45:50,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1080. [2018-10-12 20:45:50,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1080 states. [2018-10-12 20:45:50,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1089 transitions. [2018-10-12 20:45:50,278 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 1089 transitions. Word has length 981 [2018-10-12 20:45:50,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:50,279 INFO L481 AbstractCegarLoop]: Abstraction has 1080 states and 1089 transitions. [2018-10-12 20:45:50,279 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-12 20:45:50,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1089 transitions. [2018-10-12 20:45:50,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 996 [2018-10-12 20:45:50,289 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:50,289 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2018-10-12 20:45:50,289 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:50,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:50,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1915696538, now seen corresponding path program 20 times [2018-10-12 20:45:50,291 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:50,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:51,024 WARN L178 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-10-12 20:45:53,349 INFO L134 CoverageAnalysis]: Checked inductivity of 6680 backedges. 3599 proven. 2459 refuted. 0 times theorem prover too weak. 622 trivial. 0 not checked. [2018-10-12 20:45:53,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:53,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-12 20:45:53,350 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-12 20:45:53,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-12 20:45:53,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1632, Unknown=0, NotChecked=0, Total=1806 [2018-10-12 20:45:53,351 INFO L87 Difference]: Start difference. First operand 1080 states and 1089 transitions. Second operand 43 states. [2018-10-12 20:45:58,190 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2018-10-12 20:45:58,369 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2018-10-12 20:45:58,507 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2018-10-12 20:45:58,827 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2018-10-12 20:45:58,977 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2018-10-12 20:45:59,403 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2018-10-12 20:46:01,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:46:01,966 INFO L93 Difference]: Finished difference Result 1346 states and 1359 transitions. [2018-10-12 20:46:01,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-12 20:46:01,966 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 995 [2018-10-12 20:46:01,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:46:01,971 INFO L225 Difference]: With dead ends: 1346 [2018-10-12 20:46:01,971 INFO L226 Difference]: Without dead ends: 1346 [2018-10-12 20:46:01,972 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3086 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=2278, Invalid=10378, Unknown=0, NotChecked=0, Total=12656 [2018-10-12 20:46:01,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2018-10-12 20:46:01,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 1101. [2018-10-12 20:46:01,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1101 states. [2018-10-12 20:46:01,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 1111 transitions. [2018-10-12 20:46:01,984 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 1111 transitions. Word has length 995 [2018-10-12 20:46:01,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:46:01,985 INFO L481 AbstractCegarLoop]: Abstraction has 1101 states and 1111 transitions. [2018-10-12 20:46:01,985 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-12 20:46:01,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1111 transitions. [2018-10-12 20:46:01,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1017 [2018-10-12 20:46:01,996 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:46:01,997 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2018-10-12 20:46:01,997 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:46:01,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:46:01,998 INFO L82 PathProgramCache]: Analyzing trace with hash 194143763, now seen corresponding path program 21 times [2018-10-12 20:46:01,998 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:46:02,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:46:03,394 INFO L134 CoverageAnalysis]: Checked inductivity of 7110 backedges. 283 proven. 6097 refuted. 0 times theorem prover too weak. 730 trivial. 0 not checked. [2018-10-12 20:46:03,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:46:03,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-12 20:46:03,396 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-12 20:46:03,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-12 20:46:03,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=750, Unknown=0, NotChecked=0, Total=870 [2018-10-12 20:46:03,396 INFO L87 Difference]: Start difference. First operand 1101 states and 1111 transitions. Second operand 30 states. [2018-10-12 20:46:06,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:46:06,340 INFO L93 Difference]: Finished difference Result 1459 states and 1472 transitions. [2018-10-12 20:46:06,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-10-12 20:46:06,341 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 1016 [2018-10-12 20:46:06,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:46:06,347 INFO L225 Difference]: With dead ends: 1459 [2018-10-12 20:46:06,348 INFO L226 Difference]: Without dead ends: 1459 [2018-10-12 20:46:06,350 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6691 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3009, Invalid=15081, Unknown=0, NotChecked=0, Total=18090 [2018-10-12 20:46:06,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2018-10-12 20:46:06,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 1351. [2018-10-12 20:46:06,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1351 states. [2018-10-12 20:46:06,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1351 states to 1351 states and 1363 transitions. [2018-10-12 20:46:06,364 INFO L78 Accepts]: Start accepts. Automaton has 1351 states and 1363 transitions. Word has length 1016 [2018-10-12 20:46:06,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:46:06,365 INFO L481 AbstractCegarLoop]: Abstraction has 1351 states and 1363 transitions. [2018-10-12 20:46:06,365 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-12 20:46:06,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 1363 transitions. [2018-10-12 20:46:06,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1246 [2018-10-12 20:46:06,379 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:46:06,380 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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] [2018-10-12 20:46:06,380 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:46:06,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:46:06,381 INFO L82 PathProgramCache]: Analyzing trace with hash -213230948, now seen corresponding path program 22 times [2018-10-12 20:46:06,381 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:46:06,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:46:08,556 INFO L134 CoverageAnalysis]: Checked inductivity of 11185 backedges. 7731 proven. 2240 refuted. 0 times theorem prover too weak. 1214 trivial. 0 not checked. [2018-10-12 20:46:08,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:46:08,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-12 20:46:08,558 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-12 20:46:08,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-12 20:46:08,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=651, Unknown=0, NotChecked=0, Total=756 [2018-10-12 20:46:08,558 INFO L87 Difference]: Start difference. First operand 1351 states and 1363 transitions. Second operand 28 states. [2018-10-12 20:46:10,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:46:10,299 INFO L93 Difference]: Finished difference Result 1351 states and 1361 transitions. [2018-10-12 20:46:10,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-12 20:46:10,300 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 1245 [2018-10-12 20:46:10,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:46:10,305 INFO L225 Difference]: With dead ends: 1351 [2018-10-12 20:46:10,305 INFO L226 Difference]: Without dead ends: 1351 [2018-10-12 20:46:10,305 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=783, Invalid=3249, Unknown=0, NotChecked=0, Total=4032 [2018-10-12 20:46:10,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2018-10-12 20:46:10,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1351. [2018-10-12 20:46:10,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1351 states. [2018-10-12 20:46:10,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1351 states to 1351 states and 1361 transitions. [2018-10-12 20:46:10,316 INFO L78 Accepts]: Start accepts. Automaton has 1351 states and 1361 transitions. Word has length 1245 [2018-10-12 20:46:10,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:46:10,317 INFO L481 AbstractCegarLoop]: Abstraction has 1351 states and 1361 transitions. [2018-10-12 20:46:10,317 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-12 20:46:10,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 1361 transitions. [2018-10-12 20:46:10,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1267 [2018-10-12 20:46:10,336 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:46:10,337 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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] [2018-10-12 20:46:10,337 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:46:10,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:46:10,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1060927957, now seen corresponding path program 23 times [2018-10-12 20:46:10,339 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:46:10,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:46:12,178 INFO L134 CoverageAnalysis]: Checked inductivity of 11742 backedges. 6292 proven. 332 refuted. 0 times theorem prover too weak. 5118 trivial. 0 not checked. [2018-10-12 20:46:12,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:46:12,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-12 20:46:12,179 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-12 20:46:12,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-12 20:46:12,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=608, Unknown=0, NotChecked=0, Total=702 [2018-10-12 20:46:12,180 INFO L87 Difference]: Start difference. First operand 1351 states and 1361 transitions. Second operand 27 states. [2018-10-12 20:46:14,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:46:14,778 INFO L93 Difference]: Finished difference Result 1368 states and 1378 transitions. [2018-10-12 20:46:14,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-12 20:46:14,779 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 1266 [2018-10-12 20:46:14,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:46:14,785 INFO L225 Difference]: With dead ends: 1368 [2018-10-12 20:46:14,785 INFO L226 Difference]: Without dead ends: 1368 [2018-10-12 20:46:14,786 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1600 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1146, Invalid=5334, Unknown=0, NotChecked=0, Total=6480 [2018-10-12 20:46:14,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2018-10-12 20:46:14,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 1365. [2018-10-12 20:46:14,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1365 states. [2018-10-12 20:46:14,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 1375 transitions. [2018-10-12 20:46:14,795 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 1375 transitions. Word has length 1266 [2018-10-12 20:46:14,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:46:14,796 INFO L481 AbstractCegarLoop]: Abstraction has 1365 states and 1375 transitions. [2018-10-12 20:46:14,796 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-12 20:46:14,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 1375 transitions. [2018-10-12 20:46:14,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1281 [2018-10-12 20:46:14,810 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:46:14,811 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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] [2018-10-12 20:46:14,811 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:46:14,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:46:14,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1289570780, now seen corresponding path program 24 times [2018-10-12 20:46:14,812 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:46:14,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:46:18,803 INFO L134 CoverageAnalysis]: Checked inductivity of 12029 backedges. 7100 proven. 3799 refuted. 0 times theorem prover too weak. 1130 trivial. 0 not checked. [2018-10-12 20:46:18,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:46:18,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-12 20:46:18,805 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-12 20:46:18,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-12 20:46:18,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=1965, Unknown=0, NotChecked=0, Total=2162 [2018-10-12 20:46:18,805 INFO L87 Difference]: Start difference. First operand 1365 states and 1375 transitions. Second operand 47 states. [2018-10-12 20:46:25,908 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2018-10-12 20:46:26,076 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2018-10-12 20:46:26,559 WARN L178 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 56 [2018-10-12 20:46:26,733 WARN L178 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2018-10-12 20:46:27,245 WARN L178 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2018-10-12 20:46:29,241 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2018-10-12 20:46:29,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:46:29,838 INFO L93 Difference]: Finished difference Result 1659 states and 1673 transitions. [2018-10-12 20:46:29,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-12 20:46:29,838 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 1280 [2018-10-12 20:46:29,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:46:29,844 INFO L225 Difference]: With dead ends: 1659 [2018-10-12 20:46:29,844 INFO L226 Difference]: Without dead ends: 1659 [2018-10-12 20:46:29,845 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3616 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=2564, Invalid=12198, Unknown=0, NotChecked=0, Total=14762 [2018-10-12 20:46:29,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1659 states. [2018-10-12 20:46:29,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1659 to 1386. [2018-10-12 20:46:29,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1386 states. [2018-10-12 20:46:29,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 1397 transitions. [2018-10-12 20:46:29,856 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 1397 transitions. Word has length 1280 [2018-10-12 20:46:29,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:46:29,857 INFO L481 AbstractCegarLoop]: Abstraction has 1386 states and 1397 transitions. [2018-10-12 20:46:29,857 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-12 20:46:29,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 1397 transitions. [2018-10-12 20:46:29,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1302 [2018-10-12 20:46:29,871 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:46:29,871 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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] [2018-10-12 20:46:29,872 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:46:29,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:46:29,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1790111505, now seen corresponding path program 25 times [2018-10-12 20:46:29,873 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:46:29,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:46:32,585 INFO L134 CoverageAnalysis]: Checked inductivity of 12607 backedges. 411 proven. 10929 refuted. 0 times theorem prover too weak. 1267 trivial. 0 not checked. [2018-10-12 20:46:32,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:46:32,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-12 20:46:32,587 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-12 20:46:32,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-12 20:46:32,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=970, Unknown=0, NotChecked=0, Total=1122 [2018-10-12 20:46:32,587 INFO L87 Difference]: Start difference. First operand 1386 states and 1397 transitions. Second operand 34 states. [2018-10-12 20:46:36,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:46:36,618 INFO L93 Difference]: Finished difference Result 1793 states and 1807 transitions. [2018-10-12 20:46:36,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-10-12 20:46:36,618 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 1301 [2018-10-12 20:46:36,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:46:36,625 INFO L225 Difference]: With dead ends: 1793 [2018-10-12 20:46:36,626 INFO L226 Difference]: Without dead ends: 1793 [2018-10-12 20:46:36,628 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10596 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=4368, Invalid=23022, Unknown=0, NotChecked=0, Total=27390 [2018-10-12 20:46:36,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1793 states. [2018-10-12 20:46:36,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1793 to 1671. [2018-10-12 20:46:36,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1671 states. [2018-10-12 20:46:36,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 1684 transitions. [2018-10-12 20:46:36,641 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 1684 transitions. Word has length 1301 [2018-10-12 20:46:36,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:46:36,642 INFO L481 AbstractCegarLoop]: Abstraction has 1671 states and 1684 transitions. [2018-10-12 20:46:36,642 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-12 20:46:36,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 1684 transitions. [2018-10-12 20:46:36,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1566 [2018-10-12 20:46:36,656 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:46:36,657 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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] [2018-10-12 20:46:36,657 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:46:36,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:46:36,658 INFO L82 PathProgramCache]: Analyzing trace with hash -73348120, now seen corresponding path program 26 times [2018-10-12 20:46:36,658 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:46:36,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:46:39,307 INFO L134 CoverageAnalysis]: Checked inductivity of 18991 backedges. 13521 proven. 3518 refuted. 0 times theorem prover too weak. 1952 trivial. 0 not checked. [2018-10-12 20:46:39,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:46:39,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-12 20:46:39,309 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-12 20:46:39,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-12 20:46:39,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=857, Unknown=0, NotChecked=0, Total=992 [2018-10-12 20:46:39,309 INFO L87 Difference]: Start difference. First operand 1671 states and 1684 transitions. Second operand 32 states. [2018-10-12 20:46:41,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:46:41,458 INFO L93 Difference]: Finished difference Result 1671 states and 1682 transitions. [2018-10-12 20:46:41,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-12 20:46:41,459 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 1565 [2018-10-12 20:46:41,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:46:41,465 INFO L225 Difference]: With dead ends: 1671 [2018-10-12 20:46:41,466 INFO L226 Difference]: Without dead ends: 1671 [2018-10-12 20:46:41,466 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1133 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1044, Invalid=4358, Unknown=0, NotChecked=0, Total=5402 [2018-10-12 20:46:41,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2018-10-12 20:46:41,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1671. [2018-10-12 20:46:41,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1671 states. [2018-10-12 20:46:41,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 1682 transitions. [2018-10-12 20:46:41,478 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 1682 transitions. Word has length 1565 [2018-10-12 20:46:41,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:46:41,479 INFO L481 AbstractCegarLoop]: Abstraction has 1671 states and 1682 transitions. [2018-10-12 20:46:41,479 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-12 20:46:41,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 1682 transitions. [2018-10-12 20:46:41,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1587 [2018-10-12 20:46:41,494 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:46:41,494 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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] [2018-10-12 20:46:41,495 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:46:41,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:46:41,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1617596717, now seen corresponding path program 27 times [2018-10-12 20:46:41,496 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:46:41,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:46:43,201 INFO L134 CoverageAnalysis]: Checked inductivity of 19717 backedges. 9893 proven. 444 refuted. 0 times theorem prover too weak. 9380 trivial. 0 not checked. [2018-10-12 20:46:43,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:46:43,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-12 20:46:43,202 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-12 20:46:43,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-12 20:46:43,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=808, Unknown=0, NotChecked=0, Total=930 [2018-10-12 20:46:43,203 INFO L87 Difference]: Start difference. First operand 1671 states and 1682 transitions. Second operand 31 states. [2018-10-12 20:46:46,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:46:46,463 INFO L93 Difference]: Finished difference Result 1688 states and 1699 transitions. [2018-10-12 20:46:46,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-12 20:46:46,463 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 1586 [2018-10-12 20:46:46,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:46:46,472 INFO L225 Difference]: With dead ends: 1688 [2018-10-12 20:46:46,472 INFO L226 Difference]: Without dead ends: 1688 [2018-10-12 20:46:46,473 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2218 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1540, Invalid=7202, Unknown=0, NotChecked=0, Total=8742 [2018-10-12 20:46:46,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1688 states. [2018-10-12 20:46:46,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1688 to 1685. [2018-10-12 20:46:46,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1685 states. [2018-10-12 20:46:46,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1685 states to 1685 states and 1696 transitions. [2018-10-12 20:46:46,489 INFO L78 Accepts]: Start accepts. Automaton has 1685 states and 1696 transitions. Word has length 1586 [2018-10-12 20:46:46,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:46:46,490 INFO L481 AbstractCegarLoop]: Abstraction has 1685 states and 1696 transitions. [2018-10-12 20:46:46,491 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-12 20:46:46,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1685 states and 1696 transitions. [2018-10-12 20:46:46,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1601 [2018-10-12 20:46:46,510 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:46:46,511 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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] [2018-10-12 20:46:46,512 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:46:46,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:46:46,512 INFO L82 PathProgramCache]: Analyzing trace with hash -134648340, now seen corresponding path program 28 times [2018-10-12 20:46:46,513 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:46:46,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:46:51,896 INFO L134 CoverageAnalysis]: Checked inductivity of 20103 backedges. 12686 proven. 5567 refuted. 0 times theorem prover too weak. 1850 trivial. 0 not checked. [2018-10-12 20:46:51,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:46:51,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-12 20:46:51,899 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-12 20:46:51,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-12 20:46:51,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=2304, Unknown=0, NotChecked=0, Total=2550 [2018-10-12 20:46:51,900 INFO L87 Difference]: Start difference. First operand 1685 states and 1696 transitions. Second operand 51 states. [2018-10-12 20:46:59,156 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2018-10-12 20:46:59,772 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2018-10-12 20:46:59,927 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2018-10-12 20:47:00,267 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2018-10-12 20:47:00,450 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2018-10-12 20:47:00,879 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2018-10-12 20:47:01,490 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2018-10-12 20:47:02,085 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2018-10-12 20:47:04,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:47:04,176 INFO L93 Difference]: Finished difference Result 2007 states and 2022 transitions. [2018-10-12 20:47:04,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-10-12 20:47:04,176 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 1600 [2018-10-12 20:47:04,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:47:04,183 INFO L225 Difference]: With dead ends: 2007 [2018-10-12 20:47:04,183 INFO L226 Difference]: Without dead ends: 2007 [2018-10-12 20:47:04,184 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4534 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=3237, Invalid=14853, Unknown=0, NotChecked=0, Total=18090 [2018-10-12 20:47:04,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2007 states. [2018-10-12 20:47:04,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2007 to 1706. [2018-10-12 20:47:04,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1706 states. [2018-10-12 20:47:04,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1706 states to 1706 states and 1718 transitions. [2018-10-12 20:47:04,197 INFO L78 Accepts]: Start accepts. Automaton has 1706 states and 1718 transitions. Word has length 1600 [2018-10-12 20:47:04,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:47:04,199 INFO L481 AbstractCegarLoop]: Abstraction has 1706 states and 1718 transitions. [2018-10-12 20:47:04,199 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-12 20:47:04,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 1718 transitions. [2018-10-12 20:47:04,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1622 [2018-10-12 20:47:04,214 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:47:04,215 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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] [2018-10-12 20:47:04,215 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:47:04,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:47:04,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1068561665, now seen corresponding path program 29 times [2018-10-12 20:47:04,216 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:47:04,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:47:07,087 INFO L134 CoverageAnalysis]: Checked inductivity of 20850 backedges. 563 proven. 18271 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2018-10-12 20:47:07,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:47:07,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-12 20:47:07,089 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-12 20:47:07,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-12 20:47:07,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1218, Unknown=0, NotChecked=0, Total=1406 [2018-10-12 20:47:07,090 INFO L87 Difference]: Start difference. First operand 1706 states and 1718 transitions. Second operand 38 states. [2018-10-12 20:47:10,266 WARN L178 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-12 20:47:12,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:47:12,660 INFO L93 Difference]: Finished difference Result 2162 states and 2177 transitions. [2018-10-12 20:47:12,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2018-10-12 20:47:12,667 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 1621 [2018-10-12 20:47:12,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:47:12,674 INFO L225 Difference]: With dead ends: 2162 [2018-10-12 20:47:12,675 INFO L226 Difference]: Without dead ends: 2162 [2018-10-12 20:47:12,677 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15979 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=6138, Invalid=33662, Unknown=0, NotChecked=0, Total=39800 [2018-10-12 20:47:12,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2162 states. [2018-10-12 20:47:12,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2162 to 2026. [2018-10-12 20:47:12,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2026 states. [2018-10-12 20:47:12,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2026 states to 2026 states and 2040 transitions. [2018-10-12 20:47:12,695 INFO L78 Accepts]: Start accepts. Automaton has 2026 states and 2040 transitions. Word has length 1621 [2018-10-12 20:47:12,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:47:12,696 INFO L481 AbstractCegarLoop]: Abstraction has 2026 states and 2040 transitions. [2018-10-12 20:47:12,697 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-12 20:47:12,697 INFO L276 IsEmpty]: Start isEmpty. Operand 2026 states and 2040 transitions. [2018-10-12 20:47:12,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1921 [2018-10-12 20:47:12,721 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:47:12,722 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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] [2018-10-12 20:47:12,722 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:47:12,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:47:12,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1346257956, now seen corresponding path program 30 times [2018-10-12 20:47:12,723 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:47:12,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:47:15,802 INFO L134 CoverageAnalysis]: Checked inductivity of 30291 backedges. 22133 proven. 5221 refuted. 0 times theorem prover too weak. 2937 trivial. 0 not checked. [2018-10-12 20:47:15,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:47:15,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-12 20:47:15,804 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-12 20:47:15,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-12 20:47:15,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1091, Unknown=0, NotChecked=0, Total=1260 [2018-10-12 20:47:15,804 INFO L87 Difference]: Start difference. First operand 2026 states and 2040 transitions. Second operand 36 states. [2018-10-12 20:47:18,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:47:18,378 INFO L93 Difference]: Finished difference Result 2026 states and 2038 transitions. [2018-10-12 20:47:18,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-12 20:47:18,378 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 1920 [2018-10-12 20:47:18,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:47:18,384 INFO L225 Difference]: With dead ends: 2026 [2018-10-12 20:47:18,384 INFO L226 Difference]: Without dead ends: 2026 [2018-10-12 20:47:18,385 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:18,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2026 states. [2018-10-12 20:47:18,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2026 to 2026. [2018-10-12 20:47:18,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2026 states. [2018-10-12 20:47:18,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2026 states to 2026 states and 2038 transitions. [2018-10-12 20:47:18,402 INFO L78 Accepts]: Start accepts. Automaton has 2026 states and 2038 transitions. Word has length 1920 [2018-10-12 20:47:18,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:47:18,403 INFO L481 AbstractCegarLoop]: Abstraction has 2026 states and 2038 transitions. [2018-10-12 20:47:18,403 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-12 20:47:18,403 INFO L276 IsEmpty]: Start isEmpty. Operand 2026 states and 2038 transitions. [2018-10-12 20:47:18,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1942 [2018-10-12 20:47:18,427 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:47:18,428 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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] [2018-10-12 20:47:18,428 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:47:18,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:47:18,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1625914097, now seen corresponding path program 31 times [2018-10-12 20:47:18,429 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:47:18,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:47:21,183 INFO L134 CoverageAnalysis]: Checked inductivity of 31207 backedges. 14675 proven. 570 refuted. 0 times theorem prover too weak. 15962 trivial. 0 not checked. [2018-10-12 20:47:21,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:47:21,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-12 20:47:21,184 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-12 20:47:21,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-12 20:47:21,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1036, Unknown=0, NotChecked=0, Total=1190 [2018-10-12 20:47:21,184 INFO L87 Difference]: Start difference. First operand 2026 states and 2038 transitions. Second operand 35 states. [2018-10-12 20:47:25,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:47:25,019 INFO L93 Difference]: Finished difference Result 2043 states and 2055 transitions. [2018-10-12 20:47:25,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-12 20:47:25,020 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 1941 [2018-10-12 20:47:25,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:47:25,025 INFO L225 Difference]: With dead ends: 2043 [2018-10-12 20:47:25,025 INFO L226 Difference]: Without dead ends: 2043 [2018-10-12 20:47:25,026 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2936 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1994, Invalid=9348, Unknown=0, NotChecked=0, Total=11342 [2018-10-12 20:47:25,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2043 states. [2018-10-12 20:47:25,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2043 to 2040. [2018-10-12 20:47:25,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2040 states. [2018-10-12 20:47:25,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2040 states to 2040 states and 2052 transitions. [2018-10-12 20:47:25,040 INFO L78 Accepts]: Start accepts. Automaton has 2040 states and 2052 transitions. Word has length 1941 [2018-10-12 20:47:25,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:47:25,041 INFO L481 AbstractCegarLoop]: Abstraction has 2040 states and 2052 transitions. [2018-10-12 20:47:25,042 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-12 20:47:25,042 INFO L276 IsEmpty]: Start isEmpty. Operand 2040 states and 2052 transitions. [2018-10-12 20:47:25,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1956 [2018-10-12 20:47:25,064 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:47:25,065 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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] [2018-10-12 20:47:25,065 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:47:25,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:47:25,066 INFO L82 PathProgramCache]: Analyzing trace with hash -488605384, now seen corresponding path program 32 times [2018-10-12 20:47:25,067 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:47:25,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:47:32,492 INFO L134 CoverageAnalysis]: Checked inductivity of 31706 backedges. 21063 proven. 7826 refuted. 0 times theorem prover too weak. 2817 trivial. 0 not checked. [2018-10-12 20:47:32,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:47:32,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-12 20:47:32,494 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-12 20:47:32,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-12 20:47:32,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=2524, Unknown=0, NotChecked=0, Total=2756 [2018-10-12 20:47:32,495 INFO L87 Difference]: Start difference. First operand 2040 states and 2052 transitions. Second operand 53 states. [2018-10-12 20:47:43,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:47:43,809 INFO L93 Difference]: Finished difference Result 2390 states and 2406 transitions. [2018-10-12 20:47:43,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-12 20:47:43,809 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 1955 [2018-10-12 20:47:43,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:47:43,813 INFO L225 Difference]: With dead ends: 2390 [2018-10-12 20:47:43,813 INFO L226 Difference]: Without dead ends: 2390 [2018-10-12 20:47:43,815 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5011 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=2921, Invalid=15985, Unknown=0, NotChecked=0, Total=18906 [2018-10-12 20:47:43,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2390 states. [2018-10-12 20:47:43,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2390 to 2061. [2018-10-12 20:47:43,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2061 states. [2018-10-12 20:47:43,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2061 states to 2061 states and 2074 transitions. [2018-10-12 20:47:43,829 INFO L78 Accepts]: Start accepts. Automaton has 2061 states and 2074 transitions. Word has length 1955 [2018-10-12 20:47:43,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:47:43,830 INFO L481 AbstractCegarLoop]: Abstraction has 2061 states and 2074 transitions. [2018-10-12 20:47:43,830 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-12 20:47:43,830 INFO L276 IsEmpty]: Start isEmpty. Operand 2061 states and 2074 transitions. [2018-10-12 20:47:43,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1977 [2018-10-12 20:47:43,856 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:47:43,857 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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] [2018-10-12 20:47:43,857 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:47:43,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:47:43,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1444794059, now seen corresponding path program 33 times [2018-10-12 20:47:43,859 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:47:43,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:47:47,203 INFO L134 CoverageAnalysis]: Checked inductivity of 32643 backedges. 739 proven. 28892 refuted. 0 times theorem prover too weak. 3012 trivial. 0 not checked. [2018-10-12 20:47:47,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:47:47,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-12 20:47:47,204 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-12 20:47:47,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-12 20:47:47,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=1494, Unknown=0, NotChecked=0, Total=1722 [2018-10-12 20:47:47,205 INFO L87 Difference]: Start difference. First operand 2061 states and 2074 transitions. Second operand 42 states. [2018-10-12 20:47:53,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:47:53,660 INFO L93 Difference]: Finished difference Result 2566 states and 2582 transitions. [2018-10-12 20:47:53,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 199 states. [2018-10-12 20:47:53,665 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 1976 [2018-10-12 20:47:53,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:47:53,670 INFO L225 Difference]: With dead ends: 2566 [2018-10-12 20:47:53,670 INFO L226 Difference]: Without dead ends: 2566 [2018-10-12 20:47:53,675 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23172 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=8396, Invalid=47536, Unknown=0, NotChecked=0, Total=55932 [2018-10-12 20:47:53,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2566 states. [2018-10-12 20:47:53,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2566 to 2416. [2018-10-12 20:47:53,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2416 states. [2018-10-12 20:47:53,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2416 states to 2416 states and 2431 transitions. [2018-10-12 20:47:53,695 INFO L78 Accepts]: Start accepts. Automaton has 2416 states and 2431 transitions. Word has length 1976 [2018-10-12 20:47:53,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:47:53,696 INFO L481 AbstractCegarLoop]: Abstraction has 2416 states and 2431 transitions. [2018-10-12 20:47:53,696 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-12 20:47:53,697 INFO L276 IsEmpty]: Start isEmpty. Operand 2416 states and 2431 transitions. [2018-10-12 20:47:53,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2311 [2018-10-12 20:47:53,735 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:47:53,736 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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] [2018-10-12 20:47:53,737 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:47:53,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:47:53,737 INFO L82 PathProgramCache]: Analyzing trace with hash -2090704482, now seen corresponding path program 34 times [2018-10-12 20:47:53,738 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:47:53,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:47:57,565 INFO L134 CoverageAnalysis]: Checked inductivity of 45994 backedges. 34378 proven. 7412 refuted. 0 times theorem prover too weak. 4204 trivial. 0 not checked. [2018-10-12 20:47:57,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:47:57,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-12 20:47:57,567 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-12 20:47:57,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-12 20:47:57,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1353, Unknown=0, NotChecked=0, Total=1560 [2018-10-12 20:47:57,567 INFO L87 Difference]: Start difference. First operand 2416 states and 2431 transitions. Second operand 40 states. [2018-10-12 20:48:00,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:48:00,659 INFO L93 Difference]: Finished difference Result 2416 states and 2429 transitions. [2018-10-12 20:48:00,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-12 20:48:00,660 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 2310 [2018-10-12 20:48:00,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:48:00,666 INFO L225 Difference]: With dead ends: 2416 [2018-10-12 20:48:00,666 INFO L226 Difference]: Without dead ends: 2416 [2018-10-12 20:48:00,667 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1916 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1680, Invalid=7062, Unknown=0, NotChecked=0, Total=8742 [2018-10-12 20:48:00,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2416 states. [2018-10-12 20:48:00,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2416 to 2416. [2018-10-12 20:48:00,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2416 states. [2018-10-12 20:48:00,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2416 states to 2416 states and 2429 transitions. [2018-10-12 20:48:00,686 INFO L78 Accepts]: Start accepts. Automaton has 2416 states and 2429 transitions. Word has length 2310 [2018-10-12 20:48:00,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:48:00,687 INFO L481 AbstractCegarLoop]: Abstraction has 2416 states and 2429 transitions. [2018-10-12 20:48:00,687 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-12 20:48:00,687 INFO L276 IsEmpty]: Start isEmpty. Operand 2416 states and 2429 transitions. [2018-10-12 20:48:00,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2332 [2018-10-12 20:48:00,735 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:48:00,736 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 55, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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] [2018-10-12 20:48:00,737 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:48:00,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:48:00,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1740830591, now seen corresponding path program 35 times [2018-10-12 20:48:00,738 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:48:00,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:48:03,923 INFO L134 CoverageAnalysis]: Checked inductivity of 47121 backedges. 20806 proven. 710 refuted. 0 times theorem prover too weak. 25605 trivial. 0 not checked. [2018-10-12 20:48:03,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:48:03,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-12 20:48:03,925 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-12 20:48:03,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-12 20:48:03,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1292, Unknown=0, NotChecked=0, Total=1482 [2018-10-12 20:48:03,925 INFO L87 Difference]: Start difference. First operand 2416 states and 2429 transitions. Second operand 39 states. [2018-10-12 20:48:07,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:48:07,265 INFO L93 Difference]: Finished difference Result 2433 states and 2446 transitions. [2018-10-12 20:48:07,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-10-12 20:48:07,266 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 2331 [2018-10-12 20:48:07,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:48:07,272 INFO L225 Difference]: With dead ends: 2433 [2018-10-12 20:48:07,272 INFO L226 Difference]: Without dead ends: 2433 [2018-10-12 20:48:07,273 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3754 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2508, Invalid=11772, Unknown=0, NotChecked=0, Total=14280 [2018-10-12 20:48:07,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2433 states. [2018-10-12 20:48:07,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2433 to 2430. [2018-10-12 20:48:07,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2430 states. [2018-10-12 20:48:07,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2430 states to 2430 states and 2443 transitions. [2018-10-12 20:48:07,293 INFO L78 Accepts]: Start accepts. Automaton has 2430 states and 2443 transitions. Word has length 2331 [2018-10-12 20:48:07,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:48:07,294 INFO L481 AbstractCegarLoop]: Abstraction has 2430 states and 2443 transitions. [2018-10-12 20:48:07,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-12 20:48:07,294 INFO L276 IsEmpty]: Start isEmpty. Operand 2430 states and 2443 transitions. [2018-10-12 20:48:07,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2346 [2018-10-12 20:48:07,335 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:48:07,336 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 55, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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] [2018-10-12 20:48:07,336 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:48:07,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:48:07,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1742551002, now seen corresponding path program 36 times [2018-10-12 20:48:07,338 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:48:07,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:48:17,001 INFO L134 CoverageAnalysis]: Checked inductivity of 47747 backedges. 33042 proven. 10639 refuted. 0 times theorem prover too weak. 4066 trivial. 0 not checked. [2018-10-12 20:48:17,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:48:17,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-10-12 20:48:17,002 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-12 20:48:17,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-12 20:48:17,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=3201, Unknown=0, NotChecked=0, Total=3540 [2018-10-12 20:48:17,003 INFO L87 Difference]: Start difference. First operand 2430 states and 2443 transitions. Second operand 60 states. [2018-10-12 20:48:26,577 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2018-10-12 20:48:26,767 WARN L178 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2018-10-12 20:48:26,960 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2018-10-12 20:48:27,296 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2018-10-12 20:48:27,440 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2018-10-12 20:48:27,876 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2018-10-12 20:48:28,521 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2018-10-12 20:48:28,678 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2018-10-12 20:48:29,131 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2018-10-12 20:48:29,302 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2018-10-12 20:48:29,762 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2018-10-12 20:48:29,937 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2018-10-12 20:48:30,421 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2018-10-12 20:48:33,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:48:33,540 INFO L93 Difference]: Finished difference Result 2808 states and 2825 transitions. [2018-10-12 20:48:33,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-10-12 20:48:33,540 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 2345 [2018-10-12 20:48:33,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:48:33,544 INFO L225 Difference]: With dead ends: 2808 [2018-10-12 20:48:33,544 INFO L226 Difference]: Without dead ends: 2808 [2018-10-12 20:48:33,546 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6381 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=4404, Invalid=20402, Unknown=0, NotChecked=0, Total=24806 [2018-10-12 20:48:33,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2808 states. [2018-10-12 20:48:33,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2808 to 2451. [2018-10-12 20:48:33,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2451 states. [2018-10-12 20:48:33,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2451 states to 2451 states and 2465 transitions. [2018-10-12 20:48:33,565 INFO L78 Accepts]: Start accepts. Automaton has 2451 states and 2465 transitions. Word has length 2345 [2018-10-12 20:48:33,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:48:33,567 INFO L481 AbstractCegarLoop]: Abstraction has 2451 states and 2465 transitions. [2018-10-12 20:48:33,567 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-12 20:48:33,567 INFO L276 IsEmpty]: Start isEmpty. Operand 2451 states and 2465 transitions. [2018-10-12 20:48:33,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2367 [2018-10-12 20:48:33,616 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:48:33,617 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 56, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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] [2018-10-12 20:48:33,618 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:48:33,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:48:33,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1148695597, now seen corresponding path program 37 times [2018-10-12 20:48:33,619 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:48:33,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:48:37,949 INFO L134 CoverageAnalysis]: Checked inductivity of 48895 backedges. 939 proven. 43666 refuted. 0 times theorem prover too weak. 4290 trivial. 0 not checked. [2018-10-12 20:48:37,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:48:37,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-12 20:48:37,951 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-12 20:48:37,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-12 20:48:37,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=1798, Unknown=0, NotChecked=0, Total=2070 [2018-10-12 20:48:37,952 INFO L87 Difference]: Start difference. First operand 2451 states and 2465 transitions. Second operand 46 states. [2018-10-12 20:48:45,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:48:45,414 INFO L93 Difference]: Finished difference Result 3005 states and 3022 transitions. [2018-10-12 20:48:45,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 235 states. [2018-10-12 20:48:45,415 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 2366 [2018-10-12 20:48:45,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:48:45,419 INFO L225 Difference]: With dead ends: 3005 [2018-10-12 20:48:45,419 INFO L226 Difference]: Without dead ends: 3005 [2018-10-12 20:48:45,423 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 275 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32541 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=11226, Invalid=65226, Unknown=0, NotChecked=0, Total=76452 [2018-10-12 20:48:45,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3005 states. [2018-10-12 20:48:45,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3005 to 2841. [2018-10-12 20:48:45,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2841 states. [2018-10-12 20:48:45,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2841 states to 2841 states and 2857 transitions. [2018-10-12 20:48:45,445 INFO L78 Accepts]: Start accepts. Automaton has 2841 states and 2857 transitions. Word has length 2366 [2018-10-12 20:48:45,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:48:45,447 INFO L481 AbstractCegarLoop]: Abstraction has 2841 states and 2857 transitions. [2018-10-12 20:48:45,447 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-12 20:48:45,447 INFO L276 IsEmpty]: Start isEmpty. Operand 2841 states and 2857 transitions. [2018-10-12 20:48:45,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2736 [2018-10-12 20:48:45,506 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:48:45,507 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 65, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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] [2018-10-12 20:48:45,507 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:48:45,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:48:45,508 INFO L82 PathProgramCache]: Analyzing trace with hash -414117192, now seen corresponding path program 38 times [2018-10-12 20:48:45,509 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:48:45,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:48:50,714 INFO L134 CoverageAnalysis]: Checked inductivity of 67114 backedges. 51172 proven. 10154 refuted. 0 times theorem prover too weak. 5788 trivial. 0 not checked. [2018-10-12 20:48:50,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:48:50,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-12 20:48:50,716 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-12 20:48:50,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-12 20:48:50,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=1643, Unknown=0, NotChecked=0, Total=1892 [2018-10-12 20:48:50,716 INFO L87 Difference]: Start difference. First operand 2841 states and 2857 transitions. Second operand 44 states. [2018-10-12 20:48:54,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:48:54,673 INFO L93 Difference]: Finished difference Result 2841 states and 2855 transitions. [2018-10-12 20:48:54,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-12 20:48:54,673 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 2735 [2018-10-12 20:48:54,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:48:54,677 INFO L225 Difference]: With dead ends: 2841 [2018-10-12 20:48:54,677 INFO L226 Difference]: Without dead ends: 2841 [2018-10-12 20:48:54,678 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2384 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2055, Invalid=8657, Unknown=0, NotChecked=0, Total=10712 [2018-10-12 20:48:54,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2841 states. [2018-10-12 20:48:54,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2841 to 2841. [2018-10-12 20:48:54,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2841 states. [2018-10-12 20:48:54,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2841 states to 2841 states and 2855 transitions. [2018-10-12 20:48:54,693 INFO L78 Accepts]: Start accepts. Automaton has 2841 states and 2855 transitions. Word has length 2735 [2018-10-12 20:48:54,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:48:54,694 INFO L481 AbstractCegarLoop]: Abstraction has 2841 states and 2855 transitions. [2018-10-12 20:48:54,694 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-12 20:48:54,694 INFO L276 IsEmpty]: Start isEmpty. Operand 2841 states and 2855 transitions. [2018-10-12 20:48:54,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2757 [2018-10-12 20:48:54,735 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:48:54,736 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 66, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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] [2018-10-12 20:48:54,736 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:48:54,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:48:54,737 INFO L82 PathProgramCache]: Analyzing trace with hash 262920177, now seen corresponding path program 39 times [2018-10-12 20:48:54,737 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:48:54,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:48:58,445 INFO L134 CoverageAnalysis]: Checked inductivity of 68473 backedges. 28454 proven. 864 refuted. 0 times theorem prover too weak. 39155 trivial. 0 not checked. [2018-10-12 20:48:58,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:48:58,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-12 20:48:58,446 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-12 20:48:58,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-12 20:48:58,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=1576, Unknown=0, NotChecked=0, Total=1806 [2018-10-12 20:48:58,447 INFO L87 Difference]: Start difference. First operand 2841 states and 2855 transitions. Second operand 43 states. [2018-10-12 20:49:02,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:49:02,067 INFO L93 Difference]: Finished difference Result 2858 states and 2872 transitions. [2018-10-12 20:49:02,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-10-12 20:49:02,067 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 2756 [2018-10-12 20:49:02,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:49:02,071 INFO L225 Difference]: With dead ends: 2858 [2018-10-12 20:49:02,071 INFO L226 Difference]: Without dead ends: 2858 [2018-10-12 20:49:02,073 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4672 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3082, Invalid=14474, Unknown=0, NotChecked=0, Total=17556 [2018-10-12 20:49:02,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2858 states. [2018-10-12 20:49:02,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2858 to 2855. [2018-10-12 20:49:02,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2855 states. [2018-10-12 20:49:02,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2855 states to 2855 states and 2869 transitions. [2018-10-12 20:49:02,088 INFO L78 Accepts]: Start accepts. Automaton has 2855 states and 2869 transitions. Word has length 2756 [2018-10-12 20:49:02,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:49:02,089 INFO L481 AbstractCegarLoop]: Abstraction has 2855 states and 2869 transitions. [2018-10-12 20:49:02,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-12 20:49:02,089 INFO L276 IsEmpty]: Start isEmpty. Operand 2855 states and 2869 transitions. [2018-10-12 20:49:02,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2771 [2018-10-12 20:49:02,128 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:49:02,129 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 66, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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] [2018-10-12 20:49:02,129 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:49:02,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:49:02,130 INFO L82 PathProgramCache]: Analyzing trace with hash 770790776, now seen corresponding path program 40 times [2018-10-12 20:49:02,131 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:49:02,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:49:15,019 INFO L134 CoverageAnalysis]: Checked inductivity of 69240 backedges. 49539 proven. 14069 refuted. 0 times theorem prover too weak. 5632 trivial. 0 not checked. [2018-10-12 20:49:15,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:49:15,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-10-12 20:49:15,021 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-12 20:49:15,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-12 20:49:15,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=3662, Unknown=0, NotChecked=0, Total=4032 [2018-10-12 20:49:15,021 INFO L87 Difference]: Start difference. First operand 2855 states and 2869 transitions. Second operand 64 states. [2018-10-12 20:49:26,546 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2018-10-12 20:49:26,713 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2018-10-12 20:49:27,225 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2018-10-12 20:49:27,390 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2018-10-12 20:49:27,858 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2018-10-12 20:49:28,029 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2018-10-12 20:49:28,183 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2018-10-12 20:49:28,376 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2018-10-12 20:49:28,592 WARN L178 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2018-10-12 20:49:28,763 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2018-10-12 20:49:29,257 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2018-10-12 20:49:29,438 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2018-10-12 20:49:29,954 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2018-10-12 20:49:30,146 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2018-10-12 20:49:30,670 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2018-10-12 20:49:30,856 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2018-10-12 20:49:33,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:49:33,826 INFO L93 Difference]: Finished difference Result 3261 states and 3279 transitions. [2018-10-12 20:49:33,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-10-12 20:49:33,827 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 2770 [2018-10-12 20:49:33,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:49:33,830 INFO L225 Difference]: With dead ends: 3261 [2018-10-12 20:49:33,830 INFO L226 Difference]: Without dead ends: 3261 [2018-10-12 20:49:33,832 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7120 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=4810, Invalid=22912, Unknown=0, NotChecked=0, Total=27722 [2018-10-12 20:49:33,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3261 states. [2018-10-12 20:49:33,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3261 to 2876. [2018-10-12 20:49:33,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2876 states. [2018-10-12 20:49:33,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2876 states to 2876 states and 2891 transitions. [2018-10-12 20:49:33,851 INFO L78 Accepts]: Start accepts. Automaton has 2876 states and 2891 transitions. Word has length 2770 [2018-10-12 20:49:33,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:49:33,852 INFO L481 AbstractCegarLoop]: Abstraction has 2876 states and 2891 transitions. [2018-10-12 20:49:33,852 INFO L482 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-12 20:49:33,852 INFO L276 IsEmpty]: Start isEmpty. Operand 2876 states and 2891 transitions. [2018-10-12 20:49:33,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2792 [2018-10-12 20:49:33,898 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:49:33,899 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 67, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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] [2018-10-12 20:49:33,899 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:49:33,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:49:33,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1990294773, now seen corresponding path program 41 times [2018-10-12 20:49:33,900 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:49:34,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:49:40,077 INFO L134 CoverageAnalysis]: Checked inductivity of 70620 backedges. 1163 proven. 63572 refuted. 0 times theorem prover too weak. 5885 trivial. 0 not checked. [2018-10-12 20:49:40,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:49:40,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-12 20:49:40,078 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-12 20:49:40,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-12 20:49:40,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=2130, Unknown=0, NotChecked=0, Total=2450 [2018-10-12 20:49:40,079 INFO L87 Difference]: Start difference. First operand 2876 states and 2891 transitions. Second operand 50 states. [2018-10-12 20:49:44,907 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-12 20:49:50,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:49:50,010 INFO L93 Difference]: Finished difference Result 3479 states and 3497 transitions. [2018-10-12 20:49:50,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 274 states. [2018-10-12 20:49:50,010 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 2791 [2018-10-12 20:49:50,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:49:50,014 INFO L225 Difference]: With dead ends: 3479 [2018-10-12 20:49:50,014 INFO L226 Difference]: Without dead ends: 3479 [2018-10-12 20:49:50,019 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 318 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44486 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=14719, Invalid=87361, Unknown=0, NotChecked=0, Total=102080 [2018-10-12 20:49:50,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3479 states. [2018-10-12 20:49:50,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3479 to 3301. [2018-10-12 20:49:50,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3301 states. [2018-10-12 20:49:50,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3301 states to 3301 states and 3318 transitions. [2018-10-12 20:49:50,034 INFO L78 Accepts]: Start accepts. Automaton has 3301 states and 3318 transitions. Word has length 2791 [2018-10-12 20:49:50,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:49:50,035 INFO L481 AbstractCegarLoop]: Abstraction has 3301 states and 3318 transitions. [2018-10-12 20:49:50,035 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-12 20:49:50,035 INFO L276 IsEmpty]: Start isEmpty. Operand 3301 states and 3318 transitions. [2018-10-12 20:49:50,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3196 [2018-10-12 20:49:50,087 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:49:50,088 INFO L375 BasicCegarLoop]: trace histogram [77, 77, 77, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 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] [2018-10-12 20:49:50,089 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:49:50,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:49:50,089 INFO L82 PathProgramCache]: Analyzing trace with hash 243384560, now seen corresponding path program 42 times [2018-10-12 20:49:50,090 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:49:50,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:49:57,215 INFO L134 CoverageAnalysis]: Checked inductivity of 94770 backedges. 73536 proven. 13510 refuted. 0 times theorem prover too weak. 7724 trivial. 0 not checked. [2018-10-12 20:49:57,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:49:57,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-12 20:49:57,217 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-12 20:49:57,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-12 20:49:57,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=1961, Unknown=0, NotChecked=0, Total=2256 [2018-10-12 20:49:57,218 INFO L87 Difference]: Start difference. First operand 3301 states and 3318 transitions. Second operand 48 states. [2018-10-12 20:50:00,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:50:00,725 INFO L93 Difference]: Finished difference Result 3301 states and 3316 transitions. [2018-10-12 20:50:00,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-12 20:50:00,726 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 3195 [2018-10-12 20:50:00,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:50:00,731 INFO L225 Difference]: With dead ends: 3301 [2018-10-12 20:50:00,731 INFO L226 Difference]: Without dead ends: 3301 [2018-10-12 20:50:00,733 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2903 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2468, Invalid=10414, Unknown=0, NotChecked=0, Total=12882 [2018-10-12 20:50:00,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3301 states. [2018-10-12 20:50:00,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3301 to 3301. [2018-10-12 20:50:00,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3301 states. [2018-10-12 20:50:00,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3301 states to 3301 states and 3316 transitions. [2018-10-12 20:50:00,752 INFO L78 Accepts]: Start accepts. Automaton has 3301 states and 3316 transitions. Word has length 3195 [2018-10-12 20:50:00,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:50:00,753 INFO L481 AbstractCegarLoop]: Abstraction has 3301 states and 3316 transitions. [2018-10-12 20:50:00,753 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-12 20:50:00,753 INFO L276 IsEmpty]: Start isEmpty. Operand 3301 states and 3316 transitions. [2018-10-12 20:50:00,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3217 [2018-10-12 20:50:00,810 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:50:00,812 INFO L375 BasicCegarLoop]: trace histogram [78, 78, 78, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 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] [2018-10-12 20:50:00,812 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:50:00,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:50:00,813 INFO L82 PathProgramCache]: Analyzing trace with hash 183818771, now seen corresponding path program 43 times [2018-10-12 20:50:00,813 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:50:00,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:50:05,786 INFO L134 CoverageAnalysis]: Checked inductivity of 96382 backedges. 37787 proven. 1032 refuted. 0 times theorem prover too weak. 57563 trivial. 0 not checked. [2018-10-12 20:50:05,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:50:05,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-12 20:50:05,788 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-12 20:50:05,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-12 20:50:05,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=1888, Unknown=0, NotChecked=0, Total=2162 [2018-10-12 20:50:05,789 INFO L87 Difference]: Start difference. First operand 3301 states and 3316 transitions. Second operand 47 states. [2018-10-12 20:50:10,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:50:10,514 INFO L93 Difference]: Finished difference Result 3318 states and 3333 transitions. [2018-10-12 20:50:10,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-10-12 20:50:10,515 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 3216 [2018-10-12 20:50:10,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:50:10,519 INFO L225 Difference]: With dead ends: 3318 [2018-10-12 20:50:10,519 INFO L226 Difference]: Without dead ends: 3318 [2018-10-12 20:50:10,520 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5690 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3716, Invalid=17454, Unknown=0, NotChecked=0, Total=21170 [2018-10-12 20:50:10,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3318 states. [2018-10-12 20:50:10,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3318 to 3315. [2018-10-12 20:50:10,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3315 states. [2018-10-12 20:50:10,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3315 states to 3315 states and 3330 transitions. [2018-10-12 20:50:10,539 INFO L78 Accepts]: Start accepts. Automaton has 3315 states and 3330 transitions. Word has length 3216 [2018-10-12 20:50:10,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:50:10,540 INFO L481 AbstractCegarLoop]: Abstraction has 3315 states and 3330 transitions. [2018-10-12 20:50:10,540 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-12 20:50:10,541 INFO L276 IsEmpty]: Start isEmpty. Operand 3315 states and 3330 transitions. [2018-10-12 20:50:10,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3231 [2018-10-12 20:50:10,601 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:50:10,602 INFO L375 BasicCegarLoop]: trace histogram [78, 78, 78, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 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] [2018-10-12 20:50:10,602 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:50:10,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:50:10,603 INFO L82 PathProgramCache]: Analyzing trace with hash 981248684, now seen corresponding path program 44 times [2018-10-12 20:50:10,604 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:50:10,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:50:27,035 INFO L134 CoverageAnalysis]: Checked inductivity of 97304 backedges. 71575 proven. 18179 refuted. 0 times theorem prover too weak. 7550 trivial. 0 not checked. [2018-10-12 20:50:27,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:50:27,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-10-12 20:50:27,037 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-12 20:50:27,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-12 20:50:27,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=443, Invalid=4113, Unknown=0, NotChecked=0, Total=4556 [2018-10-12 20:50:27,038 INFO L87 Difference]: Start difference. First operand 3315 states and 3330 transitions. Second operand 68 states. [2018-10-12 20:50:37,895 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2018-10-12 20:50:38,355 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2018-10-12 20:50:38,829 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2018-10-12 20:50:39,444 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2018-10-12 20:50:39,601 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2018-10-12 20:50:39,902 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2018-10-12 20:50:40,140 WARN L178 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2018-10-12 20:50:40,304 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2018-10-12 20:50:40,771 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2018-10-12 20:50:40,941 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2018-10-12 20:50:41,427 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2018-10-12 20:50:41,605 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2018-10-12 20:50:42,084 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2018-10-12 20:50:42,266 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2018-10-12 20:50:42,757 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2018-10-12 20:50:42,938 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2018-10-12 20:50:43,452 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2018-10-12 20:50:46,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:50:46,741 INFO L93 Difference]: Finished difference Result 3749 states and 3768 transitions. [2018-10-12 20:50:46,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-10-12 20:50:46,741 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 3230 [2018-10-12 20:50:46,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:50:46,745 INFO L225 Difference]: With dead ends: 3749 [2018-10-12 20:50:46,746 INFO L226 Difference]: Without dead ends: 3749 [2018-10-12 20:50:46,747 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8379 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=5739, Invalid=26481, Unknown=0, NotChecked=0, Total=32220 [2018-10-12 20:50:46,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3749 states. [2018-10-12 20:50:46,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3749 to 3336. [2018-10-12 20:50:46,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3336 states. [2018-10-12 20:50:46,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3336 states to 3336 states and 3352 transitions. [2018-10-12 20:50:46,762 INFO L78 Accepts]: Start accepts. Automaton has 3336 states and 3352 transitions. Word has length 3230 [2018-10-12 20:50:46,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:50:46,764 INFO L481 AbstractCegarLoop]: Abstraction has 3336 states and 3352 transitions. [2018-10-12 20:50:46,764 INFO L482 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-12 20:50:46,764 INFO L276 IsEmpty]: Start isEmpty. Operand 3336 states and 3352 transitions. [2018-10-12 20:50:46,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3252 [2018-10-12 20:50:46,818 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:50:46,819 INFO L375 BasicCegarLoop]: trace histogram [79, 79, 79, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 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] [2018-10-12 20:50:46,819 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:50:46,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:50:46,820 INFO L82 PathProgramCache]: Analyzing trace with hash -115920831, now seen corresponding path program 45 times [2018-10-12 20:50:46,820 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:50:46,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:50:54,650 INFO L134 CoverageAnalysis]: Checked inductivity of 98937 backedges. 1411 proven. 89694 refuted. 0 times theorem prover too weak. 7832 trivial. 0 not checked. [2018-10-12 20:50:54,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:50:54,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-12 20:50:54,652 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-12 20:50:54,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-12 20:50:54,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=372, Invalid=2490, Unknown=0, NotChecked=0, Total=2862 [2018-10-12 20:50:54,653 INFO L87 Difference]: Start difference. First operand 3336 states and 3352 transitions. Second operand 54 states. [2018-10-12 20:51:06,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:51:06,461 INFO L93 Difference]: Finished difference Result 3988 states and 4007 transitions. [2018-10-12 20:51:06,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 316 states. [2018-10-12 20:51:06,462 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 3251 [2018-10-12 20:51:06,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:51:06,466 INFO L225 Difference]: With dead ends: 3988 [2018-10-12 20:51:06,466 INFO L226 Difference]: Without dead ends: 3988 [2018-10-12 20:51:06,476 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 364 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59441 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=18973, Invalid=114617, Unknown=0, NotChecked=0, Total=133590 [2018-10-12 20:51:06,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3988 states. [2018-10-12 20:51:06,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3988 to 3796. [2018-10-12 20:51:06,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3796 states. [2018-10-12 20:51:06,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3796 states to 3796 states and 3814 transitions. [2018-10-12 20:51:06,496 INFO L78 Accepts]: Start accepts. Automaton has 3796 states and 3814 transitions. Word has length 3251 [2018-10-12 20:51:06,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:51:06,497 INFO L481 AbstractCegarLoop]: Abstraction has 3796 states and 3814 transitions. [2018-10-12 20:51:06,497 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-12 20:51:06,497 INFO L276 IsEmpty]: Start isEmpty. Operand 3796 states and 3814 transitions. [2018-10-12 20:51:06,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3691 [2018-10-12 20:51:06,565 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:51:06,566 INFO L375 BasicCegarLoop]: trace histogram [90, 90, 90, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 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] [2018-10-12 20:51:06,566 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:51:06,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:51:06,567 INFO L82 PathProgramCache]: Analyzing trace with hash 223083384, now seen corresponding path program 46 times [2018-10-12 20:51:06,567 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:51:06,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:51:15,929 INFO L134 CoverageAnalysis]: Checked inductivity of 130186 backedges. 102596 proven. 17543 refuted. 0 times theorem prover too weak. 10047 trivial. 0 not checked. [2018-10-12 20:51:15,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:51:15,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-12 20:51:15,931 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-12 20:51:15,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-12 20:51:15,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=345, Invalid=2307, Unknown=0, NotChecked=0, Total=2652 [2018-10-12 20:51:15,932 INFO L87 Difference]: Start difference. First operand 3796 states and 3814 transitions. Second operand 52 states. [2018-10-12 20:51:20,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:51:20,441 INFO L93 Difference]: Finished difference Result 3796 states and 3812 transitions. [2018-10-12 20:51:20,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-12 20:51:20,442 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 3690 [2018-10-12 20:51:20,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:51:20,446 INFO L225 Difference]: With dead ends: 3796 [2018-10-12 20:51:20,446 INFO L226 Difference]: Without dead ends: 3796 [2018-10-12 20:51:20,446 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3473 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2919, Invalid=12333, Unknown=0, NotChecked=0, Total=15252 [2018-10-12 20:51:20,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3796 states. [2018-10-12 20:51:20,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3796 to 3796. [2018-10-12 20:51:20,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3796 states. [2018-10-12 20:51:20,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3796 states to 3796 states and 3812 transitions. [2018-10-12 20:51:20,464 INFO L78 Accepts]: Start accepts. Automaton has 3796 states and 3812 transitions. Word has length 3690 [2018-10-12 20:51:20,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:51:20,466 INFO L481 AbstractCegarLoop]: Abstraction has 3796 states and 3812 transitions. [2018-10-12 20:51:20,466 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-12 20:51:20,466 INFO L276 IsEmpty]: Start isEmpty. Operand 3796 states and 3812 transitions. [2018-10-12 20:51:20,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3712 [2018-10-12 20:51:20,537 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:51:20,537 INFO L375 BasicCegarLoop]: trace histogram [91, 91, 91, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 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] [2018-10-12 20:51:20,537 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:51:20,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:51:20,538 INFO L82 PathProgramCache]: Analyzing trace with hash -559173235, now seen corresponding path program 47 times [2018-10-12 20:51:20,539 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:51:20,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:51:28,355 INFO L134 CoverageAnalysis]: Checked inductivity of 132072 backedges. 48973 proven. 1214 refuted. 0 times theorem prover too weak. 81885 trivial. 0 not checked. [2018-10-12 20:51:28,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:51:28,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-12 20:51:28,356 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-12 20:51:28,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-12 20:51:28,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=2228, Unknown=0, NotChecked=0, Total=2550 [2018-10-12 20:51:28,357 INFO L87 Difference]: Start difference. First operand 3796 states and 3812 transitions. Second operand 51 states. [2018-10-12 20:51:34,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:51:34,746 INFO L93 Difference]: Finished difference Result 3813 states and 3829 transitions. [2018-10-12 20:51:34,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-10-12 20:51:34,746 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 3711 [2018-10-12 20:51:34,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:51:34,751 INFO L225 Difference]: With dead ends: 3813 [2018-10-12 20:51:34,751 INFO L226 Difference]: Without dead ends: 3813 [2018-10-12 20:51:34,753 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6808 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=4410, Invalid=20712, Unknown=0, NotChecked=0, Total=25122 [2018-10-12 20:51:34,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3813 states. [2018-10-12 20:51:34,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3813 to 3810. [2018-10-12 20:51:34,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3810 states. [2018-10-12 20:51:34,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3810 states to 3810 states and 3826 transitions. [2018-10-12 20:51:34,770 INFO L78 Accepts]: Start accepts. Automaton has 3810 states and 3826 transitions. Word has length 3711 [2018-10-12 20:51:34,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:51:34,771 INFO L481 AbstractCegarLoop]: Abstraction has 3810 states and 3826 transitions. [2018-10-12 20:51:34,771 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-12 20:51:34,771 INFO L276 IsEmpty]: Start isEmpty. Operand 3810 states and 3826 transitions. [2018-10-12 20:51:34,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3726 [2018-10-12 20:51:34,841 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:51:34,842 INFO L375 BasicCegarLoop]: trace histogram [91, 91, 91, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 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] [2018-10-12 20:51:34,842 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:51:34,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:51:34,842 INFO L82 PathProgramCache]: Analyzing trace with hash -871867052, now seen corresponding path program 48 times [2018-10-12 20:51:34,843 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:51:35,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:51:56,638 INFO L134 CoverageAnalysis]: Checked inductivity of 133163 backedges. 100276 proven. 23032 refuted. 0 times theorem prover too weak. 9855 trivial. 0 not checked. [2018-10-12 20:51:56,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:51:56,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-10-12 20:51:56,639 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-12 20:51:56,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-12 20:51:56,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=438, Invalid=4674, Unknown=0, NotChecked=0, Total=5112 [2018-10-12 20:51:56,640 INFO L87 Difference]: Start difference. First operand 3810 states and 3826 transitions. Second operand 72 states. [2018-10-12 20:52:10,428 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 51 [2018-10-12 20:52:10,594 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 50 [2018-10-12 20:52:11,260 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 50 [2018-10-12 20:52:11,429 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 50 [2018-10-12 20:52:12,215 WARN L178 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 55 [2018-10-12 20:52:12,444 WARN L178 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 57 [2018-10-12 20:52:13,024 WARN L178 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 56 [2018-10-12 20:52:13,229 WARN L178 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 57 [2018-10-12 20:52:13,548 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2018-10-12 20:52:13,770 WARN L178 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 56 [2018-10-12 20:52:13,974 WARN L178 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 57 [2018-10-12 20:52:14,301 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2018-10-12 20:52:14,526 WARN L178 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 56 [2018-10-12 20:52:14,730 WARN L178 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 57 [2018-10-12 20:52:15,293 WARN L178 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 56 [2018-10-12 20:52:15,496 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 56 [2018-10-12 20:52:15,894 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2018-10-12 20:52:16,089 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2018-10-12 20:52:16,468 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2018-10-12 20:52:16,657 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2018-10-12 20:52:17,034 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2018-10-12 20:52:17,255 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2018-10-12 20:52:19,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:52:19,680 INFO L93 Difference]: Finished difference Result 4272 states and 4292 transitions. [2018-10-12 20:52:19,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-10-12 20:52:19,680 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 3725 [2018-10-12 20:52:19,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:52:19,684 INFO L225 Difference]: With dead ends: 4272 [2018-10-12 20:52:19,684 INFO L226 Difference]: Without dead ends: 4272 [2018-10-12 20:52:19,686 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8930 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=5803, Invalid=28979, Unknown=0, NotChecked=0, Total=34782 [2018-10-12 20:52:19,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4272 states. [2018-10-12 20:52:19,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4272 to 3831. [2018-10-12 20:52:19,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3831 states. [2018-10-12 20:52:19,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3831 states to 3831 states and 3848 transitions. [2018-10-12 20:52:19,707 INFO L78 Accepts]: Start accepts. Automaton has 3831 states and 3848 transitions. Word has length 3725 [2018-10-12 20:52:19,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:52:19,709 INFO L481 AbstractCegarLoop]: Abstraction has 3831 states and 3848 transitions. [2018-10-12 20:52:19,709 INFO L482 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-12 20:52:19,709 INFO L276 IsEmpty]: Start isEmpty. Operand 3831 states and 3848 transitions. [2018-10-12 20:52:19,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3747 [2018-10-12 20:52:19,779 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:52:19,780 INFO L375 BasicCegarLoop]: trace histogram [92, 92, 92, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 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] [2018-10-12 20:52:19,780 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:52:19,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:52:19,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1611581799, now seen corresponding path program 49 times [2018-10-12 20:52:19,781 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:52:20,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:52:30,814 INFO L134 CoverageAnalysis]: Checked inductivity of 135070 backedges. 1683 proven. 123221 refuted. 0 times theorem prover too weak. 10166 trivial. 0 not checked. [2018-10-12 20:52:30,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:52:30,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-10-12 20:52:30,815 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-12 20:52:30,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-12 20:52:30,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=428, Invalid=2878, Unknown=0, NotChecked=0, Total=3306 [2018-10-12 20:52:30,816 INFO L87 Difference]: Start difference. First operand 3831 states and 3848 transitions. Second operand 58 states. [2018-10-12 20:52:45,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:52:45,052 INFO L93 Difference]: Finished difference Result 4532 states and 4552 transitions. [2018-10-12 20:52:45,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 361 states. [2018-10-12 20:52:45,053 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 3746 [2018-10-12 20:52:45,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:52:45,057 INFO L225 Difference]: With dead ends: 4532 [2018-10-12 20:52:45,057 INFO L226 Difference]: Without dead ends: 4532 [2018-10-12 20:52:45,063 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 413 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77874 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=24093, Invalid=147717, Unknown=0, NotChecked=0, Total=171810 [2018-10-12 20:52:45,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4532 states. [2018-10-12 20:52:45,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4532 to 4326. [2018-10-12 20:52:45,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4326 states. [2018-10-12 20:52:45,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4326 states to 4326 states and 4345 transitions. [2018-10-12 20:52:45,084 INFO L78 Accepts]: Start accepts. Automaton has 4326 states and 4345 transitions. Word has length 3746 [2018-10-12 20:52:45,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:52:45,086 INFO L481 AbstractCegarLoop]: Abstraction has 4326 states and 4345 transitions. [2018-10-12 20:52:45,086 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-12 20:52:45,086 INFO L276 IsEmpty]: Start isEmpty. Operand 4326 states and 4345 transitions. [2018-10-12 20:52:45,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4221 [2018-10-12 20:52:45,175 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:52:45,175 INFO L375 BasicCegarLoop]: trace histogram [104, 104, 104, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 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] [2018-10-12 20:52:45,175 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:52:45,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:52:45,176 INFO L82 PathProgramCache]: Analyzing trace with hash 637670694, now seen corresponding path program 50 times [2018-10-12 20:52:45,176 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:52:45,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:52:57,659 INFO L134 CoverageAnalysis]: Checked inductivity of 174691 backedges. 139583 proven. 22316 refuted. 0 times theorem prover too weak. 12792 trivial. 0 not checked. [2018-10-12 20:52:57,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:52:57,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-10-12 20:52:57,660 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-12 20:52:57,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-12 20:52:57,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=2681, Unknown=0, NotChecked=0, Total=3080 [2018-10-12 20:52:57,661 INFO L87 Difference]: Start difference. First operand 4326 states and 4345 transitions. Second operand 56 states. [2018-10-12 20:53:02,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:53:02,985 INFO L93 Difference]: Finished difference Result 4326 states and 4343 transitions. [2018-10-12 20:53:02,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-10-12 20:53:02,985 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 4220 [2018-10-12 20:53:02,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:53:02,989 INFO L225 Difference]: With dead ends: 4326 [2018-10-12 20:53:02,990 INFO L226 Difference]: Without dead ends: 4326 [2018-10-12 20:53:02,990 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4094 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3408, Invalid=14414, Unknown=0, NotChecked=0, Total=17822 [2018-10-12 20:53:02,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4326 states. [2018-10-12 20:53:03,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4326 to 4326. [2018-10-12 20:53:03,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4326 states. [2018-10-12 20:53:03,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4326 states to 4326 states and 4343 transitions. [2018-10-12 20:53:03,016 INFO L78 Accepts]: Start accepts. Automaton has 4326 states and 4343 transitions. Word has length 4220 [2018-10-12 20:53:03,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:53:03,018 INFO L481 AbstractCegarLoop]: Abstraction has 4326 states and 4343 transitions. [2018-10-12 20:53:03,018 INFO L482 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-12 20:53:03,019 INFO L276 IsEmpty]: Start isEmpty. Operand 4326 states and 4343 transitions. [2018-10-12 20:53:03,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4242 [2018-10-12 20:53:03,115 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:53:03,116 INFO L375 BasicCegarLoop]: trace histogram [105, 105, 105, 104, 104, 104, 104, 104, 104, 104, 104, 104, 104, 104, 104, 104, 104, 104, 104, 104, 104, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 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] [2018-10-12 20:53:03,116 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:53:03,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:53:03,117 INFO L82 PathProgramCache]: Analyzing trace with hash 256464193, now seen corresponding path program 51 times [2018-10-12 20:53:03,117 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:53:03,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:53:11,337 INFO L134 CoverageAnalysis]: Checked inductivity of 176872 backedges. 62180 proven. 1410 refuted. 0 times theorem prover too weak. 113282 trivial. 0 not checked. [2018-10-12 20:53:11,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:53:11,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-12 20:53:11,338 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-12 20:53:11,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-12 20:53:11,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=2596, Unknown=0, NotChecked=0, Total=2970 [2018-10-12 20:53:11,339 INFO L87 Difference]: Start difference. First operand 4326 states and 4343 transitions. Second operand 55 states.