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/sanfoundry_24_false-valid-deref.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-502d2f4 [2018-10-12 21:10:55,085 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-12 21:10:55,088 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-12 21:10:55,105 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-12 21:10:55,105 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-12 21:10:55,106 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-12 21:10:55,107 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-12 21:10:55,110 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-12 21:10:55,112 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-12 21:10:55,113 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-12 21:10:55,114 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-12 21:10:55,115 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-12 21:10:55,116 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-12 21:10:55,116 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-12 21:10:55,118 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-12 21:10:55,118 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-12 21:10:55,119 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-12 21:10:55,121 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-12 21:10:55,123 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-12 21:10:55,125 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-12 21:10:55,126 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-12 21:10:55,127 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-12 21:10:55,129 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-12 21:10:55,129 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-12 21:10:55,132 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-12 21:10:55,133 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-12 21:10:55,134 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-12 21:10:55,138 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-12 21:10:55,139 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-12 21:10:55,142 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-12 21:10:55,142 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-12 21:10:55,143 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-12 21:10:55,143 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-12 21:10:55,143 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-12 21:10:55,144 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-12 21:10:55,147 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-12 21:10:55,147 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-12 21:10:55,164 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-12 21:10:55,164 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-12 21:10:55,166 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-12 21:10:55,166 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-12 21:10:55,166 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-12 21:10:55,166 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-12 21:10:55,167 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-12 21:10:55,167 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-12 21:10:55,167 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-12 21:10:55,168 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-12 21:10:55,168 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-12 21:10:55,168 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-12 21:10:55,168 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-12 21:10:55,169 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-12 21:10:55,169 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-12 21:10:55,230 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-12 21:10:55,245 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-12 21:10:55,249 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-12 21:10:55,251 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-12 21:10:55,251 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-12 21:10:55,252 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/sanfoundry_24_false-valid-deref.i_4.bpl [2018-10-12 21:10:55,252 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/sanfoundry_24_false-valid-deref.i_4.bpl' [2018-10-12 21:10:55,310 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-12 21:10:55,312 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-12 21:10:55,312 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-12 21:10:55,312 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-12 21:10:55,313 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-12 21:10:55,340 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "sanfoundry_24_false-valid-deref.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 09:10:55" (1/1) ... [2018-10-12 21:10:55,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "sanfoundry_24_false-valid-deref.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 09:10:55" (1/1) ... [2018-10-12 21:10:55,356 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "sanfoundry_24_false-valid-deref.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 09:10:55" (1/1) ... [2018-10-12 21:10:55,356 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "sanfoundry_24_false-valid-deref.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 09:10:55" (1/1) ... [2018-10-12 21:10:55,360 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "sanfoundry_24_false-valid-deref.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 09:10:55" (1/1) ... [2018-10-12 21:10:55,362 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "sanfoundry_24_false-valid-deref.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 09:10:55" (1/1) ... [2018-10-12 21:10:55,363 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "sanfoundry_24_false-valid-deref.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 09:10:55" (1/1) ... [2018-10-12 21:10:55,365 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-12 21:10:55,366 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-12 21:10:55,367 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-12 21:10:55,367 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-12 21:10:55,368 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "sanfoundry_24_false-valid-deref.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 09:10:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-12 21:10:55,443 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-12 21:10:55,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-12 21:10:55,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-12 21:10:55,957 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-12 21:10:55,958 INFO L202 PluginConnector]: Adding new model sanfoundry_24_false-valid-deref.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:10:55 BoogieIcfgContainer [2018-10-12 21:10:55,958 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-12 21:10:55,960 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-12 21:10:55,960 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-12 21:10:55,963 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-12 21:10:55,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sanfoundry_24_false-valid-deref.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 09:10:55" (1/2) ... [2018-10-12 21:10:55,965 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6afca508 and model type sanfoundry_24_false-valid-deref.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:10:55, skipping insertion in model container [2018-10-12 21:10:55,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sanfoundry_24_false-valid-deref.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:10:55" (2/2) ... [2018-10-12 21:10:55,967 INFO L112 eAbstractionObserver]: Analyzing ICFG sanfoundry_24_false-valid-deref.i_4.bpl [2018-10-12 21:10:55,977 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-12 21:10:55,986 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-12 21:10:56,003 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-12 21:10:56,033 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-12 21:10:56,033 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-12 21:10:56,034 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-12 21:10:56,034 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-12 21:10:56,034 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-12 21:10:56,034 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-12 21:10:56,035 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-12 21:10:56,035 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-12 21:10:56,035 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-12 21:10:56,052 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-10-12 21:10:56,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-12 21:10:56,063 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:10:56,064 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] [2018-10-12 21:10:56,069 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:10:56,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:10:56,076 INFO L82 PathProgramCache]: Analyzing trace with hash -974922535, now seen corresponding path program 1 times [2018-10-12 21:10:56,123 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:10:56,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:10:56,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:10:56,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-12 21:10:56,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-12 21:10:56,496 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-12 21:10:56,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-12 21:10:56,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-10-12 21:10:56,516 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 8 states. [2018-10-12 21:10:56,825 WARN L178 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-12 21:10:57,173 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-10-12 21:10:57,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:10:57,228 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-10-12 21:10:57,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-12 21:10:57,230 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-10-12 21:10:57,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:10:57,245 INFO L225 Difference]: With dead ends: 52 [2018-10-12 21:10:57,246 INFO L226 Difference]: Without dead ends: 52 [2018-10-12 21:10:57,256 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2018-10-12 21:10:57,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-10-12 21:10:57,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 40. [2018-10-12 21:10:57,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-12 21:10:57,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-10-12 21:10:57,307 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 25 [2018-10-12 21:10:57,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:10:57,307 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-10-12 21:10:57,307 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-12 21:10:57,308 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-10-12 21:10:57,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-12 21:10:57,309 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:10:57,310 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:10:57,310 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:10:57,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:10:57,311 INFO L82 PathProgramCache]: Analyzing trace with hash 759825485, now seen corresponding path program 1 times [2018-10-12 21:10:57,312 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:10:57,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:10:57,638 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:10:57,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:10:57,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-12 21:10:57,641 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-12 21:10:57,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-12 21:10:57,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-10-12 21:10:57,642 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 10 states. [2018-10-12 21:10:58,014 WARN L178 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-12 21:10:58,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:10:58,623 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-10-12 21:10:58,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-12 21:10:58,625 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-10-12 21:10:58,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:10:58,627 INFO L225 Difference]: With dead ends: 66 [2018-10-12 21:10:58,628 INFO L226 Difference]: Without dead ends: 66 [2018-10-12 21:10:58,629 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2018-10-12 21:10:58,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-10-12 21:10:58,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 54. [2018-10-12 21:10:58,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-10-12 21:10:58,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-10-12 21:10:58,637 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 39 [2018-10-12 21:10:58,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:10:58,637 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-10-12 21:10:58,637 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-12 21:10:58,638 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-10-12 21:10:58,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-12 21:10:58,639 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:10:58,640 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-10-12 21:10:58,640 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:10:58,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:10:58,641 INFO L82 PathProgramCache]: Analyzing trace with hash -825487167, now seen corresponding path program 2 times [2018-10-12 21:10:58,642 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:10:58,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:10:59,072 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:10:59,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:10:59,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-12 21:10:59,073 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-12 21:10:59,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-12 21:10:59,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-10-12 21:10:59,074 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 12 states. [2018-10-12 21:11:00,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:11:00,092 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-10-12 21:11:00,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-12 21:11:00,093 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2018-10-12 21:11:00,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:11:00,095 INFO L225 Difference]: With dead ends: 80 [2018-10-12 21:11:00,095 INFO L226 Difference]: Without dead ends: 80 [2018-10-12 21:11:00,096 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2018-10-12 21:11:00,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-10-12 21:11:00,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 68. [2018-10-12 21:11:00,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-10-12 21:11:00,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-10-12 21:11:00,106 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 53 [2018-10-12 21:11:00,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:11:00,106 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-10-12 21:11:00,107 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-12 21:11:00,107 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-10-12 21:11:00,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-12 21:11:00,109 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:11:00,109 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 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] [2018-10-12 21:11:00,109 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:11:00,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:11:00,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1523236299, now seen corresponding path program 3 times [2018-10-12 21:11:00,111 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:11:00,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:11:00,502 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:11:00,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:11:00,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-12 21:11:00,503 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-12 21:11:00,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-12 21:11:00,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-10-12 21:11:00,504 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 14 states. [2018-10-12 21:11:01,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:11:01,261 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-10-12 21:11:01,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-12 21:11:01,262 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2018-10-12 21:11:01,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:11:01,263 INFO L225 Difference]: With dead ends: 94 [2018-10-12 21:11:01,264 INFO L226 Difference]: Without dead ends: 94 [2018-10-12 21:11:01,264 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=168, Invalid=588, Unknown=0, NotChecked=0, Total=756 [2018-10-12 21:11:01,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-10-12 21:11:01,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 82. [2018-10-12 21:11:01,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-10-12 21:11:01,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-10-12 21:11:01,273 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 67 [2018-10-12 21:11:01,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:11:01,273 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-10-12 21:11:01,274 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-12 21:11:01,274 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-10-12 21:11:01,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-10-12 21:11:01,276 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:11:01,276 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 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] [2018-10-12 21:11:01,277 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:11:01,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:11:01,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1184946345, now seen corresponding path program 4 times [2018-10-12 21:11:01,278 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:11:01,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:11:01,757 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:11:01,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:11:01,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-12 21:11:01,758 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-12 21:11:01,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-12 21:11:01,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-10-12 21:11:01,759 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 16 states. [2018-10-12 21:11:02,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:11:02,958 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-10-12 21:11:02,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-12 21:11:02,959 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 81 [2018-10-12 21:11:02,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:11:02,961 INFO L225 Difference]: With dead ends: 108 [2018-10-12 21:11:02,962 INFO L226 Difference]: Without dead ends: 108 [2018-10-12 21:11:02,963 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=205, Invalid=851, Unknown=0, NotChecked=0, Total=1056 [2018-10-12 21:11:02,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-10-12 21:11:02,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 96. [2018-10-12 21:11:02,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-10-12 21:11:02,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-10-12 21:11:02,971 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 81 [2018-10-12 21:11:02,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:11:02,972 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-10-12 21:11:02,972 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-12 21:11:02,972 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-10-12 21:11:02,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-12 21:11:02,974 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:11:02,974 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 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] [2018-10-12 21:11:02,974 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:11:02,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:11:02,975 INFO L82 PathProgramCache]: Analyzing trace with hash -663088099, now seen corresponding path program 5 times [2018-10-12 21:11:02,976 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:11:02,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:11:03,361 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:11:03,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:11:03,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-12 21:11:03,362 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-12 21:11:03,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-12 21:11:03,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2018-10-12 21:11:03,363 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 18 states. [2018-10-12 21:11:05,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:11:05,268 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2018-10-12 21:11:05,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-12 21:11:05,268 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 95 [2018-10-12 21:11:05,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:11:05,270 INFO L225 Difference]: With dead ends: 122 [2018-10-12 21:11:05,270 INFO L226 Difference]: Without dead ends: 122 [2018-10-12 21:11:05,273 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=242, Invalid=1164, Unknown=0, NotChecked=0, Total=1406 [2018-10-12 21:11:05,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-10-12 21:11:05,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 110. [2018-10-12 21:11:05,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-10-12 21:11:05,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-10-12 21:11:05,281 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 95 [2018-10-12 21:11:05,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:11:05,282 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-10-12 21:11:05,282 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-12 21:11:05,282 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-10-12 21:11:05,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-12 21:11:05,284 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:11:05,284 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 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] [2018-10-12 21:11:05,284 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:11:05,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:11:05,285 INFO L82 PathProgramCache]: Analyzing trace with hash 58471569, now seen corresponding path program 6 times [2018-10-12 21:11:05,288 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:11:05,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:11:06,213 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:11:06,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:11:06,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-12 21:11:06,214 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-12 21:11:06,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-12 21:11:06,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2018-10-12 21:11:06,215 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 22 states. [2018-10-12 21:11:08,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:11:08,436 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2018-10-12 21:11:08,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-12 21:11:08,437 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 109 [2018-10-12 21:11:08,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:11:08,438 INFO L225 Difference]: With dead ends: 136 [2018-10-12 21:11:08,438 INFO L226 Difference]: Without dead ends: 136 [2018-10-12 21:11:08,440 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=536, Invalid=1720, Unknown=0, NotChecked=0, Total=2256 [2018-10-12 21:11:08,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-10-12 21:11:08,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 124. [2018-10-12 21:11:08,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-10-12 21:11:08,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2018-10-12 21:11:08,448 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 109 [2018-10-12 21:11:08,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:11:08,448 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2018-10-12 21:11:08,448 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-12 21:11:08,449 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2018-10-12 21:11:08,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-10-12 21:11:08,450 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:11:08,451 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 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] [2018-10-12 21:11:08,451 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:11:08,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:11:08,451 INFO L82 PathProgramCache]: Analyzing trace with hash -407733755, now seen corresponding path program 7 times [2018-10-12 21:11:08,452 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:11:08,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:11:09,187 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 0 proven. 322 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:11:09,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:11:09,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-12 21:11:09,188 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-12 21:11:09,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-12 21:11:09,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2018-10-12 21:11:09,189 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 24 states. [2018-10-12 21:11:10,841 WARN L178 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 39 [2018-10-12 21:11:11,622 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-10-12 21:11:11,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:11:11,719 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2018-10-12 21:11:11,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-12 21:11:11,722 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 123 [2018-10-12 21:11:11,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:11:11,723 INFO L225 Difference]: With dead ends: 150 [2018-10-12 21:11:11,723 INFO L226 Difference]: Without dead ends: 150 [2018-10-12 21:11:11,725 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=681, Invalid=2181, Unknown=0, NotChecked=0, Total=2862 [2018-10-12 21:11:11,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-10-12 21:11:11,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 138. [2018-10-12 21:11:11,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-10-12 21:11:11,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2018-10-12 21:11:11,731 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 123 [2018-10-12 21:11:11,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:11:11,732 INFO L481 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2018-10-12 21:11:11,732 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-12 21:11:11,732 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2018-10-12 21:11:11,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-10-12 21:11:11,734 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:11:11,734 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 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] [2018-10-12 21:11:11,734 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:11:11,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:11:11,735 INFO L82 PathProgramCache]: Analyzing trace with hash 276309113, now seen corresponding path program 8 times [2018-10-12 21:11:11,736 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:11:11,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:11:12,363 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 0 proven. 424 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:11:12,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:11:12,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-12 21:11:12,365 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-12 21:11:12,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-12 21:11:12,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2018-10-12 21:11:12,366 INFO L87 Difference]: Start difference. First operand 138 states and 138 transitions. Second operand 26 states. [2018-10-12 21:11:15,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:11:15,415 INFO L93 Difference]: Finished difference Result 164 states and 164 transitions. [2018-10-12 21:11:15,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-12 21:11:15,416 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 137 [2018-10-12 21:11:15,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:11:15,417 INFO L225 Difference]: With dead ends: 164 [2018-10-12 21:11:15,417 INFO L226 Difference]: Without dead ends: 164 [2018-10-12 21:11:15,419 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 731 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=843, Invalid=2697, Unknown=0, NotChecked=0, Total=3540 [2018-10-12 21:11:15,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-10-12 21:11:15,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 152. [2018-10-12 21:11:15,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-10-12 21:11:15,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2018-10-12 21:11:15,424 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 137 [2018-10-12 21:11:15,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:11:15,425 INFO L481 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2018-10-12 21:11:15,425 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-12 21:11:15,425 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2018-10-12 21:11:15,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-12 21:11:15,430 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:11:15,430 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 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] [2018-10-12 21:11:15,430 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:11:15,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:11:15,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1752724461, now seen corresponding path program 9 times [2018-10-12 21:11:15,432 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:11:15,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:11:16,370 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 0 proven. 540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:11:16,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:11:16,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-12 21:11:16,371 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-12 21:11:16,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-12 21:11:16,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2018-10-12 21:11:16,372 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 28 states. [2018-10-12 21:11:19,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:11:19,855 INFO L93 Difference]: Finished difference Result 178 states and 178 transitions. [2018-10-12 21:11:19,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-12 21:11:19,856 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 151 [2018-10-12 21:11:19,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:11:19,858 INFO L225 Difference]: With dead ends: 178 [2018-10-12 21:11:19,858 INFO L226 Difference]: Without dead ends: 178 [2018-10-12 21:11:19,860 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 914 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1022, Invalid=3268, Unknown=0, NotChecked=0, Total=4290 [2018-10-12 21:11:19,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-10-12 21:11:19,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 166. [2018-10-12 21:11:19,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-10-12 21:11:19,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2018-10-12 21:11:19,865 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 151 [2018-10-12 21:11:19,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:11:19,866 INFO L481 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2018-10-12 21:11:19,866 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-12 21:11:19,866 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2018-10-12 21:11:19,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-10-12 21:11:19,869 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:11:19,869 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 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] [2018-10-12 21:11:19,869 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:11:19,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:11:19,870 INFO L82 PathProgramCache]: Analyzing trace with hash 766421089, now seen corresponding path program 10 times [2018-10-12 21:11:19,870 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:11:19,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:11:20,661 INFO L134 CoverageAnalysis]: Checked inductivity of 670 backedges. 0 proven. 670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:11:20,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:11:20,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-12 21:11:20,663 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-12 21:11:20,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-12 21:11:20,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=742, Unknown=0, NotChecked=0, Total=870 [2018-10-12 21:11:20,663 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 30 states. [2018-10-12 21:11:21,240 WARN L178 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-12 21:11:25,029 WARN L178 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 33 [2018-10-12 21:11:25,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:11:25,636 INFO L93 Difference]: Finished difference Result 192 states and 192 transitions. [2018-10-12 21:11:25,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-12 21:11:25,637 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 165 [2018-10-12 21:11:25,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:11:25,638 INFO L225 Difference]: With dead ends: 192 [2018-10-12 21:11:25,638 INFO L226 Difference]: Without dead ends: 192 [2018-10-12 21:11:25,640 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1118 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1218, Invalid=3894, Unknown=0, NotChecked=0, Total=5112 [2018-10-12 21:11:25,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-10-12 21:11:25,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 180. [2018-10-12 21:11:25,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-10-12 21:11:25,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 180 transitions. [2018-10-12 21:11:25,647 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 180 transitions. Word has length 165 [2018-10-12 21:11:25,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:11:25,648 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 180 transitions. [2018-10-12 21:11:25,648 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-12 21:11:25,648 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 180 transitions. [2018-10-12 21:11:25,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-12 21:11:25,651 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:11:25,651 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 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] [2018-10-12 21:11:25,651 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:11:25,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:11:25,652 INFO L82 PathProgramCache]: Analyzing trace with hash -446299691, now seen corresponding path program 11 times [2018-10-12 21:11:25,653 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:11:25,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:11:26,942 INFO L134 CoverageAnalysis]: Checked inductivity of 814 backedges. 0 proven. 814 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:11:26,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:11:26,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-12 21:11:26,943 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-12 21:11:26,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-12 21:11:26,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=843, Unknown=0, NotChecked=0, Total=992 [2018-10-12 21:11:26,944 INFO L87 Difference]: Start difference. First operand 180 states and 180 transitions. Second operand 32 states. [2018-10-12 21:11:31,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:11:31,425 INFO L93 Difference]: Finished difference Result 206 states and 206 transitions. [2018-10-12 21:11:31,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-12 21:11:31,425 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 179 [2018-10-12 21:11:31,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:11:31,428 INFO L225 Difference]: With dead ends: 206 [2018-10-12 21:11:31,428 INFO L226 Difference]: Without dead ends: 206 [2018-10-12 21:11:31,430 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1343 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1431, Invalid=4575, Unknown=0, NotChecked=0, Total=6006 [2018-10-12 21:11:31,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-10-12 21:11:31,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 194. [2018-10-12 21:11:31,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-10-12 21:11:31,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 194 transitions. [2018-10-12 21:11:31,434 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 194 transitions. Word has length 179 [2018-10-12 21:11:31,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:11:31,435 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 194 transitions. [2018-10-12 21:11:31,435 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-12 21:11:31,435 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 194 transitions. [2018-10-12 21:11:31,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-12 21:11:31,437 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:11:31,437 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 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] [2018-10-12 21:11:31,438 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:11:31,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:11:31,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1345962057, now seen corresponding path program 12 times [2018-10-12 21:11:31,439 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:11:31,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:11:32,717 INFO L134 CoverageAnalysis]: Checked inductivity of 972 backedges. 0 proven. 972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:11:32,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:11:32,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-12 21:11:32,718 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-12 21:11:32,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-12 21:11:32,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=950, Unknown=0, NotChecked=0, Total=1122 [2018-10-12 21:11:32,719 INFO L87 Difference]: Start difference. First operand 194 states and 194 transitions. Second operand 34 states. [2018-10-12 21:11:37,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:11:37,635 INFO L93 Difference]: Finished difference Result 220 states and 220 transitions. [2018-10-12 21:11:37,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-12 21:11:37,637 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 193 [2018-10-12 21:11:37,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:11:37,639 INFO L225 Difference]: With dead ends: 220 [2018-10-12 21:11:37,639 INFO L226 Difference]: Without dead ends: 220 [2018-10-12 21:11:37,642 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1589 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1661, Invalid=5311, Unknown=0, NotChecked=0, Total=6972 [2018-10-12 21:11:37,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-10-12 21:11:37,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 208. [2018-10-12 21:11:37,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-10-12 21:11:37,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 208 transitions. [2018-10-12 21:11:37,646 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 208 transitions. Word has length 193 [2018-10-12 21:11:37,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:11:37,646 INFO L481 AbstractCegarLoop]: Abstraction has 208 states and 208 transitions. [2018-10-12 21:11:37,647 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-12 21:11:37,647 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 208 transitions. [2018-10-12 21:11:37,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-10-12 21:11:37,649 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:11:37,649 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 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] [2018-10-12 21:11:37,649 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:11:37,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:11:37,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1578443709, now seen corresponding path program 13 times [2018-10-12 21:11:37,650 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:11:37,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:11:38,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1144 backedges. 0 proven. 1144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:11:38,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:11:38,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-12 21:11:38,931 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-12 21:11:38,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-12 21:11:38,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=1063, Unknown=0, NotChecked=0, Total=1260 [2018-10-12 21:11:38,932 INFO L87 Difference]: Start difference. First operand 208 states and 208 transitions. Second operand 36 states. [2018-10-12 21:11:44,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:11:44,123 INFO L93 Difference]: Finished difference Result 234 states and 234 transitions. [2018-10-12 21:11:44,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-12 21:11:44,125 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 207 [2018-10-12 21:11:44,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:11:44,128 INFO L225 Difference]: With dead ends: 234 [2018-10-12 21:11:44,128 INFO L226 Difference]: Without dead ends: 234 [2018-10-12 21:11:44,132 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1856 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1908, Invalid=6102, Unknown=0, NotChecked=0, Total=8010 [2018-10-12 21:11:44,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-10-12 21:11:44,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 222. [2018-10-12 21:11:44,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-10-12 21:11:44,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 222 transitions. [2018-10-12 21:11:44,137 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 222 transitions. Word has length 207 [2018-10-12 21:11:44,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:11:44,137 INFO L481 AbstractCegarLoop]: Abstraction has 222 states and 222 transitions. [2018-10-12 21:11:44,137 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-12 21:11:44,137 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 222 transitions. [2018-10-12 21:11:44,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-10-12 21:11:44,139 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:11:44,139 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 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] [2018-10-12 21:11:44,139 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:11:44,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:11:44,140 INFO L82 PathProgramCache]: Analyzing trace with hash 573795377, now seen corresponding path program 14 times [2018-10-12 21:11:44,141 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:11:44,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:11:45,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1330 backedges. 0 proven. 1330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:11:45,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:11:45,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-12 21:11:45,453 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-12 21:11:45,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-12 21:11:45,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=1182, Unknown=0, NotChecked=0, Total=1406 [2018-10-12 21:11:45,454 INFO L87 Difference]: Start difference. First operand 222 states and 222 transitions. Second operand 38 states. [2018-10-12 21:11:49,121 WARN L178 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 40 [2018-10-12 21:11:51,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:11:51,088 INFO L93 Difference]: Finished difference Result 248 states and 248 transitions. [2018-10-12 21:11:51,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-12 21:11:51,089 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 221 [2018-10-12 21:11:51,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:11:51,091 INFO L225 Difference]: With dead ends: 248 [2018-10-12 21:11:51,091 INFO L226 Difference]: Without dead ends: 248 [2018-10-12 21:11:51,096 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2144 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=2172, Invalid=6948, Unknown=0, NotChecked=0, Total=9120 [2018-10-12 21:11:51,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-10-12 21:11:51,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 236. [2018-10-12 21:11:51,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-10-12 21:11:51,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 236 transitions. [2018-10-12 21:11:51,100 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 236 transitions. Word has length 221 [2018-10-12 21:11:51,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:11:51,101 INFO L481 AbstractCegarLoop]: Abstraction has 236 states and 236 transitions. [2018-10-12 21:11:51,101 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-12 21:11:51,101 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 236 transitions. [2018-10-12 21:11:51,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-10-12 21:11:51,102 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:11:51,102 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 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] [2018-10-12 21:11:51,102 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:11:51,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:11:51,102 INFO L82 PathProgramCache]: Analyzing trace with hash -954213979, now seen corresponding path program 15 times [2018-10-12 21:11:51,103 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:11:51,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:11:52,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1530 backedges. 0 proven. 1530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:11:52,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:11:52,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-12 21:11:52,169 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-12 21:11:52,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-12 21:11:52,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=1307, Unknown=0, NotChecked=0, Total=1560 [2018-10-12 21:11:52,170 INFO L87 Difference]: Start difference. First operand 236 states and 236 transitions. Second operand 40 states. [2018-10-12 21:11:58,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:11:58,170 INFO L93 Difference]: Finished difference Result 262 states and 262 transitions. [2018-10-12 21:11:58,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-12 21:11:58,171 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 235 [2018-10-12 21:11:58,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:11:58,173 INFO L225 Difference]: With dead ends: 262 [2018-10-12 21:11:58,173 INFO L226 Difference]: Without dead ends: 262 [2018-10-12 21:11:58,175 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2453 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=2453, Invalid=7849, Unknown=0, NotChecked=0, Total=10302 [2018-10-12 21:11:58,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-10-12 21:11:58,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 250. [2018-10-12 21:11:58,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-10-12 21:11:58,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 250 transitions. [2018-10-12 21:11:58,180 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 250 transitions. Word has length 235 [2018-10-12 21:11:58,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:11:58,180 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 250 transitions. [2018-10-12 21:11:58,181 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-12 21:11:58,181 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 250 transitions. [2018-10-12 21:11:58,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-10-12 21:11:58,182 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:11:58,182 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 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] [2018-10-12 21:11:58,182 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:11:58,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:11:58,183 INFO L82 PathProgramCache]: Analyzing trace with hash -2102023143, now seen corresponding path program 16 times [2018-10-12 21:11:58,184 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:11:58,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:11:58,951 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-12 21:12:00,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1744 backedges. 0 proven. 1744 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:12:00,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:12:00,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-12 21:12:00,614 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-12 21:12:00,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-12 21:12:00,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=1438, Unknown=0, NotChecked=0, Total=1722 [2018-10-12 21:12:00,615 INFO L87 Difference]: Start difference. First operand 250 states and 250 transitions. Second operand 42 states. [2018-10-12 21:12:07,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:12:07,193 INFO L93 Difference]: Finished difference Result 276 states and 276 transitions. [2018-10-12 21:12:07,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-12 21:12:07,193 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 249 [2018-10-12 21:12:07,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:12:07,196 INFO L225 Difference]: With dead ends: 276 [2018-10-12 21:12:07,196 INFO L226 Difference]: Without dead ends: 276 [2018-10-12 21:12:07,197 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2783 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=2751, Invalid=8805, Unknown=0, NotChecked=0, Total=11556 [2018-10-12 21:12:07,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-10-12 21:12:07,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 264. [2018-10-12 21:12:07,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-10-12 21:12:07,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 264 transitions. [2018-10-12 21:12:07,202 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 264 transitions. Word has length 249 [2018-10-12 21:12:07,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:12:07,203 INFO L481 AbstractCegarLoop]: Abstraction has 264 states and 264 transitions. [2018-10-12 21:12:07,203 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-12 21:12:07,203 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 264 transitions. [2018-10-12 21:12:07,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-10-12 21:12:07,205 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:12:07,205 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 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] [2018-10-12 21:12:07,205 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:12:07,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:12:07,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1977605235, now seen corresponding path program 17 times [2018-10-12 21:12:07,206 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:12:07,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:12:08,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1972 backedges. 0 proven. 1972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:12:08,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:12:08,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-12 21:12:08,372 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-12 21:12:08,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-12 21:12:08,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=1575, Unknown=0, NotChecked=0, Total=1892 [2018-10-12 21:12:08,373 INFO L87 Difference]: Start difference. First operand 264 states and 264 transitions. Second operand 44 states. [2018-10-12 21:12:15,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:12:15,301 INFO L93 Difference]: Finished difference Result 290 states and 290 transitions. [2018-10-12 21:12:15,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-12 21:12:15,302 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 263 [2018-10-12 21:12:15,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:12:15,303 INFO L225 Difference]: With dead ends: 290 [2018-10-12 21:12:15,304 INFO L226 Difference]: Without dead ends: 290 [2018-10-12 21:12:15,305 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3134 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=3066, Invalid=9816, Unknown=0, NotChecked=0, Total=12882 [2018-10-12 21:12:15,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-10-12 21:12:15,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 278. [2018-10-12 21:12:15,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-10-12 21:12:15,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 278 transitions. [2018-10-12 21:12:15,310 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 278 transitions. Word has length 263 [2018-10-12 21:12:15,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:12:15,311 INFO L481 AbstractCegarLoop]: Abstraction has 278 states and 278 transitions. [2018-10-12 21:12:15,311 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-12 21:12:15,311 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 278 transitions. [2018-10-12 21:12:15,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-10-12 21:12:15,313 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:12:15,313 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 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] [2018-10-12 21:12:15,313 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:12:15,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:12:15,314 INFO L82 PathProgramCache]: Analyzing trace with hash 98205697, now seen corresponding path program 18 times [2018-10-12 21:12:15,314 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:12:15,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:12:17,042 INFO L134 CoverageAnalysis]: Checked inductivity of 2214 backedges. 0 proven. 2214 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:12:17,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:12:17,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-12 21:12:17,043 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-12 21:12:17,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-12 21:12:17,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=352, Invalid=1718, Unknown=0, NotChecked=0, Total=2070 [2018-10-12 21:12:17,044 INFO L87 Difference]: Start difference. First operand 278 states and 278 transitions. Second operand 46 states. [2018-10-12 21:12:24,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:12:24,846 INFO L93 Difference]: Finished difference Result 304 states and 304 transitions. [2018-10-12 21:12:24,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-12 21:12:24,847 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 277 [2018-10-12 21:12:24,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:12:24,849 INFO L225 Difference]: With dead ends: 304 [2018-10-12 21:12:24,850 INFO L226 Difference]: Without dead ends: 304 [2018-10-12 21:12:24,851 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3506 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=3398, Invalid=10882, Unknown=0, NotChecked=0, Total=14280 [2018-10-12 21:12:24,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-10-12 21:12:24,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 292. [2018-10-12 21:12:24,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-10-12 21:12:24,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 292 transitions. [2018-10-12 21:12:24,856 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 292 transitions. Word has length 277 [2018-10-12 21:12:24,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:12:24,857 INFO L481 AbstractCegarLoop]: Abstraction has 292 states and 292 transitions. [2018-10-12 21:12:24,857 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-12 21:12:24,857 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 292 transitions. [2018-10-12 21:12:24,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2018-10-12 21:12:24,858 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:12:24,859 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 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] [2018-10-12 21:12:24,859 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:12:24,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:12:24,859 INFO L82 PathProgramCache]: Analyzing trace with hash 95420789, now seen corresponding path program 19 times [2018-10-12 21:12:24,860 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:12:24,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:12:26,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2470 backedges. 0 proven. 2470 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:12:26,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:12:26,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-12 21:12:26,499 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-12 21:12:26,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-12 21:12:26,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=389, Invalid=1867, Unknown=0, NotChecked=0, Total=2256 [2018-10-12 21:12:26,500 INFO L87 Difference]: Start difference. First operand 292 states and 292 transitions. Second operand 48 states. [2018-10-12 21:12:34,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:12:34,642 INFO L93 Difference]: Finished difference Result 318 states and 318 transitions. [2018-10-12 21:12:34,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-12 21:12:34,643 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 291 [2018-10-12 21:12:34,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:12:34,644 INFO L225 Difference]: With dead ends: 318 [2018-10-12 21:12:34,644 INFO L226 Difference]: Without dead ends: 318 [2018-10-12 21:12:34,646 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3899 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=3747, Invalid=12003, Unknown=0, NotChecked=0, Total=15750 [2018-10-12 21:12:34,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-10-12 21:12:34,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 306. [2018-10-12 21:12:34,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-10-12 21:12:34,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 306 transitions. [2018-10-12 21:12:34,651 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 306 transitions. Word has length 291 [2018-10-12 21:12:34,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:12:34,651 INFO L481 AbstractCegarLoop]: Abstraction has 306 states and 306 transitions. [2018-10-12 21:12:34,651 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-12 21:12:34,651 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 306 transitions. [2018-10-12 21:12:34,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2018-10-12 21:12:34,653 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:12:34,653 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 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] [2018-10-12 21:12:34,653 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:12:34,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:12:34,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1958471657, now seen corresponding path program 20 times [2018-10-12 21:12:34,654 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:12:34,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:12:36,645 INFO L134 CoverageAnalysis]: Checked inductivity of 2740 backedges. 0 proven. 2740 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:12:36,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:12:36,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-12 21:12:36,645 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-12 21:12:36,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-12 21:12:36,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=428, Invalid=2022, Unknown=0, NotChecked=0, Total=2450 [2018-10-12 21:12:36,646 INFO L87 Difference]: Start difference. First operand 306 states and 306 transitions. Second operand 50 states. [2018-10-12 21:12:45,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:12:45,260 INFO L93 Difference]: Finished difference Result 332 states and 332 transitions. [2018-10-12 21:12:45,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-10-12 21:12:45,261 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 305 [2018-10-12 21:12:45,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:12:45,262 INFO L225 Difference]: With dead ends: 332 [2018-10-12 21:12:45,262 INFO L226 Difference]: Without dead ends: 332 [2018-10-12 21:12:45,263 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4313 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=4113, Invalid=13179, Unknown=0, NotChecked=0, Total=17292 [2018-10-12 21:12:45,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-10-12 21:12:45,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 320. [2018-10-12 21:12:45,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-10-12 21:12:45,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 320 transitions. [2018-10-12 21:12:45,269 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 320 transitions. Word has length 305 [2018-10-12 21:12:45,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:12:45,269 INFO L481 AbstractCegarLoop]: Abstraction has 320 states and 320 transitions. [2018-10-12 21:12:45,269 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-12 21:12:45,269 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 320 transitions. [2018-10-12 21:12:45,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2018-10-12 21:12:45,271 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:12:45,271 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 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] [2018-10-12 21:12:45,271 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:12:45,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:12:45,272 INFO L82 PathProgramCache]: Analyzing trace with hash 225014621, now seen corresponding path program 21 times [2018-10-12 21:12:45,272 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:12:45,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:12:47,207 INFO L134 CoverageAnalysis]: Checked inductivity of 3024 backedges. 0 proven. 3024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:12:47,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:12:47,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-12 21:12:47,208 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-12 21:12:47,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-12 21:12:47,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=469, Invalid=2183, Unknown=0, NotChecked=0, Total=2652 [2018-10-12 21:12:47,209 INFO L87 Difference]: Start difference. First operand 320 states and 320 transitions. Second operand 52 states. [2018-10-12 21:12:56,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:12:56,947 INFO L93 Difference]: Finished difference Result 346 states and 346 transitions. [2018-10-12 21:12:56,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-12 21:12:56,949 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 319 [2018-10-12 21:12:56,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:12:56,950 INFO L225 Difference]: With dead ends: 346 [2018-10-12 21:12:56,950 INFO L226 Difference]: Without dead ends: 346 [2018-10-12 21:12:56,951 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4748 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=4496, Invalid=14410, Unknown=0, NotChecked=0, Total=18906 [2018-10-12 21:12:56,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-10-12 21:12:56,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 334. [2018-10-12 21:12:56,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-10-12 21:12:56,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 334 transitions. [2018-10-12 21:12:56,957 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 334 transitions. Word has length 319 [2018-10-12 21:12:56,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:12:56,957 INFO L481 AbstractCegarLoop]: Abstraction has 334 states and 334 transitions. [2018-10-12 21:12:56,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-12 21:12:56,957 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 334 transitions. [2018-10-12 21:12:56,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-10-12 21:12:56,959 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:12:56,959 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 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] [2018-10-12 21:12:56,959 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:12:56,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:12:56,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1299440593, now seen corresponding path program 22 times [2018-10-12 21:12:56,960 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:12:56,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:12:59,066 INFO L134 CoverageAnalysis]: Checked inductivity of 3322 backedges. 0 proven. 3322 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:12:59,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:12:59,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-12 21:12:59,067 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-12 21:12:59,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-12 21:12:59,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=512, Invalid=2350, Unknown=0, NotChecked=0, Total=2862 [2018-10-12 21:12:59,068 INFO L87 Difference]: Start difference. First operand 334 states and 334 transitions. Second operand 54 states. [2018-10-12 21:13:09,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:13:09,578 INFO L93 Difference]: Finished difference Result 360 states and 360 transitions. [2018-10-12 21:13:09,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-10-12 21:13:09,578 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 333 [2018-10-12 21:13:09,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:13:09,580 INFO L225 Difference]: With dead ends: 360 [2018-10-12 21:13:09,580 INFO L226 Difference]: Without dead ends: 360 [2018-10-12 21:13:09,583 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5204 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=4896, Invalid=15696, Unknown=0, NotChecked=0, Total=20592 [2018-10-12 21:13:09,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2018-10-12 21:13:09,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 348. [2018-10-12 21:13:09,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-10-12 21:13:09,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 348 transitions. [2018-10-12 21:13:09,588 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 348 transitions. Word has length 333 [2018-10-12 21:13:09,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:13:09,589 INFO L481 AbstractCegarLoop]: Abstraction has 348 states and 348 transitions. [2018-10-12 21:13:09,589 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-12 21:13:09,589 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 348 transitions. [2018-10-12 21:13:09,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2018-10-12 21:13:09,591 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:13:09,591 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 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] [2018-10-12 21:13:09,591 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:13:09,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:13:09,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1776712005, now seen corresponding path program 23 times [2018-10-12 21:13:09,592 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:13:09,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:13:12,313 INFO L134 CoverageAnalysis]: Checked inductivity of 3634 backedges. 0 proven. 3634 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:13:12,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:13:12,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-10-12 21:13:12,314 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-12 21:13:12,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-12 21:13:12,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=557, Invalid=2523, Unknown=0, NotChecked=0, Total=3080 [2018-10-12 21:13:12,315 INFO L87 Difference]: Start difference. First operand 348 states and 348 transitions. Second operand 56 states. [2018-10-12 21:13:23,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:13:23,455 INFO L93 Difference]: Finished difference Result 374 states and 374 transitions. [2018-10-12 21:13:23,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-10-12 21:13:23,455 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 347 [2018-10-12 21:13:23,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:13:23,457 INFO L225 Difference]: With dead ends: 374 [2018-10-12 21:13:23,457 INFO L226 Difference]: Without dead ends: 374 [2018-10-12 21:13:23,458 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5681 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=5313, Invalid=17037, Unknown=0, NotChecked=0, Total=22350 [2018-10-12 21:13:23,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2018-10-12 21:13:23,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 362. [2018-10-12 21:13:23,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2018-10-12 21:13:23,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 362 transitions. [2018-10-12 21:13:23,463 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 362 transitions. Word has length 347 [2018-10-12 21:13:23,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:13:23,463 INFO L481 AbstractCegarLoop]: Abstraction has 362 states and 362 transitions. [2018-10-12 21:13:23,464 INFO L482 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-12 21:13:23,464 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 362 transitions. [2018-10-12 21:13:23,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2018-10-12 21:13:23,466 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:13:23,466 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 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] [2018-10-12 21:13:23,466 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:13:23,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:13:23,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1125938105, now seen corresponding path program 24 times [2018-10-12 21:13:23,467 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:13:23,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:13:26,249 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 3960 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:13:26,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:13:26,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-10-12 21:13:26,250 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-12 21:13:26,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-12 21:13:26,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=604, Invalid=2702, Unknown=0, NotChecked=0, Total=3306 [2018-10-12 21:13:26,250 INFO L87 Difference]: Start difference. First operand 362 states and 362 transitions. Second operand 58 states. [2018-10-12 21:13:38,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:13:38,044 INFO L93 Difference]: Finished difference Result 388 states and 388 transitions. [2018-10-12 21:13:38,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-10-12 21:13:38,047 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 361 [2018-10-12 21:13:38,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:13:38,049 INFO L225 Difference]: With dead ends: 388 [2018-10-12 21:13:38,049 INFO L226 Difference]: Without dead ends: 388 [2018-10-12 21:13:38,050 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6179 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=5747, Invalid=18433, Unknown=0, NotChecked=0, Total=24180 [2018-10-12 21:13:38,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-10-12 21:13:38,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 376. [2018-10-12 21:13:38,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-10-12 21:13:38,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 376 transitions. [2018-10-12 21:13:38,056 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 376 transitions. Word has length 361 [2018-10-12 21:13:38,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:13:38,056 INFO L481 AbstractCegarLoop]: Abstraction has 376 states and 376 transitions. [2018-10-12 21:13:38,056 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-12 21:13:38,056 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 376 transitions. [2018-10-12 21:13:38,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2018-10-12 21:13:38,058 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:13:38,059 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 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] [2018-10-12 21:13:38,059 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:13:38,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:13:38,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1489048365, now seen corresponding path program 25 times [2018-10-12 21:13:38,060 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:13:38,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:13:40,622 INFO L134 CoverageAnalysis]: Checked inductivity of 4300 backedges. 0 proven. 4300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:13:40,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:13:40,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-10-12 21:13:40,622 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-12 21:13:40,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-12 21:13:40,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=653, Invalid=2887, Unknown=0, NotChecked=0, Total=3540 [2018-10-12 21:13:40,623 INFO L87 Difference]: Start difference. First operand 376 states and 376 transitions. Second operand 60 states. [2018-10-12 21:13:53,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:13:53,202 INFO L93 Difference]: Finished difference Result 402 states and 402 transitions. [2018-10-12 21:13:53,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-10-12 21:13:53,203 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 375 [2018-10-12 21:13:53,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:13:53,205 INFO L225 Difference]: With dead ends: 402 [2018-10-12 21:13:53,205 INFO L226 Difference]: Without dead ends: 402 [2018-10-12 21:13:53,206 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6698 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=6198, Invalid=19884, Unknown=0, NotChecked=0, Total=26082 [2018-10-12 21:13:53,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-10-12 21:13:53,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 390. [2018-10-12 21:13:53,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2018-10-12 21:13:53,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 390 transitions. [2018-10-12 21:13:53,211 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 390 transitions. Word has length 375 [2018-10-12 21:13:53,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:13:53,212 INFO L481 AbstractCegarLoop]: Abstraction has 390 states and 390 transitions. [2018-10-12 21:13:53,212 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-12 21:13:53,212 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 390 transitions. [2018-10-12 21:13:53,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2018-10-12 21:13:53,214 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:13:53,214 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 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] [2018-10-12 21:13:53,214 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:13:53,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:13:53,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1110468703, now seen corresponding path program 26 times [2018-10-12 21:13:53,215 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:13:53,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:13:55,454 INFO L134 CoverageAnalysis]: Checked inductivity of 4654 backedges. 0 proven. 4654 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:13:55,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:13:55,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-10-12 21:13:55,455 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-12 21:13:55,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-12 21:13:55,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=704, Invalid=3078, Unknown=0, NotChecked=0, Total=3782 [2018-10-12 21:13:55,456 INFO L87 Difference]: Start difference. First operand 390 states and 390 transitions. Second operand 62 states. [2018-10-12 21:14:08,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:14:08,723 INFO L93 Difference]: Finished difference Result 416 states and 416 transitions. [2018-10-12 21:14:08,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-10-12 21:14:08,723 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 389 [2018-10-12 21:14:08,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:14:08,725 INFO L225 Difference]: With dead ends: 416 [2018-10-12 21:14:08,725 INFO L226 Difference]: Without dead ends: 416 [2018-10-12 21:14:08,727 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7238 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=6666, Invalid=21390, Unknown=0, NotChecked=0, Total=28056 [2018-10-12 21:14:08,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2018-10-12 21:14:08,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 404. [2018-10-12 21:14:08,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2018-10-12 21:14:08,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 404 transitions. [2018-10-12 21:14:08,732 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 404 transitions. Word has length 389 [2018-10-12 21:14:08,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:14:08,732 INFO L481 AbstractCegarLoop]: Abstraction has 404 states and 404 transitions. [2018-10-12 21:14:08,732 INFO L482 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-12 21:14:08,732 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 404 transitions. [2018-10-12 21:14:08,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2018-10-12 21:14:08,735 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:14:08,735 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 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] [2018-10-12 21:14:08,735 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:14:08,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:14:08,736 INFO L82 PathProgramCache]: Analyzing trace with hash 210977045, now seen corresponding path program 27 times [2018-10-12 21:14:08,736 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:14:08,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:14:11,003 INFO L134 CoverageAnalysis]: Checked inductivity of 5022 backedges. 0 proven. 5022 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:14:11,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:14:11,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-10-12 21:14:11,004 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-12 21:14:11,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-12 21:14:11,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=757, Invalid=3275, Unknown=0, NotChecked=0, Total=4032 [2018-10-12 21:14:11,004 INFO L87 Difference]: Start difference. First operand 404 states and 404 transitions. Second operand 64 states. [2018-10-12 21:14:25,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:14:25,281 INFO L93 Difference]: Finished difference Result 430 states and 430 transitions. [2018-10-12 21:14:25,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-10-12 21:14:25,283 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 403 [2018-10-12 21:14:25,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:14:25,285 INFO L225 Difference]: With dead ends: 430 [2018-10-12 21:14:25,285 INFO L226 Difference]: Without dead ends: 430 [2018-10-12 21:14:25,286 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7799 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=7151, Invalid=22951, Unknown=0, NotChecked=0, Total=30102 [2018-10-12 21:14:25,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2018-10-12 21:14:25,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 418. [2018-10-12 21:14:25,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2018-10-12 21:14:25,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 418 transitions. [2018-10-12 21:14:25,291 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 418 transitions. Word has length 403 [2018-10-12 21:14:25,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:14:25,291 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 418 transitions. [2018-10-12 21:14:25,291 INFO L482 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-12 21:14:25,291 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 418 transitions. [2018-10-12 21:14:25,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2018-10-12 21:14:25,294 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:14:25,294 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 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] [2018-10-12 21:14:25,294 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:14:25,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:14:25,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1520914313, now seen corresponding path program 28 times [2018-10-12 21:14:25,295 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:14:25,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:14:27,744 INFO L134 CoverageAnalysis]: Checked inductivity of 5404 backedges. 0 proven. 5404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:14:27,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:14:27,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-10-12 21:14:27,745 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-12 21:14:27,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-12 21:14:27,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=812, Invalid=3478, Unknown=0, NotChecked=0, Total=4290 [2018-10-12 21:14:27,745 INFO L87 Difference]: Start difference. First operand 418 states and 418 transitions. Second operand 66 states. [2018-10-12 21:14:42,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:14:42,794 INFO L93 Difference]: Finished difference Result 444 states and 444 transitions. [2018-10-12 21:14:42,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-10-12 21:14:42,795 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 417 [2018-10-12 21:14:42,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:14:42,797 INFO L225 Difference]: With dead ends: 444 [2018-10-12 21:14:42,797 INFO L226 Difference]: Without dead ends: 444 [2018-10-12 21:14:42,799 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8381 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=7653, Invalid=24567, Unknown=0, NotChecked=0, Total=32220 [2018-10-12 21:14:42,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2018-10-12 21:14:42,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 432. [2018-10-12 21:14:42,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2018-10-12 21:14:42,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 432 transitions. [2018-10-12 21:14:42,804 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 432 transitions. Word has length 417 [2018-10-12 21:14:42,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:14:42,804 INFO L481 AbstractCegarLoop]: Abstraction has 432 states and 432 transitions. [2018-10-12 21:14:42,805 INFO L482 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-12 21:14:42,805 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 432 transitions. [2018-10-12 21:14:42,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2018-10-12 21:14:42,807 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:14:42,807 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 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] [2018-10-12 21:14:42,808 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:14:42,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:14:42,808 INFO L82 PathProgramCache]: Analyzing trace with hash 754385661, now seen corresponding path program 29 times [2018-10-12 21:14:42,809 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:14:42,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:14:45,901 INFO L134 CoverageAnalysis]: Checked inductivity of 5800 backedges. 0 proven. 5800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:14:45,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:14:45,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-10-12 21:14:45,902 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-12 21:14:45,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-12 21:14:45,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=869, Invalid=3687, Unknown=0, NotChecked=0, Total=4556 [2018-10-12 21:14:45,902 INFO L87 Difference]: Start difference. First operand 432 states and 432 transitions. Second operand 68 states. [2018-10-12 21:15:01,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:15:01,390 INFO L93 Difference]: Finished difference Result 458 states and 458 transitions. [2018-10-12 21:15:01,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-10-12 21:15:01,391 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 431 [2018-10-12 21:15:01,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:15:01,393 INFO L225 Difference]: With dead ends: 458 [2018-10-12 21:15:01,393 INFO L226 Difference]: Without dead ends: 458 [2018-10-12 21:15:01,395 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8984 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=8172, Invalid=26238, Unknown=0, NotChecked=0, Total=34410 [2018-10-12 21:15:01,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2018-10-12 21:15:01,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 446. [2018-10-12 21:15:01,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2018-10-12 21:15:01,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 446 transitions. [2018-10-12 21:15:01,399 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 446 transitions. Word has length 431 [2018-10-12 21:15:01,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:15:01,400 INFO L481 AbstractCegarLoop]: Abstraction has 446 states and 446 transitions. [2018-10-12 21:15:01,400 INFO L482 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-12 21:15:01,400 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 446 transitions. [2018-10-12 21:15:01,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2018-10-12 21:15:01,402 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:15:01,403 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 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] [2018-10-12 21:15:01,403 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:15:01,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:15:01,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1807588209, now seen corresponding path program 30 times [2018-10-12 21:15:01,404 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:15:01,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:15:04,514 INFO L134 CoverageAnalysis]: Checked inductivity of 6210 backedges. 0 proven. 6210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:15:04,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:15:04,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-10-12 21:15:04,515 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-12 21:15:04,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-12 21:15:04,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=928, Invalid=3902, Unknown=0, NotChecked=0, Total=4830 [2018-10-12 21:15:04,516 INFO L87 Difference]: Start difference. First operand 446 states and 446 transitions. Second operand 70 states. [2018-10-12 21:15:21,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:15:21,004 INFO L93 Difference]: Finished difference Result 472 states and 472 transitions. [2018-10-12 21:15:21,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-10-12 21:15:21,005 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 445 [2018-10-12 21:15:21,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:15:21,006 INFO L225 Difference]: With dead ends: 472 [2018-10-12 21:15:21,006 INFO L226 Difference]: Without dead ends: 472 [2018-10-12 21:15:21,007 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9608 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=8708, Invalid=27964, Unknown=0, NotChecked=0, Total=36672 [2018-10-12 21:15:21,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2018-10-12 21:15:21,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 460. [2018-10-12 21:15:21,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-10-12 21:15:21,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 460 transitions. [2018-10-12 21:15:21,012 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 460 transitions. Word has length 445 [2018-10-12 21:15:21,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:15:21,013 INFO L481 AbstractCegarLoop]: Abstraction has 460 states and 460 transitions. [2018-10-12 21:15:21,013 INFO L482 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-12 21:15:21,013 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 460 transitions. [2018-10-12 21:15:21,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2018-10-12 21:15:21,016 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:15:21,016 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 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] [2018-10-12 21:15:21,016 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:15:21,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:15:21,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1451645157, now seen corresponding path program 31 times [2018-10-12 21:15:21,017 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:15:21,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:15:24,776 INFO L134 CoverageAnalysis]: Checked inductivity of 6634 backedges. 0 proven. 6634 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:15:24,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:15:24,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-10-12 21:15:24,777 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-12 21:15:24,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-12 21:15:24,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=989, Invalid=4123, Unknown=0, NotChecked=0, Total=5112 [2018-10-12 21:15:24,778 INFO L87 Difference]: Start difference. First operand 460 states and 460 transitions. Second operand 72 states. [2018-10-12 21:15:42,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:15:42,700 INFO L93 Difference]: Finished difference Result 486 states and 486 transitions. [2018-10-12 21:15:42,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-10-12 21:15:42,701 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 459 [2018-10-12 21:15:42,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:15:42,702 INFO L225 Difference]: With dead ends: 486 [2018-10-12 21:15:42,703 INFO L226 Difference]: Without dead ends: 486 [2018-10-12 21:15:42,704 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10253 ImplicationChecksByTransitivity, 18.7s TimeCoverageRelationStatistics Valid=9261, Invalid=29745, Unknown=0, NotChecked=0, Total=39006 [2018-10-12 21:15:42,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2018-10-12 21:15:42,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 474. [2018-10-12 21:15:42,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2018-10-12 21:15:42,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 474 transitions. [2018-10-12 21:15:42,709 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 474 transitions. Word has length 459 [2018-10-12 21:15:42,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:15:42,709 INFO L481 AbstractCegarLoop]: Abstraction has 474 states and 474 transitions. [2018-10-12 21:15:42,709 INFO L482 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-12 21:15:42,709 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 474 transitions. [2018-10-12 21:15:42,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2018-10-12 21:15:42,711 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:15:42,711 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 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] [2018-10-12 21:15:42,711 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:15:42,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:15:42,712 INFO L82 PathProgramCache]: Analyzing trace with hash 2016181081, now seen corresponding path program 32 times [2018-10-12 21:15:42,712 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:15:42,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:15:46,499 INFO L134 CoverageAnalysis]: Checked inductivity of 7072 backedges. 0 proven. 7072 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:15:46,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:15:46,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-10-12 21:15:46,500 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-10-12 21:15:46,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-10-12 21:15:46,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1052, Invalid=4350, Unknown=0, NotChecked=0, Total=5402 [2018-10-12 21:15:46,501 INFO L87 Difference]: Start difference. First operand 474 states and 474 transitions. Second operand 74 states. [2018-10-12 21:16:05,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:16:05,342 INFO L93 Difference]: Finished difference Result 500 states and 500 transitions. [2018-10-12 21:16:05,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-10-12 21:16:05,342 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 473 [2018-10-12 21:16:05,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:16:05,344 INFO L225 Difference]: With dead ends: 500 [2018-10-12 21:16:05,344 INFO L226 Difference]: Without dead ends: 500 [2018-10-12 21:16:05,346 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10919 ImplicationChecksByTransitivity, 19.7s TimeCoverageRelationStatistics Valid=9831, Invalid=31581, Unknown=0, NotChecked=0, Total=41412 [2018-10-12 21:16:05,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2018-10-12 21:16:05,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 488. [2018-10-12 21:16:05,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2018-10-12 21:16:05,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 488 transitions. [2018-10-12 21:16:05,351 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 488 transitions. Word has length 473 [2018-10-12 21:16:05,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:16:05,352 INFO L481 AbstractCegarLoop]: Abstraction has 488 states and 488 transitions. [2018-10-12 21:16:05,352 INFO L482 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-10-12 21:16:05,352 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 488 transitions. [2018-10-12 21:16:05,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2018-10-12 21:16:05,355 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:16:05,355 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 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] [2018-10-12 21:16:05,355 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:16:05,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:16:05,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1696906547, now seen corresponding path program 33 times [2018-10-12 21:16:05,356 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:16:05,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:16:08,803 INFO L134 CoverageAnalysis]: Checked inductivity of 7524 backedges. 0 proven. 7524 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:16:08,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:16:08,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-10-12 21:16:08,804 INFO L460 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-10-12 21:16:08,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-10-12 21:16:08,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1117, Invalid=4583, Unknown=0, NotChecked=0, Total=5700 [2018-10-12 21:16:08,805 INFO L87 Difference]: Start difference. First operand 488 states and 488 transitions. Second operand 76 states. [2018-10-12 21:16:28,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:16:28,588 INFO L93 Difference]: Finished difference Result 514 states and 514 transitions. [2018-10-12 21:16:28,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-10-12 21:16:28,588 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 487 [2018-10-12 21:16:28,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:16:28,590 INFO L225 Difference]: With dead ends: 514 [2018-10-12 21:16:28,590 INFO L226 Difference]: Without dead ends: 514 [2018-10-12 21:16:28,591 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11606 ImplicationChecksByTransitivity, 20.1s TimeCoverageRelationStatistics Valid=10418, Invalid=33472, Unknown=0, NotChecked=0, Total=43890 [2018-10-12 21:16:28,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2018-10-12 21:16:28,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 502. [2018-10-12 21:16:28,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2018-10-12 21:16:28,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 502 transitions. [2018-10-12 21:16:28,596 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 502 transitions. Word has length 487 [2018-10-12 21:16:28,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:16:28,597 INFO L481 AbstractCegarLoop]: Abstraction has 502 states and 502 transitions. [2018-10-12 21:16:28,597 INFO L482 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-10-12 21:16:28,597 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 502 transitions. [2018-10-12 21:16:28,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2018-10-12 21:16:28,600 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:16:28,600 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 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] [2018-10-12 21:16:28,600 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:16:28,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:16:28,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1139937471, now seen corresponding path program 34 times [2018-10-12 21:16:28,601 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:16:28,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:16:32,161 INFO L134 CoverageAnalysis]: Checked inductivity of 7990 backedges. 0 proven. 7990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:16:32,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:16:32,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-10-12 21:16:32,163 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-12 21:16:32,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-12 21:16:32,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1184, Invalid=4822, Unknown=0, NotChecked=0, Total=6006 [2018-10-12 21:16:32,163 INFO L87 Difference]: Start difference. First operand 502 states and 502 transitions. Second operand 78 states. [2018-10-12 21:16:52,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:16:52,658 INFO L93 Difference]: Finished difference Result 528 states and 528 transitions. [2018-10-12 21:16:52,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2018-10-12 21:16:52,665 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 501 [2018-10-12 21:16:52,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:16:52,666 INFO L225 Difference]: With dead ends: 528 [2018-10-12 21:16:52,667 INFO L226 Difference]: Without dead ends: 528 [2018-10-12 21:16:52,668 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12314 ImplicationChecksByTransitivity, 21.0s TimeCoverageRelationStatistics Valid=11022, Invalid=35418, Unknown=0, NotChecked=0, Total=46440 [2018-10-12 21:16:52,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2018-10-12 21:16:52,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 516. [2018-10-12 21:16:52,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2018-10-12 21:16:52,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 516 transitions. [2018-10-12 21:16:52,672 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 516 transitions. Word has length 501 [2018-10-12 21:16:52,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:16:52,673 INFO L481 AbstractCegarLoop]: Abstraction has 516 states and 516 transitions. [2018-10-12 21:16:52,673 INFO L482 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-12 21:16:52,673 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 516 transitions. [2018-10-12 21:16:52,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 516 [2018-10-12 21:16:52,676 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:16:52,676 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 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] [2018-10-12 21:16:52,676 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:16:52,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:16:52,677 INFO L82 PathProgramCache]: Analyzing trace with hash 9420981, now seen corresponding path program 35 times [2018-10-12 21:16:52,677 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:16:52,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:16:56,217 INFO L134 CoverageAnalysis]: Checked inductivity of 8470 backedges. 0 proven. 8470 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:16:56,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:16:56,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-10-12 21:16:56,218 INFO L460 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-10-12 21:16:56,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-10-12 21:16:56,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1253, Invalid=5067, Unknown=0, NotChecked=0, Total=6320 [2018-10-12 21:16:56,219 INFO L87 Difference]: Start difference. First operand 516 states and 516 transitions. Second operand 80 states. [2018-10-12 21:17:16,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:17:16,784 INFO L93 Difference]: Finished difference Result 542 states and 542 transitions. [2018-10-12 21:17:16,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-10-12 21:17:16,785 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 515 [2018-10-12 21:17:16,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:17:16,787 INFO L225 Difference]: With dead ends: 542 [2018-10-12 21:17:16,787 INFO L226 Difference]: Without dead ends: 542 [2018-10-12 21:17:16,789 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13043 ImplicationChecksByTransitivity, 20.9s TimeCoverageRelationStatistics Valid=11643, Invalid=37419, Unknown=0, NotChecked=0, Total=49062 [2018-10-12 21:17:16,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2018-10-12 21:17:16,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 530. [2018-10-12 21:17:16,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2018-10-12 21:17:16,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 530 transitions. [2018-10-12 21:17:16,793 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 530 transitions. Word has length 515 [2018-10-12 21:17:16,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:17:16,793 INFO L481 AbstractCegarLoop]: Abstraction has 530 states and 530 transitions. [2018-10-12 21:17:16,793 INFO L482 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-10-12 21:17:16,793 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 530 transitions. [2018-10-12 21:17:16,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2018-10-12 21:17:16,796 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:17:16,797 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 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] [2018-10-12 21:17:16,797 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:17:16,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:17:16,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1468270807, now seen corresponding path program 36 times [2018-10-12 21:17:16,798 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:17:16,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:17:20,790 INFO L134 CoverageAnalysis]: Checked inductivity of 8964 backedges. 0 proven. 8964 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:17:20,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:17:20,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-10-12 21:17:20,791 INFO L460 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-10-12 21:17:20,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-10-12 21:17:20,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1324, Invalid=5318, Unknown=0, NotChecked=0, Total=6642 [2018-10-12 21:17:20,792 INFO L87 Difference]: Start difference. First operand 530 states and 530 transitions. Second operand 82 states. [2018-10-12 21:17:41,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:17:41,897 INFO L93 Difference]: Finished difference Result 556 states and 556 transitions. [2018-10-12 21:17:41,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-10-12 21:17:41,897 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 529 [2018-10-12 21:17:41,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:17:41,899 INFO L225 Difference]: With dead ends: 556 [2018-10-12 21:17:41,899 INFO L226 Difference]: Without dead ends: 556 [2018-10-12 21:17:41,900 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13793 ImplicationChecksByTransitivity, 21.9s TimeCoverageRelationStatistics Valid=12281, Invalid=39475, Unknown=0, NotChecked=0, Total=51756 [2018-10-12 21:17:41,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2018-10-12 21:17:41,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 544. [2018-10-12 21:17:41,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2018-10-12 21:17:41,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 544 transitions. [2018-10-12 21:17:41,905 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 544 transitions. Word has length 529 [2018-10-12 21:17:41,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:17:41,906 INFO L481 AbstractCegarLoop]: Abstraction has 544 states and 544 transitions. [2018-10-12 21:17:41,906 INFO L482 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-10-12 21:17:41,906 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 544 transitions. [2018-10-12 21:17:41,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 544 [2018-10-12 21:17:41,909 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:17:41,909 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 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] [2018-10-12 21:17:41,910 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:17:41,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:17:41,910 INFO L82 PathProgramCache]: Analyzing trace with hash 54383261, now seen corresponding path program 37 times [2018-10-12 21:17:41,911 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:17:42,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:17:45,752 INFO L134 CoverageAnalysis]: Checked inductivity of 9472 backedges. 0 proven. 9472 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:17:45,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:17:45,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-10-12 21:17:45,753 INFO L460 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-10-12 21:17:45,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-10-12 21:17:45,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1397, Invalid=5575, Unknown=0, NotChecked=0, Total=6972 [2018-10-12 21:17:45,754 INFO L87 Difference]: Start difference. First operand 544 states and 544 transitions. Second operand 84 states. [2018-10-12 21:18:07,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:18:07,054 INFO L93 Difference]: Finished difference Result 570 states and 570 transitions. [2018-10-12 21:18:07,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2018-10-12 21:18:07,054 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 543 [2018-10-12 21:18:07,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:18:07,056 INFO L225 Difference]: With dead ends: 570 [2018-10-12 21:18:07,056 INFO L226 Difference]: Without dead ends: 570 [2018-10-12 21:18:07,058 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14564 ImplicationChecksByTransitivity, 22.4s TimeCoverageRelationStatistics Valid=12936, Invalid=41586, Unknown=0, NotChecked=0, Total=54522 [2018-10-12 21:18:07,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2018-10-12 21:18:07,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 558. [2018-10-12 21:18:07,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 558 states. [2018-10-12 21:18:07,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 558 transitions. [2018-10-12 21:18:07,062 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 558 transitions. Word has length 543 [2018-10-12 21:18:07,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:18:07,063 INFO L481 AbstractCegarLoop]: Abstraction has 558 states and 558 transitions. [2018-10-12 21:18:07,063 INFO L482 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-10-12 21:18:07,063 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 558 transitions. [2018-10-12 21:18:07,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 558 [2018-10-12 21:18:07,065 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:18:07,065 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 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] [2018-10-12 21:18:07,065 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:18:07,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:18:07,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1670419217, now seen corresponding path program 38 times [2018-10-12 21:18:07,066 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:18:07,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:18:11,250 INFO L134 CoverageAnalysis]: Checked inductivity of 9994 backedges. 0 proven. 9994 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:18:11,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:18:11,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-10-12 21:18:11,251 INFO L460 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-10-12 21:18:11,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-10-12 21:18:11,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1472, Invalid=5838, Unknown=0, NotChecked=0, Total=7310 [2018-10-12 21:18:11,251 INFO L87 Difference]: Start difference. First operand 558 states and 558 transitions. Second operand 86 states. [2018-10-12 21:18:33,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:18:33,135 INFO L93 Difference]: Finished difference Result 584 states and 584 transitions. [2018-10-12 21:18:33,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2018-10-12 21:18:33,136 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 557 [2018-10-12 21:18:33,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:18:33,138 INFO L225 Difference]: With dead ends: 584 [2018-10-12 21:18:33,138 INFO L226 Difference]: Without dead ends: 584 [2018-10-12 21:18:33,139 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15356 ImplicationChecksByTransitivity, 23.5s TimeCoverageRelationStatistics Valid=13608, Invalid=43752, Unknown=0, NotChecked=0, Total=57360 [2018-10-12 21:18:33,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2018-10-12 21:18:33,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 572. [2018-10-12 21:18:33,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572 states. [2018-10-12 21:18:33,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 572 transitions. [2018-10-12 21:18:33,145 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 572 transitions. Word has length 557 [2018-10-12 21:18:33,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:18:33,145 INFO L481 AbstractCegarLoop]: Abstraction has 572 states and 572 transitions. [2018-10-12 21:18:33,145 INFO L482 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-10-12 21:18:33,145 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 572 transitions. [2018-10-12 21:18:33,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2018-10-12 21:18:33,149 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:18:33,149 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 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] [2018-10-12 21:18:33,149 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:18:33,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:18:33,150 INFO L82 PathProgramCache]: Analyzing trace with hash 327121029, now seen corresponding path program 39 times [2018-10-12 21:18:33,150 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:18:33,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:18:37,891 INFO L134 CoverageAnalysis]: Checked inductivity of 10530 backedges. 0 proven. 10530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:18:37,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:18:37,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-10-12 21:18:37,892 INFO L460 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-10-12 21:18:37,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-10-12 21:18:37,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1549, Invalid=6107, Unknown=0, NotChecked=0, Total=7656 [2018-10-12 21:18:37,893 INFO L87 Difference]: Start difference. First operand 572 states and 572 transitions. Second operand 88 states. [2018-10-12 21:19:00,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:19:00,979 INFO L93 Difference]: Finished difference Result 598 states and 598 transitions. [2018-10-12 21:19:00,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2018-10-12 21:19:00,979 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 571 [2018-10-12 21:19:00,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:19:00,981 INFO L225 Difference]: With dead ends: 598 [2018-10-12 21:19:00,981 INFO L226 Difference]: Without dead ends: 598 [2018-10-12 21:19:00,983 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16169 ImplicationChecksByTransitivity, 24.9s TimeCoverageRelationStatistics Valid=14297, Invalid=45973, Unknown=0, NotChecked=0, Total=60270 [2018-10-12 21:19:00,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2018-10-12 21:19:00,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 586. [2018-10-12 21:19:00,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2018-10-12 21:19:00,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 586 transitions. [2018-10-12 21:19:00,987 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 586 transitions. Word has length 571 [2018-10-12 21:19:00,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:19:00,987 INFO L481 AbstractCegarLoop]: Abstraction has 586 states and 586 transitions. [2018-10-12 21:19:00,987 INFO L482 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-10-12 21:19:00,987 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 586 transitions. [2018-10-12 21:19:00,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 586 [2018-10-12 21:19:00,990 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:19:00,990 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:19:00,990 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:19:00,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:19:00,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1214628601, now seen corresponding path program 40 times [2018-10-12 21:19:00,991 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:19:01,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:19:05,197 INFO L134 CoverageAnalysis]: Checked inductivity of 11080 backedges. 0 proven. 11080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:19:05,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:19:05,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-10-12 21:19:05,198 INFO L460 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-10-12 21:19:05,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-10-12 21:19:05,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1628, Invalid=6382, Unknown=0, NotChecked=0, Total=8010 [2018-10-12 21:19:05,199 INFO L87 Difference]: Start difference. First operand 586 states and 586 transitions. Second operand 90 states. [2018-10-12 21:19:29,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:19:29,999 INFO L93 Difference]: Finished difference Result 612 states and 612 transitions. [2018-10-12 21:19:29,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2018-10-12 21:19:29,999 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 585 [2018-10-12 21:19:30,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:19:30,001 INFO L225 Difference]: With dead ends: 612 [2018-10-12 21:19:30,002 INFO L226 Difference]: Without dead ends: 612 [2018-10-12 21:19:30,003 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17003 ImplicationChecksByTransitivity, 25.5s TimeCoverageRelationStatistics Valid=15003, Invalid=48249, Unknown=0, NotChecked=0, Total=63252 [2018-10-12 21:19:30,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2018-10-12 21:19:30,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 600. [2018-10-12 21:19:30,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2018-10-12 21:19:30,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 600 transitions. [2018-10-12 21:19:30,007 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 600 transitions. Word has length 585 [2018-10-12 21:19:30,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:19:30,008 INFO L481 AbstractCegarLoop]: Abstraction has 600 states and 600 transitions. [2018-10-12 21:19:30,008 INFO L482 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-10-12 21:19:30,008 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 600 transitions. [2018-10-12 21:19:30,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2018-10-12 21:19:30,011 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:19:30,011 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:19:30,012 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:19:30,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:19:30,012 INFO L82 PathProgramCache]: Analyzing trace with hash 384741997, now seen corresponding path program 41 times [2018-10-12 21:19:30,013 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:19:30,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:19:34,431 INFO L134 CoverageAnalysis]: Checked inductivity of 11644 backedges. 0 proven. 11644 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:19:34,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:19:34,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-10-12 21:19:34,432 INFO L460 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-10-12 21:19:34,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-10-12 21:19:34,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1709, Invalid=6663, Unknown=0, NotChecked=0, Total=8372 [2018-10-12 21:19:34,433 INFO L87 Difference]: Start difference. First operand 600 states and 600 transitions. Second operand 92 states.