java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20181010-MemSafetyPathprograms/standard_strcpy_false-valid-deref_ground.i_8.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-093a8c0 [2018-10-14 16:53:32,219 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-14 16:53:32,221 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-14 16:53:32,233 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-14 16:53:32,233 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-14 16:53:32,234 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-14 16:53:32,235 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-14 16:53:32,237 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-14 16:53:32,239 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-14 16:53:32,240 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-14 16:53:32,240 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-14 16:53:32,241 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-14 16:53:32,242 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-14 16:53:32,243 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-14 16:53:32,244 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-14 16:53:32,244 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-14 16:53:32,245 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-14 16:53:32,247 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-14 16:53:32,249 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-14 16:53:32,251 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-14 16:53:32,254 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-14 16:53:32,255 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-14 16:53:32,262 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-14 16:53:32,262 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-14 16:53:32,262 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-14 16:53:32,263 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-14 16:53:32,265 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-14 16:53:32,266 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-14 16:53:32,267 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-14 16:53:32,268 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-14 16:53:32,270 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-14 16:53:32,271 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-14 16:53:32,271 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-14 16:53:32,272 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-14 16:53:32,273 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-14 16:53:32,275 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-14 16:53:32,275 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-14 16:53:32,291 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-14 16:53:32,291 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-14 16:53:32,294 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-14 16:53:32,295 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-14 16:53:32,295 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-14 16:53:32,295 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-14 16:53:32,296 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-14 16:53:32,296 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-14 16:53:32,296 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-14 16:53:32,296 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-14 16:53:32,297 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-14 16:53:32,297 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-14 16:53:32,297 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-14 16:53:32,298 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-14 16:53:32,299 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-14 16:53:32,354 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-14 16:53:32,365 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-14 16:53:32,370 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-14 16:53:32,372 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-14 16:53:32,373 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-14 16:53:32,376 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/standard_strcpy_false-valid-deref_ground.i_8.bpl [2018-10-14 16:53:32,376 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/standard_strcpy_false-valid-deref_ground.i_8.bpl' [2018-10-14 16:53:32,457 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-14 16:53:32,459 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-14 16:53:32,460 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-14 16:53:32,460 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-14 16:53:32,460 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-14 16:53:32,485 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:53:32" (1/1) ... [2018-10-14 16:53:32,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:53:32" (1/1) ... [2018-10-14 16:53:32,501 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:53:32" (1/1) ... [2018-10-14 16:53:32,501 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:53:32" (1/1) ... [2018-10-14 16:53:32,506 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:53:32" (1/1) ... [2018-10-14 16:53:32,508 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:53:32" (1/1) ... [2018-10-14 16:53:32,509 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:53:32" (1/1) ... [2018-10-14 16:53:32,512 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-14 16:53:32,513 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-14 16:53:32,513 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-14 16:53:32,513 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-14 16:53:32,514 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:53:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-14 16:53:32,592 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-14 16:53:32,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-14 16:53:32,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-14 16:53:33,150 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-14 16:53:33,151 INFO L202 PluginConnector]: Adding new model standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:53:33 BoogieIcfgContainer [2018-10-14 16:53:33,151 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-14 16:53:33,153 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-14 16:53:33,153 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-14 16:53:33,157 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-14 16:53:33,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:53:32" (1/2) ... [2018-10-14 16:53:33,159 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37c2e58a and model type standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:53:33, skipping insertion in model container [2018-10-14 16:53:33,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:53:33" (2/2) ... [2018-10-14 16:53:33,161 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_strcpy_false-valid-deref_ground.i_8.bpl [2018-10-14 16:53:33,172 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-14 16:53:33,183 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-14 16:53:33,203 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-14 16:53:33,240 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-14 16:53:33,240 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-14 16:53:33,241 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-14 16:53:33,241 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-14 16:53:33,241 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-14 16:53:33,241 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-14 16:53:33,241 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-14 16:53:33,242 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-14 16:53:33,242 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-14 16:53:33,264 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2018-10-14 16:53:33,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-14 16:53:33,286 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:53:33,288 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:53:33,289 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:53:33,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:53:33,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1825826060, now seen corresponding path program 1 times [2018-10-14 16:53:33,367 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:53:33,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:53:34,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:53:34,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 16:53:34,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-14 16:53:34,322 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-14 16:53:34,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-14 16:53:34,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-10-14 16:53:34,342 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 12 states. [2018-10-14 16:53:34,627 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-10-14 16:53:35,120 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-10-14 16:53:35,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:53:35,561 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-10-14 16:53:35,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-14 16:53:35,563 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2018-10-14 16:53:35,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:53:35,575 INFO L225 Difference]: With dead ends: 85 [2018-10-14 16:53:35,575 INFO L226 Difference]: Without dead ends: 85 [2018-10-14 16:53:35,578 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=154, Invalid=398, Unknown=0, NotChecked=0, Total=552 [2018-10-14 16:53:35,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-14 16:53:35,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 59. [2018-10-14 16:53:35,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-14 16:53:35,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-10-14 16:53:35,621 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 30 [2018-10-14 16:53:35,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:53:35,622 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-10-14 16:53:35,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-14 16:53:35,623 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-10-14 16:53:35,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-14 16:53:35,625 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:53:35,625 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:53:35,626 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:53:35,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:53:35,626 INFO L82 PathProgramCache]: Analyzing trace with hash -560265094, now seen corresponding path program 1 times [2018-10-14 16:53:35,627 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:53:35,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:53:36,320 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:53:36,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:53:36,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-14 16:53:36,323 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-14 16:53:36,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-14 16:53:36,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-10-14 16:53:36,324 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 15 states. [2018-10-14 16:53:36,661 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-10-14 16:53:37,069 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-10-14 16:53:37,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:53:37,864 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-10-14 16:53:37,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-14 16:53:37,866 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 58 [2018-10-14 16:53:37,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:53:37,868 INFO L225 Difference]: With dead ends: 113 [2018-10-14 16:53:37,868 INFO L226 Difference]: Without dead ends: 113 [2018-10-14 16:53:37,870 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=260, Invalid=670, Unknown=0, NotChecked=0, Total=930 [2018-10-14 16:53:37,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-10-14 16:53:37,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 87. [2018-10-14 16:53:37,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-10-14 16:53:37,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-10-14 16:53:37,882 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 58 [2018-10-14 16:53:37,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:53:37,883 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-10-14 16:53:37,883 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-14 16:53:37,883 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-10-14 16:53:37,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-14 16:53:37,886 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:53:37,887 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:53:37,887 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:53:37,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:53:37,888 INFO L82 PathProgramCache]: Analyzing trace with hash 477354728, now seen corresponding path program 2 times [2018-10-14 16:53:37,891 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:53:37,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:53:38,403 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:53:38,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:53:38,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-14 16:53:38,404 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-14 16:53:38,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-14 16:53:38,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-10-14 16:53:38,405 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 16 states. [2018-10-14 16:53:39,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:53:39,747 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-10-14 16:53:39,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-14 16:53:39,749 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 86 [2018-10-14 16:53:39,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:53:39,751 INFO L225 Difference]: With dead ends: 141 [2018-10-14 16:53:39,753 INFO L226 Difference]: Without dead ends: 141 [2018-10-14 16:53:39,755 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=284, Invalid=772, Unknown=0, NotChecked=0, Total=1056 [2018-10-14 16:53:39,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-10-14 16:53:39,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 115. [2018-10-14 16:53:39,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-14 16:53:39,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-10-14 16:53:39,767 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 86 [2018-10-14 16:53:39,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:53:39,768 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-10-14 16:53:39,768 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-14 16:53:39,768 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-10-14 16:53:39,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-14 16:53:39,770 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:53:39,770 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:53:39,771 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:53:39,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:53:39,771 INFO L82 PathProgramCache]: Analyzing trace with hash -267264938, now seen corresponding path program 3 times [2018-10-14 16:53:39,772 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:53:39,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:53:40,360 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:53:40,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:53:40,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-14 16:53:40,361 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-14 16:53:40,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-14 16:53:40,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2018-10-14 16:53:40,362 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 17 states. [2018-10-14 16:53:42,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:53:42,162 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2018-10-14 16:53:42,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-14 16:53:42,163 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 114 [2018-10-14 16:53:42,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:53:42,167 INFO L225 Difference]: With dead ends: 169 [2018-10-14 16:53:42,167 INFO L226 Difference]: Without dead ends: 169 [2018-10-14 16:53:42,168 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=308, Invalid=882, Unknown=0, NotChecked=0, Total=1190 [2018-10-14 16:53:42,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-10-14 16:53:42,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 143. [2018-10-14 16:53:42,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-10-14 16:53:42,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-10-14 16:53:42,178 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 114 [2018-10-14 16:53:42,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:53:42,178 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-10-14 16:53:42,179 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-14 16:53:42,179 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-10-14 16:53:42,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-14 16:53:42,181 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:53:42,181 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:53:42,182 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:53:42,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:53:42,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1525189828, now seen corresponding path program 4 times [2018-10-14 16:53:42,183 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:53:42,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:53:42,873 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:53:42,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:53:42,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-14 16:53:42,874 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-14 16:53:42,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-14 16:53:42,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2018-10-14 16:53:42,877 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 18 states. [2018-10-14 16:53:44,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:53:44,609 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2018-10-14 16:53:44,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-14 16:53:44,617 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 142 [2018-10-14 16:53:44,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:53:44,619 INFO L225 Difference]: With dead ends: 197 [2018-10-14 16:53:44,619 INFO L226 Difference]: Without dead ends: 197 [2018-10-14 16:53:44,622 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=332, Invalid=1000, Unknown=0, NotChecked=0, Total=1332 [2018-10-14 16:53:44,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-10-14 16:53:44,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 171. [2018-10-14 16:53:44,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-10-14 16:53:44,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-10-14 16:53:44,633 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 142 [2018-10-14 16:53:44,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:53:44,633 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-10-14 16:53:44,634 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-14 16:53:44,634 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-10-14 16:53:44,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-14 16:53:44,637 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:53:44,648 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:53:44,649 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:53:44,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:53:44,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1982557234, now seen corresponding path program 5 times [2018-10-14 16:53:44,651 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:53:44,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:53:45,681 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:53:45,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:53:45,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-14 16:53:45,682 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-14 16:53:45,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-14 16:53:45,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-10-14 16:53:45,683 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 19 states. [2018-10-14 16:53:47,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:53:47,530 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2018-10-14 16:53:47,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-14 16:53:47,532 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 170 [2018-10-14 16:53:47,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:53:47,533 INFO L225 Difference]: With dead ends: 225 [2018-10-14 16:53:47,533 INFO L226 Difference]: Without dead ends: 225 [2018-10-14 16:53:47,534 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=356, Invalid=1126, Unknown=0, NotChecked=0, Total=1482 [2018-10-14 16:53:47,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-10-14 16:53:47,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 199. [2018-10-14 16:53:47,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-10-14 16:53:47,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2018-10-14 16:53:47,544 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 170 [2018-10-14 16:53:47,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:53:47,545 INFO L481 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2018-10-14 16:53:47,545 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-14 16:53:47,545 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2018-10-14 16:53:47,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-10-14 16:53:47,548 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:53:47,548 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:53:47,549 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:53:47,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:53:47,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1389230752, now seen corresponding path program 6 times [2018-10-14 16:53:47,550 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:53:47,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:53:48,241 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 0 proven. 438 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:53:48,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:53:48,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-14 16:53:48,242 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-14 16:53:48,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-14 16:53:48,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2018-10-14 16:53:48,243 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand 20 states. [2018-10-14 16:53:50,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:53:50,689 INFO L93 Difference]: Finished difference Result 253 states and 253 transitions. [2018-10-14 16:53:50,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-14 16:53:50,689 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 198 [2018-10-14 16:53:50,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:53:50,691 INFO L225 Difference]: With dead ends: 253 [2018-10-14 16:53:50,691 INFO L226 Difference]: Without dead ends: 253 [2018-10-14 16:53:50,692 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=380, Invalid=1260, Unknown=0, NotChecked=0, Total=1640 [2018-10-14 16:53:50,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-10-14 16:53:50,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 227. [2018-10-14 16:53:50,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-10-14 16:53:50,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2018-10-14 16:53:50,701 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 198 [2018-10-14 16:53:50,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:53:50,701 INFO L481 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2018-10-14 16:53:50,701 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-14 16:53:50,701 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2018-10-14 16:53:50,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-10-14 16:53:50,705 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:53:50,705 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:53:50,705 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:53:50,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:53:50,706 INFO L82 PathProgramCache]: Analyzing trace with hash -645679090, now seen corresponding path program 7 times [2018-10-14 16:53:50,706 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:53:50,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:53:51,892 INFO L134 CoverageAnalysis]: Checked inductivity of 609 backedges. 0 proven. 609 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:53:51,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:53:51,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-14 16:53:51,894 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-14 16:53:51,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-14 16:53:51,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2018-10-14 16:53:51,894 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 21 states. [2018-10-14 16:53:54,454 WARN L179 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2018-10-14 16:53:54,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:53:54,905 INFO L93 Difference]: Finished difference Result 281 states and 281 transitions. [2018-10-14 16:53:54,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-14 16:53:54,905 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 226 [2018-10-14 16:53:54,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:53:54,907 INFO L225 Difference]: With dead ends: 281 [2018-10-14 16:53:54,907 INFO L226 Difference]: Without dead ends: 281 [2018-10-14 16:53:54,908 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=404, Invalid=1402, Unknown=0, NotChecked=0, Total=1806 [2018-10-14 16:53:54,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-10-14 16:53:54,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 255. [2018-10-14 16:53:54,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-10-14 16:53:54,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 255 transitions. [2018-10-14 16:53:54,915 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 255 transitions. Word has length 226 [2018-10-14 16:53:54,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:53:54,916 INFO L481 AbstractCegarLoop]: Abstraction has 255 states and 255 transitions. [2018-10-14 16:53:54,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-14 16:53:54,916 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 255 transitions. [2018-10-14 16:53:54,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-10-14 16:53:54,920 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:53:54,920 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:53:54,920 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:53:54,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:53:54,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1430248324, now seen corresponding path program 8 times [2018-10-14 16:53:54,922 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:53:54,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:53:55,885 INFO L134 CoverageAnalysis]: Checked inductivity of 808 backedges. 0 proven. 808 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:53:55,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:53:55,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-14 16:53:55,886 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-14 16:53:55,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-14 16:53:55,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2018-10-14 16:53:55,887 INFO L87 Difference]: Start difference. First operand 255 states and 255 transitions. Second operand 22 states. [2018-10-14 16:53:57,045 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2018-10-14 16:53:58,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:53:58,746 INFO L93 Difference]: Finished difference Result 309 states and 309 transitions. [2018-10-14 16:53:58,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-14 16:53:58,748 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 254 [2018-10-14 16:53:58,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:53:58,752 INFO L225 Difference]: With dead ends: 309 [2018-10-14 16:53:58,752 INFO L226 Difference]: Without dead ends: 309 [2018-10-14 16:53:58,753 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=428, Invalid=1552, Unknown=0, NotChecked=0, Total=1980 [2018-10-14 16:53:58,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-10-14 16:53:58,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 283. [2018-10-14 16:53:58,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-10-14 16:53:58,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 283 transitions. [2018-10-14 16:53:58,768 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 283 transitions. Word has length 254 [2018-10-14 16:53:58,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:53:58,768 INFO L481 AbstractCegarLoop]: Abstraction has 283 states and 283 transitions. [2018-10-14 16:53:58,768 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-14 16:53:58,769 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 283 transitions. [2018-10-14 16:53:58,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-10-14 16:53:58,770 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:53:58,770 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:53:58,771 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:53:58,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:53:58,771 INFO L82 PathProgramCache]: Analyzing trace with hash -21577750, now seen corresponding path program 9 times [2018-10-14 16:53:58,772 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:53:58,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:53:59,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:53:59,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:53:59,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-14 16:53:59,983 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-14 16:53:59,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-14 16:53:59,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2018-10-14 16:53:59,984 INFO L87 Difference]: Start difference. First operand 283 states and 283 transitions. Second operand 23 states. [2018-10-14 16:54:03,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:54:03,106 INFO L93 Difference]: Finished difference Result 337 states and 337 transitions. [2018-10-14 16:54:03,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-14 16:54:03,107 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 282 [2018-10-14 16:54:03,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:54:03,109 INFO L225 Difference]: With dead ends: 337 [2018-10-14 16:54:03,109 INFO L226 Difference]: Without dead ends: 337 [2018-10-14 16:54:03,111 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=452, Invalid=1710, Unknown=0, NotChecked=0, Total=2162 [2018-10-14 16:54:03,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-10-14 16:54:03,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 311. [2018-10-14 16:54:03,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-10-14 16:54:03,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 311 transitions. [2018-10-14 16:54:03,116 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 311 transitions. Word has length 282 [2018-10-14 16:54:03,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:54:03,117 INFO L481 AbstractCegarLoop]: Abstraction has 311 states and 311 transitions. [2018-10-14 16:54:03,117 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-14 16:54:03,117 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 311 transitions. [2018-10-14 16:54:03,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-10-14 16:54:03,119 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:54:03,119 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:54:03,120 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:54:03,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:54:03,120 INFO L82 PathProgramCache]: Analyzing trace with hash -2057631144, now seen corresponding path program 10 times [2018-10-14 16:54:03,121 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:54:03,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:54:04,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1290 backedges. 0 proven. 1290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:54:04,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:54:04,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-14 16:54:04,399 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-14 16:54:04,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-14 16:54:04,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2018-10-14 16:54:04,400 INFO L87 Difference]: Start difference. First operand 311 states and 311 transitions. Second operand 24 states. [2018-10-14 16:54:07,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:54:07,855 INFO L93 Difference]: Finished difference Result 365 states and 365 transitions. [2018-10-14 16:54:07,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-14 16:54:07,856 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 310 [2018-10-14 16:54:07,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:54:07,859 INFO L225 Difference]: With dead ends: 365 [2018-10-14 16:54:07,859 INFO L226 Difference]: Without dead ends: 365 [2018-10-14 16:54:07,861 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=476, Invalid=1876, Unknown=0, NotChecked=0, Total=2352 [2018-10-14 16:54:07,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-10-14 16:54:07,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 339. [2018-10-14 16:54:07,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-10-14 16:54:07,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 339 transitions. [2018-10-14 16:54:07,867 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 339 transitions. Word has length 310 [2018-10-14 16:54:07,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:54:07,868 INFO L481 AbstractCegarLoop]: Abstraction has 339 states and 339 transitions. [2018-10-14 16:54:07,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-14 16:54:07,868 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 339 transitions. [2018-10-14 16:54:07,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2018-10-14 16:54:07,870 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:54:07,871 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:54:07,871 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:54:07,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:54:07,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1180730310, now seen corresponding path program 11 times [2018-10-14 16:54:07,872 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:54:07,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:54:09,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1573 backedges. 0 proven. 1573 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:54:09,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:54:09,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-14 16:54:09,115 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-14 16:54:09,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-14 16:54:09,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2018-10-14 16:54:09,115 INFO L87 Difference]: Start difference. First operand 339 states and 339 transitions. Second operand 25 states. [2018-10-14 16:54:13,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:54:13,193 INFO L93 Difference]: Finished difference Result 393 states and 393 transitions. [2018-10-14 16:54:13,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-14 16:54:13,194 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 338 [2018-10-14 16:54:13,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:54:13,196 INFO L225 Difference]: With dead ends: 393 [2018-10-14 16:54:13,196 INFO L226 Difference]: Without dead ends: 393 [2018-10-14 16:54:13,197 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=500, Invalid=2050, Unknown=0, NotChecked=0, Total=2550 [2018-10-14 16:54:13,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-10-14 16:54:13,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 367. [2018-10-14 16:54:13,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-10-14 16:54:13,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 367 transitions. [2018-10-14 16:54:13,204 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 367 transitions. Word has length 338 [2018-10-14 16:54:13,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:54:13,205 INFO L481 AbstractCegarLoop]: Abstraction has 367 states and 367 transitions. [2018-10-14 16:54:13,205 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-14 16:54:13,205 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 367 transitions. [2018-10-14 16:54:13,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2018-10-14 16:54:13,207 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:54:13,208 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:54:13,208 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:54:13,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:54:13,208 INFO L82 PathProgramCache]: Analyzing trace with hash -2126861260, now seen corresponding path program 12 times [2018-10-14 16:54:13,209 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:54:13,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:54:14,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1884 backedges. 0 proven. 1884 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:54:14,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:54:14,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-14 16:54:14,419 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-14 16:54:14,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-14 16:54:14,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2018-10-14 16:54:14,420 INFO L87 Difference]: Start difference. First operand 367 states and 367 transitions. Second operand 26 states. [2018-10-14 16:54:19,878 WARN L179 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2018-10-14 16:54:20,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:54:20,225 INFO L93 Difference]: Finished difference Result 421 states and 421 transitions. [2018-10-14 16:54:20,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-14 16:54:20,227 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 366 [2018-10-14 16:54:20,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:54:20,229 INFO L225 Difference]: With dead ends: 421 [2018-10-14 16:54:20,229 INFO L226 Difference]: Without dead ends: 421 [2018-10-14 16:54:20,231 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=524, Invalid=2232, Unknown=0, NotChecked=0, Total=2756 [2018-10-14 16:54:20,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2018-10-14 16:54:20,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 395. [2018-10-14 16:54:20,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-10-14 16:54:20,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 395 transitions. [2018-10-14 16:54:20,237 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 395 transitions. Word has length 366 [2018-10-14 16:54:20,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:54:20,238 INFO L481 AbstractCegarLoop]: Abstraction has 395 states and 395 transitions. [2018-10-14 16:54:20,238 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-14 16:54:20,238 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 395 transitions. [2018-10-14 16:54:20,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2018-10-14 16:54:20,240 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:54:20,241 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:54:20,241 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:54:20,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:54:20,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1927478366, now seen corresponding path program 13 times [2018-10-14 16:54:20,242 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:54:20,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:54:22,558 INFO L134 CoverageAnalysis]: Checked inductivity of 2223 backedges. 0 proven. 2223 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:54:22,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:54:22,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-14 16:54:22,559 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-14 16:54:22,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-14 16:54:22,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=628, Unknown=0, NotChecked=0, Total=702 [2018-10-14 16:54:22,560 INFO L87 Difference]: Start difference. First operand 395 states and 395 transitions. Second operand 27 states. [2018-10-14 16:54:27,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:54:27,466 INFO L93 Difference]: Finished difference Result 449 states and 449 transitions. [2018-10-14 16:54:27,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-14 16:54:27,466 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 394 [2018-10-14 16:54:27,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:54:27,468 INFO L225 Difference]: With dead ends: 449 [2018-10-14 16:54:27,468 INFO L226 Difference]: Without dead ends: 449 [2018-10-14 16:54:27,469 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=548, Invalid=2422, Unknown=0, NotChecked=0, Total=2970 [2018-10-14 16:54:27,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-10-14 16:54:27,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 423. [2018-10-14 16:54:27,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-10-14 16:54:27,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 423 transitions. [2018-10-14 16:54:27,476 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 423 transitions. Word has length 394 [2018-10-14 16:54:27,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:54:27,477 INFO L481 AbstractCegarLoop]: Abstraction has 423 states and 423 transitions. [2018-10-14 16:54:27,477 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-14 16:54:27,477 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 423 transitions. [2018-10-14 16:54:27,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2018-10-14 16:54:27,480 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:54:27,480 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:54:27,480 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:54:27,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:54:27,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1191507440, now seen corresponding path program 14 times [2018-10-14 16:54:27,481 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:54:27,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:54:29,444 INFO L134 CoverageAnalysis]: Checked inductivity of 2590 backedges. 0 proven. 2590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:54:29,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:54:29,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-14 16:54:29,445 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-14 16:54:29,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-14 16:54:29,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=679, Unknown=0, NotChecked=0, Total=756 [2018-10-14 16:54:29,446 INFO L87 Difference]: Start difference. First operand 423 states and 423 transitions. Second operand 28 states. [2018-10-14 16:54:35,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:54:35,284 INFO L93 Difference]: Finished difference Result 477 states and 477 transitions. [2018-10-14 16:54:35,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-14 16:54:35,284 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 422 [2018-10-14 16:54:35,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:54:35,287 INFO L225 Difference]: With dead ends: 477 [2018-10-14 16:54:35,287 INFO L226 Difference]: Without dead ends: 477 [2018-10-14 16:54:35,289 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=572, Invalid=2620, Unknown=0, NotChecked=0, Total=3192 [2018-10-14 16:54:35,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2018-10-14 16:54:35,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 451. [2018-10-14 16:54:35,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2018-10-14 16:54:35,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 451 transitions. [2018-10-14 16:54:35,295 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 451 transitions. Word has length 422 [2018-10-14 16:54:35,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:54:35,296 INFO L481 AbstractCegarLoop]: Abstraction has 451 states and 451 transitions. [2018-10-14 16:54:35,296 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-14 16:54:35,296 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 451 transitions. [2018-10-14 16:54:35,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2018-10-14 16:54:35,299 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:54:35,299 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:54:35,300 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:54:35,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:54:35,300 INFO L82 PathProgramCache]: Analyzing trace with hash 730349438, now seen corresponding path program 15 times [2018-10-14 16:54:35,301 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:54:35,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:54:36,817 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-14 16:54:37,588 INFO L134 CoverageAnalysis]: Checked inductivity of 2985 backedges. 0 proven. 2985 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:54:37,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:54:37,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-14 16:54:37,590 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-14 16:54:37,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-14 16:54:37,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=732, Unknown=0, NotChecked=0, Total=812 [2018-10-14 16:54:37,591 INFO L87 Difference]: Start difference. First operand 451 states and 451 transitions. Second operand 29 states. [2018-10-14 16:54:43,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:54:43,921 INFO L93 Difference]: Finished difference Result 505 states and 505 transitions. [2018-10-14 16:54:43,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-14 16:54:43,921 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 450 [2018-10-14 16:54:43,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:54:43,924 INFO L225 Difference]: With dead ends: 505 [2018-10-14 16:54:43,924 INFO L226 Difference]: Without dead ends: 505 [2018-10-14 16:54:43,926 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=596, Invalid=2826, Unknown=0, NotChecked=0, Total=3422 [2018-10-14 16:54:43,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2018-10-14 16:54:43,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 479. [2018-10-14 16:54:43,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2018-10-14 16:54:43,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 479 transitions. [2018-10-14 16:54:43,932 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 479 transitions. Word has length 450 [2018-10-14 16:54:43,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:54:43,933 INFO L481 AbstractCegarLoop]: Abstraction has 479 states and 479 transitions. [2018-10-14 16:54:43,933 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-14 16:54:43,933 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 479 transitions. [2018-10-14 16:54:43,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2018-10-14 16:54:43,936 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:54:43,937 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:54:43,937 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:54:43,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:54:43,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1019730964, now seen corresponding path program 16 times [2018-10-14 16:54:43,938 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:54:43,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:54:46,030 INFO L134 CoverageAnalysis]: Checked inductivity of 3408 backedges. 0 proven. 3408 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:54:46,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:54:46,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-14 16:54:46,031 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-14 16:54:46,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-14 16:54:46,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=787, Unknown=0, NotChecked=0, Total=870 [2018-10-14 16:54:46,032 INFO L87 Difference]: Start difference. First operand 479 states and 479 transitions. Second operand 30 states. [2018-10-14 16:54:53,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:54:53,168 INFO L93 Difference]: Finished difference Result 533 states and 533 transitions. [2018-10-14 16:54:53,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-14 16:54:53,169 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 478 [2018-10-14 16:54:53,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:54:53,172 INFO L225 Difference]: With dead ends: 533 [2018-10-14 16:54:53,173 INFO L226 Difference]: Without dead ends: 533 [2018-10-14 16:54:53,174 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 589 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=620, Invalid=3040, Unknown=0, NotChecked=0, Total=3660 [2018-10-14 16:54:53,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2018-10-14 16:54:53,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 507. [2018-10-14 16:54:53,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2018-10-14 16:54:53,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 507 transitions. [2018-10-14 16:54:53,181 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 507 transitions. Word has length 478 [2018-10-14 16:54:53,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:54:53,182 INFO L481 AbstractCegarLoop]: Abstraction has 507 states and 507 transitions. [2018-10-14 16:54:53,182 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-14 16:54:53,182 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 507 transitions. [2018-10-14 16:54:53,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2018-10-14 16:54:53,186 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:54:53,186 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:54:53,186 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:54:53,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:54:53,187 INFO L82 PathProgramCache]: Analyzing trace with hash -163694758, now seen corresponding path program 17 times [2018-10-14 16:54:53,187 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:54:53,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:54:55,221 INFO L134 CoverageAnalysis]: Checked inductivity of 3859 backedges. 0 proven. 3859 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:54:55,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:54:55,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-14 16:54:55,222 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-14 16:54:55,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-14 16:54:55,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=844, Unknown=0, NotChecked=0, Total=930 [2018-10-14 16:54:55,222 INFO L87 Difference]: Start difference. First operand 507 states and 507 transitions. Second operand 31 states. [2018-10-14 16:54:59,363 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2018-10-14 16:55:02,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:55:02,892 INFO L93 Difference]: Finished difference Result 561 states and 561 transitions. [2018-10-14 16:55:02,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-14 16:55:02,892 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 506 [2018-10-14 16:55:02,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:55:02,895 INFO L225 Difference]: With dead ends: 561 [2018-10-14 16:55:02,895 INFO L226 Difference]: Without dead ends: 561 [2018-10-14 16:55:02,897 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 627 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=644, Invalid=3262, Unknown=0, NotChecked=0, Total=3906 [2018-10-14 16:55:02,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2018-10-14 16:55:02,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 535. [2018-10-14 16:55:02,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2018-10-14 16:55:02,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 535 transitions. [2018-10-14 16:55:02,904 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 535 transitions. Word has length 506 [2018-10-14 16:55:02,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:55:02,905 INFO L481 AbstractCegarLoop]: Abstraction has 535 states and 535 transitions. [2018-10-14 16:55:02,905 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-14 16:55:02,906 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 535 transitions. [2018-10-14 16:55:02,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2018-10-14 16:55:02,909 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:55:02,909 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:55:02,910 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:55:02,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:55:02,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1299318328, now seen corresponding path program 18 times [2018-10-14 16:55:02,911 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:55:02,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:55:05,910 INFO L134 CoverageAnalysis]: Checked inductivity of 4338 backedges. 0 proven. 4338 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:55:05,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:55:05,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-14 16:55:05,911 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-14 16:55:05,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-14 16:55:05,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=903, Unknown=0, NotChecked=0, Total=992 [2018-10-14 16:55:05,913 INFO L87 Difference]: Start difference. First operand 535 states and 535 transitions. Second operand 32 states. [2018-10-14 16:55:13,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:55:13,907 INFO L93 Difference]: Finished difference Result 589 states and 589 transitions. [2018-10-14 16:55:13,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-14 16:55:13,907 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 534 [2018-10-14 16:55:13,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:55:13,910 INFO L225 Difference]: With dead ends: 589 [2018-10-14 16:55:13,910 INFO L226 Difference]: Without dead ends: 589 [2018-10-14 16:55:13,912 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=668, Invalid=3492, Unknown=0, NotChecked=0, Total=4160 [2018-10-14 16:55:13,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2018-10-14 16:55:13,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 563. [2018-10-14 16:55:13,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2018-10-14 16:55:13,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 563 transitions. [2018-10-14 16:55:13,919 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 563 transitions. Word has length 534 [2018-10-14 16:55:13,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:55:13,919 INFO L481 AbstractCegarLoop]: Abstraction has 563 states and 563 transitions. [2018-10-14 16:55:13,919 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-14 16:55:13,919 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 563 transitions. [2018-10-14 16:55:13,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 563 [2018-10-14 16:55:13,923 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:55:13,923 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:55:13,924 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:55:13,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:55:13,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1037757238, now seen corresponding path program 19 times [2018-10-14 16:55:13,925 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:55:13,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:55:16,056 INFO L134 CoverageAnalysis]: Checked inductivity of 4845 backedges. 0 proven. 4845 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:55:16,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:55:16,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-14 16:55:16,057 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-14 16:55:16,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-14 16:55:16,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=964, Unknown=0, NotChecked=0, Total=1056 [2018-10-14 16:55:16,058 INFO L87 Difference]: Start difference. First operand 563 states and 563 transitions. Second operand 33 states. [2018-10-14 16:55:24,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:55:24,518 INFO L93 Difference]: Finished difference Result 617 states and 617 transitions. [2018-10-14 16:55:24,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-14 16:55:24,519 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 562 [2018-10-14 16:55:24,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:55:24,522 INFO L225 Difference]: With dead ends: 617 [2018-10-14 16:55:24,522 INFO L226 Difference]: Without dead ends: 617 [2018-10-14 16:55:24,523 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 702 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=692, Invalid=3730, Unknown=0, NotChecked=0, Total=4422 [2018-10-14 16:55:24,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2018-10-14 16:55:24,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 591. [2018-10-14 16:55:24,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2018-10-14 16:55:24,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 591 transitions. [2018-10-14 16:55:24,530 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 591 transitions. Word has length 562 [2018-10-14 16:55:24,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:55:24,531 INFO L481 AbstractCegarLoop]: Abstraction has 591 states and 591 transitions. [2018-10-14 16:55:24,531 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-14 16:55:24,531 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 591 transitions. [2018-10-14 16:55:24,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 591 [2018-10-14 16:55:24,535 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:55:24,535 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:55:24,536 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:55:24,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:55:24,536 INFO L82 PathProgramCache]: Analyzing trace with hash 362318756, now seen corresponding path program 20 times [2018-10-14 16:55:24,537 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:55:24,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:55:27,728 INFO L134 CoverageAnalysis]: Checked inductivity of 5380 backedges. 0 proven. 5380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:55:27,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:55:27,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-14 16:55:27,729 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-14 16:55:27,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-14 16:55:27,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1027, Unknown=0, NotChecked=0, Total=1122 [2018-10-14 16:55:27,731 INFO L87 Difference]: Start difference. First operand 591 states and 591 transitions. Second operand 34 states. [2018-10-14 16:55:37,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:55:37,137 INFO L93 Difference]: Finished difference Result 645 states and 645 transitions. [2018-10-14 16:55:37,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-14 16:55:37,137 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 590 [2018-10-14 16:55:37,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:55:37,140 INFO L225 Difference]: With dead ends: 645 [2018-10-14 16:55:37,140 INFO L226 Difference]: Without dead ends: 645 [2018-10-14 16:55:37,142 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=716, Invalid=3976, Unknown=0, NotChecked=0, Total=4692 [2018-10-14 16:55:37,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2018-10-14 16:55:37,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 619. [2018-10-14 16:55:37,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 619 states. [2018-10-14 16:55:37,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 619 transitions. [2018-10-14 16:55:37,149 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 619 transitions. Word has length 590 [2018-10-14 16:55:37,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:55:37,150 INFO L481 AbstractCegarLoop]: Abstraction has 619 states and 619 transitions. [2018-10-14 16:55:37,150 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-14 16:55:37,150 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 619 transitions. [2018-10-14 16:55:37,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 619 [2018-10-14 16:55:37,154 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:55:37,155 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:55:37,155 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:55:37,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:55:37,155 INFO L82 PathProgramCache]: Analyzing trace with hash -822453486, now seen corresponding path program 21 times [2018-10-14 16:55:37,156 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:55:37,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:55:39,619 INFO L134 CoverageAnalysis]: Checked inductivity of 5943 backedges. 0 proven. 5943 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:55:39,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:55:39,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-14 16:55:39,620 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-14 16:55:39,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-14 16:55:39,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1092, Unknown=0, NotChecked=0, Total=1190 [2018-10-14 16:55:39,621 INFO L87 Difference]: Start difference. First operand 619 states and 619 transitions. Second operand 35 states. [2018-10-14 16:55:49,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:55:49,538 INFO L93 Difference]: Finished difference Result 673 states and 673 transitions. [2018-10-14 16:55:49,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-14 16:55:49,540 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 618 [2018-10-14 16:55:49,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:55:49,543 INFO L225 Difference]: With dead ends: 673 [2018-10-14 16:55:49,543 INFO L226 Difference]: Without dead ends: 673 [2018-10-14 16:55:49,544 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 785 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=740, Invalid=4230, Unknown=0, NotChecked=0, Total=4970 [2018-10-14 16:55:49,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2018-10-14 16:55:49,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 647. [2018-10-14 16:55:49,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2018-10-14 16:55:49,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 647 transitions. [2018-10-14 16:55:49,552 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 647 transitions. Word has length 618 [2018-10-14 16:55:49,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:55:49,552 INFO L481 AbstractCegarLoop]: Abstraction has 647 states and 647 transitions. [2018-10-14 16:55:49,553 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-14 16:55:49,553 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 647 transitions. [2018-10-14 16:55:49,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 647 [2018-10-14 16:55:49,557 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:55:49,557 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:55:49,558 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:55:49,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:55:49,558 INFO L82 PathProgramCache]: Analyzing trace with hash -151791232, now seen corresponding path program 22 times [2018-10-14 16:55:49,559 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:55:49,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:55:52,556 INFO L134 CoverageAnalysis]: Checked inductivity of 6534 backedges. 0 proven. 6534 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:55:52,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:55:52,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-14 16:55:52,558 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-14 16:55:52,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-14 16:55:52,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1159, Unknown=0, NotChecked=0, Total=1260 [2018-10-14 16:55:52,558 INFO L87 Difference]: Start difference. First operand 647 states and 647 transitions. Second operand 36 states. [2018-10-14 16:56:03,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:56:03,400 INFO L93 Difference]: Finished difference Result 701 states and 701 transitions. [2018-10-14 16:56:03,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-14 16:56:03,400 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 646 [2018-10-14 16:56:03,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:56:03,403 INFO L225 Difference]: With dead ends: 701 [2018-10-14 16:56:03,403 INFO L226 Difference]: Without dead ends: 701 [2018-10-14 16:56:03,403 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 832 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=764, Invalid=4492, Unknown=0, NotChecked=0, Total=5256 [2018-10-14 16:56:03,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2018-10-14 16:56:03,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 675. [2018-10-14 16:56:03,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 675 states. [2018-10-14 16:56:03,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 675 transitions. [2018-10-14 16:56:03,413 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 675 transitions. Word has length 646 [2018-10-14 16:56:03,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:56:03,414 INFO L481 AbstractCegarLoop]: Abstraction has 675 states and 675 transitions. [2018-10-14 16:56:03,414 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-14 16:56:03,414 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 675 transitions. [2018-10-14 16:56:03,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 675 [2018-10-14 16:56:03,419 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:56:03,419 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:56:03,420 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:56:03,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:56:03,420 INFO L82 PathProgramCache]: Analyzing trace with hash -231176466, now seen corresponding path program 23 times [2018-10-14 16:56:03,421 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:56:03,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:56:06,278 INFO L134 CoverageAnalysis]: Checked inductivity of 7153 backedges. 0 proven. 7153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:56:06,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:56:06,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-14 16:56:06,280 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-14 16:56:06,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-14 16:56:06,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1228, Unknown=0, NotChecked=0, Total=1332 [2018-10-14 16:56:06,281 INFO L87 Difference]: Start difference. First operand 675 states and 675 transitions. Second operand 37 states. [2018-10-14 16:56:17,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:56:17,981 INFO L93 Difference]: Finished difference Result 729 states and 729 transitions. [2018-10-14 16:56:17,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-14 16:56:17,982 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 674 [2018-10-14 16:56:17,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:56:17,984 INFO L225 Difference]: With dead ends: 729 [2018-10-14 16:56:17,984 INFO L226 Difference]: Without dead ends: 729 [2018-10-14 16:56:17,985 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 876 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=788, Invalid=4762, Unknown=0, NotChecked=0, Total=5550 [2018-10-14 16:56:17,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2018-10-14 16:56:17,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 703. [2018-10-14 16:56:17,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2018-10-14 16:56:17,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 703 transitions. [2018-10-14 16:56:17,993 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 703 transitions. Word has length 674 [2018-10-14 16:56:17,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:56:17,993 INFO L481 AbstractCegarLoop]: Abstraction has 703 states and 703 transitions. [2018-10-14 16:56:17,993 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-14 16:56:17,994 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 703 transitions. [2018-10-14 16:56:17,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 703 [2018-10-14 16:56:17,999 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:56:17,999 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:56:17,999 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:56:18,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:56:18,000 INFO L82 PathProgramCache]: Analyzing trace with hash -583277732, now seen corresponding path program 24 times [2018-10-14 16:56:18,001 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:56:18,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:56:21,055 INFO L134 CoverageAnalysis]: Checked inductivity of 7800 backedges. 0 proven. 7800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:56:21,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:56:21,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-14 16:56:21,056 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-14 16:56:21,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-14 16:56:21,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1299, Unknown=0, NotChecked=0, Total=1406 [2018-10-14 16:56:21,057 INFO L87 Difference]: Start difference. First operand 703 states and 703 transitions. Second operand 38 states. [2018-10-14 16:56:33,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:56:33,595 INFO L93 Difference]: Finished difference Result 757 states and 757 transitions. [2018-10-14 16:56:33,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-14 16:56:33,595 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 702 [2018-10-14 16:56:33,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:56:33,597 INFO L225 Difference]: With dead ends: 757 [2018-10-14 16:56:33,597 INFO L226 Difference]: Without dead ends: 757 [2018-10-14 16:56:33,598 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 921 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=812, Invalid=5040, Unknown=0, NotChecked=0, Total=5852 [2018-10-14 16:56:33,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2018-10-14 16:56:33,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 731. [2018-10-14 16:56:33,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2018-10-14 16:56:33,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 731 transitions. [2018-10-14 16:56:33,606 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 731 transitions. Word has length 702 [2018-10-14 16:56:33,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:56:33,606 INFO L481 AbstractCegarLoop]: Abstraction has 731 states and 731 transitions. [2018-10-14 16:56:33,606 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-14 16:56:33,607 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 731 transitions. [2018-10-14 16:56:33,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 731 [2018-10-14 16:56:33,612 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:56:33,612 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:56:33,613 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:56:33,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:56:33,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1815178954, now seen corresponding path program 25 times [2018-10-14 16:56:33,614 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:56:33,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:56:36,745 INFO L134 CoverageAnalysis]: Checked inductivity of 8475 backedges. 0 proven. 8475 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:56:36,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:56:36,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-14 16:56:36,746 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-14 16:56:36,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-14 16:56:36,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1372, Unknown=0, NotChecked=0, Total=1482 [2018-10-14 16:56:36,747 INFO L87 Difference]: Start difference. First operand 731 states and 731 transitions. Second operand 39 states. [2018-10-14 16:56:51,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:56:51,165 INFO L93 Difference]: Finished difference Result 785 states and 785 transitions. [2018-10-14 16:56:51,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-14 16:56:51,165 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 730 [2018-10-14 16:56:51,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:56:51,168 INFO L225 Difference]: With dead ends: 785 [2018-10-14 16:56:51,168 INFO L226 Difference]: Without dead ends: 785 [2018-10-14 16:56:51,168 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 967 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=836, Invalid=5326, Unknown=0, NotChecked=0, Total=6162 [2018-10-14 16:56:51,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2018-10-14 16:56:51,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 759. [2018-10-14 16:56:51,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2018-10-14 16:56:51,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 759 transitions. [2018-10-14 16:56:51,176 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 759 transitions. Word has length 730 [2018-10-14 16:56:51,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:56:51,177 INFO L481 AbstractCegarLoop]: Abstraction has 759 states and 759 transitions. [2018-10-14 16:56:51,177 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-14 16:56:51,177 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 759 transitions. [2018-10-14 16:56:51,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 759 [2018-10-14 16:56:51,183 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:56:51,183 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:56:51,184 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:56:51,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:56:51,184 INFO L82 PathProgramCache]: Analyzing trace with hash -888362696, now seen corresponding path program 26 times [2018-10-14 16:56:51,185 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:56:51,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:56:54,703 INFO L134 CoverageAnalysis]: Checked inductivity of 9178 backedges. 0 proven. 9178 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:56:54,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:56:54,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-14 16:56:54,705 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-14 16:56:54,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-14 16:56:54,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1447, Unknown=0, NotChecked=0, Total=1560 [2018-10-14 16:56:54,705 INFO L87 Difference]: Start difference. First operand 759 states and 759 transitions. Second operand 40 states. [2018-10-14 16:57:09,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:57:09,271 INFO L93 Difference]: Finished difference Result 813 states and 813 transitions. [2018-10-14 16:57:09,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-14 16:57:09,272 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 758 [2018-10-14 16:57:09,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:57:09,274 INFO L225 Difference]: With dead ends: 813 [2018-10-14 16:57:09,274 INFO L226 Difference]: Without dead ends: 813 [2018-10-14 16:57:09,275 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1014 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=860, Invalid=5620, Unknown=0, NotChecked=0, Total=6480 [2018-10-14 16:57:09,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2018-10-14 16:57:09,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 787. [2018-10-14 16:57:09,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2018-10-14 16:57:09,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 787 transitions. [2018-10-14 16:57:09,283 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 787 transitions. Word has length 758 [2018-10-14 16:57:09,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:57:09,284 INFO L481 AbstractCegarLoop]: Abstraction has 787 states and 787 transitions. [2018-10-14 16:57:09,284 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-14 16:57:09,284 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 787 transitions. [2018-10-14 16:57:09,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 787 [2018-10-14 16:57:09,291 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:57:09,291 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:57:09,291 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:57:09,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:57:09,292 INFO L82 PathProgramCache]: Analyzing trace with hash 2105610918, now seen corresponding path program 27 times [2018-10-14 16:57:09,292 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:57:09,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:57:10,439 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-14 16:57:13,495 INFO L134 CoverageAnalysis]: Checked inductivity of 9909 backedges. 0 proven. 9909 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:57:13,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:57:13,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-14 16:57:13,497 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-14 16:57:13,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-14 16:57:13,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1524, Unknown=0, NotChecked=0, Total=1640 [2018-10-14 16:57:13,498 INFO L87 Difference]: Start difference. First operand 787 states and 787 transitions. Second operand 41 states. [2018-10-14 16:57:28,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:57:28,503 INFO L93 Difference]: Finished difference Result 841 states and 841 transitions. [2018-10-14 16:57:28,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-14 16:57:28,504 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 786 [2018-10-14 16:57:28,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:57:28,506 INFO L225 Difference]: With dead ends: 841 [2018-10-14 16:57:28,507 INFO L226 Difference]: Without dead ends: 841 [2018-10-14 16:57:28,507 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1058 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=884, Invalid=5922, Unknown=0, NotChecked=0, Total=6806 [2018-10-14 16:57:28,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2018-10-14 16:57:28,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 815. [2018-10-14 16:57:28,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 815 states. [2018-10-14 16:57:28,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 815 transitions. [2018-10-14 16:57:28,516 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 815 transitions. Word has length 786 [2018-10-14 16:57:28,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:57:28,516 INFO L481 AbstractCegarLoop]: Abstraction has 815 states and 815 transitions. [2018-10-14 16:57:28,516 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-14 16:57:28,517 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 815 transitions. [2018-10-14 16:57:28,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 815 [2018-10-14 16:57:28,523 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:57:28,524 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:57:28,524 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:57:28,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:57:28,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1057106708, now seen corresponding path program 28 times [2018-10-14 16:57:28,525 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:57:28,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:57:29,156 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-14 16:57:32,530 INFO L134 CoverageAnalysis]: Checked inductivity of 10668 backedges. 0 proven. 10668 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:57:32,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:57:32,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-14 16:57:32,532 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-14 16:57:32,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-14 16:57:32,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1603, Unknown=0, NotChecked=0, Total=1722 [2018-10-14 16:57:32,532 INFO L87 Difference]: Start difference. First operand 815 states and 815 transitions. Second operand 42 states. [2018-10-14 16:57:48,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:57:48,267 INFO L93 Difference]: Finished difference Result 869 states and 869 transitions. [2018-10-14 16:57:48,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-14 16:57:48,269 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 814 [2018-10-14 16:57:48,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:57:48,271 INFO L225 Difference]: With dead ends: 869 [2018-10-14 16:57:48,271 INFO L226 Difference]: Without dead ends: 869 [2018-10-14 16:57:48,272 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1107 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=908, Invalid=6232, Unknown=0, NotChecked=0, Total=7140 [2018-10-14 16:57:48,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2018-10-14 16:57:48,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 843. [2018-10-14 16:57:48,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 843 states. [2018-10-14 16:57:48,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 843 transitions. [2018-10-14 16:57:48,279 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 843 transitions. Word has length 814 [2018-10-14 16:57:48,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:57:48,280 INFO L481 AbstractCegarLoop]: Abstraction has 843 states and 843 transitions. [2018-10-14 16:57:48,280 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-14 16:57:48,280 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 843 transitions. [2018-10-14 16:57:48,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 843 [2018-10-14 16:57:48,287 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:57:48,287 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:57:48,288 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:57:48,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:57:48,288 INFO L82 PathProgramCache]: Analyzing trace with hash -490507646, now seen corresponding path program 29 times [2018-10-14 16:57:48,289 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:57:48,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:57:52,272 INFO L134 CoverageAnalysis]: Checked inductivity of 11455 backedges. 0 proven. 11455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:57:52,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:57:52,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-14 16:57:52,273 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-14 16:57:52,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-14 16:57:52,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1684, Unknown=0, NotChecked=0, Total=1806 [2018-10-14 16:57:52,274 INFO L87 Difference]: Start difference. First operand 843 states and 843 transitions. Second operand 43 states. [2018-10-14 16:58:08,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:58:08,730 INFO L93 Difference]: Finished difference Result 897 states and 897 transitions. [2018-10-14 16:58:08,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-14 16:58:08,730 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 842 [2018-10-14 16:58:08,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:58:08,733 INFO L225 Difference]: With dead ends: 897 [2018-10-14 16:58:08,733 INFO L226 Difference]: Without dead ends: 897 [2018-10-14 16:58:08,733 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1157 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=932, Invalid=6550, Unknown=0, NotChecked=0, Total=7482 [2018-10-14 16:58:08,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2018-10-14 16:58:08,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 871. [2018-10-14 16:58:08,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 871 states. [2018-10-14 16:58:08,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 871 transitions. [2018-10-14 16:58:08,741 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 871 transitions. Word has length 842 [2018-10-14 16:58:08,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:58:08,741 INFO L481 AbstractCegarLoop]: Abstraction has 871 states and 871 transitions. [2018-10-14 16:58:08,741 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-14 16:58:08,741 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 871 transitions. [2018-10-14 16:58:08,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 871 [2018-10-14 16:58:08,748 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:58:08,749 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:58:08,749 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:58:08,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:58:08,750 INFO L82 PathProgramCache]: Analyzing trace with hash 867723504, now seen corresponding path program 30 times [2018-10-14 16:58:08,750 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:58:08,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:58:12,791 INFO L134 CoverageAnalysis]: Checked inductivity of 12270 backedges. 0 proven. 12270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:58:12,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:58:12,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-14 16:58:12,792 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-14 16:58:12,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-14 16:58:12,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1767, Unknown=0, NotChecked=0, Total=1892 [2018-10-14 16:58:12,793 INFO L87 Difference]: Start difference. First operand 871 states and 871 transitions. Second operand 44 states. [2018-10-14 16:58:30,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:58:30,309 INFO L93 Difference]: Finished difference Result 925 states and 925 transitions. [2018-10-14 16:58:30,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-14 16:58:30,310 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 870 [2018-10-14 16:58:30,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:58:30,313 INFO L225 Difference]: With dead ends: 925 [2018-10-14 16:58:30,313 INFO L226 Difference]: Without dead ends: 925 [2018-10-14 16:58:30,314 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1208 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=956, Invalid=6876, Unknown=0, NotChecked=0, Total=7832 [2018-10-14 16:58:30,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2018-10-14 16:58:30,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 899. [2018-10-14 16:58:30,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2018-10-14 16:58:30,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 899 transitions. [2018-10-14 16:58:30,320 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 899 transitions. Word has length 870 [2018-10-14 16:58:30,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:58:30,321 INFO L481 AbstractCegarLoop]: Abstraction has 899 states and 899 transitions. [2018-10-14 16:58:30,321 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-14 16:58:30,321 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 899 transitions. [2018-10-14 16:58:30,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 899 [2018-10-14 16:58:30,328 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:58:30,328 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:58:30,328 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:58:30,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:58:30,329 INFO L82 PathProgramCache]: Analyzing trace with hash -728461730, now seen corresponding path program 31 times [2018-10-14 16:58:30,330 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:58:30,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:58:34,849 INFO L134 CoverageAnalysis]: Checked inductivity of 13113 backedges. 0 proven. 13113 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:58:34,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:58:34,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-14 16:58:34,850 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-14 16:58:34,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-14 16:58:34,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1852, Unknown=0, NotChecked=0, Total=1980 [2018-10-14 16:58:34,851 INFO L87 Difference]: Start difference. First operand 899 states and 899 transitions. Second operand 45 states. [2018-10-14 16:58:53,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:58:53,351 INFO L93 Difference]: Finished difference Result 953 states and 953 transitions. [2018-10-14 16:58:53,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-14 16:58:53,351 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 898 [2018-10-14 16:58:53,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:58:53,354 INFO L225 Difference]: With dead ends: 953 [2018-10-14 16:58:53,354 INFO L226 Difference]: Without dead ends: 953 [2018-10-14 16:58:53,355 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1260 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=980, Invalid=7210, Unknown=0, NotChecked=0, Total=8190 [2018-10-14 16:58:53,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2018-10-14 16:58:53,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 927. [2018-10-14 16:58:53,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2018-10-14 16:58:53,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 927 transitions. [2018-10-14 16:58:53,362 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 927 transitions. Word has length 898 [2018-10-14 16:58:53,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:58:53,362 INFO L481 AbstractCegarLoop]: Abstraction has 927 states and 927 transitions. [2018-10-14 16:58:53,363 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-14 16:58:53,363 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 927 transitions. [2018-10-14 16:58:53,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 927 [2018-10-14 16:58:53,368 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:58:53,368 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:58:53,369 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:58:53,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:58:53,369 INFO L82 PathProgramCache]: Analyzing trace with hash 533422796, now seen corresponding path program 32 times [2018-10-14 16:58:53,370 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:58:53,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:58:57,971 INFO L134 CoverageAnalysis]: Checked inductivity of 13984 backedges. 0 proven. 13984 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:58:57,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:58:57,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-14 16:58:57,973 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-14 16:58:57,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-14 16:58:57,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1939, Unknown=0, NotChecked=0, Total=2070 [2018-10-14 16:58:57,973 INFO L87 Difference]: Start difference. First operand 927 states and 927 transitions. Second operand 46 states. [2018-10-14 16:59:17,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:59:17,478 INFO L93 Difference]: Finished difference Result 981 states and 981 transitions. [2018-10-14 16:59:17,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-14 16:59:17,478 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 926 [2018-10-14 16:59:17,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:59:17,481 INFO L225 Difference]: With dead ends: 981 [2018-10-14 16:59:17,481 INFO L226 Difference]: Without dead ends: 981 [2018-10-14 16:59:17,482 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1313 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1004, Invalid=7552, Unknown=0, NotChecked=0, Total=8556 [2018-10-14 16:59:17,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2018-10-14 16:59:17,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 955. [2018-10-14 16:59:17,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 955 states. [2018-10-14 16:59:17,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 955 transitions. [2018-10-14 16:59:17,489 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 955 transitions. Word has length 926 [2018-10-14 16:59:17,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:59:17,490 INFO L481 AbstractCegarLoop]: Abstraction has 955 states and 955 transitions. [2018-10-14 16:59:17,490 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-14 16:59:17,490 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 955 transitions. [2018-10-14 16:59:17,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 955 [2018-10-14 16:59:17,496 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:59:17,496 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:59:17,497 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:59:17,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:59:17,497 INFO L82 PathProgramCache]: Analyzing trace with hash 126903866, now seen corresponding path program 33 times [2018-10-14 16:59:17,498 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:59:17,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:59:22,393 INFO L134 CoverageAnalysis]: Checked inductivity of 14883 backedges. 0 proven. 14883 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:59:22,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:59:22,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-14 16:59:22,394 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-14 16:59:22,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-14 16:59:22,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=2028, Unknown=0, NotChecked=0, Total=2162 [2018-10-14 16:59:22,395 INFO L87 Difference]: Start difference. First operand 955 states and 955 transitions. Second operand 47 states. [2018-10-14 16:59:42,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:59:42,968 INFO L93 Difference]: Finished difference Result 1009 states and 1009 transitions. [2018-10-14 16:59:42,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-14 16:59:42,968 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 954 [2018-10-14 16:59:42,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:59:42,971 INFO L225 Difference]: With dead ends: 1009 [2018-10-14 16:59:42,971 INFO L226 Difference]: Without dead ends: 1009 [2018-10-14 16:59:42,972 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1367 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1028, Invalid=7902, Unknown=0, NotChecked=0, Total=8930 [2018-10-14 16:59:42,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2018-10-14 16:59:42,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 983. [2018-10-14 16:59:42,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 983 states. [2018-10-14 16:59:42,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 983 transitions. [2018-10-14 16:59:42,979 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 983 transitions. Word has length 954 [2018-10-14 16:59:42,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:59:42,979 INFO L481 AbstractCegarLoop]: Abstraction has 983 states and 983 transitions. [2018-10-14 16:59:42,979 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-14 16:59:42,979 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 983 transitions. [2018-10-14 16:59:42,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 983 [2018-10-14 16:59:42,987 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:59:42,988 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:59:42,988 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:59:42,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:59:42,989 INFO L82 PathProgramCache]: Analyzing trace with hash -170452824, now seen corresponding path program 34 times [2018-10-14 16:59:42,989 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:59:43,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:59:44,803 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-14 16:59:48,739 INFO L134 CoverageAnalysis]: Checked inductivity of 15810 backedges. 0 proven. 15810 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:59:48,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:59:48,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-14 16:59:48,740 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-14 16:59:48,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-14 16:59:48,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=2119, Unknown=0, NotChecked=0, Total=2256 [2018-10-14 16:59:48,740 INFO L87 Difference]: Start difference. First operand 983 states and 983 transitions. Second operand 48 states. [2018-10-14 17:00:10,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:00:10,407 INFO L93 Difference]: Finished difference Result 1037 states and 1037 transitions. [2018-10-14 17:00:10,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-14 17:00:10,407 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 982 [2018-10-14 17:00:10,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:00:10,410 INFO L225 Difference]: With dead ends: 1037 [2018-10-14 17:00:10,410 INFO L226 Difference]: Without dead ends: 1037 [2018-10-14 17:00:10,411 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1422 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=1052, Invalid=8260, Unknown=0, NotChecked=0, Total=9312 [2018-10-14 17:00:10,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2018-10-14 17:00:10,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 1011. [2018-10-14 17:00:10,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1011 states. [2018-10-14 17:00:10,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1011 transitions. [2018-10-14 17:00:10,419 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1011 transitions. Word has length 982 [2018-10-14 17:00:10,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:00:10,420 INFO L481 AbstractCegarLoop]: Abstraction has 1011 states and 1011 transitions. [2018-10-14 17:00:10,420 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-14 17:00:10,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1011 transitions. [2018-10-14 17:00:10,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1011 [2018-10-14 17:00:10,426 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:00:10,426 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:00:10,427 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:00:10,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:00:10,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1403848170, now seen corresponding path program 35 times [2018-10-14 17:00:10,428 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:00:10,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:00:15,657 INFO L134 CoverageAnalysis]: Checked inductivity of 16765 backedges. 0 proven. 16765 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:00:15,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:00:15,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-14 17:00:15,658 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-14 17:00:15,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-14 17:00:15,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=2212, Unknown=0, NotChecked=0, Total=2352 [2018-10-14 17:00:15,659 INFO L87 Difference]: Start difference. First operand 1011 states and 1011 transitions. Second operand 49 states. [2018-10-14 17:00:38,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:00:38,470 INFO L93 Difference]: Finished difference Result 1065 states and 1065 transitions. [2018-10-14 17:00:38,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-14 17:00:38,471 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 1010 [2018-10-14 17:00:38,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:00:38,474 INFO L225 Difference]: With dead ends: 1065 [2018-10-14 17:00:38,474 INFO L226 Difference]: Without dead ends: 1065 [2018-10-14 17:00:38,474 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1478 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1076, Invalid=8626, Unknown=0, NotChecked=0, Total=9702 [2018-10-14 17:00:38,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2018-10-14 17:00:38,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 1039. [2018-10-14 17:00:38,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1039 states. [2018-10-14 17:00:38,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 1039 transitions. [2018-10-14 17:00:38,483 INFO L78 Accepts]: Start accepts. Automaton has 1039 states and 1039 transitions. Word has length 1010 [2018-10-14 17:00:38,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:00:38,483 INFO L481 AbstractCegarLoop]: Abstraction has 1039 states and 1039 transitions. [2018-10-14 17:00:38,483 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-14 17:00:38,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1039 transitions. [2018-10-14 17:00:38,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1039 [2018-10-14 17:00:38,490 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:00:38,490 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:00:38,490 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:00:38,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:00:38,491 INFO L82 PathProgramCache]: Analyzing trace with hash 611814020, now seen corresponding path program 36 times [2018-10-14 17:00:38,492 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:00:38,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:00:44,372 INFO L134 CoverageAnalysis]: Checked inductivity of 17748 backedges. 0 proven. 17748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:00:44,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:00:44,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-14 17:00:44,373 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-14 17:00:44,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-14 17:00:44,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=2307, Unknown=0, NotChecked=0, Total=2450 [2018-10-14 17:00:44,374 INFO L87 Difference]: Start difference. First operand 1039 states and 1039 transitions. Second operand 50 states. [2018-10-14 17:01:08,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:01:08,341 INFO L93 Difference]: Finished difference Result 1093 states and 1093 transitions. [2018-10-14 17:01:08,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-14 17:01:08,341 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 1038 [2018-10-14 17:01:08,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:01:08,345 INFO L225 Difference]: With dead ends: 1093 [2018-10-14 17:01:08,345 INFO L226 Difference]: Without dead ends: 1093 [2018-10-14 17:01:08,345 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1535 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1100, Invalid=9000, Unknown=0, NotChecked=0, Total=10100 [2018-10-14 17:01:08,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2018-10-14 17:01:08,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 1067. [2018-10-14 17:01:08,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1067 states. [2018-10-14 17:01:08,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 1067 transitions. [2018-10-14 17:01:08,352 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 1067 transitions. Word has length 1038 [2018-10-14 17:01:08,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:01:08,353 INFO L481 AbstractCegarLoop]: Abstraction has 1067 states and 1067 transitions. [2018-10-14 17:01:08,353 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-14 17:01:08,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1067 transitions. [2018-10-14 17:01:08,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1067 [2018-10-14 17:01:08,360 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:01:08,361 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:01:08,361 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:01:08,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:01:08,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1870154226, now seen corresponding path program 37 times [2018-10-14 17:01:08,362 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:01:08,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:01:14,287 INFO L134 CoverageAnalysis]: Checked inductivity of 18759 backedges. 0 proven. 18759 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:01:14,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:01:14,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-14 17:01:14,288 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-14 17:01:14,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-14 17:01:14,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=2404, Unknown=0, NotChecked=0, Total=2550 [2018-10-14 17:01:14,289 INFO L87 Difference]: Start difference. First operand 1067 states and 1067 transitions. Second operand 51 states. [2018-10-14 17:01:39,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:01:39,382 INFO L93 Difference]: Finished difference Result 1121 states and 1121 transitions. [2018-10-14 17:01:39,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-14 17:01:39,382 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 1066 [2018-10-14 17:01:39,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:01:39,386 INFO L225 Difference]: With dead ends: 1121 [2018-10-14 17:01:39,387 INFO L226 Difference]: Without dead ends: 1121 [2018-10-14 17:01:39,387 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1593 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1124, Invalid=9382, Unknown=0, NotChecked=0, Total=10506 [2018-10-14 17:01:39,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2018-10-14 17:01:39,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1095. [2018-10-14 17:01:39,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1095 states. [2018-10-14 17:01:39,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1095 transitions. [2018-10-14 17:01:39,394 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 1095 transitions. Word has length 1066 [2018-10-14 17:01:39,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:01:39,394 INFO L481 AbstractCegarLoop]: Abstraction has 1095 states and 1095 transitions. [2018-10-14 17:01:39,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-14 17:01:39,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1095 transitions. [2018-10-14 17:01:39,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1095 [2018-10-14 17:01:39,403 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:01:39,403 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:01:39,403 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:01:39,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:01:39,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1773619104, now seen corresponding path program 38 times [2018-10-14 17:01:39,404 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:01:39,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:01:45,569 INFO L134 CoverageAnalysis]: Checked inductivity of 19798 backedges. 0 proven. 19798 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:01:45,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:01:45,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-14 17:01:45,570 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-14 17:01:45,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-14 17:01:45,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=2503, Unknown=0, NotChecked=0, Total=2652 [2018-10-14 17:01:45,571 INFO L87 Difference]: Start difference. First operand 1095 states and 1095 transitions. Second operand 52 states. [2018-10-14 17:02:11,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:02:11,775 INFO L93 Difference]: Finished difference Result 1149 states and 1149 transitions. [2018-10-14 17:02:11,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-14 17:02:11,775 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 1094 [2018-10-14 17:02:11,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:02:11,779 INFO L225 Difference]: With dead ends: 1149 [2018-10-14 17:02:11,779 INFO L226 Difference]: Without dead ends: 1149 [2018-10-14 17:02:11,779 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1652 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1148, Invalid=9772, Unknown=0, NotChecked=0, Total=10920 [2018-10-14 17:02:11,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2018-10-14 17:02:11,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 1123. [2018-10-14 17:02:11,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1123 states. [2018-10-14 17:02:11,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1123 transitions. [2018-10-14 17:02:11,788 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1123 transitions. Word has length 1094 [2018-10-14 17:02:11,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:02:11,788 INFO L481 AbstractCegarLoop]: Abstraction has 1123 states and 1123 transitions. [2018-10-14 17:02:11,788 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-14 17:02:11,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1123 transitions. [2018-10-14 17:02:11,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1123 [2018-10-14 17:02:11,796 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:02:11,796 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:02:11,796 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:02:11,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:02:11,797 INFO L82 PathProgramCache]: Analyzing trace with hash 2040288718, now seen corresponding path program 39 times [2018-10-14 17:02:11,797 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:02:11,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat