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/standard_strcpy_original_false-valid-deref.i_7.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-093a8c0 [2018-10-14 16:53:35,264 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-14 16:53:35,266 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-14 16:53:35,278 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-14 16:53:35,279 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-14 16:53:35,280 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-14 16:53:35,281 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-14 16:53:35,283 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-14 16:53:35,285 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-14 16:53:35,286 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-14 16:53:35,287 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-14 16:53:35,287 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-14 16:53:35,288 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-14 16:53:35,289 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-14 16:53:35,290 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-14 16:53:35,291 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-14 16:53:35,292 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-14 16:53:35,293 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-14 16:53:35,295 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-14 16:53:35,297 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-14 16:53:35,298 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-14 16:53:35,299 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-14 16:53:35,303 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-14 16:53:35,303 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-14 16:53:35,303 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-14 16:53:35,306 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-14 16:53:35,307 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-14 16:53:35,308 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-14 16:53:35,310 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-14 16:53:35,311 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-14 16:53:35,312 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-14 16:53:35,312 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-14 16:53:35,312 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-14 16:53:35,313 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-14 16:53:35,314 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-14 16:53:35,314 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-14 16:53:35,315 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-14 16:53:35,328 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-14 16:53:35,329 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-14 16:53:35,330 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-14 16:53:35,331 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-14 16:53:35,331 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-14 16:53:35,331 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-14 16:53:35,332 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-14 16:53:35,332 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-14 16:53:35,333 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-14 16:53:35,333 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-14 16:53:35,333 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-14 16:53:35,333 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-14 16:53:35,333 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-14 16:53:35,334 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-14 16:53:35,335 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-14 16:53:35,403 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-14 16:53:35,418 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-14 16:53:35,425 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-14 16:53:35,427 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-14 16:53:35,428 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-14 16:53:35,429 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/standard_strcpy_original_false-valid-deref.i_7.bpl [2018-10-14 16:53:35,429 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/standard_strcpy_original_false-valid-deref.i_7.bpl' [2018-10-14 16:53:35,508 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-14 16:53:35,510 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-14 16:53:35,510 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-14 16:53:35,511 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-14 16:53:35,511 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-14 16:53:35,538 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "standard_strcpy_original_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:53:35" (1/1) ... [2018-10-14 16:53:35,540 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "standard_strcpy_original_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:53:35" (1/1) ... [2018-10-14 16:53:35,554 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "standard_strcpy_original_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:53:35" (1/1) ... [2018-10-14 16:53:35,554 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "standard_strcpy_original_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:53:35" (1/1) ... [2018-10-14 16:53:35,561 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "standard_strcpy_original_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:53:35" (1/1) ... [2018-10-14 16:53:35,564 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "standard_strcpy_original_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:53:35" (1/1) ... [2018-10-14 16:53:35,565 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "standard_strcpy_original_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:53:35" (1/1) ... [2018-10-14 16:53:35,572 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-14 16:53:35,573 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-14 16:53:35,574 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-14 16:53:35,574 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-14 16:53:35,576 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "standard_strcpy_original_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:53:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-14 16:53:35,647 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-14 16:53:35,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-14 16:53:35,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-14 16:53:36,279 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-14 16:53:36,280 INFO L202 PluginConnector]: Adding new model standard_strcpy_original_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:53:36 BoogieIcfgContainer [2018-10-14 16:53:36,280 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-14 16:53:36,282 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-14 16:53:36,282 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-14 16:53:36,285 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-14 16:53:36,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "standard_strcpy_original_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:53:35" (1/2) ... [2018-10-14 16:53:36,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b441217 and model type standard_strcpy_original_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:53:36, skipping insertion in model container [2018-10-14 16:53:36,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "standard_strcpy_original_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:53:36" (2/2) ... [2018-10-14 16:53:36,289 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_strcpy_original_false-valid-deref.i_7.bpl [2018-10-14 16:53:36,298 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-14 16:53:36,309 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-14 16:53:36,325 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-14 16:53:36,352 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-14 16:53:36,353 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-14 16:53:36,353 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-14 16:53:36,353 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-14 16:53:36,353 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-14 16:53:36,353 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-14 16:53:36,354 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-14 16:53:36,354 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-14 16:53:36,354 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-14 16:53:36,371 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2018-10-14 16:53:36,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-14 16:53:36,380 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:53:36,381 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] [2018-10-14 16:53:36,382 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:53:36,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:53:36,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1825826060, now seen corresponding path program 1 times [2018-10-14 16:53:36,438 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:53:36,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:53:37,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:53:37,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 16:53:37,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-14 16:53:37,280 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-14 16:53:37,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-14 16:53:37,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-10-14 16:53:37,300 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 12 states. [2018-10-14 16:53:37,641 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-10-14 16:53:37,804 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-10-14 16:53:38,632 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-10-14 16:53:38,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:53:38,901 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-10-14 16:53:38,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-14 16:53:38,903 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2018-10-14 16:53:38,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:53:38,917 INFO L225 Difference]: With dead ends: 85 [2018-10-14 16:53:38,917 INFO L226 Difference]: Without dead ends: 85 [2018-10-14 16:53:38,920 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=154, Invalid=398, Unknown=0, NotChecked=0, Total=552 [2018-10-14 16:53:38,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-14 16:53:38,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 59. [2018-10-14 16:53:38,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-14 16:53:38,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-10-14 16:53:38,968 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 30 [2018-10-14 16:53:38,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:53:38,968 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-10-14 16:53:38,969 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-14 16:53:38,969 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-10-14 16:53:38,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-14 16:53:38,971 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:53:38,971 INFO L375 BasicCegarLoop]: trace histogram [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-14 16:53:38,972 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:53:38,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:53:38,972 INFO L82 PathProgramCache]: Analyzing trace with hash -560265094, now seen corresponding path program 1 times [2018-10-14 16:53:38,973 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:53:39,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:53:39,671 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:53:39,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:53:39,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-14 16:53:39,674 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-14 16:53:39,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-14 16:53:39,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-10-14 16:53:39,675 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 15 states. [2018-10-14 16:53:40,401 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-10-14 16:53:41,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:53:41,271 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-10-14 16:53:41,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-14 16:53:41,278 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 58 [2018-10-14 16:53:41,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:53:41,281 INFO L225 Difference]: With dead ends: 113 [2018-10-14 16:53:41,281 INFO L226 Difference]: Without dead ends: 113 [2018-10-14 16:53:41,283 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=260, Invalid=670, Unknown=0, NotChecked=0, Total=930 [2018-10-14 16:53:41,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-10-14 16:53:41,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 87. [2018-10-14 16:53:41,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-10-14 16:53:41,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-10-14 16:53:41,293 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 58 [2018-10-14 16:53:41,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:53:41,294 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-10-14 16:53:41,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-14 16:53:41,295 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-10-14 16:53:41,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-14 16:53:41,297 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:53:41,298 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:53:41,298 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:53:41,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:53:41,299 INFO L82 PathProgramCache]: Analyzing trace with hash 477354728, now seen corresponding path program 2 times [2018-10-14 16:53:41,300 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:53:41,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:53:41,805 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:53:41,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:53:41,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-14 16:53:41,807 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-14 16:53:41,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-14 16:53:41,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-10-14 16:53:41,808 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 16 states. [2018-10-14 16:53:43,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:53:43,042 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-10-14 16:53:43,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-14 16:53:43,045 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 86 [2018-10-14 16:53:43,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:53:43,048 INFO L225 Difference]: With dead ends: 141 [2018-10-14 16:53:43,048 INFO L226 Difference]: Without dead ends: 141 [2018-10-14 16:53:43,049 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=284, Invalid=772, Unknown=0, NotChecked=0, Total=1056 [2018-10-14 16:53:43,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-10-14 16:53:43,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 115. [2018-10-14 16:53:43,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-14 16:53:43,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-10-14 16:53:43,060 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 86 [2018-10-14 16:53:43,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:53:43,060 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-10-14 16:53:43,061 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-14 16:53:43,061 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-10-14 16:53:43,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-14 16:53:43,064 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:53:43,065 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:53:43,065 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:53:43,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:53:43,065 INFO L82 PathProgramCache]: Analyzing trace with hash -267264938, now seen corresponding path program 3 times [2018-10-14 16:53:43,066 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:53:43,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:53:43,719 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:53:43,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:53:43,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-14 16:53:43,720 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-14 16:53:43,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-14 16:53:43,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2018-10-14 16:53:43,721 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 17 states. [2018-10-14 16:53:45,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:53:45,676 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2018-10-14 16:53:45,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-14 16:53:45,677 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 114 [2018-10-14 16:53:45,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:53:45,679 INFO L225 Difference]: With dead ends: 169 [2018-10-14 16:53:45,679 INFO L226 Difference]: Without dead ends: 169 [2018-10-14 16:53:45,680 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=308, Invalid=882, Unknown=0, NotChecked=0, Total=1190 [2018-10-14 16:53:45,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-10-14 16:53:45,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 143. [2018-10-14 16:53:45,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-10-14 16:53:45,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-10-14 16:53:45,692 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 114 [2018-10-14 16:53:45,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:53:45,692 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-10-14 16:53:45,693 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-14 16:53:45,693 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-10-14 16:53:45,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-14 16:53:45,695 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:53:45,695 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:53:45,695 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:53:45,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:53:45,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1525189828, now seen corresponding path program 4 times [2018-10-14 16:53:45,697 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:53:45,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:53:46,344 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:53:46,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:53:46,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-14 16:53:46,345 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-14 16:53:46,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-14 16:53:46,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2018-10-14 16:53:46,346 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 18 states. [2018-10-14 16:53:48,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:53:48,007 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2018-10-14 16:53:48,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-14 16:53:48,008 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 142 [2018-10-14 16:53:48,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:53:48,010 INFO L225 Difference]: With dead ends: 197 [2018-10-14 16:53:48,010 INFO L226 Difference]: Without dead ends: 197 [2018-10-14 16:53:48,011 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=332, Invalid=1000, Unknown=0, NotChecked=0, Total=1332 [2018-10-14 16:53:48,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-10-14 16:53:48,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 171. [2018-10-14 16:53:48,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-10-14 16:53:48,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-10-14 16:53:48,022 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 142 [2018-10-14 16:53:48,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:53:48,023 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-10-14 16:53:48,023 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-14 16:53:48,023 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-10-14 16:53:48,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-14 16:53:48,026 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:53:48,026 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:53:48,026 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:53:48,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:53:48,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1982557234, now seen corresponding path program 5 times [2018-10-14 16:53:48,027 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:53:48,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:53:49,240 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:53:49,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:53:49,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-14 16:53:49,241 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-14 16:53:49,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-14 16:53:49,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-10-14 16:53:49,242 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 19 states. [2018-10-14 16:53:51,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:53:51,086 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2018-10-14 16:53:51,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-14 16:53:51,087 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 170 [2018-10-14 16:53:51,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:53:51,089 INFO L225 Difference]: With dead ends: 225 [2018-10-14 16:53:51,089 INFO L226 Difference]: Without dead ends: 225 [2018-10-14 16:53:51,090 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=356, Invalid=1126, Unknown=0, NotChecked=0, Total=1482 [2018-10-14 16:53:51,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-10-14 16:53:51,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 199. [2018-10-14 16:53:51,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-10-14 16:53:51,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2018-10-14 16:53:51,101 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 170 [2018-10-14 16:53:51,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:53:51,102 INFO L481 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2018-10-14 16:53:51,102 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-14 16:53:51,102 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2018-10-14 16:53:51,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-10-14 16:53:51,105 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:53:51,105 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:53:51,105 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:53:51,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:53:51,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1389230752, now seen corresponding path program 6 times [2018-10-14 16:53:51,107 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:53:51,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:53:51,774 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 0 proven. 438 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:53:51,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:53:51,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-14 16:53:51,776 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-14 16:53:51,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-14 16:53:51,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2018-10-14 16:53:51,777 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand 20 states. [2018-10-14 16:53:54,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:53:54,239 INFO L93 Difference]: Finished difference Result 253 states and 253 transitions. [2018-10-14 16:53:54,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-14 16:53:54,240 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 198 [2018-10-14 16:53:54,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:53:54,242 INFO L225 Difference]: With dead ends: 253 [2018-10-14 16:53:54,242 INFO L226 Difference]: Without dead ends: 253 [2018-10-14 16:53:54,243 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=380, Invalid=1260, Unknown=0, NotChecked=0, Total=1640 [2018-10-14 16:53:54,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-10-14 16:53:54,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 227. [2018-10-14 16:53:54,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-10-14 16:53:54,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2018-10-14 16:53:54,251 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 198 [2018-10-14 16:53:54,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:53:54,251 INFO L481 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2018-10-14 16:53:54,251 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-14 16:53:54,252 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2018-10-14 16:53:54,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-10-14 16:53:54,255 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:53:54,255 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:53:54,255 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:53:54,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:53:54,256 INFO L82 PathProgramCache]: Analyzing trace with hash -645679090, now seen corresponding path program 7 times [2018-10-14 16:53:54,257 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:53:54,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:53:55,227 INFO L134 CoverageAnalysis]: Checked inductivity of 609 backedges. 0 proven. 609 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:53:55,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:53:55,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-14 16:53:55,229 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-14 16:53:55,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-14 16:53:55,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2018-10-14 16:53:55,229 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 21 states. [2018-10-14 16:53:57,858 WARN L179 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2018-10-14 16:53:58,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:53:58,337 INFO L93 Difference]: Finished difference Result 281 states and 281 transitions. [2018-10-14 16:53:58,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-14 16:53:58,337 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 226 [2018-10-14 16:53:58,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:53:58,339 INFO L225 Difference]: With dead ends: 281 [2018-10-14 16:53:58,339 INFO L226 Difference]: Without dead ends: 281 [2018-10-14 16:53:58,340 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=404, Invalid=1402, Unknown=0, NotChecked=0, Total=1806 [2018-10-14 16:53:58,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-10-14 16:53:58,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 255. [2018-10-14 16:53:58,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-10-14 16:53:58,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 255 transitions. [2018-10-14 16:53:58,347 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 255 transitions. Word has length 226 [2018-10-14 16:53:58,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:53:58,348 INFO L481 AbstractCegarLoop]: Abstraction has 255 states and 255 transitions. [2018-10-14 16:53:58,348 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-14 16:53:58,348 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 255 transitions. [2018-10-14 16:53:58,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-10-14 16:53:58,353 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:53:58,353 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:53:58,354 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:53:58,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:53:58,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1430248324, now seen corresponding path program 8 times [2018-10-14 16:53:58,355 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:53:58,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:53:59,594 INFO L134 CoverageAnalysis]: Checked inductivity of 808 backedges. 0 proven. 808 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:53:59,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:53:59,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-14 16:53:59,595 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-14 16:53:59,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-14 16:53:59,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2018-10-14 16:53:59,596 INFO L87 Difference]: Start difference. First operand 255 states and 255 transitions. Second operand 22 states. [2018-10-14 16:54:00,760 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2018-10-14 16:54:02,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:54:02,514 INFO L93 Difference]: Finished difference Result 309 states and 309 transitions. [2018-10-14 16:54:02,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-14 16:54:02,519 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 254 [2018-10-14 16:54:02,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:54:02,520 INFO L225 Difference]: With dead ends: 309 [2018-10-14 16:54:02,521 INFO L226 Difference]: Without dead ends: 309 [2018-10-14 16:54:02,522 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=428, Invalid=1552, Unknown=0, NotChecked=0, Total=1980 [2018-10-14 16:54:02,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-10-14 16:54:02,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 283. [2018-10-14 16:54:02,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-10-14 16:54:02,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 283 transitions. [2018-10-14 16:54:02,527 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 283 transitions. Word has length 254 [2018-10-14 16:54:02,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:54:02,528 INFO L481 AbstractCegarLoop]: Abstraction has 283 states and 283 transitions. [2018-10-14 16:54:02,528 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-14 16:54:02,528 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 283 transitions. [2018-10-14 16:54:02,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-10-14 16:54:02,530 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:54:02,530 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:54:02,530 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:54:02,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:54:02,531 INFO L82 PathProgramCache]: Analyzing trace with hash -21577750, now seen corresponding path program 9 times [2018-10-14 16:54:02,532 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:54:02,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:54:03,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:54:03,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:54:03,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-14 16:54:03,592 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-14 16:54:03,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-14 16:54:03,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2018-10-14 16:54:03,593 INFO L87 Difference]: Start difference. First operand 283 states and 283 transitions. Second operand 23 states. [2018-10-14 16:54:06,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:54:06,817 INFO L93 Difference]: Finished difference Result 337 states and 337 transitions. [2018-10-14 16:54:06,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-14 16:54:06,818 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 282 [2018-10-14 16:54:06,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:54:06,821 INFO L225 Difference]: With dead ends: 337 [2018-10-14 16:54:06,821 INFO L226 Difference]: Without dead ends: 337 [2018-10-14 16:54:06,823 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=452, Invalid=1710, Unknown=0, NotChecked=0, Total=2162 [2018-10-14 16:54:06,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-10-14 16:54:06,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 311. [2018-10-14 16:54:06,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-10-14 16:54:06,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 311 transitions. [2018-10-14 16:54:06,829 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 311 transitions. Word has length 282 [2018-10-14 16:54:06,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:54:06,829 INFO L481 AbstractCegarLoop]: Abstraction has 311 states and 311 transitions. [2018-10-14 16:54:06,829 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-14 16:54:06,829 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 311 transitions. [2018-10-14 16:54:06,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-10-14 16:54:06,831 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:54:06,831 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:54:06,832 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:54:06,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:54:06,832 INFO L82 PathProgramCache]: Analyzing trace with hash -2057631144, now seen corresponding path program 10 times [2018-10-14 16:54:06,833 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:54:06,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:54:08,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1290 backedges. 0 proven. 1290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:54:08,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:54:08,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-14 16:54:08,069 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-14 16:54:08,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-14 16:54:08,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2018-10-14 16:54:08,070 INFO L87 Difference]: Start difference. First operand 311 states and 311 transitions. Second operand 24 states. [2018-10-14 16:54:11,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:54:11,590 INFO L93 Difference]: Finished difference Result 365 states and 365 transitions. [2018-10-14 16:54:11,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-14 16:54:11,591 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 310 [2018-10-14 16:54:11,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:54:11,594 INFO L225 Difference]: With dead ends: 365 [2018-10-14 16:54:11,594 INFO L226 Difference]: Without dead ends: 365 [2018-10-14 16:54:11,595 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=476, Invalid=1876, Unknown=0, NotChecked=0, Total=2352 [2018-10-14 16:54:11,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-10-14 16:54:11,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 339. [2018-10-14 16:54:11,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-10-14 16:54:11,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 339 transitions. [2018-10-14 16:54:11,601 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 339 transitions. Word has length 310 [2018-10-14 16:54:11,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:54:11,602 INFO L481 AbstractCegarLoop]: Abstraction has 339 states and 339 transitions. [2018-10-14 16:54:11,602 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-14 16:54:11,602 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 339 transitions. [2018-10-14 16:54:11,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2018-10-14 16:54:11,604 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:54:11,605 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:54:11,605 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:54:11,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:54:11,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1180730310, now seen corresponding path program 11 times [2018-10-14 16:54:11,606 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:54:11,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:54:12,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1573 backedges. 0 proven. 1573 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:54:12,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:54:12,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-14 16:54:12,719 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-14 16:54:12,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-14 16:54:12,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2018-10-14 16:54:12,720 INFO L87 Difference]: Start difference. First operand 339 states and 339 transitions. Second operand 25 states. [2018-10-14 16:54:13,224 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-10-14 16:54:17,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:54:17,061 INFO L93 Difference]: Finished difference Result 393 states and 393 transitions. [2018-10-14 16:54:17,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-14 16:54:17,061 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 338 [2018-10-14 16:54:17,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:54:17,063 INFO L225 Difference]: With dead ends: 393 [2018-10-14 16:54:17,064 INFO L226 Difference]: Without dead ends: 393 [2018-10-14 16:54:17,065 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=500, Invalid=2050, Unknown=0, NotChecked=0, Total=2550 [2018-10-14 16:54:17,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-10-14 16:54:17,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 367. [2018-10-14 16:54:17,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-10-14 16:54:17,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 367 transitions. [2018-10-14 16:54:17,072 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 367 transitions. Word has length 338 [2018-10-14 16:54:17,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:54:17,073 INFO L481 AbstractCegarLoop]: Abstraction has 367 states and 367 transitions. [2018-10-14 16:54:17,073 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-14 16:54:17,073 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 367 transitions. [2018-10-14 16:54:17,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2018-10-14 16:54:17,075 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:54:17,075 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:54:17,076 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:54:17,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:54:17,076 INFO L82 PathProgramCache]: Analyzing trace with hash -2126861260, now seen corresponding path program 12 times [2018-10-14 16:54:17,077 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:54:17,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:54:18,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1884 backedges. 0 proven. 1884 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:54:18,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:54:18,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-14 16:54:18,323 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-14 16:54:18,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-14 16:54:18,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2018-10-14 16:54:18,324 INFO L87 Difference]: Start difference. First operand 367 states and 367 transitions. Second operand 26 states. [2018-10-14 16:54:23,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:54:23,006 INFO L93 Difference]: Finished difference Result 421 states and 421 transitions. [2018-10-14 16:54:23,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-14 16:54:23,007 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 366 [2018-10-14 16:54:23,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:54:23,011 INFO L225 Difference]: With dead ends: 421 [2018-10-14 16:54:23,011 INFO L226 Difference]: Without dead ends: 421 [2018-10-14 16:54:23,012 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=524, Invalid=2232, Unknown=0, NotChecked=0, Total=2756 [2018-10-14 16:54:23,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2018-10-14 16:54:23,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 395. [2018-10-14 16:54:23,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-10-14 16:54:23,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 395 transitions. [2018-10-14 16:54:23,019 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 395 transitions. Word has length 366 [2018-10-14 16:54:23,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:54:23,020 INFO L481 AbstractCegarLoop]: Abstraction has 395 states and 395 transitions. [2018-10-14 16:54:23,020 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-14 16:54:23,020 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 395 transitions. [2018-10-14 16:54:23,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2018-10-14 16:54:23,022 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:54:23,022 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:54:23,023 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:54:23,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:54:23,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1927478366, now seen corresponding path program 13 times [2018-10-14 16:54:23,024 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:54:23,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:54:24,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2223 backedges. 0 proven. 2223 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:54:24,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:54:24,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-14 16:54:24,330 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-14 16:54:24,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-14 16:54:24,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=628, Unknown=0, NotChecked=0, Total=702 [2018-10-14 16:54:24,331 INFO L87 Difference]: Start difference. First operand 395 states and 395 transitions. Second operand 27 states. [2018-10-14 16:54:29,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:54:29,896 INFO L93 Difference]: Finished difference Result 449 states and 449 transitions. [2018-10-14 16:54:29,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-14 16:54:29,897 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 394 [2018-10-14 16:54:29,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:54:29,900 INFO L225 Difference]: With dead ends: 449 [2018-10-14 16:54:29,900 INFO L226 Difference]: Without dead ends: 449 [2018-10-14 16:54:29,902 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=548, Invalid=2422, Unknown=0, NotChecked=0, Total=2970 [2018-10-14 16:54:29,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-10-14 16:54:29,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 423. [2018-10-14 16:54:29,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-10-14 16:54:29,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 423 transitions. [2018-10-14 16:54:29,909 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 423 transitions. Word has length 394 [2018-10-14 16:54:29,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:54:29,910 INFO L481 AbstractCegarLoop]: Abstraction has 423 states and 423 transitions. [2018-10-14 16:54:29,910 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-14 16:54:29,910 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 423 transitions. [2018-10-14 16:54:29,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2018-10-14 16:54:29,912 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:54:29,913 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:54:29,913 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:54:29,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:54:29,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1191507440, now seen corresponding path program 14 times [2018-10-14 16:54:29,914 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:54:29,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:54:32,829 INFO L134 CoverageAnalysis]: Checked inductivity of 2590 backedges. 0 proven. 2590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:54:32,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:54:32,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-14 16:54:32,830 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-14 16:54:32,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-14 16:54:32,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=679, Unknown=0, NotChecked=0, Total=756 [2018-10-14 16:54:32,831 INFO L87 Difference]: Start difference. First operand 423 states and 423 transitions. Second operand 28 states. [2018-10-14 16:54:38,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:54:38,512 INFO L93 Difference]: Finished difference Result 477 states and 477 transitions. [2018-10-14 16:54:38,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-14 16:54:38,513 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 422 [2018-10-14 16:54:38,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:54:38,516 INFO L225 Difference]: With dead ends: 477 [2018-10-14 16:54:38,516 INFO L226 Difference]: Without dead ends: 477 [2018-10-14 16:54:38,518 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=572, Invalid=2620, Unknown=0, NotChecked=0, Total=3192 [2018-10-14 16:54:38,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2018-10-14 16:54:38,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 451. [2018-10-14 16:54:38,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2018-10-14 16:54:38,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 451 transitions. [2018-10-14 16:54:38,525 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 451 transitions. Word has length 422 [2018-10-14 16:54:38,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:54:38,525 INFO L481 AbstractCegarLoop]: Abstraction has 451 states and 451 transitions. [2018-10-14 16:54:38,525 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-14 16:54:38,526 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 451 transitions. [2018-10-14 16:54:38,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2018-10-14 16:54:38,528 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:54:38,528 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:54:38,529 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:54:38,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:54:38,529 INFO L82 PathProgramCache]: Analyzing trace with hash 730349438, now seen corresponding path program 15 times [2018-10-14 16:54:38,530 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:54:38,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:54:39,246 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-14 16:54:41,224 INFO L134 CoverageAnalysis]: Checked inductivity of 2985 backedges. 0 proven. 2985 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:54:41,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:54:41,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-14 16:54:41,225 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-14 16:54:41,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-14 16:54:41,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=732, Unknown=0, NotChecked=0, Total=812 [2018-10-14 16:54:41,226 INFO L87 Difference]: Start difference. First operand 451 states and 451 transitions. Second operand 29 states. [2018-10-14 16:54:47,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:54:47,311 INFO L93 Difference]: Finished difference Result 505 states and 505 transitions. [2018-10-14 16:54:47,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-14 16:54:47,312 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 450 [2018-10-14 16:54:47,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:54:47,315 INFO L225 Difference]: With dead ends: 505 [2018-10-14 16:54:47,315 INFO L226 Difference]: Without dead ends: 505 [2018-10-14 16:54:47,316 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=596, Invalid=2826, Unknown=0, NotChecked=0, Total=3422 [2018-10-14 16:54:47,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2018-10-14 16:54:47,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 479. [2018-10-14 16:54:47,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2018-10-14 16:54:47,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 479 transitions. [2018-10-14 16:54:47,323 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 479 transitions. Word has length 450 [2018-10-14 16:54:47,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:54:47,324 INFO L481 AbstractCegarLoop]: Abstraction has 479 states and 479 transitions. [2018-10-14 16:54:47,324 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-14 16:54:47,324 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 479 transitions. [2018-10-14 16:54:47,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2018-10-14 16:54:47,327 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:54:47,327 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:54:47,327 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:54:47,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:54:47,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1019730964, now seen corresponding path program 16 times [2018-10-14 16:54:47,328 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:54:47,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:54:49,424 INFO L134 CoverageAnalysis]: Checked inductivity of 3408 backedges. 0 proven. 3408 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:54:49,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:54:49,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-14 16:54:49,425 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-14 16:54:49,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-14 16:54:49,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=787, Unknown=0, NotChecked=0, Total=870 [2018-10-14 16:54:49,426 INFO L87 Difference]: Start difference. First operand 479 states and 479 transitions. Second operand 30 states. [2018-10-14 16:54:49,640 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-14 16:54:56,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:54:56,397 INFO L93 Difference]: Finished difference Result 533 states and 533 transitions. [2018-10-14 16:54:56,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-14 16:54:56,398 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 478 [2018-10-14 16:54:56,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:54:56,401 INFO L225 Difference]: With dead ends: 533 [2018-10-14 16:54:56,401 INFO L226 Difference]: Without dead ends: 533 [2018-10-14 16:54:56,402 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 589 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=620, Invalid=3040, Unknown=0, NotChecked=0, Total=3660 [2018-10-14 16:54:56,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2018-10-14 16:54:56,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 507. [2018-10-14 16:54:56,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2018-10-14 16:54:56,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 507 transitions. [2018-10-14 16:54:56,410 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 507 transitions. Word has length 478 [2018-10-14 16:54:56,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:54:56,410 INFO L481 AbstractCegarLoop]: Abstraction has 507 states and 507 transitions. [2018-10-14 16:54:56,410 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-14 16:54:56,411 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 507 transitions. [2018-10-14 16:54:56,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2018-10-14 16:54:56,414 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:54:56,414 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:54:56,414 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:54:56,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:54:56,415 INFO L82 PathProgramCache]: Analyzing trace with hash -163694758, now seen corresponding path program 17 times [2018-10-14 16:54:56,415 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:54:56,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:54:58,630 INFO L134 CoverageAnalysis]: Checked inductivity of 3859 backedges. 0 proven. 3859 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:54:58,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:54:58,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-14 16:54:58,631 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-14 16:54:58,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-14 16:54:58,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=844, Unknown=0, NotChecked=0, Total=930 [2018-10-14 16:54:58,632 INFO L87 Difference]: Start difference. First operand 507 states and 507 transitions. Second operand 31 states. [2018-10-14 16:55:02,556 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2018-10-14 16:55:06,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:55:06,019 INFO L93 Difference]: Finished difference Result 561 states and 561 transitions. [2018-10-14 16:55:06,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-14 16:55:06,020 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 506 [2018-10-14 16:55:06,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:55:06,023 INFO L225 Difference]: With dead ends: 561 [2018-10-14 16:55:06,023 INFO L226 Difference]: Without dead ends: 561 [2018-10-14 16:55:06,024 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 627 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=644, Invalid=3262, Unknown=0, NotChecked=0, Total=3906 [2018-10-14 16:55:06,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2018-10-14 16:55:06,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 535. [2018-10-14 16:55:06,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2018-10-14 16:55:06,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 535 transitions. [2018-10-14 16:55:06,031 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 535 transitions. Word has length 506 [2018-10-14 16:55:06,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:55:06,032 INFO L481 AbstractCegarLoop]: Abstraction has 535 states and 535 transitions. [2018-10-14 16:55:06,032 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-14 16:55:06,032 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 535 transitions. [2018-10-14 16:55:06,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2018-10-14 16:55:06,035 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:55:06,035 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:55:06,036 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:55:06,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:55:06,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1299318328, now seen corresponding path program 18 times [2018-10-14 16:55:06,037 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:55:06,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:55:08,368 INFO L134 CoverageAnalysis]: Checked inductivity of 4338 backedges. 0 proven. 4338 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:55:08,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:55:08,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-14 16:55:08,369 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-14 16:55:08,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-14 16:55:08,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=903, Unknown=0, NotChecked=0, Total=992 [2018-10-14 16:55:08,370 INFO L87 Difference]: Start difference. First operand 535 states and 535 transitions. Second operand 32 states. [2018-10-14 16:55:16,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:55:16,367 INFO L93 Difference]: Finished difference Result 589 states and 589 transitions. [2018-10-14 16:55:16,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-14 16:55:16,368 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 534 [2018-10-14 16:55:16,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:55:16,370 INFO L225 Difference]: With dead ends: 589 [2018-10-14 16:55:16,370 INFO L226 Difference]: Without dead ends: 589 [2018-10-14 16:55:16,372 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=668, Invalid=3492, Unknown=0, NotChecked=0, Total=4160 [2018-10-14 16:55:16,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2018-10-14 16:55:16,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 563. [2018-10-14 16:55:16,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2018-10-14 16:55:16,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 563 transitions. [2018-10-14 16:55:16,379 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 563 transitions. Word has length 534 [2018-10-14 16:55:16,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:55:16,379 INFO L481 AbstractCegarLoop]: Abstraction has 563 states and 563 transitions. [2018-10-14 16:55:16,379 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-14 16:55:16,379 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 563 transitions. [2018-10-14 16:55:16,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 563 [2018-10-14 16:55:16,383 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:55:16,383 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:55:16,383 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:55:16,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:55:16,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1037757238, now seen corresponding path program 19 times [2018-10-14 16:55:16,385 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:55:16,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:55:18,571 INFO L134 CoverageAnalysis]: Checked inductivity of 4845 backedges. 0 proven. 4845 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:55:18,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:55:18,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-14 16:55:18,572 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-14 16:55:18,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-14 16:55:18,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=964, Unknown=0, NotChecked=0, Total=1056 [2018-10-14 16:55:18,573 INFO L87 Difference]: Start difference. First operand 563 states and 563 transitions. Second operand 33 states. [2018-10-14 16:55:27,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:55:27,107 INFO L93 Difference]: Finished difference Result 617 states and 617 transitions. [2018-10-14 16:55:27,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-14 16:55:27,107 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 562 [2018-10-14 16:55:27,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:55:27,111 INFO L225 Difference]: With dead ends: 617 [2018-10-14 16:55:27,111 INFO L226 Difference]: Without dead ends: 617 [2018-10-14 16:55:27,112 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 702 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=692, Invalid=3730, Unknown=0, NotChecked=0, Total=4422 [2018-10-14 16:55:27,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2018-10-14 16:55:27,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 591. [2018-10-14 16:55:27,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2018-10-14 16:55:27,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 591 transitions. [2018-10-14 16:55:27,119 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 591 transitions. Word has length 562 [2018-10-14 16:55:27,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:55:27,120 INFO L481 AbstractCegarLoop]: Abstraction has 591 states and 591 transitions. [2018-10-14 16:55:27,120 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-14 16:55:27,120 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 591 transitions. [2018-10-14 16:55:27,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 591 [2018-10-14 16:55:27,124 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:55:27,124 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:55:27,125 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:55:27,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:55:27,125 INFO L82 PathProgramCache]: Analyzing trace with hash 362318756, now seen corresponding path program 20 times [2018-10-14 16:55:27,126 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:55:27,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:55:29,424 INFO L134 CoverageAnalysis]: Checked inductivity of 5380 backedges. 0 proven. 5380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:55:29,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:55:29,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-14 16:55:29,425 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-14 16:55:29,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-14 16:55:29,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1027, Unknown=0, NotChecked=0, Total=1122 [2018-10-14 16:55:29,426 INFO L87 Difference]: Start difference. First operand 591 states and 591 transitions. Second operand 34 states. [2018-10-14 16:55:38,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:55:38,702 INFO L93 Difference]: Finished difference Result 645 states and 645 transitions. [2018-10-14 16:55:38,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-14 16:55:38,702 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 590 [2018-10-14 16:55:38,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:55:38,704 INFO L225 Difference]: With dead ends: 645 [2018-10-14 16:55:38,704 INFO L226 Difference]: Without dead ends: 645 [2018-10-14 16:55:38,706 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=716, Invalid=3976, Unknown=0, NotChecked=0, Total=4692 [2018-10-14 16:55:38,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2018-10-14 16:55:38,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 619. [2018-10-14 16:55:38,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 619 states. [2018-10-14 16:55:38,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 619 transitions. [2018-10-14 16:55:38,713 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 619 transitions. Word has length 590 [2018-10-14 16:55:38,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:55:38,714 INFO L481 AbstractCegarLoop]: Abstraction has 619 states and 619 transitions. [2018-10-14 16:55:38,714 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-14 16:55:38,714 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 619 transitions. [2018-10-14 16:55:38,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 619 [2018-10-14 16:55:38,718 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:55:38,719 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:55:38,719 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:55:38,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:55:38,719 INFO L82 PathProgramCache]: Analyzing trace with hash -822453486, now seen corresponding path program 21 times [2018-10-14 16:55:38,720 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:55:38,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:55:41,139 INFO L134 CoverageAnalysis]: Checked inductivity of 5943 backedges. 0 proven. 5943 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:55:41,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:55:41,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-14 16:55:41,140 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-14 16:55:41,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-14 16:55:41,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1092, Unknown=0, NotChecked=0, Total=1190 [2018-10-14 16:55:41,141 INFO L87 Difference]: Start difference. First operand 619 states and 619 transitions. Second operand 35 states. [2018-10-14 16:55:51,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:55:51,100 INFO L93 Difference]: Finished difference Result 673 states and 673 transitions. [2018-10-14 16:55:51,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-14 16:55:51,102 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 618 [2018-10-14 16:55:51,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:55:51,105 INFO L225 Difference]: With dead ends: 673 [2018-10-14 16:55:51,105 INFO L226 Difference]: Without dead ends: 673 [2018-10-14 16:55:51,106 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 785 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=740, Invalid=4230, Unknown=0, NotChecked=0, Total=4970 [2018-10-14 16:55:51,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2018-10-14 16:55:51,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 647. [2018-10-14 16:55:51,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2018-10-14 16:55:51,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 647 transitions. [2018-10-14 16:55:51,113 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 647 transitions. Word has length 618 [2018-10-14 16:55:51,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:55:51,114 INFO L481 AbstractCegarLoop]: Abstraction has 647 states and 647 transitions. [2018-10-14 16:55:51,114 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-14 16:55:51,114 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 647 transitions. [2018-10-14 16:55:51,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 647 [2018-10-14 16:55:51,118 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:55:51,119 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:55:51,119 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:55:51,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:55:51,119 INFO L82 PathProgramCache]: Analyzing trace with hash -151791232, now seen corresponding path program 22 times [2018-10-14 16:55:51,120 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:55:51,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:55:54,031 INFO L134 CoverageAnalysis]: Checked inductivity of 6534 backedges. 0 proven. 6534 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:55:54,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:55:54,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-14 16:55:54,032 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-14 16:55:54,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-14 16:55:54,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1159, Unknown=0, NotChecked=0, Total=1260 [2018-10-14 16:55:54,033 INFO L87 Difference]: Start difference. First operand 647 states and 647 transitions. Second operand 36 states. [2018-10-14 16:56:04,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:56:04,884 INFO L93 Difference]: Finished difference Result 701 states and 701 transitions. [2018-10-14 16:56:04,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-14 16:56:04,884 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 646 [2018-10-14 16:56:04,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:56:04,887 INFO L225 Difference]: With dead ends: 701 [2018-10-14 16:56:04,887 INFO L226 Difference]: Without dead ends: 701 [2018-10-14 16:56:04,887 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 832 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=764, Invalid=4492, Unknown=0, NotChecked=0, Total=5256 [2018-10-14 16:56:04,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2018-10-14 16:56:04,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 675. [2018-10-14 16:56:04,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 675 states. [2018-10-14 16:56:04,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 675 transitions. [2018-10-14 16:56:04,895 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 675 transitions. Word has length 646 [2018-10-14 16:56:04,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:56:04,895 INFO L481 AbstractCegarLoop]: Abstraction has 675 states and 675 transitions. [2018-10-14 16:56:04,895 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-14 16:56:04,896 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 675 transitions. [2018-10-14 16:56:04,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 675 [2018-10-14 16:56:04,900 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:56:04,901 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:56:04,901 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:56:04,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:56:04,902 INFO L82 PathProgramCache]: Analyzing trace with hash -231176466, now seen corresponding path program 23 times [2018-10-14 16:56:04,902 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:56:04,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:56:07,624 INFO L134 CoverageAnalysis]: Checked inductivity of 7153 backedges. 0 proven. 7153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:56:07,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:56:07,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-14 16:56:07,625 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-14 16:56:07,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-14 16:56:07,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1228, Unknown=0, NotChecked=0, Total=1332 [2018-10-14 16:56:07,626 INFO L87 Difference]: Start difference. First operand 675 states and 675 transitions. Second operand 37 states. [2018-10-14 16:56:19,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:56:19,224 INFO L93 Difference]: Finished difference Result 729 states and 729 transitions. [2018-10-14 16:56:19,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-14 16:56:19,224 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 674 [2018-10-14 16:56:19,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:56:19,227 INFO L225 Difference]: With dead ends: 729 [2018-10-14 16:56:19,227 INFO L226 Difference]: Without dead ends: 729 [2018-10-14 16:56:19,228 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 876 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=788, Invalid=4762, Unknown=0, NotChecked=0, Total=5550 [2018-10-14 16:56:19,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2018-10-14 16:56:19,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 703. [2018-10-14 16:56:19,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2018-10-14 16:56:19,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 703 transitions. [2018-10-14 16:56:19,235 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 703 transitions. Word has length 674 [2018-10-14 16:56:19,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:56:19,236 INFO L481 AbstractCegarLoop]: Abstraction has 703 states and 703 transitions. [2018-10-14 16:56:19,236 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-14 16:56:19,236 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 703 transitions. [2018-10-14 16:56:19,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 703 [2018-10-14 16:56:19,241 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:56:19,241 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:56:19,242 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:56:19,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:56:19,242 INFO L82 PathProgramCache]: Analyzing trace with hash -583277732, now seen corresponding path program 24 times [2018-10-14 16:56:19,243 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:56:19,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:56:22,479 INFO L134 CoverageAnalysis]: Checked inductivity of 7800 backedges. 0 proven. 7800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:56:22,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:56:22,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-14 16:56:22,480 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-14 16:56:22,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-14 16:56:22,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1299, Unknown=0, NotChecked=0, Total=1406 [2018-10-14 16:56:22,481 INFO L87 Difference]: Start difference. First operand 703 states and 703 transitions. Second operand 38 states. [2018-10-14 16:56:35,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:56:35,016 INFO L93 Difference]: Finished difference Result 757 states and 757 transitions. [2018-10-14 16:56:35,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-14 16:56:35,016 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 702 [2018-10-14 16:56:35,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:56:35,019 INFO L225 Difference]: With dead ends: 757 [2018-10-14 16:56:35,019 INFO L226 Difference]: Without dead ends: 757 [2018-10-14 16:56:35,019 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 921 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=812, Invalid=5040, Unknown=0, NotChecked=0, Total=5852 [2018-10-14 16:56:35,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2018-10-14 16:56:35,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 731. [2018-10-14 16:56:35,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2018-10-14 16:56:35,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 731 transitions. [2018-10-14 16:56:35,027 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 731 transitions. Word has length 702 [2018-10-14 16:56:35,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:56:35,028 INFO L481 AbstractCegarLoop]: Abstraction has 731 states and 731 transitions. [2018-10-14 16:56:35,028 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-14 16:56:35,028 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 731 transitions. [2018-10-14 16:56:35,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 731 [2018-10-14 16:56:35,034 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:56:35,034 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:56:35,034 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:56:35,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:56:35,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1815178954, now seen corresponding path program 25 times [2018-10-14 16:56:35,036 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:56:35,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:56:39,097 INFO L134 CoverageAnalysis]: Checked inductivity of 8475 backedges. 0 proven. 8475 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:56:39,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:56:39,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-14 16:56:39,098 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-14 16:56:39,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-14 16:56:39,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1372, Unknown=0, NotChecked=0, Total=1482 [2018-10-14 16:56:39,099 INFO L87 Difference]: Start difference. First operand 731 states and 731 transitions. Second operand 39 states. [2018-10-14 16:56:53,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:56:53,366 INFO L93 Difference]: Finished difference Result 785 states and 785 transitions. [2018-10-14 16:56:53,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-14 16:56:53,366 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 730 [2018-10-14 16:56:53,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:56:53,369 INFO L225 Difference]: With dead ends: 785 [2018-10-14 16:56:53,369 INFO L226 Difference]: Without dead ends: 785 [2018-10-14 16:56:53,369 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 967 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=836, Invalid=5326, Unknown=0, NotChecked=0, Total=6162 [2018-10-14 16:56:53,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2018-10-14 16:56:53,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 759. [2018-10-14 16:56:53,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2018-10-14 16:56:53,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 759 transitions. [2018-10-14 16:56:53,376 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 759 transitions. Word has length 730 [2018-10-14 16:56:53,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:56:53,377 INFO L481 AbstractCegarLoop]: Abstraction has 759 states and 759 transitions. [2018-10-14 16:56:53,377 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-14 16:56:53,377 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 759 transitions. [2018-10-14 16:56:53,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 759 [2018-10-14 16:56:53,383 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:56:53,383 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:56:53,384 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:56:53,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:56:53,384 INFO L82 PathProgramCache]: Analyzing trace with hash -888362696, now seen corresponding path program 26 times [2018-10-14 16:56:53,385 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:56:53,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:56:56,744 INFO L134 CoverageAnalysis]: Checked inductivity of 9178 backedges. 0 proven. 9178 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:56:56,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:56:56,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-14 16:56:56,745 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-14 16:56:56,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-14 16:56:56,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1447, Unknown=0, NotChecked=0, Total=1560 [2018-10-14 16:56:56,745 INFO L87 Difference]: Start difference. First operand 759 states and 759 transitions. Second operand 40 states. [2018-10-14 16:57:11,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:57:11,542 INFO L93 Difference]: Finished difference Result 813 states and 813 transitions. [2018-10-14 16:57:11,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-14 16:57:11,543 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 758 [2018-10-14 16:57:11,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:57:11,545 INFO L225 Difference]: With dead ends: 813 [2018-10-14 16:57:11,545 INFO L226 Difference]: Without dead ends: 813 [2018-10-14 16:57:11,546 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1014 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=860, Invalid=5620, Unknown=0, NotChecked=0, Total=6480 [2018-10-14 16:57:11,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2018-10-14 16:57:11,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 787. [2018-10-14 16:57:11,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2018-10-14 16:57:11,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 787 transitions. [2018-10-14 16:57:11,554 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 787 transitions. Word has length 758 [2018-10-14 16:57:11,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:57:11,555 INFO L481 AbstractCegarLoop]: Abstraction has 787 states and 787 transitions. [2018-10-14 16:57:11,555 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-14 16:57:11,555 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 787 transitions. [2018-10-14 16:57:11,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 787 [2018-10-14 16:57:11,562 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:57:11,562 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:57:11,562 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:57:11,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:57:11,563 INFO L82 PathProgramCache]: Analyzing trace with hash 2105610918, now seen corresponding path program 27 times [2018-10-14 16:57:11,563 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:57:11,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:57:15,357 INFO L134 CoverageAnalysis]: Checked inductivity of 9909 backedges. 0 proven. 9909 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:57:15,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:57:15,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-14 16:57:15,359 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-14 16:57:15,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-14 16:57:15,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1524, Unknown=0, NotChecked=0, Total=1640 [2018-10-14 16:57:15,360 INFO L87 Difference]: Start difference. First operand 787 states and 787 transitions. Second operand 41 states. [2018-10-14 16:57:30,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:57:30,377 INFO L93 Difference]: Finished difference Result 841 states and 841 transitions. [2018-10-14 16:57:30,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-14 16:57:30,378 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 786 [2018-10-14 16:57:30,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:57:30,380 INFO L225 Difference]: With dead ends: 841 [2018-10-14 16:57:30,380 INFO L226 Difference]: Without dead ends: 841 [2018-10-14 16:57:30,381 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1058 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=884, Invalid=5922, Unknown=0, NotChecked=0, Total=6806 [2018-10-14 16:57:30,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2018-10-14 16:57:30,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 815. [2018-10-14 16:57:30,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 815 states. [2018-10-14 16:57:30,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 815 transitions. [2018-10-14 16:57:30,389 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 815 transitions. Word has length 786 [2018-10-14 16:57:30,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:57:30,390 INFO L481 AbstractCegarLoop]: Abstraction has 815 states and 815 transitions. [2018-10-14 16:57:30,390 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-14 16:57:30,390 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 815 transitions. [2018-10-14 16:57:30,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 815 [2018-10-14 16:57:30,396 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:57:30,397 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:57:30,397 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:57:30,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:57:30,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1057106708, now seen corresponding path program 28 times [2018-10-14 16:57:30,398 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:57:30,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:57:32,551 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-14 16:57:35,738 INFO L134 CoverageAnalysis]: Checked inductivity of 10668 backedges. 0 proven. 10668 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:57:35,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:57:35,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-14 16:57:35,739 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-14 16:57:35,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-14 16:57:35,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1603, Unknown=0, NotChecked=0, Total=1722 [2018-10-14 16:57:35,740 INFO L87 Difference]: Start difference. First operand 815 states and 815 transitions. Second operand 42 states. [2018-10-14 16:57:51,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:57:51,615 INFO L93 Difference]: Finished difference Result 869 states and 869 transitions. [2018-10-14 16:57:51,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-14 16:57:51,624 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 814 [2018-10-14 16:57:51,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:57:51,628 INFO L225 Difference]: With dead ends: 869 [2018-10-14 16:57:51,628 INFO L226 Difference]: Without dead ends: 869 [2018-10-14 16:57:51,628 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1107 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=908, Invalid=6232, Unknown=0, NotChecked=0, Total=7140 [2018-10-14 16:57:51,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2018-10-14 16:57:51,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 843. [2018-10-14 16:57:51,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 843 states. [2018-10-14 16:57:51,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 843 transitions. [2018-10-14 16:57:51,639 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 843 transitions. Word has length 814 [2018-10-14 16:57:51,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:57:51,640 INFO L481 AbstractCegarLoop]: Abstraction has 843 states and 843 transitions. [2018-10-14 16:57:51,640 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-14 16:57:51,640 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 843 transitions. [2018-10-14 16:57:51,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 843 [2018-10-14 16:57:51,647 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:57:51,647 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:57:51,647 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:57:51,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:57:51,648 INFO L82 PathProgramCache]: Analyzing trace with hash -490507646, now seen corresponding path program 29 times [2018-10-14 16:57:51,650 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:57:51,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:57:55,674 INFO L134 CoverageAnalysis]: Checked inductivity of 11455 backedges. 0 proven. 11455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:57:55,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:57:55,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-14 16:57:55,675 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-14 16:57:55,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-14 16:57:55,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1684, Unknown=0, NotChecked=0, Total=1806 [2018-10-14 16:57:55,675 INFO L87 Difference]: Start difference. First operand 843 states and 843 transitions. Second operand 43 states. [2018-10-14 16:58:12,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:58:12,264 INFO L93 Difference]: Finished difference Result 897 states and 897 transitions. [2018-10-14 16:58:12,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-14 16:58:12,264 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 842 [2018-10-14 16:58:12,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:58:12,267 INFO L225 Difference]: With dead ends: 897 [2018-10-14 16:58:12,267 INFO L226 Difference]: Without dead ends: 897 [2018-10-14 16:58:12,268 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1157 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=932, Invalid=6550, Unknown=0, NotChecked=0, Total=7482 [2018-10-14 16:58:12,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2018-10-14 16:58:12,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 871. [2018-10-14 16:58:12,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 871 states. [2018-10-14 16:58:12,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 871 transitions. [2018-10-14 16:58:12,275 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 871 transitions. Word has length 842 [2018-10-14 16:58:12,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:58:12,276 INFO L481 AbstractCegarLoop]: Abstraction has 871 states and 871 transitions. [2018-10-14 16:58:12,276 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-14 16:58:12,276 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 871 transitions. [2018-10-14 16:58:12,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 871 [2018-10-14 16:58:12,283 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:58:12,283 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:58:12,284 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:58:12,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:58:12,284 INFO L82 PathProgramCache]: Analyzing trace with hash 867723504, now seen corresponding path program 30 times [2018-10-14 16:58:12,285 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:58:12,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:58:16,381 INFO L134 CoverageAnalysis]: Checked inductivity of 12270 backedges. 0 proven. 12270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:58:16,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:58:16,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-14 16:58:16,382 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-14 16:58:16,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-14 16:58:16,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1767, Unknown=0, NotChecked=0, Total=1892 [2018-10-14 16:58:16,383 INFO L87 Difference]: Start difference. First operand 871 states and 871 transitions. Second operand 44 states. [2018-10-14 16:58:34,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:58:34,004 INFO L93 Difference]: Finished difference Result 925 states and 925 transitions. [2018-10-14 16:58:34,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-14 16:58:34,005 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 870 [2018-10-14 16:58:34,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:58:34,008 INFO L225 Difference]: With dead ends: 925 [2018-10-14 16:58:34,008 INFO L226 Difference]: Without dead ends: 925 [2018-10-14 16:58:34,009 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1208 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=956, Invalid=6876, Unknown=0, NotChecked=0, Total=7832 [2018-10-14 16:58:34,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2018-10-14 16:58:34,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 899. [2018-10-14 16:58:34,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2018-10-14 16:58:34,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 899 transitions. [2018-10-14 16:58:34,018 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 899 transitions. Word has length 870 [2018-10-14 16:58:34,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:58:34,019 INFO L481 AbstractCegarLoop]: Abstraction has 899 states and 899 transitions. [2018-10-14 16:58:34,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-14 16:58:34,019 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 899 transitions. [2018-10-14 16:58:34,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 899 [2018-10-14 16:58:34,029 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:58:34,029 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:58:34,030 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:58:34,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:58:34,030 INFO L82 PathProgramCache]: Analyzing trace with hash -728461730, now seen corresponding path program 31 times [2018-10-14 16:58:34,031 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:58:34,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:58:38,333 INFO L134 CoverageAnalysis]: Checked inductivity of 13113 backedges. 0 proven. 13113 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:58:38,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:58:38,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-14 16:58:38,334 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-14 16:58:38,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-14 16:58:38,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1852, Unknown=0, NotChecked=0, Total=1980 [2018-10-14 16:58:38,335 INFO L87 Difference]: Start difference. First operand 899 states and 899 transitions. Second operand 45 states. [2018-10-14 16:58:56,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:58:56,976 INFO L93 Difference]: Finished difference Result 953 states and 953 transitions. [2018-10-14 16:58:56,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-14 16:58:56,976 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 898 [2018-10-14 16:58:56,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:58:56,979 INFO L225 Difference]: With dead ends: 953 [2018-10-14 16:58:56,979 INFO L226 Difference]: Without dead ends: 953 [2018-10-14 16:58:56,980 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1260 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=980, Invalid=7210, Unknown=0, NotChecked=0, Total=8190 [2018-10-14 16:58:56,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2018-10-14 16:58:56,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 927. [2018-10-14 16:58:56,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2018-10-14 16:58:56,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 927 transitions. [2018-10-14 16:58:56,988 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 927 transitions. Word has length 898 [2018-10-14 16:58:56,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:58:56,989 INFO L481 AbstractCegarLoop]: Abstraction has 927 states and 927 transitions. [2018-10-14 16:58:56,989 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-14 16:58:56,989 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 927 transitions. [2018-10-14 16:58:56,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 927 [2018-10-14 16:58:56,994 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:58:56,995 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:58:56,995 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:58:56,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:58:56,995 INFO L82 PathProgramCache]: Analyzing trace with hash 533422796, now seen corresponding path program 32 times [2018-10-14 16:58:56,996 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:58:57,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:59:01,548 INFO L134 CoverageAnalysis]: Checked inductivity of 13984 backedges. 0 proven. 13984 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:59:01,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:59:01,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-14 16:59:01,550 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-14 16:59:01,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-14 16:59:01,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1939, Unknown=0, NotChecked=0, Total=2070 [2018-10-14 16:59:01,551 INFO L87 Difference]: Start difference. First operand 927 states and 927 transitions. Second operand 46 states. [2018-10-14 16:59:21,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:59:21,175 INFO L93 Difference]: Finished difference Result 981 states and 981 transitions. [2018-10-14 16:59:21,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-14 16:59:21,175 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 926 [2018-10-14 16:59:21,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:59:21,178 INFO L225 Difference]: With dead ends: 981 [2018-10-14 16:59:21,178 INFO L226 Difference]: Without dead ends: 981 [2018-10-14 16:59:21,179 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1313 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1004, Invalid=7552, Unknown=0, NotChecked=0, Total=8556 [2018-10-14 16:59:21,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2018-10-14 16:59:21,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 955. [2018-10-14 16:59:21,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 955 states. [2018-10-14 16:59:21,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 955 transitions. [2018-10-14 16:59:21,186 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 955 transitions. Word has length 926 [2018-10-14 16:59:21,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:59:21,187 INFO L481 AbstractCegarLoop]: Abstraction has 955 states and 955 transitions. [2018-10-14 16:59:21,187 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-14 16:59:21,187 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 955 transitions. [2018-10-14 16:59:21,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 955 [2018-10-14 16:59:21,193 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:59:21,194 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:59:21,194 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:59:21,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:59:21,194 INFO L82 PathProgramCache]: Analyzing trace with hash 126903866, now seen corresponding path program 33 times [2018-10-14 16:59:21,195 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:59:21,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:59:25,954 INFO L134 CoverageAnalysis]: Checked inductivity of 14883 backedges. 0 proven. 14883 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:59:25,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:59:25,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-14 16:59:25,955 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-14 16:59:25,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-14 16:59:25,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=2028, Unknown=0, NotChecked=0, Total=2162 [2018-10-14 16:59:25,955 INFO L87 Difference]: Start difference. First operand 955 states and 955 transitions. Second operand 47 states. [2018-10-14 16:59:46,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:59:46,753 INFO L93 Difference]: Finished difference Result 1009 states and 1009 transitions. [2018-10-14 16:59:46,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-14 16:59:46,753 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 954 [2018-10-14 16:59:46,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:59:46,757 INFO L225 Difference]: With dead ends: 1009 [2018-10-14 16:59:46,757 INFO L226 Difference]: Without dead ends: 1009 [2018-10-14 16:59:46,757 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1367 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1028, Invalid=7902, Unknown=0, NotChecked=0, Total=8930 [2018-10-14 16:59:46,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2018-10-14 16:59:46,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 983. [2018-10-14 16:59:46,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 983 states. [2018-10-14 16:59:46,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 983 transitions. [2018-10-14 16:59:46,764 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 983 transitions. Word has length 954 [2018-10-14 16:59:46,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:59:46,764 INFO L481 AbstractCegarLoop]: Abstraction has 983 states and 983 transitions. [2018-10-14 16:59:46,764 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-14 16:59:46,764 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 983 transitions. [2018-10-14 16:59:46,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 983 [2018-10-14 16:59:46,770 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:59:46,771 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:59:46,771 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:59:46,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:59:46,772 INFO L82 PathProgramCache]: Analyzing trace with hash -170452824, now seen corresponding path program 34 times [2018-10-14 16:59:46,772 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:59:46,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:59:48,568 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-14 16:59:52,386 INFO L134 CoverageAnalysis]: Checked inductivity of 15810 backedges. 0 proven. 15810 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:59:52,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:59:52,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-14 16:59:52,387 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-14 16:59:52,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-14 16:59:52,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=2119, Unknown=0, NotChecked=0, Total=2256 [2018-10-14 16:59:52,387 INFO L87 Difference]: Start difference. First operand 983 states and 983 transitions. Second operand 48 states. [2018-10-14 17:00:14,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:00:14,144 INFO L93 Difference]: Finished difference Result 1037 states and 1037 transitions. [2018-10-14 17:00:14,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-14 17:00:14,144 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 982 [2018-10-14 17:00:14,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:00:14,148 INFO L225 Difference]: With dead ends: 1037 [2018-10-14 17:00:14,148 INFO L226 Difference]: Without dead ends: 1037 [2018-10-14 17:00:14,148 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1422 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1052, Invalid=8260, Unknown=0, NotChecked=0, Total=9312 [2018-10-14 17:00:14,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2018-10-14 17:00:14,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 1011. [2018-10-14 17:00:14,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1011 states. [2018-10-14 17:00:14,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1011 transitions. [2018-10-14 17:00:14,157 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1011 transitions. Word has length 982 [2018-10-14 17:00:14,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:00:14,157 INFO L481 AbstractCegarLoop]: Abstraction has 1011 states and 1011 transitions. [2018-10-14 17:00:14,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-14 17:00:14,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1011 transitions. [2018-10-14 17:00:14,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1011 [2018-10-14 17:00:14,164 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:00:14,164 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:00:14,164 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:00:14,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:00:14,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1403848170, now seen corresponding path program 35 times [2018-10-14 17:00:14,165 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:00:14,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:00:19,440 INFO L134 CoverageAnalysis]: Checked inductivity of 16765 backedges. 0 proven. 16765 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:00:19,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:00:19,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-14 17:00:19,441 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-14 17:00:19,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-14 17:00:19,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=2212, Unknown=0, NotChecked=0, Total=2352 [2018-10-14 17:00:19,442 INFO L87 Difference]: Start difference. First operand 1011 states and 1011 transitions. Second operand 49 states. [2018-10-14 17:00:42,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:00:42,186 INFO L93 Difference]: Finished difference Result 1065 states and 1065 transitions. [2018-10-14 17:00:42,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-14 17:00:42,186 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 1010 [2018-10-14 17:00:42,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:00:42,189 INFO L225 Difference]: With dead ends: 1065 [2018-10-14 17:00:42,190 INFO L226 Difference]: Without dead ends: 1065 [2018-10-14 17:00:42,190 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1478 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1076, Invalid=8626, Unknown=0, NotChecked=0, Total=9702 [2018-10-14 17:00:42,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2018-10-14 17:00:42,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 1039. [2018-10-14 17:00:42,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1039 states. [2018-10-14 17:00:42,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 1039 transitions. [2018-10-14 17:00:42,198 INFO L78 Accepts]: Start accepts. Automaton has 1039 states and 1039 transitions. Word has length 1010 [2018-10-14 17:00:42,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:00:42,199 INFO L481 AbstractCegarLoop]: Abstraction has 1039 states and 1039 transitions. [2018-10-14 17:00:42,199 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-14 17:00:42,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1039 transitions. [2018-10-14 17:00:42,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1039 [2018-10-14 17:00:42,205 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:00:42,206 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:00:42,206 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:00:42,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:00:42,207 INFO L82 PathProgramCache]: Analyzing trace with hash 611814020, now seen corresponding path program 36 times [2018-10-14 17:00:42,207 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:00:42,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:00:47,633 INFO L134 CoverageAnalysis]: Checked inductivity of 17748 backedges. 0 proven. 17748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:00:47,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:00:47,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-14 17:00:47,634 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-14 17:00:47,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-14 17:00:47,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=2307, Unknown=0, NotChecked=0, Total=2450 [2018-10-14 17:00:47,635 INFO L87 Difference]: Start difference. First operand 1039 states and 1039 transitions. Second operand 50 states. [2018-10-14 17:01:11,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:01:11,532 INFO L93 Difference]: Finished difference Result 1093 states and 1093 transitions. [2018-10-14 17:01:11,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-14 17:01:11,533 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 1038 [2018-10-14 17:01:11,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:01:11,536 INFO L225 Difference]: With dead ends: 1093 [2018-10-14 17:01:11,536 INFO L226 Difference]: Without dead ends: 1093 [2018-10-14 17:01:11,537 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1535 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1100, Invalid=9000, Unknown=0, NotChecked=0, Total=10100 [2018-10-14 17:01:11,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2018-10-14 17:01:11,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 1067. [2018-10-14 17:01:11,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1067 states. [2018-10-14 17:01:11,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 1067 transitions. [2018-10-14 17:01:11,543 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 1067 transitions. Word has length 1038 [2018-10-14 17:01:11,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:01:11,544 INFO L481 AbstractCegarLoop]: Abstraction has 1067 states and 1067 transitions. [2018-10-14 17:01:11,544 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-14 17:01:11,544 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1067 transitions. [2018-10-14 17:01:11,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1067 [2018-10-14 17:01:11,551 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:01:11,551 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:01:11,552 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:01:11,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:01:11,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1870154226, now seen corresponding path program 37 times [2018-10-14 17:01:11,553 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:01:11,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:01:17,617 INFO L134 CoverageAnalysis]: Checked inductivity of 18759 backedges. 0 proven. 18759 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:01:17,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:01:17,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-14 17:01:17,618 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-14 17:01:17,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-14 17:01:17,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=2404, Unknown=0, NotChecked=0, Total=2550 [2018-10-14 17:01:17,619 INFO L87 Difference]: Start difference. First operand 1067 states and 1067 transitions. Second operand 51 states. [2018-10-14 17:01:42,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:01:42,894 INFO L93 Difference]: Finished difference Result 1121 states and 1121 transitions. [2018-10-14 17:01:42,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-14 17:01:42,895 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 1066 [2018-10-14 17:01:42,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:01:42,899 INFO L225 Difference]: With dead ends: 1121 [2018-10-14 17:01:42,899 INFO L226 Difference]: Without dead ends: 1121 [2018-10-14 17:01:42,900 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1593 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=1124, Invalid=9382, Unknown=0, NotChecked=0, Total=10506 [2018-10-14 17:01:42,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2018-10-14 17:01:42,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1095. [2018-10-14 17:01:42,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1095 states. [2018-10-14 17:01:42,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1095 transitions. [2018-10-14 17:01:42,907 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 1095 transitions. Word has length 1066 [2018-10-14 17:01:42,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:01:42,908 INFO L481 AbstractCegarLoop]: Abstraction has 1095 states and 1095 transitions. [2018-10-14 17:01:42,908 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-14 17:01:42,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1095 transitions. [2018-10-14 17:01:42,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1095 [2018-10-14 17:01:42,916 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:01:42,916 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:01:42,916 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:01:42,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:01:42,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1773619104, now seen corresponding path program 38 times [2018-10-14 17:01:42,917 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:01:43,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:01:48,823 INFO L134 CoverageAnalysis]: Checked inductivity of 19798 backedges. 0 proven. 19798 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:01:48,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:01:48,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-14 17:01:48,824 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-14 17:01:48,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-14 17:01:48,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=2503, Unknown=0, NotChecked=0, Total=2652 [2018-10-14 17:01:48,825 INFO L87 Difference]: Start difference. First operand 1095 states and 1095 transitions. Second operand 52 states. [2018-10-14 17:02:15,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:02:15,198 INFO L93 Difference]: Finished difference Result 1149 states and 1149 transitions. [2018-10-14 17:02:15,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-14 17:02:15,199 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 1094 [2018-10-14 17:02:15,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:02:15,202 INFO L225 Difference]: With dead ends: 1149 [2018-10-14 17:02:15,202 INFO L226 Difference]: Without dead ends: 1149 [2018-10-14 17:02:15,203 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1652 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1148, Invalid=9772, Unknown=0, NotChecked=0, Total=10920 [2018-10-14 17:02:15,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2018-10-14 17:02:15,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 1123. [2018-10-14 17:02:15,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1123 states. [2018-10-14 17:02:15,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1123 transitions. [2018-10-14 17:02:15,211 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1123 transitions. Word has length 1094 [2018-10-14 17:02:15,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:02:15,211 INFO L481 AbstractCegarLoop]: Abstraction has 1123 states and 1123 transitions. [2018-10-14 17:02:15,211 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-14 17:02:15,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1123 transitions. [2018-10-14 17:02:15,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1123 [2018-10-14 17:02:15,219 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:02:15,219 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:02:15,220 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:02:15,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:02:15,220 INFO L82 PathProgramCache]: Analyzing trace with hash 2040288718, now seen corresponding path program 39 times [2018-10-14 17:02:15,220 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:02:15,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat