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/ArraysOfVariableLength_true-valid-memsafety.c_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-093a8c0 [2018-10-14 16:26:01,956 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-14 16:26:01,959 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-14 16:26:01,977 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-14 16:26:01,977 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-14 16:26:01,979 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-14 16:26:01,980 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-14 16:26:01,983 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-14 16:26:01,985 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-14 16:26:01,986 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-14 16:26:01,987 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-14 16:26:01,987 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-14 16:26:01,988 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-14 16:26:01,997 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-14 16:26:01,998 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-14 16:26:01,999 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-14 16:26:02,001 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-14 16:26:02,005 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-14 16:26:02,008 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-14 16:26:02,013 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-14 16:26:02,014 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-14 16:26:02,015 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-14 16:26:02,018 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-14 16:26:02,018 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-14 16:26:02,018 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-14 16:26:02,022 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-14 16:26:02,023 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-14 16:26:02,025 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-14 16:26:02,025 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-14 16:26:02,026 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-14 16:26:02,027 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-14 16:26:02,029 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-14 16:26:02,029 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-14 16:26:02,029 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-14 16:26:02,032 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-14 16:26:02,033 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-14 16:26:02,033 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-14 16:26:02,046 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-14 16:26:02,047 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-14 16:26:02,047 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-14 16:26:02,048 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-14 16:26:02,048 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-14 16:26:02,048 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-14 16:26:02,049 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-14 16:26:02,049 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-14 16:26:02,049 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-14 16:26:02,049 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-14 16:26:02,050 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-14 16:26:02,050 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-14 16:26:02,050 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-14 16:26:02,051 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-14 16:26:02,051 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-14 16:26:02,110 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-14 16:26:02,124 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-14 16:26:02,130 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-14 16:26:02,132 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-14 16:26:02,132 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-14 16:26:02,133 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength_true-valid-memsafety.c_12.bpl [2018-10-14 16:26:02,134 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength_true-valid-memsafety.c_12.bpl' [2018-10-14 16:26:02,221 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-14 16:26:02,224 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-14 16:26:02,224 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-14 16:26:02,224 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-14 16:26:02,225 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-14 16:26:02,255 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:26:02" (1/1) ... [2018-10-14 16:26:02,257 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:26:02" (1/1) ... [2018-10-14 16:26:02,275 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:26:02" (1/1) ... [2018-10-14 16:26:02,276 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:26:02" (1/1) ... [2018-10-14 16:26:02,282 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:26:02" (1/1) ... [2018-10-14 16:26:02,291 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:26:02" (1/1) ... [2018-10-14 16:26:02,292 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:26:02" (1/1) ... [2018-10-14 16:26:02,299 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-14 16:26:02,300 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-14 16:26:02,301 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-14 16:26:02,301 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-14 16:26:02,302 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:26:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-14 16:26:02,368 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-14 16:26:02,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-14 16:26:02,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-14 16:26:02,862 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-14 16:26:02,863 INFO L202 PluginConnector]: Adding new model ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:26:02 BoogieIcfgContainer [2018-10-14 16:26:02,863 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-14 16:26:02,864 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-14 16:26:02,864 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-14 16:26:02,868 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-14 16:26:02,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:26:02" (1/2) ... [2018-10-14 16:26:02,869 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79dbb1f and model type ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:26:02, skipping insertion in model container [2018-10-14 16:26:02,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:26:02" (2/2) ... [2018-10-14 16:26:02,871 INFO L112 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength_true-valid-memsafety.c_12.bpl [2018-10-14 16:26:02,881 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-14 16:26:02,890 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-14 16:26:02,907 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-14 16:26:02,935 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-14 16:26:02,936 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-14 16:26:02,936 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-14 16:26:02,936 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-14 16:26:02,936 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-14 16:26:02,936 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-14 16:26:02,936 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-14 16:26:02,937 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-14 16:26:02,937 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-14 16:26:02,954 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2018-10-14 16:26:02,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-14 16:26:02,964 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:26:02,965 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] [2018-10-14 16:26:02,966 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:26:02,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:26:02,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1642431773, now seen corresponding path program 1 times [2018-10-14 16:26:03,024 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:26:03,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:26:03,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:26:03,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 16:26:03,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-14 16:26:03,528 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-14 16:26:03,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-14 16:26:03,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-10-14 16:26:03,549 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 8 states. [2018-10-14 16:26:04,032 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-10-14 16:26:04,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:26:04,199 INFO L93 Difference]: Finished difference Result 129 states and 132 transitions. [2018-10-14 16:26:04,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-14 16:26:04,202 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2018-10-14 16:26:04,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:26:04,217 INFO L225 Difference]: With dead ends: 129 [2018-10-14 16:26:04,218 INFO L226 Difference]: Without dead ends: 129 [2018-10-14 16:26:04,220 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2018-10-14 16:26:04,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-10-14 16:26:04,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 91. [2018-10-14 16:26:04,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-14 16:26:04,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 93 transitions. [2018-10-14 16:26:04,275 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 93 transitions. Word has length 36 [2018-10-14 16:26:04,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:26:04,276 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 93 transitions. [2018-10-14 16:26:04,276 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-14 16:26:04,276 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 93 transitions. [2018-10-14 16:26:04,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-14 16:26:04,278 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:26:04,279 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:26:04,279 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:26:04,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:26:04,280 INFO L82 PathProgramCache]: Analyzing trace with hash -2036500607, now seen corresponding path program 1 times [2018-10-14 16:26:04,281 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:26:04,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:26:04,511 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:26:04,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:26:04,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-14 16:26:04,513 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-14 16:26:04,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-14 16:26:04,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-14 16:26:04,515 INFO L87 Difference]: Start difference. First operand 91 states and 93 transitions. Second operand 8 states. [2018-10-14 16:26:05,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:26:05,462 INFO L93 Difference]: Finished difference Result 159 states and 162 transitions. [2018-10-14 16:26:05,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-14 16:26:05,464 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2018-10-14 16:26:05,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:26:05,469 INFO L225 Difference]: With dead ends: 159 [2018-10-14 16:26:05,470 INFO L226 Difference]: Without dead ends: 159 [2018-10-14 16:26:05,472 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-10-14 16:26:05,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-10-14 16:26:05,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 110. [2018-10-14 16:26:05,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-10-14 16:26:05,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 112 transitions. [2018-10-14 16:26:05,484 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 112 transitions. Word has length 62 [2018-10-14 16:26:05,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:26:05,485 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 112 transitions. [2018-10-14 16:26:05,485 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-14 16:26:05,485 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 112 transitions. [2018-10-14 16:26:05,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-14 16:26:05,487 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:26:05,488 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:26:05,488 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:26:05,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:26:05,489 INFO L82 PathProgramCache]: Analyzing trace with hash -195640530, now seen corresponding path program 1 times [2018-10-14 16:26:05,490 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:26:05,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:26:05,888 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-14 16:26:05,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:26:05,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-14 16:26:05,889 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-14 16:26:05,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-14 16:26:05,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-10-14 16:26:05,890 INFO L87 Difference]: Start difference. First operand 110 states and 112 transitions. Second operand 10 states. [2018-10-14 16:26:06,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:26:06,513 INFO L93 Difference]: Finished difference Result 170 states and 174 transitions. [2018-10-14 16:26:06,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-14 16:26:06,514 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 77 [2018-10-14 16:26:06,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:26:06,516 INFO L225 Difference]: With dead ends: 170 [2018-10-14 16:26:06,516 INFO L226 Difference]: Without dead ends: 170 [2018-10-14 16:26:06,517 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2018-10-14 16:26:06,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-10-14 16:26:06,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 132. [2018-10-14 16:26:06,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-10-14 16:26:06,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 135 transitions. [2018-10-14 16:26:06,529 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 135 transitions. Word has length 77 [2018-10-14 16:26:06,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:26:06,530 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 135 transitions. [2018-10-14 16:26:06,530 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-14 16:26:06,530 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 135 transitions. [2018-10-14 16:26:06,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-14 16:26:06,534 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:26:06,534 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:26:06,534 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:26:06,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:26:06,535 INFO L82 PathProgramCache]: Analyzing trace with hash -514873332, now seen corresponding path program 2 times [2018-10-14 16:26:06,536 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:26:06,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:26:06,727 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 17 proven. 47 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-14 16:26:06,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:26:06,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-14 16:26:06,729 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-14 16:26:06,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-14 16:26:06,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-10-14 16:26:06,730 INFO L87 Difference]: Start difference. First operand 132 states and 135 transitions. Second operand 10 states. [2018-10-14 16:26:07,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:26:07,084 INFO L93 Difference]: Finished difference Result 158 states and 161 transitions. [2018-10-14 16:26:07,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-14 16:26:07,085 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 103 [2018-10-14 16:26:07,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:26:07,088 INFO L225 Difference]: With dead ends: 158 [2018-10-14 16:26:07,089 INFO L226 Difference]: Without dead ends: 158 [2018-10-14 16:26:07,090 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2018-10-14 16:26:07,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-10-14 16:26:07,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 133. [2018-10-14 16:26:07,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-10-14 16:26:07,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 136 transitions. [2018-10-14 16:26:07,100 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 136 transitions. Word has length 103 [2018-10-14 16:26:07,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:26:07,101 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 136 transitions. [2018-10-14 16:26:07,101 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-14 16:26:07,101 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 136 transitions. [2018-10-14 16:26:07,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-14 16:26:07,104 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:26:07,104 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:26:07,105 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:26:07,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:26:07,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1932659523, now seen corresponding path program 3 times [2018-10-14 16:26:07,106 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:26:07,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:26:07,409 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 17 proven. 65 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-14 16:26:07,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:26:07,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-14 16:26:07,411 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-14 16:26:07,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-14 16:26:07,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-10-14 16:26:07,412 INFO L87 Difference]: Start difference. First operand 133 states and 136 transitions. Second operand 12 states. [2018-10-14 16:26:08,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:26:08,053 INFO L93 Difference]: Finished difference Result 160 states and 163 transitions. [2018-10-14 16:26:08,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-14 16:26:08,054 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 118 [2018-10-14 16:26:08,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:26:08,056 INFO L225 Difference]: With dead ends: 160 [2018-10-14 16:26:08,056 INFO L226 Difference]: Without dead ends: 160 [2018-10-14 16:26:08,057 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=477, Unknown=0, NotChecked=0, Total=600 [2018-10-14 16:26:08,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-10-14 16:26:08,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 148. [2018-10-14 16:26:08,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-10-14 16:26:08,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 151 transitions. [2018-10-14 16:26:08,068 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 151 transitions. Word has length 118 [2018-10-14 16:26:08,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:26:08,068 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 151 transitions. [2018-10-14 16:26:08,068 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-14 16:26:08,069 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 151 transitions. [2018-10-14 16:26:08,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-10-14 16:26:08,071 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:26:08,071 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:26:08,072 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:26:08,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:26:08,072 INFO L82 PathProgramCache]: Analyzing trace with hash -2144079060, now seen corresponding path program 4 times [2018-10-14 16:26:08,073 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:26:08,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:26:08,850 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-14 16:26:09,143 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-14 16:26:09,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:26:09,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-14 16:26:09,145 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-14 16:26:09,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-14 16:26:09,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-10-14 16:26:09,146 INFO L87 Difference]: Start difference. First operand 148 states and 151 transitions. Second operand 12 states. [2018-10-14 16:26:10,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:26:10,104 INFO L93 Difference]: Finished difference Result 258 states and 263 transitions. [2018-10-14 16:26:10,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-14 16:26:10,106 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 133 [2018-10-14 16:26:10,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:26:10,107 INFO L225 Difference]: With dead ends: 258 [2018-10-14 16:26:10,108 INFO L226 Difference]: Without dead ends: 258 [2018-10-14 16:26:10,108 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2018-10-14 16:26:10,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-10-14 16:26:10,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 204. [2018-10-14 16:26:10,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-10-14 16:26:10,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 208 transitions. [2018-10-14 16:26:10,119 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 208 transitions. Word has length 133 [2018-10-14 16:26:10,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:26:10,119 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 208 transitions. [2018-10-14 16:26:10,119 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-14 16:26:10,120 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 208 transitions. [2018-10-14 16:26:10,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-10-14 16:26:10,123 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:26:10,123 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:26:10,123 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:26:10,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:26:10,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1201213738, now seen corresponding path program 5 times [2018-10-14 16:26:10,125 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:26:10,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:26:10,522 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 86 proven. 198 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-14 16:26:10,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:26:10,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-14 16:26:10,524 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-14 16:26:10,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-14 16:26:10,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-10-14 16:26:10,525 INFO L87 Difference]: Start difference. First operand 204 states and 208 transitions. Second operand 16 states. [2018-10-14 16:26:11,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:26:11,441 INFO L93 Difference]: Finished difference Result 231 states and 235 transitions. [2018-10-14 16:26:11,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-14 16:26:11,442 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 189 [2018-10-14 16:26:11,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:26:11,446 INFO L225 Difference]: With dead ends: 231 [2018-10-14 16:26:11,446 INFO L226 Difference]: Without dead ends: 231 [2018-10-14 16:26:11,447 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=232, Invalid=958, Unknown=0, NotChecked=0, Total=1190 [2018-10-14 16:26:11,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-10-14 16:26:11,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 219. [2018-10-14 16:26:11,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-10-14 16:26:11,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 223 transitions. [2018-10-14 16:26:11,461 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 223 transitions. Word has length 189 [2018-10-14 16:26:11,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:26:11,462 INFO L481 AbstractCegarLoop]: Abstraction has 219 states and 223 transitions. [2018-10-14 16:26:11,462 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-14 16:26:11,462 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 223 transitions. [2018-10-14 16:26:11,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-10-14 16:26:11,465 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:26:11,466 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:26:11,466 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:26:11,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:26:11,466 INFO L82 PathProgramCache]: Analyzing trace with hash -723418523, now seen corresponding path program 6 times [2018-10-14 16:26:11,467 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:26:11,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:26:12,074 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 349 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-10-14 16:26:12,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:26:12,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-14 16:26:12,075 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-14 16:26:12,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-14 16:26:12,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2018-10-14 16:26:12,076 INFO L87 Difference]: Start difference. First operand 219 states and 223 transitions. Second operand 20 states. [2018-10-14 16:26:15,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:26:15,892 INFO L93 Difference]: Finished difference Result 461 states and 468 transitions. [2018-10-14 16:26:15,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-14 16:26:15,893 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 204 [2018-10-14 16:26:15,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:26:15,895 INFO L225 Difference]: With dead ends: 461 [2018-10-14 16:26:15,896 INFO L226 Difference]: Without dead ends: 460 [2018-10-14 16:26:15,897 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1311 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1079, Invalid=4033, Unknown=0, NotChecked=0, Total=5112 [2018-10-14 16:26:15,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2018-10-14 16:26:15,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 276. [2018-10-14 16:26:15,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-10-14 16:26:15,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 280 transitions. [2018-10-14 16:26:15,904 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 280 transitions. Word has length 204 [2018-10-14 16:26:15,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:26:15,905 INFO L481 AbstractCegarLoop]: Abstraction has 276 states and 280 transitions. [2018-10-14 16:26:15,905 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-14 16:26:15,905 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 280 transitions. [2018-10-14 16:26:15,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-10-14 16:26:15,910 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:26:15,910 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:26:15,910 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:26:15,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:26:15,911 INFO L82 PathProgramCache]: Analyzing trace with hash -113288948, now seen corresponding path program 7 times [2018-10-14 16:26:15,912 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:26:15,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:26:17,077 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 0 proven. 733 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-10-14 16:26:17,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:26:17,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-14 16:26:17,079 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-14 16:26:17,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-14 16:26:17,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2018-10-14 16:26:17,080 INFO L87 Difference]: Start difference. First operand 276 states and 280 transitions. Second operand 22 states. [2018-10-14 16:26:21,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:26:21,555 INFO L93 Difference]: Finished difference Result 531 states and 539 transitions. [2018-10-14 16:26:21,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-14 16:26:21,556 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 275 [2018-10-14 16:26:21,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:26:21,559 INFO L225 Difference]: With dead ends: 531 [2018-10-14 16:26:21,560 INFO L226 Difference]: Without dead ends: 531 [2018-10-14 16:26:21,562 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1988 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1421, Invalid=5719, Unknown=0, NotChecked=0, Total=7140 [2018-10-14 16:26:21,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2018-10-14 16:26:21,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 347. [2018-10-14 16:26:21,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-10-14 16:26:21,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 352 transitions. [2018-10-14 16:26:21,572 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 352 transitions. Word has length 275 [2018-10-14 16:26:21,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:26:21,572 INFO L481 AbstractCegarLoop]: Abstraction has 347 states and 352 transitions. [2018-10-14 16:26:21,572 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-14 16:26:21,573 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 352 transitions. [2018-10-14 16:26:21,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-10-14 16:26:21,578 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:26:21,578 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:26:21,578 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:26:21,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:26:21,579 INFO L82 PathProgramCache]: Analyzing trace with hash 2083569797, now seen corresponding path program 8 times [2018-10-14 16:26:21,580 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:26:21,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:26:22,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1412 backedges. 0 proven. 1284 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-10-14 16:26:22,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:26:22,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-14 16:26:22,685 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-14 16:26:22,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-14 16:26:22,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2018-10-14 16:26:22,686 INFO L87 Difference]: Start difference. First operand 347 states and 352 transitions. Second operand 24 states. [2018-10-14 16:26:22,938 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 20 [2018-10-14 16:26:26,655 WARN L179 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2018-10-14 16:26:28,179 WARN L179 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-10-14 16:26:28,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:26:28,866 INFO L93 Difference]: Finished difference Result 602 states and 611 transitions. [2018-10-14 16:26:28,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-14 16:26:28,866 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 346 [2018-10-14 16:26:28,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:26:28,870 INFO L225 Difference]: With dead ends: 602 [2018-10-14 16:26:28,871 INFO L226 Difference]: Without dead ends: 602 [2018-10-14 16:26:28,874 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2815 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=1820, Invalid=7686, Unknown=0, NotChecked=0, Total=9506 [2018-10-14 16:26:28,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2018-10-14 16:26:28,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 418. [2018-10-14 16:26:28,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2018-10-14 16:26:28,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 424 transitions. [2018-10-14 16:26:28,884 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 424 transitions. Word has length 346 [2018-10-14 16:26:28,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:26:28,885 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 424 transitions. [2018-10-14 16:26:28,885 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-14 16:26:28,885 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 424 transitions. [2018-10-14 16:26:28,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2018-10-14 16:26:28,889 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:26:28,889 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:26:28,889 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:26:28,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:26:28,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1540032788, now seen corresponding path program 9 times [2018-10-14 16:26:28,891 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:26:28,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:26:30,341 INFO L134 CoverageAnalysis]: Checked inductivity of 2178 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2018-10-14 16:26:30,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:26:30,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-14 16:26:30,342 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-14 16:26:30,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-14 16:26:30,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650 [2018-10-14 16:26:30,343 INFO L87 Difference]: Start difference. First operand 418 states and 424 transitions. Second operand 26 states. [2018-10-14 16:26:32,916 WARN L179 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2018-10-14 16:26:37,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:26:37,411 INFO L93 Difference]: Finished difference Result 673 states and 683 transitions. [2018-10-14 16:26:37,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-10-14 16:26:37,412 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 417 [2018-10-14 16:26:37,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:26:37,415 INFO L225 Difference]: With dead ends: 673 [2018-10-14 16:26:37,415 INFO L226 Difference]: Without dead ends: 673 [2018-10-14 16:26:37,419 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3792 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=2276, Invalid=9934, Unknown=0, NotChecked=0, Total=12210 [2018-10-14 16:26:37,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2018-10-14 16:26:37,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 489. [2018-10-14 16:26:37,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2018-10-14 16:26:37,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 496 transitions. [2018-10-14 16:26:37,429 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 496 transitions. Word has length 417 [2018-10-14 16:26:37,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:26:37,430 INFO L481 AbstractCegarLoop]: Abstraction has 489 states and 496 transitions. [2018-10-14 16:26:37,430 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-14 16:26:37,430 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 496 transitions. [2018-10-14 16:26:37,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2018-10-14 16:26:37,433 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:26:37,433 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:26:37,434 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:26:37,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:26:37,434 INFO L82 PathProgramCache]: Analyzing trace with hash 2112276133, now seen corresponding path program 10 times [2018-10-14 16:26:37,435 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:26:37,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:26:38,961 INFO L134 CoverageAnalysis]: Checked inductivity of 3111 backedges. 0 proven. 2887 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2018-10-14 16:26:38,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:26:38,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-14 16:26:38,962 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-14 16:26:38,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-14 16:26:38,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=643, Unknown=0, NotChecked=0, Total=756 [2018-10-14 16:26:38,963 INFO L87 Difference]: Start difference. First operand 489 states and 496 transitions. Second operand 28 states. [2018-10-14 16:26:39,974 WARN L179 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2018-10-14 16:26:47,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:26:47,187 INFO L93 Difference]: Finished difference Result 744 states and 755 transitions. [2018-10-14 16:26:47,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-10-14 16:26:47,188 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 488 [2018-10-14 16:26:47,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:26:47,192 INFO L225 Difference]: With dead ends: 744 [2018-10-14 16:26:47,192 INFO L226 Difference]: Without dead ends: 744 [2018-10-14 16:26:47,196 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4919 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=2789, Invalid=12463, Unknown=0, NotChecked=0, Total=15252 [2018-10-14 16:26:47,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2018-10-14 16:26:47,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 560. [2018-10-14 16:26:47,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2018-10-14 16:26:47,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 568 transitions. [2018-10-14 16:26:47,206 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 568 transitions. Word has length 488 [2018-10-14 16:26:47,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:26:47,207 INFO L481 AbstractCegarLoop]: Abstraction has 560 states and 568 transitions. [2018-10-14 16:26:47,207 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-14 16:26:47,207 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 568 transitions. [2018-10-14 16:26:47,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 560 [2018-10-14 16:26:47,211 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:26:47,211 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:26:47,211 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:26:47,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:26:47,212 INFO L82 PathProgramCache]: Analyzing trace with hash 592628940, now seen corresponding path program 11 times [2018-10-14 16:26:47,213 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:26:47,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:26:49,248 INFO L134 CoverageAnalysis]: Checked inductivity of 4211 backedges. 0 proven. 3939 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-10-14 16:26:49,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:26:49,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-14 16:26:49,249 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-14 16:26:49,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-14 16:26:49,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=738, Unknown=0, NotChecked=0, Total=870 [2018-10-14 16:26:49,250 INFO L87 Difference]: Start difference. First operand 560 states and 568 transitions. Second operand 30 states. [2018-10-14 16:26:49,997 WARN L179 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2018-10-14 16:26:57,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:26:57,856 INFO L93 Difference]: Finished difference Result 815 states and 827 transitions. [2018-10-14 16:26:57,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-10-14 16:26:57,857 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 559 [2018-10-14 16:26:57,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:26:57,861 INFO L225 Difference]: With dead ends: 815 [2018-10-14 16:26:57,861 INFO L226 Difference]: Without dead ends: 815 [2018-10-14 16:26:57,865 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6196 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=3359, Invalid=15273, Unknown=0, NotChecked=0, Total=18632 [2018-10-14 16:26:57,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2018-10-14 16:26:57,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 631. [2018-10-14 16:26:57,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2018-10-14 16:26:57,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 640 transitions. [2018-10-14 16:26:57,876 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 640 transitions. Word has length 559 [2018-10-14 16:26:57,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:26:57,877 INFO L481 AbstractCegarLoop]: Abstraction has 631 states and 640 transitions. [2018-10-14 16:26:57,877 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-14 16:26:57,877 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 640 transitions. [2018-10-14 16:26:57,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 631 [2018-10-14 16:26:57,882 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:26:57,882 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:26:57,882 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:26:57,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:26:57,883 INFO L82 PathProgramCache]: Analyzing trace with hash -972712763, now seen corresponding path program 12 times [2018-10-14 16:26:57,884 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:26:57,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:27:00,000 INFO L134 CoverageAnalysis]: Checked inductivity of 5478 backedges. 0 proven. 5158 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2018-10-14 16:27:00,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:27:00,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-14 16:27:00,001 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-14 16:27:00,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-14 16:27:00,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=839, Unknown=0, NotChecked=0, Total=992 [2018-10-14 16:27:00,002 INFO L87 Difference]: Start difference. First operand 631 states and 640 transitions. Second operand 32 states. [2018-10-14 16:27:09,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:27:09,110 INFO L93 Difference]: Finished difference Result 886 states and 899 transitions. [2018-10-14 16:27:09,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-10-14 16:27:09,111 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 630 [2018-10-14 16:27:09,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:27:09,116 INFO L225 Difference]: With dead ends: 886 [2018-10-14 16:27:09,116 INFO L226 Difference]: Without dead ends: 886 [2018-10-14 16:27:09,119 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7623 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=3986, Invalid=18364, Unknown=0, NotChecked=0, Total=22350 [2018-10-14 16:27:09,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2018-10-14 16:27:09,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 702. [2018-10-14 16:27:09,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 702 states. [2018-10-14 16:27:09,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 712 transitions. [2018-10-14 16:27:09,130 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 712 transitions. Word has length 630 [2018-10-14 16:27:09,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:27:09,131 INFO L481 AbstractCegarLoop]: Abstraction has 702 states and 712 transitions. [2018-10-14 16:27:09,131 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-14 16:27:09,131 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 712 transitions. [2018-10-14 16:27:09,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 702 [2018-10-14 16:27:09,137 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:27:09,137 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:27:09,137 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:27:09,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:27:09,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1951849132, now seen corresponding path program 13 times [2018-10-14 16:27:09,139 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:27:09,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:27:12,216 INFO L134 CoverageAnalysis]: Checked inductivity of 6912 backedges. 0 proven. 6544 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2018-10-14 16:27:12,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:27:12,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-14 16:27:12,218 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-14 16:27:12,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-14 16:27:12,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=946, Unknown=0, NotChecked=0, Total=1122 [2018-10-14 16:27:12,218 INFO L87 Difference]: Start difference. First operand 702 states and 712 transitions. Second operand 34 states. [2018-10-14 16:27:22,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:27:22,522 INFO L93 Difference]: Finished difference Result 957 states and 971 transitions. [2018-10-14 16:27:22,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-10-14 16:27:22,522 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 701 [2018-10-14 16:27:22,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:27:22,526 INFO L225 Difference]: With dead ends: 957 [2018-10-14 16:27:22,527 INFO L226 Difference]: Without dead ends: 957 [2018-10-14 16:27:22,529 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9200 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=4670, Invalid=21736, Unknown=0, NotChecked=0, Total=26406 [2018-10-14 16:27:22,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2018-10-14 16:27:22,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 773. [2018-10-14 16:27:22,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2018-10-14 16:27:22,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 784 transitions. [2018-10-14 16:27:22,540 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 784 transitions. Word has length 701 [2018-10-14 16:27:22,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:27:22,541 INFO L481 AbstractCegarLoop]: Abstraction has 773 states and 784 transitions. [2018-10-14 16:27:22,541 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-14 16:27:22,541 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 784 transitions. [2018-10-14 16:27:22,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 773 [2018-10-14 16:27:22,547 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:27:22,548 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:27:22,548 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:27:22,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:27:22,549 INFO L82 PathProgramCache]: Analyzing trace with hash -183555355, now seen corresponding path program 14 times [2018-10-14 16:27:22,549 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:27:22,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:27:25,140 INFO L134 CoverageAnalysis]: Checked inductivity of 8513 backedges. 0 proven. 8097 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2018-10-14 16:27:25,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:27:25,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-14 16:27:25,142 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-14 16:27:25,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-14 16:27:25,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1059, Unknown=0, NotChecked=0, Total=1260 [2018-10-14 16:27:25,143 INFO L87 Difference]: Start difference. First operand 773 states and 784 transitions. Second operand 36 states. [2018-10-14 16:27:36,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:27:36,572 INFO L93 Difference]: Finished difference Result 1028 states and 1043 transitions. [2018-10-14 16:27:36,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-10-14 16:27:36,573 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 772 [2018-10-14 16:27:36,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:27:36,577 INFO L225 Difference]: With dead ends: 1028 [2018-10-14 16:27:36,577 INFO L226 Difference]: Without dead ends: 1028 [2018-10-14 16:27:36,579 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10927 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=5411, Invalid=25389, Unknown=0, NotChecked=0, Total=30800 [2018-10-14 16:27:36,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2018-10-14 16:27:36,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 844. [2018-10-14 16:27:36,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2018-10-14 16:27:36,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 856 transitions. [2018-10-14 16:27:36,590 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 856 transitions. Word has length 772 [2018-10-14 16:27:36,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:27:36,591 INFO L481 AbstractCegarLoop]: Abstraction has 844 states and 856 transitions. [2018-10-14 16:27:36,591 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-14 16:27:36,591 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 856 transitions. [2018-10-14 16:27:36,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 844 [2018-10-14 16:27:36,599 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:27:36,599 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:27:36,600 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:27:36,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:27:36,600 INFO L82 PathProgramCache]: Analyzing trace with hash -796974964, now seen corresponding path program 15 times [2018-10-14 16:27:36,601 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:27:36,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:27:39,763 INFO L134 CoverageAnalysis]: Checked inductivity of 10281 backedges. 0 proven. 9817 refuted. 0 times theorem prover too weak. 464 trivial. 0 not checked. [2018-10-14 16:27:39,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:27:39,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-14 16:27:39,764 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-14 16:27:39,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-14 16:27:39,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=1178, Unknown=0, NotChecked=0, Total=1406 [2018-10-14 16:27:39,765 INFO L87 Difference]: Start difference. First operand 844 states and 856 transitions. Second operand 38 states. [2018-10-14 16:27:51,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:27:51,995 INFO L93 Difference]: Finished difference Result 1099 states and 1115 transitions. [2018-10-14 16:27:51,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2018-10-14 16:27:51,996 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 843 [2018-10-14 16:27:51,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:27:52,000 INFO L225 Difference]: With dead ends: 1099 [2018-10-14 16:27:52,001 INFO L226 Difference]: Without dead ends: 1099 [2018-10-14 16:27:52,003 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12804 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=6209, Invalid=29323, Unknown=0, NotChecked=0, Total=35532 [2018-10-14 16:27:52,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2018-10-14 16:27:52,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 915. [2018-10-14 16:27:52,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 915 states. [2018-10-14 16:27:52,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 928 transitions. [2018-10-14 16:27:52,019 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 928 transitions. Word has length 843 [2018-10-14 16:27:52,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:27:52,020 INFO L481 AbstractCegarLoop]: Abstraction has 915 states and 928 transitions. [2018-10-14 16:27:52,020 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-14 16:27:52,020 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 928 transitions. [2018-10-14 16:27:52,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 915 [2018-10-14 16:27:52,028 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:27:52,029 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:27:52,029 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:27:52,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:27:52,030 INFO L82 PathProgramCache]: Analyzing trace with hash -2147120891, now seen corresponding path program 16 times [2018-10-14 16:27:52,030 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:27:52,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:27:55,346 INFO L134 CoverageAnalysis]: Checked inductivity of 12216 backedges. 0 proven. 11704 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2018-10-14 16:27:55,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:27:55,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-14 16:27:55,348 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-14 16:27:55,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-14 16:27:55,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=1303, Unknown=0, NotChecked=0, Total=1560 [2018-10-14 16:27:55,349 INFO L87 Difference]: Start difference. First operand 915 states and 928 transitions. Second operand 40 states. [2018-10-14 16:28:05,090 WARN L179 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2018-10-14 16:28:09,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:28:09,754 INFO L93 Difference]: Finished difference Result 1170 states and 1187 transitions. [2018-10-14 16:28:09,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2018-10-14 16:28:09,754 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 914 [2018-10-14 16:28:09,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:28:09,758 INFO L225 Difference]: With dead ends: 1170 [2018-10-14 16:28:09,758 INFO L226 Difference]: Without dead ends: 1170 [2018-10-14 16:28:09,759 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14831 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=7064, Invalid=33538, Unknown=0, NotChecked=0, Total=40602 [2018-10-14 16:28:09,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2018-10-14 16:28:09,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 986. [2018-10-14 16:28:09,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2018-10-14 16:28:09,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 1000 transitions. [2018-10-14 16:28:09,771 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 1000 transitions. Word has length 914 [2018-10-14 16:28:09,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:28:09,772 INFO L481 AbstractCegarLoop]: Abstraction has 986 states and 1000 transitions. [2018-10-14 16:28:09,772 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-14 16:28:09,772 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1000 transitions. [2018-10-14 16:28:09,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 986 [2018-10-14 16:28:09,781 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:28:09,781 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:28:09,782 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:28:09,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:28:09,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1937138068, now seen corresponding path program 17 times [2018-10-14 16:28:09,783 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:28:09,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:28:13,557 INFO L134 CoverageAnalysis]: Checked inductivity of 14318 backedges. 0 proven. 13758 refuted. 0 times theorem prover too weak. 560 trivial. 0 not checked. [2018-10-14 16:28:13,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:28:13,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-14 16:28:13,558 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-14 16:28:13,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-14 16:28:13,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=1434, Unknown=0, NotChecked=0, Total=1722 [2018-10-14 16:28:13,559 INFO L87 Difference]: Start difference. First operand 986 states and 1000 transitions. Second operand 42 states. [2018-10-14 16:28:28,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:28:28,698 INFO L93 Difference]: Finished difference Result 1241 states and 1259 transitions. [2018-10-14 16:28:28,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2018-10-14 16:28:28,699 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 985 [2018-10-14 16:28:28,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:28:28,703 INFO L225 Difference]: With dead ends: 1241 [2018-10-14 16:28:28,703 INFO L226 Difference]: Without dead ends: 1241 [2018-10-14 16:28:28,706 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17008 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=7976, Invalid=38034, Unknown=0, NotChecked=0, Total=46010 [2018-10-14 16:28:28,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2018-10-14 16:28:28,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1057. [2018-10-14 16:28:28,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1057 states. [2018-10-14 16:28:28,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 1072 transitions. [2018-10-14 16:28:28,718 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 1072 transitions. Word has length 985 [2018-10-14 16:28:28,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:28:28,719 INFO L481 AbstractCegarLoop]: Abstraction has 1057 states and 1072 transitions. [2018-10-14 16:28:28,719 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-14 16:28:28,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 1072 transitions. [2018-10-14 16:28:28,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1057 [2018-10-14 16:28:28,734 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:28:28,735 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:28:28,735 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:28:28,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:28:28,736 INFO L82 PathProgramCache]: Analyzing trace with hash -798314715, now seen corresponding path program 18 times [2018-10-14 16:28:28,737 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:28:28,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:28:32,932 INFO L134 CoverageAnalysis]: Checked inductivity of 16587 backedges. 0 proven. 15979 refuted. 0 times theorem prover too weak. 608 trivial. 0 not checked. [2018-10-14 16:28:32,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:28:32,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-14 16:28:32,934 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-14 16:28:32,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-14 16:28:32,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=1571, Unknown=0, NotChecked=0, Total=1892 [2018-10-14 16:28:32,934 INFO L87 Difference]: Start difference. First operand 1057 states and 1072 transitions. Second operand 44 states. [2018-10-14 16:28:49,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:28:49,315 INFO L93 Difference]: Finished difference Result 1312 states and 1331 transitions. [2018-10-14 16:28:49,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 188 states. [2018-10-14 16:28:49,315 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 1056 [2018-10-14 16:28:49,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:28:49,319 INFO L225 Difference]: With dead ends: 1312 [2018-10-14 16:28:49,319 INFO L226 Difference]: Without dead ends: 1312 [2018-10-14 16:28:49,322 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19335 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=8945, Invalid=42811, Unknown=0, NotChecked=0, Total=51756 [2018-10-14 16:28:49,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2018-10-14 16:28:49,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1128. [2018-10-14 16:28:49,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1128 states. [2018-10-14 16:28:49,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 1144 transitions. [2018-10-14 16:28:49,335 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 1144 transitions. Word has length 1056 [2018-10-14 16:28:49,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:28:49,336 INFO L481 AbstractCegarLoop]: Abstraction has 1128 states and 1144 transitions. [2018-10-14 16:28:49,336 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-14 16:28:49,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 1144 transitions. [2018-10-14 16:28:49,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1128 [2018-10-14 16:28:49,347 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:28:49,347 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:28:49,348 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:28:49,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:28:49,348 INFO L82 PathProgramCache]: Analyzing trace with hash -122399668, now seen corresponding path program 19 times [2018-10-14 16:28:49,349 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:28:49,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:28:54,542 INFO L134 CoverageAnalysis]: Checked inductivity of 19023 backedges. 0 proven. 18367 refuted. 0 times theorem prover too weak. 656 trivial. 0 not checked. [2018-10-14 16:28:54,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:28:54,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-14 16:28:54,544 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-14 16:28:54,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-14 16:28:54,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=1714, Unknown=0, NotChecked=0, Total=2070 [2018-10-14 16:28:54,545 INFO L87 Difference]: Start difference. First operand 1128 states and 1144 transitions. Second operand 46 states. [2018-10-14 16:29:12,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:29:12,683 INFO L93 Difference]: Finished difference Result 1383 states and 1403 transitions. [2018-10-14 16:29:12,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 199 states. [2018-10-14 16:29:12,684 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 1127 [2018-10-14 16:29:12,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:29:12,688 INFO L225 Difference]: With dead ends: 1383 [2018-10-14 16:29:12,688 INFO L226 Difference]: Without dead ends: 1383 [2018-10-14 16:29:12,692 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21812 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=9971, Invalid=47869, Unknown=0, NotChecked=0, Total=57840 [2018-10-14 16:29:12,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2018-10-14 16:29:12,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1199. [2018-10-14 16:29:12,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1199 states. [2018-10-14 16:29:12,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 1216 transitions. [2018-10-14 16:29:12,704 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 1216 transitions. Word has length 1127 [2018-10-14 16:29:12,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:29:12,705 INFO L481 AbstractCegarLoop]: Abstraction has 1199 states and 1216 transitions. [2018-10-14 16:29:12,705 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-14 16:29:12,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1216 transitions. [2018-10-14 16:29:12,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1199 [2018-10-14 16:29:12,719 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:29:12,719 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:29:12,720 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:29:12,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:29:12,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1681956165, now seen corresponding path program 20 times [2018-10-14 16:29:12,721 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:29:12,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:29:13,983 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-14 16:29:18,947 INFO L134 CoverageAnalysis]: Checked inductivity of 21626 backedges. 0 proven. 20922 refuted. 0 times theorem prover too weak. 704 trivial. 0 not checked. [2018-10-14 16:29:18,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:29:18,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-14 16:29:18,949 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-14 16:29:18,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-14 16:29:18,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=393, Invalid=1863, Unknown=0, NotChecked=0, Total=2256 [2018-10-14 16:29:18,950 INFO L87 Difference]: Start difference. First operand 1199 states and 1216 transitions. Second operand 48 states. [2018-10-14 16:29:37,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:29:37,664 INFO L93 Difference]: Finished difference Result 1454 states and 1475 transitions. [2018-10-14 16:29:37,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 210 states. [2018-10-14 16:29:37,666 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 1198 [2018-10-14 16:29:37,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:29:37,672 INFO L225 Difference]: With dead ends: 1454 [2018-10-14 16:29:37,672 INFO L226 Difference]: Without dead ends: 1454 [2018-10-14 16:29:37,675 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24439 ImplicationChecksByTransitivity, 18.7s TimeCoverageRelationStatistics Valid=11054, Invalid=53208, Unknown=0, NotChecked=0, Total=64262 [2018-10-14 16:29:37,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2018-10-14 16:29:37,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 1270. [2018-10-14 16:29:37,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1270 states. [2018-10-14 16:29:37,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1288 transitions. [2018-10-14 16:29:37,689 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1288 transitions. Word has length 1198 [2018-10-14 16:29:37,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:29:37,690 INFO L481 AbstractCegarLoop]: Abstraction has 1270 states and 1288 transitions. [2018-10-14 16:29:37,690 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-14 16:29:37,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1288 transitions. [2018-10-14 16:29:37,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1270 [2018-10-14 16:29:37,704 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:29:37,705 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:29:37,706 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:29:37,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:29:37,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1086145068, now seen corresponding path program 21 times [2018-10-14 16:29:37,707 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:29:37,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:29:44,198 INFO L134 CoverageAnalysis]: Checked inductivity of 24396 backedges. 0 proven. 23644 refuted. 0 times theorem prover too weak. 752 trivial. 0 not checked. [2018-10-14 16:29:44,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:29:44,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-14 16:29:44,199 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-14 16:29:44,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-14 16:29:44,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=432, Invalid=2018, Unknown=0, NotChecked=0, Total=2450 [2018-10-14 16:29:44,200 INFO L87 Difference]: Start difference. First operand 1270 states and 1288 transitions. Second operand 50 states. [2018-10-14 16:30:05,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:30:05,289 INFO L93 Difference]: Finished difference Result 1525 states and 1547 transitions. [2018-10-14 16:30:05,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 221 states. [2018-10-14 16:30:05,290 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 1269 [2018-10-14 16:30:05,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:30:05,294 INFO L225 Difference]: With dead ends: 1525 [2018-10-14 16:30:05,294 INFO L226 Difference]: Without dead ends: 1525 [2018-10-14 16:30:05,297 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27216 ImplicationChecksByTransitivity, 20.1s TimeCoverageRelationStatistics Valid=12194, Invalid=58828, Unknown=0, NotChecked=0, Total=71022 [2018-10-14 16:30:05,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1525 states. [2018-10-14 16:30:05,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1525 to 1341. [2018-10-14 16:30:05,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1341 states. [2018-10-14 16:30:05,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 1360 transitions. [2018-10-14 16:30:05,308 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 1360 transitions. Word has length 1269 [2018-10-14 16:30:05,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:30:05,309 INFO L481 AbstractCegarLoop]: Abstraction has 1341 states and 1360 transitions. [2018-10-14 16:30:05,309 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-14 16:30:05,309 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 1360 transitions. [2018-10-14 16:30:05,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1341 [2018-10-14 16:30:05,324 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:30:05,324 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:30:05,325 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:30:05,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:30:05,325 INFO L82 PathProgramCache]: Analyzing trace with hash -301378715, now seen corresponding path program 22 times [2018-10-14 16:30:05,326 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:30:05,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:30:12,391 INFO L134 CoverageAnalysis]: Checked inductivity of 27333 backedges. 0 proven. 26533 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2018-10-14 16:30:12,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:30:12,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-14 16:30:12,392 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-14 16:30:12,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-14 16:30:12,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=473, Invalid=2179, Unknown=0, NotChecked=0, Total=2652 [2018-10-14 16:30:12,393 INFO L87 Difference]: Start difference. First operand 1341 states and 1360 transitions. Second operand 52 states. [2018-10-14 16:30:35,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:30:35,057 INFO L93 Difference]: Finished difference Result 1596 states and 1619 transitions. [2018-10-14 16:30:35,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 232 states. [2018-10-14 16:30:35,057 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 1340 [2018-10-14 16:30:35,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:30:35,062 INFO L225 Difference]: With dead ends: 1596 [2018-10-14 16:30:35,062 INFO L226 Difference]: Without dead ends: 1596 [2018-10-14 16:30:35,066 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 278 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30143 ImplicationChecksByTransitivity, 21.7s TimeCoverageRelationStatistics Valid=13391, Invalid=64729, Unknown=0, NotChecked=0, Total=78120 [2018-10-14 16:30:35,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2018-10-14 16:30:35,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 1412. [2018-10-14 16:30:35,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1412 states. [2018-10-14 16:30:35,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 1432 transitions. [2018-10-14 16:30:35,077 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 1432 transitions. Word has length 1340 [2018-10-14 16:30:35,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:30:35,078 INFO L481 AbstractCegarLoop]: Abstraction has 1412 states and 1432 transitions. [2018-10-14 16:30:35,078 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-14 16:30:35,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 1432 transitions. [2018-10-14 16:30:35,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1412 [2018-10-14 16:30:35,095 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:30:35,096 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:30:35,096 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:30:35,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:30:35,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1273128972, now seen corresponding path program 23 times [2018-10-14 16:30:35,097 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:30:35,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:30:42,288 INFO L134 CoverageAnalysis]: Checked inductivity of 30437 backedges. 0 proven. 29589 refuted. 0 times theorem prover too weak. 848 trivial. 0 not checked. [2018-10-14 16:30:42,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:30:42,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-14 16:30:42,290 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-14 16:30:42,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-14 16:30:42,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=516, Invalid=2346, Unknown=0, NotChecked=0, Total=2862 [2018-10-14 16:30:42,290 INFO L87 Difference]: Start difference. First operand 1412 states and 1432 transitions. Second operand 54 states. [2018-10-14 16:31:05,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:31:05,855 INFO L93 Difference]: Finished difference Result 1667 states and 1691 transitions. [2018-10-14 16:31:05,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 243 states. [2018-10-14 16:31:05,856 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 1411 [2018-10-14 16:31:05,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:31:05,861 INFO L225 Difference]: With dead ends: 1667 [2018-10-14 16:31:05,861 INFO L226 Difference]: Without dead ends: 1667 [2018-10-14 16:31:05,866 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 291 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33220 ImplicationChecksByTransitivity, 22.8s TimeCoverageRelationStatistics Valid=14645, Invalid=70911, Unknown=0, NotChecked=0, Total=85556 [2018-10-14 16:31:05,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2018-10-14 16:31:05,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1483. [2018-10-14 16:31:05,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1483 states. [2018-10-14 16:31:05,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1483 states to 1483 states and 1504 transitions. [2018-10-14 16:31:05,878 INFO L78 Accepts]: Start accepts. Automaton has 1483 states and 1504 transitions. Word has length 1411 [2018-10-14 16:31:05,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:31:05,878 INFO L481 AbstractCegarLoop]: Abstraction has 1483 states and 1504 transitions. [2018-10-14 16:31:05,878 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-14 16:31:05,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1483 states and 1504 transitions. [2018-10-14 16:31:05,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1483 [2018-10-14 16:31:05,895 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:31:05,895 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:31:05,895 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:31:05,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:31:05,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1959186821, now seen corresponding path program 24 times [2018-10-14 16:31:05,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:31:05,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:31:13,409 INFO L134 CoverageAnalysis]: Checked inductivity of 33708 backedges. 0 proven. 32812 refuted. 0 times theorem prover too weak. 896 trivial. 0 not checked. [2018-10-14 16:31:13,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:31:13,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-10-14 16:31:13,410 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-14 16:31:13,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-14 16:31:13,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=2519, Unknown=0, NotChecked=0, Total=3080 [2018-10-14 16:31:13,411 INFO L87 Difference]: Start difference. First operand 1483 states and 1504 transitions. Second operand 56 states. [2018-10-14 16:31:39,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:31:39,123 INFO L93 Difference]: Finished difference Result 1738 states and 1763 transitions. [2018-10-14 16:31:39,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 254 states. [2018-10-14 16:31:39,124 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 1482 [2018-10-14 16:31:39,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:31:39,129 INFO L225 Difference]: With dead ends: 1738 [2018-10-14 16:31:39,129 INFO L226 Difference]: Without dead ends: 1738 [2018-10-14 16:31:39,132 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 304 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36447 ImplicationChecksByTransitivity, 24.0s TimeCoverageRelationStatistics Valid=15956, Invalid=77374, Unknown=0, NotChecked=0, Total=93330 [2018-10-14 16:31:39,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2018-10-14 16:31:39,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1554. [2018-10-14 16:31:39,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1554 states. [2018-10-14 16:31:39,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 1554 states and 1576 transitions. [2018-10-14 16:31:39,144 INFO L78 Accepts]: Start accepts. Automaton has 1554 states and 1576 transitions. Word has length 1482 [2018-10-14 16:31:39,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:31:39,145 INFO L481 AbstractCegarLoop]: Abstraction has 1554 states and 1576 transitions. [2018-10-14 16:31:39,145 INFO L482 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-14 16:31:39,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 1576 transitions. [2018-10-14 16:31:39,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1554 [2018-10-14 16:31:39,161 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:31:39,162 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:31:39,162 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:31:39,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:31:39,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1662925332, now seen corresponding path program 25 times [2018-10-14 16:31:39,163 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:31:39,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:31:47,272 INFO L134 CoverageAnalysis]: Checked inductivity of 37146 backedges. 0 proven. 36202 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2018-10-14 16:31:47,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:31:47,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-10-14 16:31:47,274 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-14 16:31:47,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-14 16:31:47,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=608, Invalid=2698, Unknown=0, NotChecked=0, Total=3306 [2018-10-14 16:31:47,275 INFO L87 Difference]: Start difference. First operand 1554 states and 1576 transitions. Second operand 58 states. [2018-10-14 16:32:10,149 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2018-10-14 16:32:14,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:32:14,786 INFO L93 Difference]: Finished difference Result 1809 states and 1835 transitions. [2018-10-14 16:32:14,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 265 states. [2018-10-14 16:32:14,786 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 1553 [2018-10-14 16:32:14,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:32:14,792 INFO L225 Difference]: With dead ends: 1809 [2018-10-14 16:32:14,792 INFO L226 Difference]: Without dead ends: 1809 [2018-10-14 16:32:14,796 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 317 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39824 ImplicationChecksByTransitivity, 25.5s TimeCoverageRelationStatistics Valid=17324, Invalid=84118, Unknown=0, NotChecked=0, Total=101442 [2018-10-14 16:32:14,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2018-10-14 16:32:14,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1625. [2018-10-14 16:32:14,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1625 states. [2018-10-14 16:32:14,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1625 states to 1625 states and 1648 transitions. [2018-10-14 16:32:14,808 INFO L78 Accepts]: Start accepts. Automaton has 1625 states and 1648 transitions. Word has length 1553 [2018-10-14 16:32:14,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:32:14,809 INFO L481 AbstractCegarLoop]: Abstraction has 1625 states and 1648 transitions. [2018-10-14 16:32:14,809 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-14 16:32:14,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1625 states and 1648 transitions. [2018-10-14 16:32:14,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1625 [2018-10-14 16:32:14,827 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:32:14,827 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:32:14,828 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:32:14,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:32:14,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1945835429, now seen corresponding path program 26 times [2018-10-14 16:32:14,829 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:32:14,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:32:23,531 INFO L134 CoverageAnalysis]: Checked inductivity of 40751 backedges. 0 proven. 39759 refuted. 0 times theorem prover too weak. 992 trivial. 0 not checked. [2018-10-14 16:32:23,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:32:23,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-10-14 16:32:23,533 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-14 16:32:23,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-14 16:32:23,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=657, Invalid=2883, Unknown=0, NotChecked=0, Total=3540 [2018-10-14 16:32:23,534 INFO L87 Difference]: Start difference. First operand 1625 states and 1648 transitions. Second operand 60 states. [2018-10-14 16:32:41,729 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2018-10-14 16:32:52,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:32:52,454 INFO L93 Difference]: Finished difference Result 1880 states and 1907 transitions. [2018-10-14 16:32:52,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 276 states. [2018-10-14 16:32:52,455 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 1624 [2018-10-14 16:32:52,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:32:52,461 INFO L225 Difference]: With dead ends: 1880 [2018-10-14 16:32:52,461 INFO L226 Difference]: Without dead ends: 1880 [2018-10-14 16:32:52,468 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 330 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43351 ImplicationChecksByTransitivity, 26.7s TimeCoverageRelationStatistics Valid=18749, Invalid=91143, Unknown=0, NotChecked=0, Total=109892 [2018-10-14 16:32:52,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1880 states. [2018-10-14 16:32:52,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1880 to 1696. [2018-10-14 16:32:52,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1696 states. [2018-10-14 16:32:52,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1696 states to 1696 states and 1720 transitions. [2018-10-14 16:32:52,481 INFO L78 Accepts]: Start accepts. Automaton has 1696 states and 1720 transitions. Word has length 1624 [2018-10-14 16:32:52,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:32:52,482 INFO L481 AbstractCegarLoop]: Abstraction has 1696 states and 1720 transitions. [2018-10-14 16:32:52,482 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-14 16:32:52,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1696 states and 1720 transitions. [2018-10-14 16:32:52,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1696 [2018-10-14 16:32:52,501 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:32:52,502 INFO L375 BasicCegarLoop]: trace histogram [69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:32:52,502 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:32:52,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:32:52,503 INFO L82 PathProgramCache]: Analyzing trace with hash 838425548, now seen corresponding path program 27 times [2018-10-14 16:32:52,504 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:32:52,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:33:02,396 INFO L134 CoverageAnalysis]: Checked inductivity of 44523 backedges. 0 proven. 43483 refuted. 0 times theorem prover too weak. 1040 trivial. 0 not checked. [2018-10-14 16:33:02,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:33:02,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-10-14 16:33:02,397 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-14 16:33:02,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-14 16:33:02,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=708, Invalid=3074, Unknown=0, NotChecked=0, Total=3782 [2018-10-14 16:33:02,398 INFO L87 Difference]: Start difference. First operand 1696 states and 1720 transitions. Second operand 62 states. [2018-10-14 16:33:32,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:33:32,545 INFO L93 Difference]: Finished difference Result 1951 states and 1979 transitions. [2018-10-14 16:33:32,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 287 states. [2018-10-14 16:33:32,546 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 1695 [2018-10-14 16:33:32,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:33:32,552 INFO L225 Difference]: With dead ends: 1951 [2018-10-14 16:33:32,552 INFO L226 Difference]: Without dead ends: 1951 [2018-10-14 16:33:32,558 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 343 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47028 ImplicationChecksByTransitivity, 29.6s TimeCoverageRelationStatistics Valid=20231, Invalid=98449, Unknown=0, NotChecked=0, Total=118680 [2018-10-14 16:33:32,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1951 states. [2018-10-14 16:33:32,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1951 to 1767. [2018-10-14 16:33:32,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1767 states. [2018-10-14 16:33:32,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1767 states to 1767 states and 1792 transitions. [2018-10-14 16:33:32,571 INFO L78 Accepts]: Start accepts. Automaton has 1767 states and 1792 transitions. Word has length 1695 [2018-10-14 16:33:32,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:33:32,572 INFO L481 AbstractCegarLoop]: Abstraction has 1767 states and 1792 transitions. [2018-10-14 16:33:32,572 INFO L482 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-14 16:33:32,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 1792 transitions. [2018-10-14 16:33:32,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1767 [2018-10-14 16:33:32,591 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:33:32,592 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:33:32,592 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:33:32,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:33:32,592 INFO L82 PathProgramCache]: Analyzing trace with hash -72866363, now seen corresponding path program 28 times [2018-10-14 16:33:32,593 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:33:32,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:33:43,871 INFO L134 CoverageAnalysis]: Checked inductivity of 48462 backedges. 0 proven. 47374 refuted. 0 times theorem prover too weak. 1088 trivial. 0 not checked. [2018-10-14 16:33:43,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:33:43,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-10-14 16:33:43,873 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-14 16:33:43,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-14 16:33:43,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=761, Invalid=3271, Unknown=0, NotChecked=0, Total=4032 [2018-10-14 16:33:43,873 INFO L87 Difference]: Start difference. First operand 1767 states and 1792 transitions. Second operand 64 states. [2018-10-14 16:34:14,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:34:14,780 INFO L93 Difference]: Finished difference Result 2022 states and 2051 transitions. [2018-10-14 16:34:14,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 298 states. [2018-10-14 16:34:14,780 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 1766 [2018-10-14 16:34:14,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:34:14,787 INFO L225 Difference]: With dead ends: 2022 [2018-10-14 16:34:14,787 INFO L226 Difference]: Without dead ends: 2022 [2018-10-14 16:34:14,793 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 356 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50855 ImplicationChecksByTransitivity, 31.0s TimeCoverageRelationStatistics Valid=21770, Invalid=106036, Unknown=0, NotChecked=0, Total=127806 [2018-10-14 16:34:14,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2022 states. [2018-10-14 16:34:14,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2022 to 1838. [2018-10-14 16:34:14,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2018-10-14 16:34:14,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 1864 transitions. [2018-10-14 16:34:14,804 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 1864 transitions. Word has length 1766 [2018-10-14 16:34:14,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:34:14,805 INFO L481 AbstractCegarLoop]: Abstraction has 1838 states and 1864 transitions. [2018-10-14 16:34:14,805 INFO L482 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-14 16:34:14,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 1864 transitions. [2018-10-14 16:34:14,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1838 [2018-10-14 16:34:14,823 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:34:14,824 INFO L375 BasicCegarLoop]: trace histogram [75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:34:14,824 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:34:14,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:34:14,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1692871084, now seen corresponding path program 29 times [2018-10-14 16:34:14,826 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:34:14,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:34:25,978 INFO L134 CoverageAnalysis]: Checked inductivity of 52568 backedges. 0 proven. 51432 refuted. 0 times theorem prover too weak. 1136 trivial. 0 not checked. [2018-10-14 16:34:25,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:34:25,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-10-14 16:34:25,979 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-14 16:34:25,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-14 16:34:25,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=816, Invalid=3474, Unknown=0, NotChecked=0, Total=4290 [2018-10-14 16:34:25,980 INFO L87 Difference]: Start difference. First operand 1838 states and 1864 transitions. Second operand 66 states.