java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength2_true-valid-memsafety.c_18.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-502d2f4 [2018-10-12 20:44:32,251 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-12 20:44:32,253 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-12 20:44:32,265 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-12 20:44:32,266 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-12 20:44:32,267 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-12 20:44:32,268 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-12 20:44:32,270 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-12 20:44:32,272 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-12 20:44:32,272 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-12 20:44:32,273 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-12 20:44:32,274 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-12 20:44:32,275 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-12 20:44:32,276 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-12 20:44:32,277 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-12 20:44:32,278 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-12 20:44:32,278 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-12 20:44:32,280 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-12 20:44:32,283 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-12 20:44:32,284 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-12 20:44:32,285 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-12 20:44:32,287 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-12 20:44:32,289 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-12 20:44:32,290 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-12 20:44:32,290 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-12 20:44:32,291 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-12 20:44:32,292 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-12 20:44:32,293 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-12 20:44:32,294 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-12 20:44:32,295 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-12 20:44:32,295 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-12 20:44:32,296 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-12 20:44:32,296 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-12 20:44:32,297 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-12 20:44:32,298 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-12 20:44:32,298 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-12 20:44:32,299 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-12 20:44:32,309 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-12 20:44:32,309 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-12 20:44:32,310 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-12 20:44:32,310 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-12 20:44:32,311 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-12 20:44:32,311 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-12 20:44:32,312 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-12 20:44:32,312 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-12 20:44:32,312 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-12 20:44:32,312 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-12 20:44:32,313 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-12 20:44:32,313 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-12 20:44:32,313 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-12 20:44:32,314 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-12 20:44:32,314 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-12 20:44:32,357 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-12 20:44:32,369 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-12 20:44:32,373 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-12 20:44:32,375 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-12 20:44:32,375 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-12 20:44:32,376 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength2_true-valid-memsafety.c_18.bpl [2018-10-12 20:44:32,376 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength2_true-valid-memsafety.c_18.bpl' [2018-10-12 20:44:32,444 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-12 20:44:32,446 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-12 20:44:32,446 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-12 20:44:32,447 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-12 20:44:32,447 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-12 20:44:32,474 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_18.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:44:32" (1/1) ... [2018-10-12 20:44:32,476 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_18.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:44:32" (1/1) ... [2018-10-12 20:44:32,492 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_18.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:44:32" (1/1) ... [2018-10-12 20:44:32,492 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_18.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:44:32" (1/1) ... [2018-10-12 20:44:32,502 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_18.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:44:32" (1/1) ... [2018-10-12 20:44:32,505 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_18.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:44:32" (1/1) ... [2018-10-12 20:44:32,507 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_18.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:44:32" (1/1) ... [2018-10-12 20:44:32,514 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-12 20:44:32,518 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-12 20:44:32,519 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-12 20:44:32,519 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-12 20:44:32,522 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArraysOfVariableLength2_true-valid-memsafety.c_18.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:44:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-12 20:44:32,596 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-12 20:44:32,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-12 20:44:32,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-12 20:44:33,291 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-12 20:44:33,292 INFO L202 PluginConnector]: Adding new model ArraysOfVariableLength2_true-valid-memsafety.c_18.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:44:33 BoogieIcfgContainer [2018-10-12 20:44:33,292 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-12 20:44:33,293 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-12 20:44:33,294 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-12 20:44:33,297 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-12 20:44:33,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength2_true-valid-memsafety.c_18.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:44:32" (1/2) ... [2018-10-12 20:44:33,298 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@574edbc2 and model type ArraysOfVariableLength2_true-valid-memsafety.c_18.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:44:33, skipping insertion in model container [2018-10-12 20:44:33,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength2_true-valid-memsafety.c_18.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:44:33" (2/2) ... [2018-10-12 20:44:33,301 INFO L112 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength2_true-valid-memsafety.c_18.bpl [2018-10-12 20:44:33,310 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-12 20:44:33,319 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-12 20:44:33,336 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-12 20:44:33,364 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-12 20:44:33,365 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-12 20:44:33,365 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-12 20:44:33,365 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-12 20:44:33,366 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-12 20:44:33,366 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-12 20:44:33,366 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-12 20:44:33,366 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-12 20:44:33,366 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-12 20:44:33,386 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states. [2018-10-12 20:44:33,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-12 20:44:33,398 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:33,399 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:44:33,400 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:33,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:33,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1777504921, now seen corresponding path program 1 times [2018-10-12 20:44:33,456 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:33,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:34,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:44:34,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-12 20:44:34,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-12 20:44:34,256 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-12 20:44:34,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-12 20:44:34,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-10-12 20:44:34,277 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 12 states. [2018-10-12 20:44:34,570 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-12 20:44:35,126 WARN L178 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-10-12 20:44:35,301 WARN L178 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-10-12 20:44:35,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:35,955 INFO L93 Difference]: Finished difference Result 204 states and 208 transitions. [2018-10-12 20:44:35,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-12 20:44:35,958 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 64 [2018-10-12 20:44:35,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:35,981 INFO L225 Difference]: With dead ends: 204 [2018-10-12 20:44:35,981 INFO L226 Difference]: Without dead ends: 204 [2018-10-12 20:44:35,984 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2018-10-12 20:44:36,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-10-12 20:44:36,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 185. [2018-10-12 20:44:36,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-10-12 20:44:36,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 189 transitions. [2018-10-12 20:44:36,054 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 189 transitions. Word has length 64 [2018-10-12 20:44:36,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:36,055 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 189 transitions. [2018-10-12 20:44:36,055 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-12 20:44:36,056 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 189 transitions. [2018-10-12 20:44:36,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-12 20:44:36,061 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:36,061 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-12 20:44:36,061 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:36,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:36,062 INFO L82 PathProgramCache]: Analyzing trace with hash 123713428, now seen corresponding path program 1 times [2018-10-12 20:44:36,063 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:36,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:36,373 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 26 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:44:36,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:44:36,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-12 20:44:36,376 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-12 20:44:36,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-12 20:44:36,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-12 20:44:36,377 INFO L87 Difference]: Start difference. First operand 185 states and 189 transitions. Second operand 8 states. [2018-10-12 20:44:36,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:36,723 INFO L93 Difference]: Finished difference Result 306 states and 312 transitions. [2018-10-12 20:44:36,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-12 20:44:36,726 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 118 [2018-10-12 20:44:36,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:36,730 INFO L225 Difference]: With dead ends: 306 [2018-10-12 20:44:36,730 INFO L226 Difference]: Without dead ends: 306 [2018-10-12 20:44:36,731 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-10-12 20:44:36,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-10-12 20:44:36,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 213. [2018-10-12 20:44:36,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-12 20:44:36,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 217 transitions. [2018-10-12 20:44:36,747 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 217 transitions. Word has length 118 [2018-10-12 20:44:36,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:36,748 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 217 transitions. [2018-10-12 20:44:36,749 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-12 20:44:36,749 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 217 transitions. [2018-10-12 20:44:36,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-12 20:44:36,757 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:36,758 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:44:36,758 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:36,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:36,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1233070383, now seen corresponding path program 1 times [2018-10-12 20:44:36,759 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:36,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:37,021 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 17 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-12 20:44:37,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:44:37,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-12 20:44:37,023 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-12 20:44:37,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-12 20:44:37,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-10-12 20:44:37,024 INFO L87 Difference]: Start difference. First operand 213 states and 217 transitions. Second operand 10 states. [2018-10-12 20:44:37,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:37,498 INFO L93 Difference]: Finished difference Result 339 states and 346 transitions. [2018-10-12 20:44:37,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-12 20:44:37,501 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 139 [2018-10-12 20:44:37,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:37,504 INFO L225 Difference]: With dead ends: 339 [2018-10-12 20:44:37,504 INFO L226 Difference]: Without dead ends: 339 [2018-10-12 20:44:37,505 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2018-10-12 20:44:37,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-10-12 20:44:37,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 243. [2018-10-12 20:44:37,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-10-12 20:44:37,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 248 transitions. [2018-10-12 20:44:37,521 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 248 transitions. Word has length 139 [2018-10-12 20:44:37,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:37,522 INFO L481 AbstractCegarLoop]: Abstraction has 243 states and 248 transitions. [2018-10-12 20:44:37,522 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-12 20:44:37,522 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 248 transitions. [2018-10-12 20:44:37,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-10-12 20:44:37,525 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:37,525 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:44:37,526 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:37,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:37,526 INFO L82 PathProgramCache]: Analyzing trace with hash 949328200, now seen corresponding path program 1 times [2018-10-12 20:44:37,527 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:37,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:38,593 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-12 20:44:38,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:44:38,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-12 20:44:38,594 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-12 20:44:38,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-12 20:44:38,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2018-10-12 20:44:38,595 INFO L87 Difference]: Start difference. First operand 243 states and 248 transitions. Second operand 23 states. [2018-10-12 20:44:41,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:41,018 INFO L93 Difference]: Finished difference Result 296 states and 302 transitions. [2018-10-12 20:44:41,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-12 20:44:41,019 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 153 [2018-10-12 20:44:41,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:41,021 INFO L225 Difference]: With dead ends: 296 [2018-10-12 20:44:41,021 INFO L226 Difference]: Without dead ends: 296 [2018-10-12 20:44:41,023 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=243, Invalid=1563, Unknown=0, NotChecked=0, Total=1806 [2018-10-12 20:44:41,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-10-12 20:44:41,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 274. [2018-10-12 20:44:41,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-10-12 20:44:41,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 280 transitions. [2018-10-12 20:44:41,034 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 280 transitions. Word has length 153 [2018-10-12 20:44:41,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:41,034 INFO L481 AbstractCegarLoop]: Abstraction has 274 states and 280 transitions. [2018-10-12 20:44:41,034 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-12 20:44:41,035 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 280 transitions. [2018-10-12 20:44:41,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-10-12 20:44:41,038 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:41,039 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:44:41,039 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:41,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:41,040 INFO L82 PathProgramCache]: Analyzing trace with hash -245854027, now seen corresponding path program 2 times [2018-10-12 20:44:41,041 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:41,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:41,980 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 56 proven. 94 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-12 20:44:41,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:44:41,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-12 20:44:41,981 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-12 20:44:41,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-12 20:44:41,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-10-12 20:44:41,982 INFO L87 Difference]: Start difference. First operand 274 states and 280 transitions. Second operand 10 states. [2018-10-12 20:44:42,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:42,283 INFO L93 Difference]: Finished difference Result 306 states and 312 transitions. [2018-10-12 20:44:42,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-12 20:44:42,284 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 207 [2018-10-12 20:44:42,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:42,287 INFO L225 Difference]: With dead ends: 306 [2018-10-12 20:44:42,287 INFO L226 Difference]: Without dead ends: 306 [2018-10-12 20:44:42,288 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2018-10-12 20:44:42,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-10-12 20:44:42,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 275. [2018-10-12 20:44:42,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-10-12 20:44:42,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 281 transitions. [2018-10-12 20:44:42,296 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 281 transitions. Word has length 207 [2018-10-12 20:44:42,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:42,297 INFO L481 AbstractCegarLoop]: Abstraction has 275 states and 281 transitions. [2018-10-12 20:44:42,297 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-12 20:44:42,297 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 281 transitions. [2018-10-12 20:44:42,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-10-12 20:44:42,301 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:42,301 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:44:42,302 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:42,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:42,302 INFO L82 PathProgramCache]: Analyzing trace with hash 2096430766, now seen corresponding path program 3 times [2018-10-12 20:44:42,303 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:42,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:42,579 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 56 proven. 118 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-12 20:44:42,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:44:42,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-12 20:44:42,580 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-12 20:44:42,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-12 20:44:42,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-10-12 20:44:42,581 INFO L87 Difference]: Start difference. First operand 275 states and 281 transitions. Second operand 12 states. [2018-10-12 20:44:43,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:43,077 INFO L93 Difference]: Finished difference Result 308 states and 314 transitions. [2018-10-12 20:44:43,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-12 20:44:43,078 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 228 [2018-10-12 20:44:43,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:43,080 INFO L225 Difference]: With dead ends: 308 [2018-10-12 20:44:43,080 INFO L226 Difference]: Without dead ends: 308 [2018-10-12 20:44:43,081 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=477, Unknown=0, NotChecked=0, Total=600 [2018-10-12 20:44:43,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-10-12 20:44:43,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 296. [2018-10-12 20:44:43,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-10-12 20:44:43,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 302 transitions. [2018-10-12 20:44:43,088 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 302 transitions. Word has length 228 [2018-10-12 20:44:43,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:43,089 INFO L481 AbstractCegarLoop]: Abstraction has 296 states and 302 transitions. [2018-10-12 20:44:43,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-12 20:44:43,089 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 302 transitions. [2018-10-12 20:44:43,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-10-12 20:44:43,093 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:43,093 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:44:43,093 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:43,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:43,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1398879829, now seen corresponding path program 4 times [2018-10-12 20:44:43,095 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:43,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:43,258 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 102 proven. 23 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-10-12 20:44:43,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:44:43,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-12 20:44:43,259 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-12 20:44:43,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-12 20:44:43,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-10-12 20:44:43,260 INFO L87 Difference]: Start difference. First operand 296 states and 302 transitions. Second operand 9 states. [2018-10-12 20:44:43,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:43,676 INFO L93 Difference]: Finished difference Result 751 states and 766 transitions. [2018-10-12 20:44:43,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-12 20:44:43,682 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 249 [2018-10-12 20:44:43,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:43,686 INFO L225 Difference]: With dead ends: 751 [2018-10-12 20:44:43,686 INFO L226 Difference]: Without dead ends: 751 [2018-10-12 20:44:43,687 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2018-10-12 20:44:43,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2018-10-12 20:44:43,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 328. [2018-10-12 20:44:43,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-10-12 20:44:43,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 336 transitions. [2018-10-12 20:44:43,697 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 336 transitions. Word has length 249 [2018-10-12 20:44:43,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:43,697 INFO L481 AbstractCegarLoop]: Abstraction has 328 states and 336 transitions. [2018-10-12 20:44:43,697 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-12 20:44:43,698 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 336 transitions. [2018-10-12 20:44:43,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-10-12 20:44:43,701 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:43,702 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:44:43,702 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:43,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:43,702 INFO L82 PathProgramCache]: Analyzing trace with hash -907105298, now seen corresponding path program 5 times [2018-10-12 20:44:43,703 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:43,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:44,026 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 118 proven. 24 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-10-12 20:44:44,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:44:44,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-12 20:44:44,028 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-12 20:44:44,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-12 20:44:44,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-10-12 20:44:44,029 INFO L87 Difference]: Start difference. First operand 328 states and 336 transitions. Second operand 11 states. [2018-10-12 20:44:44,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:44,574 INFO L93 Difference]: Finished difference Result 757 states and 772 transitions. [2018-10-12 20:44:44,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-12 20:44:44,579 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 263 [2018-10-12 20:44:44,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:44,583 INFO L225 Difference]: With dead ends: 757 [2018-10-12 20:44:44,583 INFO L226 Difference]: Without dead ends: 757 [2018-10-12 20:44:44,584 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=175, Invalid=637, Unknown=0, NotChecked=0, Total=812 [2018-10-12 20:44:44,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2018-10-12 20:44:44,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 399. [2018-10-12 20:44:44,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-10-12 20:44:44,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 408 transitions. [2018-10-12 20:44:44,592 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 408 transitions. Word has length 263 [2018-10-12 20:44:44,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:44,593 INFO L481 AbstractCegarLoop]: Abstraction has 399 states and 408 transitions. [2018-10-12 20:44:44,593 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-12 20:44:44,593 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 408 transitions. [2018-10-12 20:44:44,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-10-12 20:44:44,595 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:44,595 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:44:44,595 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:44,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:44,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1097720263, now seen corresponding path program 6 times [2018-10-12 20:44:44,597 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:44,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:45,239 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-12 20:44:46,565 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 0 proven. 250 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-10-12 20:44:46,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:44:46,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-12 20:44:46,567 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-12 20:44:46,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-12 20:44:46,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1081, Unknown=0, NotChecked=0, Total=1190 [2018-10-12 20:44:46,568 INFO L87 Difference]: Start difference. First operand 399 states and 408 transitions. Second operand 35 states. [2018-10-12 20:44:49,831 WARN L178 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-10-12 20:44:50,770 WARN L178 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2018-10-12 20:44:51,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:51,378 INFO L93 Difference]: Finished difference Result 544 states and 555 transitions. [2018-10-12 20:44:51,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-12 20:44:51,379 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 277 [2018-10-12 20:44:51,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:51,383 INFO L225 Difference]: With dead ends: 544 [2018-10-12 20:44:51,384 INFO L226 Difference]: Without dead ends: 544 [2018-10-12 20:44:51,386 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1099 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=417, Invalid=4005, Unknown=0, NotChecked=0, Total=4422 [2018-10-12 20:44:51,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2018-10-12 20:44:51,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 523. [2018-10-12 20:44:51,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2018-10-12 20:44:51,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 534 transitions. [2018-10-12 20:44:51,400 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 534 transitions. Word has length 277 [2018-10-12 20:44:51,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:51,400 INFO L481 AbstractCegarLoop]: Abstraction has 523 states and 534 transitions. [2018-10-12 20:44:51,401 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-12 20:44:51,401 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 534 transitions. [2018-10-12 20:44:51,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2018-10-12 20:44:51,403 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:51,404 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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-12 20:44:51,404 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:51,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:51,404 INFO L82 PathProgramCache]: Analyzing trace with hash -758820410, now seen corresponding path program 7 times [2018-10-12 20:44:51,405 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:51,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:52,116 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 187 proven. 439 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-10-12 20:44:52,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:44:52,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-12 20:44:52,117 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-12 20:44:52,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-12 20:44:52,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-10-12 20:44:52,118 INFO L87 Difference]: Start difference. First operand 523 states and 534 transitions. Second operand 18 states. [2018-10-12 20:44:52,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:52,954 INFO L93 Difference]: Finished difference Result 610 states and 622 transitions. [2018-10-12 20:44:52,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-12 20:44:52,954 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 401 [2018-10-12 20:44:52,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:52,958 INFO L225 Difference]: With dead ends: 610 [2018-10-12 20:44:52,959 INFO L226 Difference]: Without dead ends: 610 [2018-10-12 20:44:52,960 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=308, Invalid=1252, Unknown=0, NotChecked=0, Total=1560 [2018-10-12 20:44:52,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2018-10-12 20:44:52,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 537. [2018-10-12 20:44:52,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2018-10-12 20:44:52,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 548 transitions. [2018-10-12 20:44:52,968 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 548 transitions. Word has length 401 [2018-10-12 20:44:52,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:52,969 INFO L481 AbstractCegarLoop]: Abstraction has 537 states and 548 transitions. [2018-10-12 20:44:52,969 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-12 20:44:52,969 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 548 transitions. [2018-10-12 20:44:52,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2018-10-12 20:44:52,972 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:52,972 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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-12 20:44:52,973 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:52,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:52,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1482780063, now seen corresponding path program 8 times [2018-10-12 20:44:52,974 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:53,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:53,763 INFO L134 CoverageAnalysis]: Checked inductivity of 764 backedges. 385 proven. 37 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2018-10-12 20:44:53,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:44:53,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-12 20:44:53,764 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-12 20:44:53,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-12 20:44:53,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-10-12 20:44:53,765 INFO L87 Difference]: Start difference. First operand 537 states and 548 transitions. Second operand 15 states. [2018-10-12 20:44:55,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:55,298 INFO L93 Difference]: Finished difference Result 1594 states and 1623 transitions. [2018-10-12 20:44:55,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-12 20:44:55,298 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 415 [2018-10-12 20:44:55,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:55,305 INFO L225 Difference]: With dead ends: 1594 [2018-10-12 20:44:55,306 INFO L226 Difference]: Without dead ends: 1554 [2018-10-12 20:44:55,308 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2242 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1134, Invalid=5346, Unknown=0, NotChecked=0, Total=6480 [2018-10-12 20:44:55,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2018-10-12 20:44:55,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 762. [2018-10-12 20:44:55,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 762 states. [2018-10-12 20:44:55,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 779 transitions. [2018-10-12 20:44:55,325 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 779 transitions. Word has length 415 [2018-10-12 20:44:55,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:55,326 INFO L481 AbstractCegarLoop]: Abstraction has 762 states and 779 transitions. [2018-10-12 20:44:55,326 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-12 20:44:55,326 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 779 transitions. [2018-10-12 20:44:55,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2018-10-12 20:44:55,329 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:55,329 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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-12 20:44:55,330 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:55,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:55,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1200566010, now seen corresponding path program 9 times [2018-10-12 20:44:55,331 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:55,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:56,465 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-12 20:44:58,913 INFO L134 CoverageAnalysis]: Checked inductivity of 873 backedges. 0 proven. 781 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-10-12 20:44:58,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:44:58,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-12 20:44:58,914 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-12 20:44:58,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-12 20:44:58,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=2161, Unknown=0, NotChecked=0, Total=2352 [2018-10-12 20:44:58,915 INFO L87 Difference]: Start difference. First operand 762 states and 779 transitions. Second operand 49 states. [2018-10-12 20:45:02,011 WARN L178 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 36 [2018-10-12 20:45:03,314 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 36 [2018-10-12 20:45:03,858 WARN L178 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 27 [2018-10-12 20:45:05,191 WARN L178 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 39 [2018-10-12 20:45:07,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:07,656 INFO L93 Difference]: Finished difference Result 1022 states and 1043 transitions. [2018-10-12 20:45:07,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-12 20:45:07,656 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 436 [2018-10-12 20:45:07,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:07,661 INFO L225 Difference]: With dead ends: 1022 [2018-10-12 20:45:07,661 INFO L226 Difference]: Without dead ends: 1022 [2018-10-12 20:45:07,665 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 8 SyntacticMatches, 6 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3824 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=1727, Invalid=11383, Unknown=0, NotChecked=0, Total=13110 [2018-10-12 20:45:07,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2018-10-12 20:45:07,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 921. [2018-10-12 20:45:07,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 921 states. [2018-10-12 20:45:07,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 940 transitions. [2018-10-12 20:45:07,680 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 940 transitions. Word has length 436 [2018-10-12 20:45:07,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:07,681 INFO L481 AbstractCegarLoop]: Abstraction has 921 states and 940 transitions. [2018-10-12 20:45:07,681 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-12 20:45:07,681 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 940 transitions. [2018-10-12 20:45:07,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 596 [2018-10-12 20:45:07,686 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:07,686 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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-12 20:45:07,686 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:07,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:07,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1907174247, now seen corresponding path program 10 times [2018-10-12 20:45:07,688 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:07,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:08,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1858 backedges. 648 proven. 992 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2018-10-12 20:45:08,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:08,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-12 20:45:08,376 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-12 20:45:08,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-12 20:45:08,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2018-10-12 20:45:08,377 INFO L87 Difference]: Start difference. First operand 921 states and 940 transitions. Second operand 22 states. [2018-10-12 20:45:09,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:09,410 INFO L93 Difference]: Finished difference Result 1029 states and 1049 transitions. [2018-10-12 20:45:09,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-12 20:45:09,415 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 595 [2018-10-12 20:45:09,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:09,422 INFO L225 Difference]: With dead ends: 1029 [2018-10-12 20:45:09,422 INFO L226 Difference]: Without dead ends: 1029 [2018-10-12 20:45:09,423 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=473, Invalid=1977, Unknown=0, NotChecked=0, Total=2450 [2018-10-12 20:45:09,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2018-10-12 20:45:09,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 935. [2018-10-12 20:45:09,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 935 states. [2018-10-12 20:45:09,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 954 transitions. [2018-10-12 20:45:09,442 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 954 transitions. Word has length 595 [2018-10-12 20:45:09,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:09,443 INFO L481 AbstractCegarLoop]: Abstraction has 935 states and 954 transitions. [2018-10-12 20:45:09,443 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-12 20:45:09,444 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 954 transitions. [2018-10-12 20:45:09,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 610 [2018-10-12 20:45:09,449 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:09,449 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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-12 20:45:09,449 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:09,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:09,450 INFO L82 PathProgramCache]: Analyzing trace with hash -686335616, now seen corresponding path program 11 times [2018-10-12 20:45:09,451 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:09,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:12,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1989 backedges. 923 proven. 93 refuted. 0 times theorem prover too weak. 973 trivial. 0 not checked. [2018-10-12 20:45:12,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:12,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-12 20:45:12,103 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-12 20:45:12,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-12 20:45:12,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-10-12 20:45:12,104 INFO L87 Difference]: Start difference. First operand 935 states and 954 transitions. Second operand 19 states. [2018-10-12 20:45:13,224 WARN L178 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 11 [2018-10-12 20:45:14,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:14,686 INFO L93 Difference]: Finished difference Result 2443 states and 2486 transitions. [2018-10-12 20:45:14,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-10-12 20:45:14,686 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 609 [2018-10-12 20:45:14,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:14,696 INFO L225 Difference]: With dead ends: 2443 [2018-10-12 20:45:14,696 INFO L226 Difference]: Without dead ends: 2389 [2018-10-12 20:45:14,700 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4879 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1993, Invalid=11117, Unknown=0, NotChecked=0, Total=13110 [2018-10-12 20:45:14,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2389 states. [2018-10-12 20:45:14,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2389 to 1173. [2018-10-12 20:45:14,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1173 states. [2018-10-12 20:45:14,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1197 transitions. [2018-10-12 20:45:14,724 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1197 transitions. Word has length 609 [2018-10-12 20:45:14,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:14,725 INFO L481 AbstractCegarLoop]: Abstraction has 1173 states and 1197 transitions. [2018-10-12 20:45:14,725 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-12 20:45:14,725 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1197 transitions. [2018-10-12 20:45:14,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 631 [2018-10-12 20:45:14,731 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:14,731 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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-12 20:45:14,731 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:14,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:14,732 INFO L82 PathProgramCache]: Analyzing trace with hash 764235019, now seen corresponding path program 12 times [2018-10-12 20:45:14,733 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:14,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:16,008 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-12 20:45:16,257 WARN L178 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-12 20:45:19,558 INFO L134 CoverageAnalysis]: Checked inductivity of 2183 backedges. 0 proven. 1902 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2018-10-12 20:45:19,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:19,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-12 20:45:19,559 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-12 20:45:19,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-12 20:45:19,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=2686, Unknown=0, NotChecked=0, Total=2862 [2018-10-12 20:45:19,560 INFO L87 Difference]: Start difference. First operand 1173 states and 1197 transitions. Second operand 54 states. [2018-10-12 20:45:26,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:26,740 INFO L93 Difference]: Finished difference Result 1388 states and 1414 transitions. [2018-10-12 20:45:26,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-12 20:45:26,741 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 630 [2018-10-12 20:45:26,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:26,747 INFO L225 Difference]: With dead ends: 1388 [2018-10-12 20:45:26,747 INFO L226 Difference]: Without dead ends: 1388 [2018-10-12 20:45:26,751 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 11 SyntacticMatches, 6 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3098 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=692, Invalid=10438, Unknown=0, NotChecked=0, Total=11130 [2018-10-12 20:45:26,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2018-10-12 20:45:26,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 1367. [2018-10-12 20:45:26,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1367 states. [2018-10-12 20:45:26,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 1367 states and 1393 transitions. [2018-10-12 20:45:26,769 INFO L78 Accepts]: Start accepts. Automaton has 1367 states and 1393 transitions. Word has length 630 [2018-10-12 20:45:26,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:26,770 INFO L481 AbstractCegarLoop]: Abstraction has 1367 states and 1393 transitions. [2018-10-12 20:45:26,770 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-12 20:45:26,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1367 states and 1393 transitions. [2018-10-12 20:45:26,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 825 [2018-10-12 20:45:26,778 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:26,778 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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-12 20:45:26,779 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:26,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:26,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1022825180, now seen corresponding path program 13 times [2018-10-12 20:45:26,780 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:26,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:28,349 INFO L134 CoverageAnalysis]: Checked inductivity of 4123 backedges. 2341 proven. 1324 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2018-10-12 20:45:28,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:28,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-12 20:45:28,350 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-12 20:45:28,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-12 20:45:28,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2018-10-12 20:45:28,351 INFO L87 Difference]: Start difference. First operand 1367 states and 1393 transitions. Second operand 24 states. [2018-10-12 20:45:29,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:29,653 INFO L93 Difference]: Finished difference Result 1400 states and 1426 transitions. [2018-10-12 20:45:29,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-12 20:45:29,655 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 824 [2018-10-12 20:45:29,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:29,661 INFO L225 Difference]: With dead ends: 1400 [2018-10-12 20:45:29,661 INFO L226 Difference]: Without dead ends: 1400 [2018-10-12 20:45:29,662 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=564, Invalid=2406, Unknown=0, NotChecked=0, Total=2970 [2018-10-12 20:45:29,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2018-10-12 20:45:29,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1388. [2018-10-12 20:45:29,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1388 states. [2018-10-12 20:45:29,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1388 states to 1388 states and 1414 transitions. [2018-10-12 20:45:29,681 INFO L78 Accepts]: Start accepts. Automaton has 1388 states and 1414 transitions. Word has length 824 [2018-10-12 20:45:29,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:29,682 INFO L481 AbstractCegarLoop]: Abstraction has 1388 states and 1414 transitions. [2018-10-12 20:45:29,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-12 20:45:29,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1388 states and 1414 transitions. [2018-10-12 20:45:29,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 846 [2018-10-12 20:45:29,691 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:29,691 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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-12 20:45:29,691 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:29,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:29,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1962558767, now seen corresponding path program 14 times [2018-10-12 20:45:29,693 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:29,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:32,224 INFO L134 CoverageAnalysis]: Checked inductivity of 4423 backedges. 1879 proven. 234 refuted. 0 times theorem prover too weak. 2310 trivial. 0 not checked. [2018-10-12 20:45:32,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:32,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-12 20:45:32,225 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-12 20:45:32,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-12 20:45:32,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2018-10-12 20:45:32,226 INFO L87 Difference]: Start difference. First operand 1388 states and 1414 transitions. Second operand 23 states. [2018-10-12 20:45:34,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:34,389 INFO L93 Difference]: Finished difference Result 3123 states and 3178 transitions. [2018-10-12 20:45:34,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-12 20:45:34,389 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 845 [2018-10-12 20:45:34,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:34,400 INFO L225 Difference]: With dead ends: 3123 [2018-10-12 20:45:34,400 INFO L226 Difference]: Without dead ends: 3123 [2018-10-12 20:45:34,401 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1325 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=926, Invalid=4186, Unknown=0, NotChecked=0, Total=5112 [2018-10-12 20:45:34,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3123 states. [2018-10-12 20:45:34,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3123 to 1715. [2018-10-12 20:45:34,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1715 states. [2018-10-12 20:45:34,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 1746 transitions. [2018-10-12 20:45:34,431 INFO L78 Accepts]: Start accepts. Automaton has 1715 states and 1746 transitions. Word has length 845 [2018-10-12 20:45:34,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:34,432 INFO L481 AbstractCegarLoop]: Abstraction has 1715 states and 1746 transitions. [2018-10-12 20:45:34,432 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-12 20:45:34,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 1746 transitions. [2018-10-12 20:45:34,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 860 [2018-10-12 20:45:34,441 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:34,441 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:45:34,441 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:34,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:34,442 INFO L82 PathProgramCache]: Analyzing trace with hash 812627272, now seen corresponding path program 15 times [2018-10-12 20:45:34,443 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:34,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:39,211 INFO L134 CoverageAnalysis]: Checked inductivity of 4625 backedges. 0 proven. 4003 refuted. 0 times theorem prover too weak. 622 trivial. 0 not checked. [2018-10-12 20:45:39,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:39,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-12 20:45:39,212 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-12 20:45:39,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-12 20:45:39,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=2694, Unknown=0, NotChecked=0, Total=2862 [2018-10-12 20:45:39,213 INFO L87 Difference]: Start difference. First operand 1715 states and 1746 transitions. Second operand 54 states. [2018-10-12 20:45:45,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:45,879 INFO L93 Difference]: Finished difference Result 1963 states and 1996 transitions. [2018-10-12 20:45:45,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-12 20:45:45,879 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 859 [2018-10-12 20:45:45,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:45,886 INFO L225 Difference]: With dead ends: 1963 [2018-10-12 20:45:45,886 INFO L226 Difference]: Without dead ends: 1963 [2018-10-12 20:45:45,887 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2935 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=627, Invalid=10085, Unknown=0, NotChecked=0, Total=10712 [2018-10-12 20:45:45,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1963 states. [2018-10-12 20:45:45,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1963 to 1944. [2018-10-12 20:45:45,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1944 states. [2018-10-12 20:45:45,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1944 states to 1944 states and 1977 transitions. [2018-10-12 20:45:45,909 INFO L78 Accepts]: Start accepts. Automaton has 1944 states and 1977 transitions. Word has length 859 [2018-10-12 20:45:45,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:45,910 INFO L481 AbstractCegarLoop]: Abstraction has 1944 states and 1977 transitions. [2018-10-12 20:45:45,910 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-12 20:45:45,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1944 states and 1977 transitions. [2018-10-12 20:45:45,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1089 [2018-10-12 20:45:45,923 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:45,924 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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-12 20:45:45,924 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:45,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:45,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1281087275, now seen corresponding path program 16 times [2018-10-12 20:45:45,925 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:45,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:49,306 INFO L134 CoverageAnalysis]: Checked inductivity of 8016 backedges. 4901 proven. 2240 refuted. 0 times theorem prover too weak. 875 trivial. 0 not checked. [2018-10-12 20:45:49,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:49,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-12 20:45:49,308 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-12 20:45:49,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-12 20:45:49,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=651, Unknown=0, NotChecked=0, Total=756 [2018-10-12 20:45:49,308 INFO L87 Difference]: Start difference. First operand 1944 states and 1977 transitions. Second operand 28 states. [2018-10-12 20:45:50,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:50,955 INFO L93 Difference]: Finished difference Result 1977 states and 2010 transitions. [2018-10-12 20:45:50,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-12 20:45:50,956 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 1088 [2018-10-12 20:45:50,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:50,963 INFO L225 Difference]: With dead ends: 1977 [2018-10-12 20:45:50,964 INFO L226 Difference]: Without dead ends: 1977 [2018-10-12 20:45:50,964 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 865 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=787, Invalid=3373, Unknown=0, NotChecked=0, Total=4160 [2018-10-12 20:45:50,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2018-10-12 20:45:50,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 1965. [2018-10-12 20:45:50,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1965 states. [2018-10-12 20:45:50,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 1998 transitions. [2018-10-12 20:45:50,984 INFO L78 Accepts]: Start accepts. Automaton has 1965 states and 1998 transitions. Word has length 1088 [2018-10-12 20:45:50,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:50,985 INFO L481 AbstractCegarLoop]: Abstraction has 1965 states and 1998 transitions. [2018-10-12 20:45:50,985 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-12 20:45:50,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 1998 transitions. [2018-10-12 20:45:50,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1110 [2018-10-12 20:45:50,998 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:50,999 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 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, 20, 20, 20, 20, 20, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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-12 20:45:50,999 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:50,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:50,999 INFO L82 PathProgramCache]: Analyzing trace with hash 4555794, now seen corresponding path program 17 times [2018-10-12 20:45:51,000 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:51,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:52,498 INFO L134 CoverageAnalysis]: Checked inductivity of 8443 backedges. 3332 proven. 332 refuted. 0 times theorem prover too weak. 4779 trivial. 0 not checked. [2018-10-12 20:45:52,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:52,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-12 20:45:52,499 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-12 20:45:52,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-12 20:45:52,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=608, Unknown=0, NotChecked=0, Total=702 [2018-10-12 20:45:52,500 INFO L87 Difference]: Start difference. First operand 1965 states and 1998 transitions. Second operand 27 states. [2018-10-12 20:45:55,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:55,279 INFO L93 Difference]: Finished difference Result 4510 states and 4585 transitions. [2018-10-12 20:45:55,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-12 20:45:55,280 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 1109 [2018-10-12 20:45:55,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:55,292 INFO L225 Difference]: With dead ends: 4510 [2018-10-12 20:45:55,292 INFO L226 Difference]: Without dead ends: 4510 [2018-10-12 20:45:55,293 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1971 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1316, Invalid=5994, Unknown=0, NotChecked=0, Total=7310 [2018-10-12 20:45:55,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4510 states. [2018-10-12 20:45:55,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4510 to 2237. [2018-10-12 20:45:55,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2237 states. [2018-10-12 20:45:55,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2237 states to 2237 states and 2276 transitions. [2018-10-12 20:45:55,326 INFO L78 Accepts]: Start accepts. Automaton has 2237 states and 2276 transitions. Word has length 1109 [2018-10-12 20:45:55,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:55,327 INFO L481 AbstractCegarLoop]: Abstraction has 2237 states and 2276 transitions. [2018-10-12 20:45:55,327 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-12 20:45:55,327 INFO L276 IsEmpty]: Start isEmpty. Operand 2237 states and 2276 transitions. [2018-10-12 20:45:55,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1124 [2018-10-12 20:45:55,340 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:55,341 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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-12 20:45:55,341 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:55,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:55,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1841670891, now seen corresponding path program 18 times [2018-10-12 20:45:55,342 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:55,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:56,715 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-12 20:46:03,714 INFO L134 CoverageAnalysis]: Checked inductivity of 8730 backedges. 0 proven. 7609 refuted. 0 times theorem prover too weak. 1121 trivial. 0 not checked. [2018-10-12 20:46:03,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:46:03,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-12 20:46:03,715 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-12 20:46:03,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-12 20:46:03,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=3953, Unknown=0, NotChecked=0, Total=4160 [2018-10-12 20:46:03,716 INFO L87 Difference]: Start difference. First operand 2237 states and 2276 transitions. Second operand 65 states. [2018-10-12 20:46:13,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:46:13,474 INFO L93 Difference]: Finished difference Result 2524 states and 2565 transitions. [2018-10-12 20:46:13,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-12 20:46:13,475 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 1123 [2018-10-12 20:46:13,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:46:13,483 INFO L225 Difference]: With dead ends: 2524 [2018-10-12 20:46:13,483 INFO L226 Difference]: Without dead ends: 2524 [2018-10-12 20:46:13,484 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 17 SyntacticMatches, 4 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4501 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=792, Invalid=15210, Unknown=0, NotChecked=0, Total=16002 [2018-10-12 20:46:13,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2524 states. [2018-10-12 20:46:13,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2524 to 2501. [2018-10-12 20:46:13,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2501 states. [2018-10-12 20:46:13,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2501 states to 2501 states and 2542 transitions. [2018-10-12 20:46:13,507 INFO L78 Accepts]: Start accepts. Automaton has 2501 states and 2542 transitions. Word has length 1123 [2018-10-12 20:46:13,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:46:13,508 INFO L481 AbstractCegarLoop]: Abstraction has 2501 states and 2542 transitions. [2018-10-12 20:46:13,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-12 20:46:13,509 INFO L276 IsEmpty]: Start isEmpty. Operand 2501 states and 2542 transitions. [2018-10-12 20:46:13,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1388 [2018-10-12 20:46:13,528 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:46:13,529 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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-12 20:46:13,529 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:46:13,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:46:13,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1144066674, now seen corresponding path program 19 times [2018-10-12 20:46:13,530 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:46:13,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:46:16,381 INFO L134 CoverageAnalysis]: Checked inductivity of 14173 backedges. 9172 proven. 3518 refuted. 0 times theorem prover too weak. 1483 trivial. 0 not checked. [2018-10-12 20:46:16,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:46:16,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-12 20:46:16,382 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-12 20:46:16,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-12 20:46:16,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=857, Unknown=0, NotChecked=0, Total=992 [2018-10-12 20:46:16,383 INFO L87 Difference]: Start difference. First operand 2501 states and 2542 transitions. Second operand 32 states. [2018-10-12 20:46:18,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:46:18,603 INFO L93 Difference]: Finished difference Result 2534 states and 2575 transitions. [2018-10-12 20:46:18,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-12 20:46:18,604 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 1387 [2018-10-12 20:46:18,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:46:18,612 INFO L225 Difference]: With dead ends: 2534 [2018-10-12 20:46:18,613 INFO L226 Difference]: Without dead ends: 2534 [2018-10-12 20:46:18,614 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1188 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1048, Invalid=4502, Unknown=0, NotChecked=0, Total=5550 [2018-10-12 20:46:18,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2534 states. [2018-10-12 20:46:18,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2534 to 2522. [2018-10-12 20:46:18,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2522 states. [2018-10-12 20:46:18,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2522 states to 2522 states and 2563 transitions. [2018-10-12 20:46:18,637 INFO L78 Accepts]: Start accepts. Automaton has 2522 states and 2563 transitions. Word has length 1387 [2018-10-12 20:46:18,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:46:18,638 INFO L481 AbstractCegarLoop]: Abstraction has 2522 states and 2563 transitions. [2018-10-12 20:46:18,638 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-12 20:46:18,638 INFO L276 IsEmpty]: Start isEmpty. Operand 2522 states and 2563 transitions. [2018-10-12 20:46:18,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1409 [2018-10-12 20:46:18,657 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:46:18,658 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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-12 20:46:18,658 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:46:18,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:46:18,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1425920543, now seen corresponding path program 20 times [2018-10-12 20:46:18,660 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:46:18,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:46:20,926 INFO L134 CoverageAnalysis]: Checked inductivity of 14748 backedges. 5393 proven. 444 refuted. 0 times theorem prover too weak. 8911 trivial. 0 not checked. [2018-10-12 20:46:20,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:46:20,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-12 20:46:20,927 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-12 20:46:20,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-12 20:46:20,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=808, Unknown=0, NotChecked=0, Total=930 [2018-10-12 20:46:20,927 INFO L87 Difference]: Start difference. First operand 2522 states and 2563 transitions. Second operand 31 states. [2018-10-12 20:46:23,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:46:23,480 INFO L93 Difference]: Finished difference Result 6218 states and 6316 transitions. [2018-10-12 20:46:23,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-12 20:46:23,480 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 1408 [2018-10-12 20:46:23,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:46:23,498 INFO L225 Difference]: With dead ends: 6218 [2018-10-12 20:46:23,499 INFO L226 Difference]: Without dead ends: 6218 [2018-10-12 20:46:23,500 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2744 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1777, Invalid=8123, Unknown=0, NotChecked=0, Total=9900 [2018-10-12 20:46:23,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6218 states. [2018-10-12 20:46:23,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6218 to 2837. [2018-10-12 20:46:23,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2837 states. [2018-10-12 20:46:23,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2837 states to 2837 states and 2885 transitions. [2018-10-12 20:46:23,537 INFO L78 Accepts]: Start accepts. Automaton has 2837 states and 2885 transitions. Word has length 1408 [2018-10-12 20:46:23,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:46:23,538 INFO L481 AbstractCegarLoop]: Abstraction has 2837 states and 2885 transitions. [2018-10-12 20:46:23,538 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-12 20:46:23,538 INFO L276 IsEmpty]: Start isEmpty. Operand 2837 states and 2885 transitions. [2018-10-12 20:46:23,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1423 [2018-10-12 20:46:23,557 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:46:23,558 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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-12 20:46:23,558 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:46:23,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:46:23,559 INFO L82 PathProgramCache]: Analyzing trace with hash 554794618, now seen corresponding path program 21 times [2018-10-12 20:46:23,560 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:46:23,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:46:24,795 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-12 20:46:34,924 INFO L134 CoverageAnalysis]: Checked inductivity of 15134 backedges. 0 proven. 13310 refuted. 0 times theorem prover too weak. 1824 trivial. 0 not checked. [2018-10-12 20:46:34,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:46:34,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-10-12 20:46:34,926 INFO L460 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-10-12 20:46:34,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-10-12 20:46:34,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=5454, Unknown=0, NotChecked=0, Total=5700 [2018-10-12 20:46:34,927 INFO L87 Difference]: Start difference. First operand 2837 states and 2885 transitions. Second operand 76 states. [2018-10-12 20:46:49,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:46:49,600 INFO L93 Difference]: Finished difference Result 3167 states and 3217 transitions. [2018-10-12 20:46:49,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-10-12 20:46:49,600 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 1422 [2018-10-12 20:46:49,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:46:49,605 INFO L225 Difference]: With dead ends: 3167 [2018-10-12 20:46:49,605 INFO L226 Difference]: Without dead ends: 3167 [2018-10-12 20:46:49,606 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 20 SyntacticMatches, 9 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6696 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=971, Invalid=21679, Unknown=0, NotChecked=0, Total=22650 [2018-10-12 20:46:49,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3167 states. [2018-10-12 20:46:49,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3167 to 3136. [2018-10-12 20:46:49,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3136 states. [2018-10-12 20:46:49,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3136 states to 3136 states and 3186 transitions. [2018-10-12 20:46:49,627 INFO L78 Accepts]: Start accepts. Automaton has 3136 states and 3186 transitions. Word has length 1422 [2018-10-12 20:46:49,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:46:49,628 INFO L481 AbstractCegarLoop]: Abstraction has 3136 states and 3186 transitions. [2018-10-12 20:46:49,628 INFO L482 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-10-12 20:46:49,628 INFO L276 IsEmpty]: Start isEmpty. Operand 3136 states and 3186 transitions. [2018-10-12 20:46:49,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1722 [2018-10-12 20:46:49,652 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:46:49,653 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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-12 20:46:49,653 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:46:49,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:46:49,654 INFO L82 PathProgramCache]: Analyzing trace with hash 587892619, now seen corresponding path program 22 times [2018-10-12 20:46:49,655 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:46:49,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:46:53,142 INFO L134 CoverageAnalysis]: Checked inductivity of 23335 backedges. 15797 proven. 5221 refuted. 0 times theorem prover too weak. 2317 trivial. 0 not checked. [2018-10-12 20:46:53,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:46:53,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-12 20:46:53,144 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-12 20:46:53,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-12 20:46:53,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1091, Unknown=0, NotChecked=0, Total=1260 [2018-10-12 20:46:53,145 INFO L87 Difference]: Start difference. First operand 3136 states and 3186 transitions. Second operand 36 states. [2018-10-12 20:46:56,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:46:56,113 INFO L93 Difference]: Finished difference Result 3169 states and 3219 transitions. [2018-10-12 20:46:56,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-12 20:46:56,114 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 1721 [2018-10-12 20:46:56,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:46:56,121 INFO L225 Difference]: With dead ends: 3169 [2018-10-12 20:46:56,121 INFO L226 Difference]: Without dead ends: 3169 [2018-10-12 20:46:56,122 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1562 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1347, Invalid=5793, Unknown=0, NotChecked=0, Total=7140 [2018-10-12 20:46:56,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3169 states. [2018-10-12 20:46:56,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3169 to 3157. [2018-10-12 20:46:56,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3157 states. [2018-10-12 20:46:56,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3157 states to 3157 states and 3207 transitions. [2018-10-12 20:46:56,142 INFO L78 Accepts]: Start accepts. Automaton has 3157 states and 3207 transitions. Word has length 1721 [2018-10-12 20:46:56,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:46:56,143 INFO L481 AbstractCegarLoop]: Abstraction has 3157 states and 3207 transitions. [2018-10-12 20:46:56,143 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-12 20:46:56,143 INFO L276 IsEmpty]: Start isEmpty. Operand 3157 states and 3207 transitions. [2018-10-12 20:46:56,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1743 [2018-10-12 20:46:56,164 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:46:56,164 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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-12 20:46:56,165 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:46:56,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:46:56,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1370325206, now seen corresponding path program 23 times [2018-10-12 20:46:56,166 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:46:56,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:46:58,371 INFO L134 CoverageAnalysis]: Checked inductivity of 24079 backedges. 8167 proven. 570 refuted. 0 times theorem prover too weak. 15342 trivial. 0 not checked. [2018-10-12 20:46:58,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:46:58,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-12 20:46:58,373 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-12 20:46:58,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-12 20:46:58,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1036, Unknown=0, NotChecked=0, Total=1190 [2018-10-12 20:46:58,374 INFO L87 Difference]: Start difference. First operand 3157 states and 3207 transitions. Second operand 35 states. [2018-10-12 20:47:02,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:47:02,860 INFO L93 Difference]: Finished difference Result 8275 states and 8399 transitions. [2018-10-12 20:47:02,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-10-12 20:47:02,861 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 1742 [2018-10-12 20:47:02,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:47:02,875 INFO L225 Difference]: With dead ends: 8275 [2018-10-12 20:47:02,875 INFO L226 Difference]: Without dead ends: 8275 [2018-10-12 20:47:02,876 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3644 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2309, Invalid=10573, Unknown=0, NotChecked=0, Total=12882 [2018-10-12 20:47:02,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8275 states. [2018-10-12 20:47:02,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8275 to 3515. [2018-10-12 20:47:02,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3515 states. [2018-10-12 20:47:02,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3515 states to 3515 states and 3573 transitions. [2018-10-12 20:47:02,921 INFO L78 Accepts]: Start accepts. Automaton has 3515 states and 3573 transitions. Word has length 1742 [2018-10-12 20:47:02,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:47:02,922 INFO L481 AbstractCegarLoop]: Abstraction has 3515 states and 3573 transitions. [2018-10-12 20:47:02,922 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-12 20:47:02,922 INFO L276 IsEmpty]: Start isEmpty. Operand 3515 states and 3573 transitions. [2018-10-12 20:47:02,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1757 [2018-10-12 20:47:02,945 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:47:02,946 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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-12 20:47:02,946 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:47:02,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:47:02,947 INFO L82 PathProgramCache]: Analyzing trace with hash -2021523281, now seen corresponding path program 24 times [2018-10-12 20:47:02,947 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:47:03,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:47:20,291 INFO L134 CoverageAnalysis]: Checked inductivity of 24578 backedges. 0 proven. 22008 refuted. 0 times theorem prover too weak. 2570 trivial. 0 not checked. [2018-10-12 20:47:20,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:47:20,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-10-12 20:47:20,292 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-12 20:47:20,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-12 20:47:20,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=8982, Unknown=0, NotChecked=0, Total=9312 [2018-10-12 20:47:20,293 INFO L87 Difference]: Start difference. First operand 3515 states and 3573 transitions. Second operand 97 states. [2018-10-12 20:47:43,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:47:43,536 INFO L93 Difference]: Finished difference Result 3896 states and 3956 transitions. [2018-10-12 20:47:43,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-10-12 20:47:43,536 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 1756 [2018-10-12 20:47:43,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:47:43,546 INFO L225 Difference]: With dead ends: 3896 [2018-10-12 20:47:43,546 INFO L226 Difference]: Without dead ends: 3896 [2018-10-12 20:47:43,548 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 21 SyntacticMatches, 11 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11877 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=1398, Invalid=38004, Unknown=0, NotChecked=0, Total=39402 [2018-10-12 20:47:43,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3896 states. [2018-10-12 20:47:43,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3896 to 3849. [2018-10-12 20:47:43,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3849 states. [2018-10-12 20:47:43,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3849 states to 3849 states and 3909 transitions. [2018-10-12 20:47:43,578 INFO L78 Accepts]: Start accepts. Automaton has 3849 states and 3909 transitions. Word has length 1756 [2018-10-12 20:47:43,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:47:43,579 INFO L481 AbstractCegarLoop]: Abstraction has 3849 states and 3909 transitions. [2018-10-12 20:47:43,580 INFO L482 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-12 20:47:43,580 INFO L276 IsEmpty]: Start isEmpty. Operand 3849 states and 3909 transitions. [2018-10-12 20:47:43,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2091 [2018-10-12 20:47:43,616 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:47:43,617 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:47:43,618 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:47:43,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:47:43,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1018509860, now seen corresponding path program 25 times [2018-10-12 20:47:43,619 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:47:43,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:47:48,258 INFO L134 CoverageAnalysis]: Checked inductivity of 36348 backedges. 25524 proven. 7412 refuted. 0 times theorem prover too weak. 3412 trivial. 0 not checked. [2018-10-12 20:47:48,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:47:48,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-12 20:47:48,260 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-12 20:47:48,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-12 20:47:48,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1353, Unknown=0, NotChecked=0, Total=1560 [2018-10-12 20:47:48,261 INFO L87 Difference]: Start difference. First operand 3849 states and 3909 transitions. Second operand 40 states. [2018-10-12 20:47:51,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:47:51,727 INFO L93 Difference]: Finished difference Result 3882 states and 3942 transitions. [2018-10-12 20:47:51,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-12 20:47:51,727 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 2090 [2018-10-12 20:47:51,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:47:51,732 INFO L225 Difference]: With dead ends: 3882 [2018-10-12 20:47:51,732 INFO L226 Difference]: Without dead ends: 3882 [2018-10-12 20:47:51,733 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1987 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1684, Invalid=7246, Unknown=0, NotChecked=0, Total=8930 [2018-10-12 20:47:51,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3882 states. [2018-10-12 20:47:51,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3882 to 3870. [2018-10-12 20:47:51,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3870 states. [2018-10-12 20:47:51,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3870 states to 3870 states and 3930 transitions. [2018-10-12 20:47:51,761 INFO L78 Accepts]: Start accepts. Automaton has 3870 states and 3930 transitions. Word has length 2090 [2018-10-12 20:47:51,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:47:51,762 INFO L481 AbstractCegarLoop]: Abstraction has 3870 states and 3930 transitions. [2018-10-12 20:47:51,762 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-12 20:47:51,762 INFO L276 IsEmpty]: Start isEmpty. Operand 3870 states and 3930 transitions. [2018-10-12 20:47:51,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2112 [2018-10-12 20:47:51,804 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:47:51,805 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:47:51,805 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:47:51,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:47:51,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1403871953, now seen corresponding path program 26 times [2018-10-12 20:47:51,807 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:47:51,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:47:54,731 INFO L134 CoverageAnalysis]: Checked inductivity of 37282 backedges. 11759 proven. 710 refuted. 0 times theorem prover too weak. 24813 trivial. 0 not checked. [2018-10-12 20:47:54,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:47:54,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-12 20:47:54,733 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-12 20:47:54,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-12 20:47:54,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1292, Unknown=0, NotChecked=0, Total=1482 [2018-10-12 20:47:54,734 INFO L87 Difference]: Start difference. First operand 3870 states and 3930 transitions. Second operand 39 states. [2018-10-12 20:47:59,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:47:59,883 INFO L93 Difference]: Finished difference Result 10709 states and 10862 transitions. [2018-10-12 20:47:59,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-10-12 20:47:59,890 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 2111 [2018-10-12 20:47:59,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:47:59,899 INFO L225 Difference]: With dead ends: 10709 [2018-10-12 20:47:59,900 INFO L226 Difference]: Without dead ends: 10709 [2018-10-12 20:47:59,901 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4671 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2912, Invalid=13344, Unknown=0, NotChecked=0, Total=16256 [2018-10-12 20:47:59,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10709 states. [2018-10-12 20:47:59,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10709 to 4271. [2018-10-12 20:47:59,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4271 states. [2018-10-12 20:47:59,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4271 states to 4271 states and 4340 transitions. [2018-10-12 20:47:59,955 INFO L78 Accepts]: Start accepts. Automaton has 4271 states and 4340 transitions. Word has length 2111 [2018-10-12 20:47:59,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:47:59,956 INFO L481 AbstractCegarLoop]: Abstraction has 4271 states and 4340 transitions. [2018-10-12 20:47:59,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-12 20:47:59,957 INFO L276 IsEmpty]: Start isEmpty. Operand 4271 states and 4340 transitions. [2018-10-12 20:48:00,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2126 [2018-10-12 20:48:00,002 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:48:00,003 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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-12 20:48:00,003 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:48:00,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:48:00,004 INFO L82 PathProgramCache]: Analyzing trace with hash 441322824, now seen corresponding path program 27 times [2018-10-12 20:48:00,005 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:48:00,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:48:21,291 INFO L134 CoverageAnalysis]: Checked inductivity of 37908 backedges. 0 proven. 33900 refuted. 0 times theorem prover too weak. 4008 trivial. 0 not checked. [2018-10-12 20:48:21,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:48:21,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-10-12 20:48:21,293 INFO L460 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-10-12 20:48:21,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-10-12 20:48:21,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=8072, Unknown=0, NotChecked=0, Total=8372 [2018-10-12 20:48:21,294 INFO L87 Difference]: Start difference. First operand 4271 states and 4340 transitions. Second operand 92 states. [2018-10-12 20:48:27,062 WARN L178 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-10-12 20:48:41,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:48:41,138 INFO L93 Difference]: Finished difference Result 4673 states and 4744 transitions. [2018-10-12 20:48:41,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-10-12 20:48:41,138 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 2125 [2018-10-12 20:48:41,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:48:41,143 INFO L225 Difference]: With dead ends: 4673 [2018-10-12 20:48:41,143 INFO L226 Difference]: Without dead ends: 4673 [2018-10-12 20:48:41,145 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 25 SyntacticMatches, 10 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10113 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=1185, Invalid=32487, Unknown=0, NotChecked=0, Total=33672 [2018-10-12 20:48:41,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4673 states. [2018-10-12 20:48:41,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4673 to 4640. [2018-10-12 20:48:41,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4640 states. [2018-10-12 20:48:41,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4640 states to 4640 states and 4711 transitions. [2018-10-12 20:48:41,169 INFO L78 Accepts]: Start accepts. Automaton has 4640 states and 4711 transitions. Word has length 2125 [2018-10-12 20:48:41,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:48:41,171 INFO L481 AbstractCegarLoop]: Abstraction has 4640 states and 4711 transitions. [2018-10-12 20:48:41,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-10-12 20:48:41,171 INFO L276 IsEmpty]: Start isEmpty. Operand 4640 states and 4711 transitions. [2018-10-12 20:48:41,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2495 [2018-10-12 20:48:41,206 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:48:41,207 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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-12 20:48:41,207 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:48:41,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:48:41,208 INFO L82 PathProgramCache]: Analyzing trace with hash -248958513, now seen corresponding path program 28 times [2018-10-12 20:48:41,209 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:48:41,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:48:46,772 INFO L134 CoverageAnalysis]: Checked inductivity of 54163 backedges. 39206 proven. 10154 refuted. 0 times theorem prover too weak. 4803 trivial. 0 not checked. [2018-10-12 20:48:46,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:48:46,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-12 20:48:46,773 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-12 20:48:46,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-12 20:48:46,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=1643, Unknown=0, NotChecked=0, Total=1892 [2018-10-12 20:48:46,774 INFO L87 Difference]: Start difference. First operand 4640 states and 4711 transitions. Second operand 44 states. [2018-10-12 20:48:49,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:48:49,656 INFO L93 Difference]: Finished difference Result 4673 states and 4744 transitions. [2018-10-12 20:48:49,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-12 20:48:49,657 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 2494 [2018-10-12 20:48:49,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:48:49,662 INFO L225 Difference]: With dead ends: 4673 [2018-10-12 20:48:49,663 INFO L226 Difference]: Without dead ends: 4673 [2018-10-12 20:48:49,664 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2463 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2059, Invalid=8861, Unknown=0, NotChecked=0, Total=10920 [2018-10-12 20:48:49,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4673 states. [2018-10-12 20:48:49,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4673 to 4661. [2018-10-12 20:48:49,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4661 states. [2018-10-12 20:48:49,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4661 states to 4661 states and 4732 transitions. [2018-10-12 20:48:49,688 INFO L78 Accepts]: Start accepts. Automaton has 4661 states and 4732 transitions. Word has length 2494 [2018-10-12 20:48:49,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:48:49,689 INFO L481 AbstractCegarLoop]: Abstraction has 4661 states and 4732 transitions. [2018-10-12 20:48:49,689 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-12 20:48:49,689 INFO L276 IsEmpty]: Start isEmpty. Operand 4661 states and 4732 transitions. [2018-10-12 20:48:49,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2516 [2018-10-12 20:48:49,725 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:48:49,726 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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-12 20:48:49,726 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:48:49,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:48:49,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1646396362, now seen corresponding path program 29 times [2018-10-12 20:48:49,728 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:48:49,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:48:53,395 INFO L134 CoverageAnalysis]: Checked inductivity of 55308 backedges. 16274 proven. 864 refuted. 0 times theorem prover too weak. 38170 trivial. 0 not checked. [2018-10-12 20:48:53,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:48:53,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-12 20:48:53,396 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-12 20:48:53,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-12 20:48:53,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=1576, Unknown=0, NotChecked=0, Total=1806 [2018-10-12 20:48:53,397 INFO L87 Difference]: Start difference. First operand 4661 states and 4732 transitions. Second operand 43 states. [2018-10-12 20:48:58,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:48:58,974 INFO L93 Difference]: Finished difference Result 13548 states and 13733 transitions. [2018-10-12 20:48:58,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-10-12 20:48:58,974 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 2515 [2018-10-12 20:48:58,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:48:58,987 INFO L225 Difference]: With dead ends: 13548 [2018-10-12 20:48:58,987 INFO L226 Difference]: Without dead ends: 13548 [2018-10-12 20:48:58,989 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5825 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3586, Invalid=16436, Unknown=0, NotChecked=0, Total=20022 [2018-10-12 20:48:58,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13548 states. [2018-10-12 20:48:59,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13548 to 5105. [2018-10-12 20:48:59,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5105 states. [2018-10-12 20:48:59,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5105 states to 5105 states and 5186 transitions. [2018-10-12 20:48:59,090 INFO L78 Accepts]: Start accepts. Automaton has 5105 states and 5186 transitions. Word has length 2515 [2018-10-12 20:48:59,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:48:59,091 INFO L481 AbstractCegarLoop]: Abstraction has 5105 states and 5186 transitions. [2018-10-12 20:48:59,091 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-12 20:48:59,092 INFO L276 IsEmpty]: Start isEmpty. Operand 5105 states and 5186 transitions. [2018-10-12 20:48:59,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2530 [2018-10-12 20:48:59,133 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:48:59,134 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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-12 20:48:59,134 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:48:59,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:48:59,135 INFO L82 PathProgramCache]: Analyzing trace with hash -569961457, now seen corresponding path program 30 times [2018-10-12 20:48:59,135 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:48:59,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:49:25,776 INFO L134 CoverageAnalysis]: Checked inductivity of 56075 backedges. 0 proven. 50460 refuted. 0 times theorem prover too weak. 5615 trivial. 0 not checked. [2018-10-12 20:49:25,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:49:25,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-12 20:49:25,779 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-12 20:49:25,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-12 20:49:25,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=8261, Unknown=0, NotChecked=0, Total=8556 [2018-10-12 20:49:25,780 INFO L87 Difference]: Start difference. First operand 5105 states and 5186 transitions. Second operand 93 states. [2018-10-12 20:49:46,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:49:46,097 INFO L93 Difference]: Finished difference Result 5540 states and 5623 transitions. [2018-10-12 20:49:46,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-10-12 20:49:46,097 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 2529 [2018-10-12 20:49:46,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:49:46,102 INFO L225 Difference]: With dead ends: 5540 [2018-10-12 20:49:46,102 INFO L226 Difference]: Without dead ends: 5540 [2018-10-12 20:49:46,105 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9569 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=1126, Invalid=32180, Unknown=0, NotChecked=0, Total=33306 [2018-10-12 20:49:46,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5540 states. [2018-10-12 20:49:46,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5540 to 5509. [2018-10-12 20:49:46,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5509 states. [2018-10-12 20:49:46,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5509 states to 5509 states and 5592 transitions. [2018-10-12 20:49:46,134 INFO L78 Accepts]: Start accepts. Automaton has 5509 states and 5592 transitions. Word has length 2529 [2018-10-12 20:49:46,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:49:46,141 INFO L481 AbstractCegarLoop]: Abstraction has 5509 states and 5592 transitions. [2018-10-12 20:49:46,141 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-12 20:49:46,141 INFO L276 IsEmpty]: Start isEmpty. Operand 5509 states and 5592 transitions. [2018-10-12 20:49:46,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2934 [2018-10-12 20:49:46,189 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:49:46,190 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 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-12 20:49:46,190 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:49:46,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:49:46,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1582670166, now seen corresponding path program 31 times [2018-10-12 20:49:46,192 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:49:46,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:49:53,188 INFO L134 CoverageAnalysis]: Checked inductivity of 77836 backedges. 57801 proven. 13510 refuted. 0 times theorem prover too weak. 6525 trivial. 0 not checked. [2018-10-12 20:49:53,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:49:53,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-12 20:49:53,190 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-12 20:49:53,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-12 20:49:53,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=1961, Unknown=0, NotChecked=0, Total=2256 [2018-10-12 20:49:53,190 INFO L87 Difference]: Start difference. First operand 5509 states and 5592 transitions. Second operand 48 states. [2018-10-12 20:49:57,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:49:57,054 INFO L93 Difference]: Finished difference Result 5542 states and 5625 transitions. [2018-10-12 20:49:57,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-12 20:49:57,054 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 2933 [2018-10-12 20:49:57,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:49:57,060 INFO L225 Difference]: With dead ends: 5542 [2018-10-12 20:49:57,061 INFO L226 Difference]: Without dead ends: 5542 [2018-10-12 20:49:57,062 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2990 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2472, Invalid=10638, Unknown=0, NotChecked=0, Total=13110 [2018-10-12 20:49:57,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5542 states. [2018-10-12 20:49:57,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5542 to 5530. [2018-10-12 20:49:57,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5530 states. [2018-10-12 20:49:57,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5530 states to 5530 states and 5613 transitions. [2018-10-12 20:49:57,100 INFO L78 Accepts]: Start accepts. Automaton has 5530 states and 5613 transitions. Word has length 2933 [2018-10-12 20:49:57,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:49:57,102 INFO L481 AbstractCegarLoop]: Abstraction has 5530 states and 5613 transitions. [2018-10-12 20:49:57,102 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-12 20:49:57,103 INFO L276 IsEmpty]: Start isEmpty. Operand 5530 states and 5613 transitions. [2018-10-12 20:49:57,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2955 [2018-10-12 20:49:57,165 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:49:57,166 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 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-12 20:49:57,167 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:49:57,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:49:57,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1343229281, now seen corresponding path program 32 times [2018-10-12 20:49:57,168 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:49:57,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:50:02,355 INFO L134 CoverageAnalysis]: Checked inductivity of 79213 backedges. 21817 proven. 1032 refuted. 0 times theorem prover too weak. 56364 trivial. 0 not checked. [2018-10-12 20:50:02,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:50:02,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-12 20:50:02,357 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-12 20:50:02,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-12 20:50:02,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=1888, Unknown=0, NotChecked=0, Total=2162 [2018-10-12 20:50:02,357 INFO L87 Difference]: Start difference. First operand 5530 states and 5613 transitions. Second operand 47 states. [2018-10-12 20:50:08,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:50:08,673 INFO L93 Difference]: Finished difference Result 16820 states and 17040 transitions. [2018-10-12 20:50:08,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-10-12 20:50:08,674 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 2954 [2018-10-12 20:50:08,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:50:08,683 INFO L225 Difference]: With dead ends: 16820 [2018-10-12 20:50:08,683 INFO L226 Difference]: Without dead ends: 16820 [2018-10-12 20:50:08,684 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7106 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4331, Invalid=19849, Unknown=0, NotChecked=0, Total=24180 [2018-10-12 20:50:08,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16820 states. [2018-10-12 20:50:08,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16820 to 6017. [2018-10-12 20:50:08,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6017 states. [2018-10-12 20:50:08,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6017 states to 6017 states and 6111 transitions. [2018-10-12 20:50:08,757 INFO L78 Accepts]: Start accepts. Automaton has 6017 states and 6111 transitions. Word has length 2954 [2018-10-12 20:50:08,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:50:08,758 INFO L481 AbstractCegarLoop]: Abstraction has 6017 states and 6111 transitions. [2018-10-12 20:50:08,758 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-12 20:50:08,759 INFO L276 IsEmpty]: Start isEmpty. Operand 6017 states and 6111 transitions. [2018-10-12 20:50:08,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2969 [2018-10-12 20:50:08,805 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:50:08,806 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 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-12 20:50:08,806 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:50:08,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:50:08,807 INFO L82 PathProgramCache]: Analyzing trace with hash 2057453050, now seen corresponding path program 33 times [2018-10-12 20:50:08,807 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:50:09,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:50:48,034 INFO L134 CoverageAnalysis]: Checked inductivity of 80135 backedges. 0 proven. 73395 refuted. 0 times theorem prover too weak. 6740 trivial. 0 not checked. [2018-10-12 20:50:48,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:50:48,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [124] total 124 [2018-10-12 20:50:48,036 INFO L460 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-10-12 20:50:48,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-10-12 20:50:48,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=417, Invalid=14835, Unknown=0, NotChecked=0, Total=15252 [2018-10-12 20:50:48,037 INFO L87 Difference]: Start difference. First operand 6017 states and 6111 transitions. Second operand 124 states. [2018-10-12 20:51:25,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:51:25,307 INFO L93 Difference]: Finished difference Result 6529 states and 6625 transitions. [2018-10-12 20:51:25,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-10-12 20:51:25,308 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 2968 [2018-10-12 20:51:25,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:51:25,314 INFO L225 Difference]: With dead ends: 6529 [2018-10-12 20:51:25,314 INFO L226 Difference]: Without dead ends: 6529 [2018-10-12 20:51:25,317 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18410 ImplicationChecksByTransitivity, 19.4s TimeCoverageRelationStatistics Valid=1714, Invalid=61036, Unknown=0, NotChecked=0, Total=62750 [2018-10-12 20:51:25,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6529 states. [2018-10-12 20:51:25,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6529 to 6456. [2018-10-12 20:51:25,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6456 states. [2018-10-12 20:51:25,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6456 states to 6456 states and 6552 transitions. [2018-10-12 20:51:25,420 INFO L78 Accepts]: Start accepts. Automaton has 6456 states and 6552 transitions. Word has length 2968 [2018-10-12 20:51:25,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:51:25,421 INFO L481 AbstractCegarLoop]: Abstraction has 6456 states and 6552 transitions. [2018-10-12 20:51:25,421 INFO L482 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-10-12 20:51:25,421 INFO L276 IsEmpty]: Start isEmpty. Operand 6456 states and 6552 transitions. [2018-10-12 20:51:25,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3408 [2018-10-12 20:51:25,481 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:51:25,482 INFO L375 BasicCegarLoop]: trace histogram [77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 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-12 20:51:25,482 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:51:25,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:51:25,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1407576145, now seen corresponding path program 34 times [2018-10-12 20:51:25,484 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:51:25,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:51:35,372 INFO L134 CoverageAnalysis]: Checked inductivity of 108528 backedges. 82372 proven. 17543 refuted. 0 times theorem prover too weak. 8613 trivial. 0 not checked. [2018-10-12 20:51:35,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:51:35,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-12 20:51:35,375 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-12 20:51:35,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-12 20:51:35,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=345, Invalid=2307, Unknown=0, NotChecked=0, Total=2652 [2018-10-12 20:51:35,375 INFO L87 Difference]: Start difference. First operand 6456 states and 6552 transitions. Second operand 52 states. [2018-10-12 20:51:39,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:51:39,975 INFO L93 Difference]: Finished difference Result 6489 states and 6585 transitions. [2018-10-12 20:51:39,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-12 20:51:39,975 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 3407 [2018-10-12 20:51:39,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:51:39,981 INFO L225 Difference]: With dead ends: 6489 [2018-10-12 20:51:39,981 INFO L226 Difference]: Without dead ends: 6489 [2018-10-12 20:51:39,982 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3568 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2923, Invalid=12577, Unknown=0, NotChecked=0, Total=15500 [2018-10-12 20:51:39,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6489 states. [2018-10-12 20:51:40,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6489 to 6477. [2018-10-12 20:51:40,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6477 states. [2018-10-12 20:51:40,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6477 states to 6477 states and 6573 transitions. [2018-10-12 20:51:40,016 INFO L78 Accepts]: Start accepts. Automaton has 6477 states and 6573 transitions. Word has length 3407 [2018-10-12 20:51:40,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:51:40,017 INFO L481 AbstractCegarLoop]: Abstraction has 6477 states and 6573 transitions. [2018-10-12 20:51:40,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-12 20:51:40,018 INFO L276 IsEmpty]: Start isEmpty. Operand 6477 states and 6573 transitions. [2018-10-12 20:51:40,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3429 [2018-10-12 20:51:40,079 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:51:40,081 INFO L375 BasicCegarLoop]: trace histogram [78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 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-12 20:51:40,081 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:51:40,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:51:40,082 INFO L82 PathProgramCache]: Analyzing trace with hash 802060154, now seen corresponding path program 35 times [2018-10-12 20:51:40,082 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:51:40,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:51:47,247 INFO L134 CoverageAnalysis]: Checked inductivity of 110158 backedges. 28493 proven. 1214 refuted. 0 times theorem prover too weak. 80451 trivial. 0 not checked. [2018-10-12 20:51:47,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:51:47,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-12 20:51:47,249 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-12 20:51:47,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-12 20:51:47,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=2228, Unknown=0, NotChecked=0, Total=2550 [2018-10-12 20:51:47,250 INFO L87 Difference]: Start difference. First operand 6477 states and 6573 transitions. Second operand 51 states. [2018-10-12 20:51:54,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:51:54,390 INFO L93 Difference]: Finished difference Result 20553 states and 20811 transitions. [2018-10-12 20:51:54,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-10-12 20:51:54,390 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 3428 [2018-10-12 20:51:54,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:51:54,405 INFO L225 Difference]: With dead ends: 20553 [2018-10-12 20:51:54,406 INFO L226 Difference]: Without dead ends: 20553 [2018-10-12 20:51:54,408 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8514 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5147, Invalid=23583, Unknown=0, NotChecked=0, Total=28730 [2018-10-12 20:51:54,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20553 states. [2018-10-12 20:51:54,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20553 to 7007. [2018-10-12 20:51:54,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7007 states. [2018-10-12 20:51:54,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7007 states to 7007 states and 7115 transitions. [2018-10-12 20:51:54,480 INFO L78 Accepts]: Start accepts. Automaton has 7007 states and 7115 transitions. Word has length 3428 [2018-10-12 20:51:54,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:51:54,481 INFO L481 AbstractCegarLoop]: Abstraction has 7007 states and 7115 transitions. [2018-10-12 20:51:54,481 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-12 20:51:54,481 INFO L276 IsEmpty]: Start isEmpty. Operand 7007 states and 7115 transitions. [2018-10-12 20:51:54,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3443 [2018-10-12 20:51:54,538 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:51:54,539 INFO L375 BasicCegarLoop]: trace histogram [78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 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-12 20:51:54,540 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:51:54,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:51:54,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1773369261, now seen corresponding path program 36 times [2018-10-12 20:51:54,541 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:51:54,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:52:44,648 INFO L134 CoverageAnalysis]: Checked inductivity of 111249 backedges. 0 proven. 101534 refuted. 0 times theorem prover too weak. 9715 trivial. 0 not checked. [2018-10-12 20:52:44,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:52:44,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-10-12 20:52:44,651 INFO L460 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-10-12 20:52:44,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-10-12 20:52:44,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=390, Invalid=13652, Unknown=0, NotChecked=0, Total=14042 [2018-10-12 20:52:44,652 INFO L87 Difference]: Start difference. First operand 7007 states and 7115 transitions. Second operand 119 states.