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/AutomizerBplTransformed.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/simple1.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d769cf3 [2018-10-15 15:35:03,347 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 15:35:03,351 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 15:35:03,365 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 15:35:03,365 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 15:35:03,366 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 15:35:03,368 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 15:35:03,370 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 15:35:03,372 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 15:35:03,372 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 15:35:03,373 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 15:35:03,374 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 15:35:03,375 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 15:35:03,376 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 15:35:03,377 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 15:35:03,378 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 15:35:03,379 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 15:35:03,380 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 15:35:03,382 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 15:35:03,388 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 15:35:03,389 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 15:35:03,390 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 15:35:03,395 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 15:35:03,395 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 15:35:03,396 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 15:35:03,400 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 15:35:03,401 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 15:35:03,402 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 15:35:03,407 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 15:35:03,409 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 15:35:03,409 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 15:35:03,409 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 15:35:03,410 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 15:35:03,410 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 15:35:03,411 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 15:35:03,411 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 15:35:03,412 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-15 15:35:03,432 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 15:35:03,432 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 15:35:03,434 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 15:35:03,434 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 15:35:03,434 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 15:35:03,434 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 15:35:03,435 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 15:35:03,435 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 15:35:03,435 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 15:35:03,436 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 15:35:03,436 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 15:35:03,436 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 15:35:03,436 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 15:35:03,437 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 15:35:03,437 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 15:35:03,494 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 15:35:03,508 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 15:35:03,516 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 15:35:03,518 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 15:35:03,518 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 15:35:03,519 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/simple1.i_3.bpl [2018-10-15 15:35:03,520 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/simple1.i_3.bpl' [2018-10-15 15:35:03,581 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 15:35:03,582 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-15 15:35:03,583 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 15:35:03,583 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 15:35:03,583 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 15:35:03,611 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:35:03" (1/1) ... [2018-10-15 15:35:03,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:35:03" (1/1) ... [2018-10-15 15:35:03,622 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:35:03" (1/1) ... [2018-10-15 15:35:03,623 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:35:03" (1/1) ... [2018-10-15 15:35:03,625 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:35:03" (1/1) ... [2018-10-15 15:35:03,627 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:35:03" (1/1) ... [2018-10-15 15:35:03,628 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:35:03" (1/1) ... [2018-10-15 15:35:03,629 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 15:35:03,630 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 15:35:03,630 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 15:35:03,630 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 15:35:03,631 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:35:03" (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-15 15:35:03,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 15:35:03,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 15:35:03,888 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 15:35:03,889 INFO L202 PluginConnector]: Adding new model simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:35:03 BoogieIcfgContainer [2018-10-15 15:35:03,889 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 15:35:03,889 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-15 15:35:03,889 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-15 15:35:03,890 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-15 15:35:03,894 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:35:03" (1/1) ... [2018-10-15 15:35:03,899 WARN L219 ansformationObserver]: HeapSeparator: input icfg has no '#valid' array -- returning unchanged Icfg! [2018-10-15 15:35:03,916 INFO L202 PluginConnector]: Adding new model simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 03:35:03 BasicIcfg [2018-10-15 15:35:03,916 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-15 15:35:03,917 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 15:35:03,917 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 15:35:03,921 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 15:35:03,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:35:03" (1/3) ... [2018-10-15 15:35:03,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4caa3aab and model type simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:35:03, skipping insertion in model container [2018-10-15 15:35:03,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:35:03" (2/3) ... [2018-10-15 15:35:03,923 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4caa3aab and model type simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:35:03, skipping insertion in model container [2018-10-15 15:35:03,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 03:35:03" (3/3) ... [2018-10-15 15:35:03,925 INFO L112 eAbstractionObserver]: Analyzing ICFG simple1.i_3.bplleft_unchanged_by_heapseparator [2018-10-15 15:35:03,935 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 15:35:03,943 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 15:35:03,961 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 15:35:03,990 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 15:35:03,991 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 15:35:03,991 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 15:35:03,991 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 15:35:03,991 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 15:35:03,992 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 15:35:03,992 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 15:35:03,992 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 15:35:03,992 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 15:35:04,006 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2018-10-15 15:35:04,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-15 15:35:04,016 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:04,017 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:04,018 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:04,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:04,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1506042598, now seen corresponding path program 1 times [2018-10-15 15:35:04,087 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:04,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:04,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:35:04,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:35:04,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:35:04,280 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:35:04,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:35:04,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:35:04,323 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 3 states. [2018-10-15 15:35:04,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:04,424 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-10-15 15:35:04,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:35:04,426 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-10-15 15:35:04,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:04,437 INFO L225 Difference]: With dead ends: 16 [2018-10-15 15:35:04,438 INFO L226 Difference]: Without dead ends: 16 [2018-10-15 15:35:04,440 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:35:04,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-10-15 15:35:04,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-10-15 15:35:04,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-10-15 15:35:04,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-10-15 15:35:04,475 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 11 [2018-10-15 15:35:04,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:04,476 INFO L481 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-10-15 15:35:04,476 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:35:04,476 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-10-15 15:35:04,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-15 15:35:04,477 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:04,477 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:04,477 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:04,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:04,478 INFO L82 PathProgramCache]: Analyzing trace with hash 620322410, now seen corresponding path program 1 times [2018-10-15 15:35:04,479 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:04,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:04,601 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:35:04,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:04,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-10-15 15:35:04,603 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-15 15:35:04,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-15 15:35:04,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-15 15:35:04,604 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 4 states. [2018-10-15 15:35:04,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:04,682 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-10-15 15:35:04,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-15 15:35:04,682 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-10-15 15:35:04,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:04,683 INFO L225 Difference]: With dead ends: 19 [2018-10-15 15:35:04,683 INFO L226 Difference]: Without dead ends: 19 [2018-10-15 15:35:04,684 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-15 15:35:04,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-15 15:35:04,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2018-10-15 15:35:04,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-15 15:35:04,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-10-15 15:35:04,689 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 14 [2018-10-15 15:35:04,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:04,689 INFO L481 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-10-15 15:35:04,689 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-15 15:35:04,689 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-10-15 15:35:04,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-15 15:35:04,690 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:04,690 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:04,690 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:04,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:04,691 INFO L82 PathProgramCache]: Analyzing trace with hash 687627034, now seen corresponding path program 2 times [2018-10-15 15:35:04,692 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:04,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:04,812 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:35:04,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:04,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-15 15:35:04,813 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 15:35:04,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 15:35:04,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-15 15:35:04,814 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 5 states. [2018-10-15 15:35:05,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:05,012 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-10-15 15:35:05,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-15 15:35:05,013 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-10-15 15:35:05,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:05,013 INFO L225 Difference]: With dead ends: 22 [2018-10-15 15:35:05,014 INFO L226 Difference]: Without dead ends: 22 [2018-10-15 15:35:05,014 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-15 15:35:05,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-10-15 15:35:05,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-10-15 15:35:05,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-15 15:35:05,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-10-15 15:35:05,018 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 17 [2018-10-15 15:35:05,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:05,018 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-10-15 15:35:05,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 15:35:05,019 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-10-15 15:35:05,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-15 15:35:05,020 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:05,020 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:05,020 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:05,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:05,021 INFO L82 PathProgramCache]: Analyzing trace with hash 9953386, now seen corresponding path program 3 times [2018-10-15 15:35:05,022 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:05,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:05,291 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:35:05,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:05,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-15 15:35:05,292 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-15 15:35:05,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-15 15:35:05,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-15 15:35:05,293 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 6 states. [2018-10-15 15:35:05,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:05,395 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-10-15 15:35:05,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-15 15:35:05,398 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-10-15 15:35:05,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:05,399 INFO L225 Difference]: With dead ends: 25 [2018-10-15 15:35:05,399 INFO L226 Difference]: Without dead ends: 25 [2018-10-15 15:35:05,400 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-15 15:35:05,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-15 15:35:05,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-10-15 15:35:05,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-15 15:35:05,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-10-15 15:35:05,407 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 20 [2018-10-15 15:35:05,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:05,408 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-10-15 15:35:05,408 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-15 15:35:05,409 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-10-15 15:35:05,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-15 15:35:05,410 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:05,410 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:05,411 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:05,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:05,412 INFO L82 PathProgramCache]: Analyzing trace with hash 2075564314, now seen corresponding path program 4 times [2018-10-15 15:35:05,413 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:05,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:05,701 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:35:05,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:05,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-15 15:35:05,703 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 15:35:05,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 15:35:05,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-15 15:35:05,704 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 7 states. [2018-10-15 15:35:05,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:05,869 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-10-15 15:35:05,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-15 15:35:05,871 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-10-15 15:35:05,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:05,872 INFO L225 Difference]: With dead ends: 28 [2018-10-15 15:35:05,873 INFO L226 Difference]: Without dead ends: 28 [2018-10-15 15:35:05,875 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-15 15:35:05,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-10-15 15:35:05,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-10-15 15:35:05,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-15 15:35:05,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-10-15 15:35:05,883 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 23 [2018-10-15 15:35:05,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:05,883 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-10-15 15:35:05,883 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 15:35:05,883 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-10-15 15:35:05,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-15 15:35:05,885 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:05,888 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:05,888 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:05,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:05,889 INFO L82 PathProgramCache]: Analyzing trace with hash 399303274, now seen corresponding path program 5 times [2018-10-15 15:35:05,893 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:05,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:06,179 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:35:06,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:06,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-15 15:35:06,180 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-15 15:35:06,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-15 15:35:06,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-15 15:35:06,182 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 8 states. [2018-10-15 15:35:06,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:06,723 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-10-15 15:35:06,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-15 15:35:06,724 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-10-15 15:35:06,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:06,725 INFO L225 Difference]: With dead ends: 31 [2018-10-15 15:35:06,725 INFO L226 Difference]: Without dead ends: 31 [2018-10-15 15:35:06,726 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-15 15:35:06,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-15 15:35:06,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-10-15 15:35:06,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-15 15:35:06,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-10-15 15:35:06,730 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 26 [2018-10-15 15:35:06,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:06,730 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-10-15 15:35:06,730 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-15 15:35:06,731 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-10-15 15:35:06,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-15 15:35:06,732 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:06,732 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:06,732 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:06,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:06,732 INFO L82 PathProgramCache]: Analyzing trace with hash 491411226, now seen corresponding path program 6 times [2018-10-15 15:35:06,734 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:06,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:06,961 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:35:06,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:06,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 15:35:06,962 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 15:35:06,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 15:35:06,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-15 15:35:06,963 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 9 states. [2018-10-15 15:35:07,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:07,131 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-10-15 15:35:07,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-15 15:35:07,133 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-10-15 15:35:07,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:07,134 INFO L225 Difference]: With dead ends: 34 [2018-10-15 15:35:07,134 INFO L226 Difference]: Without dead ends: 34 [2018-10-15 15:35:07,135 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-15 15:35:07,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-15 15:35:07,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-10-15 15:35:07,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-15 15:35:07,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-10-15 15:35:07,139 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 29 [2018-10-15 15:35:07,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:07,140 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-10-15 15:35:07,140 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 15:35:07,140 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-10-15 15:35:07,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-15 15:35:07,141 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:07,141 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:07,141 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:07,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:07,142 INFO L82 PathProgramCache]: Analyzing trace with hash -4692886, now seen corresponding path program 7 times [2018-10-15 15:35:07,143 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:07,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:07,430 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:35:07,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:07,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-15 15:35:07,431 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-15 15:35:07,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-15 15:35:07,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-10-15 15:35:07,432 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 10 states. [2018-10-15 15:35:07,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:07,671 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-10-15 15:35:07,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-15 15:35:07,672 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-10-15 15:35:07,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:07,674 INFO L225 Difference]: With dead ends: 37 [2018-10-15 15:35:07,674 INFO L226 Difference]: Without dead ends: 37 [2018-10-15 15:35:07,675 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-10-15 15:35:07,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-15 15:35:07,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-10-15 15:35:07,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-15 15:35:07,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-10-15 15:35:07,679 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 32 [2018-10-15 15:35:07,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:07,679 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-10-15 15:35:07,679 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-15 15:35:07,679 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-10-15 15:35:07,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-15 15:35:07,680 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:07,680 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:07,681 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:07,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:07,681 INFO L82 PathProgramCache]: Analyzing trace with hash -459827942, now seen corresponding path program 8 times [2018-10-15 15:35:07,682 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:07,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:07,891 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:35:07,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:07,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 15:35:07,893 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 15:35:07,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 15:35:07,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-10-15 15:35:07,893 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 11 states. [2018-10-15 15:35:08,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:08,116 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-10-15 15:35:08,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-15 15:35:08,119 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2018-10-15 15:35:08,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:08,120 INFO L225 Difference]: With dead ends: 40 [2018-10-15 15:35:08,120 INFO L226 Difference]: Without dead ends: 40 [2018-10-15 15:35:08,121 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-10-15 15:35:08,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-10-15 15:35:08,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-10-15 15:35:08,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-15 15:35:08,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-10-15 15:35:08,125 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 35 [2018-10-15 15:35:08,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:08,125 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-10-15 15:35:08,125 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 15:35:08,125 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-10-15 15:35:08,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-15 15:35:08,126 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:08,126 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:08,127 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:08,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:08,127 INFO L82 PathProgramCache]: Analyzing trace with hash -176527766, now seen corresponding path program 9 times [2018-10-15 15:35:08,128 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:08,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:08,751 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:35:08,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:08,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-15 15:35:08,752 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-15 15:35:08,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-15 15:35:08,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-10-15 15:35:08,753 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 12 states. [2018-10-15 15:35:09,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:09,235 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-10-15 15:35:09,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-15 15:35:09,236 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2018-10-15 15:35:09,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:09,237 INFO L225 Difference]: With dead ends: 43 [2018-10-15 15:35:09,237 INFO L226 Difference]: Without dead ends: 43 [2018-10-15 15:35:09,238 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-10-15 15:35:09,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-15 15:35:09,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-10-15 15:35:09,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-10-15 15:35:09,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-10-15 15:35:09,244 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 38 [2018-10-15 15:35:09,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:09,244 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-10-15 15:35:09,244 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-15 15:35:09,244 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-10-15 15:35:09,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-15 15:35:09,245 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:09,245 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:09,246 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:09,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:09,246 INFO L82 PathProgramCache]: Analyzing trace with hash 8278810, now seen corresponding path program 10 times [2018-10-15 15:35:09,247 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:09,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:09,789 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:35:09,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:09,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 15:35:09,790 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 15:35:09,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 15:35:09,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-10-15 15:35:09,790 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 13 states. [2018-10-15 15:35:10,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:10,234 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-10-15 15:35:10,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-15 15:35:10,234 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 41 [2018-10-15 15:35:10,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:10,236 INFO L225 Difference]: With dead ends: 46 [2018-10-15 15:35:10,236 INFO L226 Difference]: Without dead ends: 46 [2018-10-15 15:35:10,237 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-10-15 15:35:10,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-10-15 15:35:10,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-10-15 15:35:10,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-15 15:35:10,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-10-15 15:35:10,243 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 41 [2018-10-15 15:35:10,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:10,243 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-10-15 15:35:10,243 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 15:35:10,243 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-10-15 15:35:10,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-15 15:35:10,244 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:10,244 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:10,245 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:10,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:10,245 INFO L82 PathProgramCache]: Analyzing trace with hash -567089046, now seen corresponding path program 11 times [2018-10-15 15:35:10,246 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:10,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:10,466 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:35:10,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:10,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-15 15:35:10,467 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-15 15:35:10,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-15 15:35:10,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-10-15 15:35:10,468 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 14 states. [2018-10-15 15:35:10,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:10,816 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-10-15 15:35:10,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-15 15:35:10,821 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2018-10-15 15:35:10,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:10,822 INFO L225 Difference]: With dead ends: 49 [2018-10-15 15:35:10,822 INFO L226 Difference]: Without dead ends: 49 [2018-10-15 15:35:10,822 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-10-15 15:35:10,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-15 15:35:10,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-10-15 15:35:10,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-15 15:35:10,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-10-15 15:35:10,827 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 44 [2018-10-15 15:35:10,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:10,829 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-10-15 15:35:10,829 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-15 15:35:10,829 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-10-15 15:35:10,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-15 15:35:10,830 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:10,830 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:10,831 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:10,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:10,831 INFO L82 PathProgramCache]: Analyzing trace with hash -136408806, now seen corresponding path program 12 times [2018-10-15 15:35:10,832 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:10,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:11,657 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:35:11,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:11,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 15:35:11,658 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 15:35:11,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 15:35:11,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-10-15 15:35:11,659 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 15 states. [2018-10-15 15:35:11,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:11,993 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-10-15 15:35:11,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-15 15:35:11,995 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2018-10-15 15:35:11,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:11,996 INFO L225 Difference]: With dead ends: 52 [2018-10-15 15:35:11,997 INFO L226 Difference]: Without dead ends: 52 [2018-10-15 15:35:11,997 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-10-15 15:35:11,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-10-15 15:35:12,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2018-10-15 15:35:12,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-15 15:35:12,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-10-15 15:35:12,002 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 47 [2018-10-15 15:35:12,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:12,003 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-10-15 15:35:12,003 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 15:35:12,003 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-10-15 15:35:12,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-15 15:35:12,004 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:12,004 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:12,004 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:12,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:12,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1191307882, now seen corresponding path program 13 times [2018-10-15 15:35:12,005 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:12,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:12,835 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:35:12,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:12,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-15 15:35:12,836 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-15 15:35:12,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-15 15:35:12,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-10-15 15:35:12,837 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 16 states. [2018-10-15 15:35:13,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:13,296 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-10-15 15:35:13,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-15 15:35:13,297 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 50 [2018-10-15 15:35:13,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:13,297 INFO L225 Difference]: With dead ends: 55 [2018-10-15 15:35:13,298 INFO L226 Difference]: Without dead ends: 55 [2018-10-15 15:35:13,298 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-10-15 15:35:13,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-15 15:35:13,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2018-10-15 15:35:13,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-10-15 15:35:13,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-10-15 15:35:13,303 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 50 [2018-10-15 15:35:13,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:13,303 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-10-15 15:35:13,303 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-15 15:35:13,303 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-10-15 15:35:13,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-15 15:35:13,304 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:13,304 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:13,305 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:13,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:13,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1449636070, now seen corresponding path program 14 times [2018-10-15 15:35:13,306 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:13,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:13,624 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:35:13,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:13,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 15:35:13,624 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 15:35:13,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 15:35:13,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-10-15 15:35:13,625 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 17 states. [2018-10-15 15:35:14,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:14,154 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-10-15 15:35:14,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-15 15:35:14,155 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 53 [2018-10-15 15:35:14,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:14,156 INFO L225 Difference]: With dead ends: 58 [2018-10-15 15:35:14,156 INFO L226 Difference]: Without dead ends: 58 [2018-10-15 15:35:14,157 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-10-15 15:35:14,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-10-15 15:35:14,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-10-15 15:35:14,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-15 15:35:14,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-10-15 15:35:14,161 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 53 [2018-10-15 15:35:14,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:14,161 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-10-15 15:35:14,162 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 15:35:14,162 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-10-15 15:35:14,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-15 15:35:14,163 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:14,163 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:14,163 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:14,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:14,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1694985322, now seen corresponding path program 15 times [2018-10-15 15:35:14,164 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:14,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:14,838 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:35:14,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:14,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-15 15:35:14,839 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-15 15:35:14,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-15 15:35:14,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-10-15 15:35:14,840 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 18 states. [2018-10-15 15:35:15,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:15,374 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-10-15 15:35:15,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-15 15:35:15,380 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 56 [2018-10-15 15:35:15,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:15,381 INFO L225 Difference]: With dead ends: 61 [2018-10-15 15:35:15,381 INFO L226 Difference]: Without dead ends: 61 [2018-10-15 15:35:15,381 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-10-15 15:35:15,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-10-15 15:35:15,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2018-10-15 15:35:15,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-15 15:35:15,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-10-15 15:35:15,388 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 56 [2018-10-15 15:35:15,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:15,389 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-10-15 15:35:15,389 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-15 15:35:15,389 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-10-15 15:35:15,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-10-15 15:35:15,390 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:15,390 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:15,390 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:15,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:15,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1284214042, now seen corresponding path program 16 times [2018-10-15 15:35:15,392 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:15,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:16,181 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:35:16,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:16,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 15:35:16,182 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 15:35:16,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 15:35:16,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-10-15 15:35:16,183 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 19 states. [2018-10-15 15:35:16,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:16,691 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-10-15 15:35:16,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-15 15:35:16,692 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 59 [2018-10-15 15:35:16,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:16,693 INFO L225 Difference]: With dead ends: 64 [2018-10-15 15:35:16,693 INFO L226 Difference]: Without dead ends: 64 [2018-10-15 15:35:16,694 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-10-15 15:35:16,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-10-15 15:35:16,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2018-10-15 15:35:16,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-15 15:35:16,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-10-15 15:35:16,699 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 59 [2018-10-15 15:35:16,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:16,699 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-10-15 15:35:16,699 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 15:35:16,699 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-10-15 15:35:16,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-15 15:35:16,700 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:16,700 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:16,700 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:16,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:16,701 INFO L82 PathProgramCache]: Analyzing trace with hash 358837866, now seen corresponding path program 17 times [2018-10-15 15:35:16,701 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:16,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:17,093 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:35:17,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:17,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-15 15:35:17,094 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-15 15:35:17,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-15 15:35:17,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-10-15 15:35:17,095 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 20 states. [2018-10-15 15:35:17,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:17,749 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-10-15 15:35:17,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-15 15:35:17,750 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 62 [2018-10-15 15:35:17,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:17,751 INFO L225 Difference]: With dead ends: 67 [2018-10-15 15:35:17,751 INFO L226 Difference]: Without dead ends: 67 [2018-10-15 15:35:17,752 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-10-15 15:35:17,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-10-15 15:35:17,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-10-15 15:35:17,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-10-15 15:35:17,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-10-15 15:35:17,755 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 62 [2018-10-15 15:35:17,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:17,756 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-10-15 15:35:17,756 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-15 15:35:17,756 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-10-15 15:35:17,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-15 15:35:17,757 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:17,757 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:17,757 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:17,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:17,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1872251674, now seen corresponding path program 18 times [2018-10-15 15:35:17,758 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:17,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:18,205 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:35:18,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:18,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 15:35:18,206 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 15:35:18,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 15:35:18,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-10-15 15:35:18,207 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 21 states. [2018-10-15 15:35:18,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:18,853 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-10-15 15:35:18,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-15 15:35:18,854 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 65 [2018-10-15 15:35:18,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:18,855 INFO L225 Difference]: With dead ends: 70 [2018-10-15 15:35:18,855 INFO L226 Difference]: Without dead ends: 70 [2018-10-15 15:35:18,856 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-10-15 15:35:18,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-10-15 15:35:18,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-10-15 15:35:18,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-10-15 15:35:18,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-10-15 15:35:18,860 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 65 [2018-10-15 15:35:18,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:18,861 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-10-15 15:35:18,861 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 15:35:18,861 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-10-15 15:35:18,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-15 15:35:18,862 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:18,862 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:18,862 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:18,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:18,863 INFO L82 PathProgramCache]: Analyzing trace with hash -583667606, now seen corresponding path program 19 times [2018-10-15 15:35:18,863 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:18,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:19,457 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:35:19,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:19,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-15 15:35:19,458 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-15 15:35:19,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-15 15:35:19,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-10-15 15:35:19,459 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 22 states. [2018-10-15 15:35:20,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:20,120 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-10-15 15:35:20,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-15 15:35:20,121 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 68 [2018-10-15 15:35:20,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:20,122 INFO L225 Difference]: With dead ends: 73 [2018-10-15 15:35:20,122 INFO L226 Difference]: Without dead ends: 73 [2018-10-15 15:35:20,123 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-10-15 15:35:20,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-10-15 15:35:20,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2018-10-15 15:35:20,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-10-15 15:35:20,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-10-15 15:35:20,126 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 68 [2018-10-15 15:35:20,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:20,127 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-10-15 15:35:20,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-15 15:35:20,127 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-10-15 15:35:20,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-10-15 15:35:20,128 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:20,128 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:20,128 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:20,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:20,128 INFO L82 PathProgramCache]: Analyzing trace with hash -107050726, now seen corresponding path program 20 times [2018-10-15 15:35:20,129 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:20,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:20,988 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:35:20,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:20,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 15:35:20,988 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 15:35:20,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 15:35:20,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-10-15 15:35:20,989 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 23 states. [2018-10-15 15:35:21,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:21,679 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-10-15 15:35:21,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-15 15:35:21,680 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 71 [2018-10-15 15:35:21,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:21,681 INFO L225 Difference]: With dead ends: 76 [2018-10-15 15:35:21,681 INFO L226 Difference]: Without dead ends: 76 [2018-10-15 15:35:21,682 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-10-15 15:35:21,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-10-15 15:35:21,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2018-10-15 15:35:21,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-15 15:35:21,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-10-15 15:35:21,686 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 71 [2018-10-15 15:35:21,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:21,686 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-10-15 15:35:21,686 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 15:35:21,686 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-10-15 15:35:21,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-15 15:35:21,687 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:21,687 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:21,687 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:21,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:21,688 INFO L82 PathProgramCache]: Analyzing trace with hash -375459222, now seen corresponding path program 21 times [2018-10-15 15:35:21,688 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:21,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:22,198 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:35:22,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:22,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-15 15:35:22,198 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-15 15:35:22,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-15 15:35:22,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-10-15 15:35:22,199 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 24 states. [2018-10-15 15:35:22,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:22,974 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-10-15 15:35:22,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-15 15:35:22,975 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 74 [2018-10-15 15:35:22,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:22,976 INFO L225 Difference]: With dead ends: 79 [2018-10-15 15:35:22,977 INFO L226 Difference]: Without dead ends: 79 [2018-10-15 15:35:22,977 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-10-15 15:35:22,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-15 15:35:22,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2018-10-15 15:35:22,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-10-15 15:35:22,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-10-15 15:35:22,979 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 74 [2018-10-15 15:35:22,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:22,980 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-10-15 15:35:22,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-15 15:35:22,980 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-10-15 15:35:22,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-15 15:35:22,981 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:22,981 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:22,981 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:22,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:22,981 INFO L82 PathProgramCache]: Analyzing trace with hash 696141594, now seen corresponding path program 22 times [2018-10-15 15:35:22,982 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:22,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:23,482 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:35:23,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:23,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 15:35:23,483 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 15:35:23,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 15:35:23,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-10-15 15:35:23,483 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 25 states. [2018-10-15 15:35:24,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:24,473 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-10-15 15:35:24,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-15 15:35:24,483 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 77 [2018-10-15 15:35:24,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:24,484 INFO L225 Difference]: With dead ends: 82 [2018-10-15 15:35:24,484 INFO L226 Difference]: Without dead ends: 82 [2018-10-15 15:35:24,484 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-10-15 15:35:24,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-10-15 15:35:24,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-10-15 15:35:24,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-10-15 15:35:24,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-10-15 15:35:24,487 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 77 [2018-10-15 15:35:24,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:24,487 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-10-15 15:35:24,487 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 15:35:24,487 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-10-15 15:35:24,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-15 15:35:24,488 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:24,488 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:24,488 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:24,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:24,489 INFO L82 PathProgramCache]: Analyzing trace with hash 264139882, now seen corresponding path program 23 times [2018-10-15 15:35:24,489 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:24,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:24,986 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:35:24,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:24,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-15 15:35:24,987 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-15 15:35:24,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-15 15:35:24,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-10-15 15:35:24,988 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 26 states. [2018-10-15 15:35:25,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:25,961 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-10-15 15:35:25,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-15 15:35:25,962 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 80 [2018-10-15 15:35:25,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:25,963 INFO L225 Difference]: With dead ends: 85 [2018-10-15 15:35:25,963 INFO L226 Difference]: Without dead ends: 85 [2018-10-15 15:35:25,964 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-10-15 15:35:25,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-15 15:35:25,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2018-10-15 15:35:25,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-10-15 15:35:25,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-10-15 15:35:25,967 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 80 [2018-10-15 15:35:25,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:25,967 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-10-15 15:35:25,967 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-15 15:35:25,967 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-10-15 15:35:25,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-10-15 15:35:25,968 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:25,968 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:25,968 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:25,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:25,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1776843494, now seen corresponding path program 24 times [2018-10-15 15:35:25,969 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:25,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:27,918 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:35:27,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:27,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 15:35:27,919 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 15:35:27,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 15:35:27,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-10-15 15:35:27,920 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 27 states. [2018-10-15 15:35:28,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:28,898 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-10-15 15:35:28,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-15 15:35:28,898 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 83 [2018-10-15 15:35:28,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:28,899 INFO L225 Difference]: With dead ends: 88 [2018-10-15 15:35:28,899 INFO L226 Difference]: Without dead ends: 88 [2018-10-15 15:35:28,900 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-10-15 15:35:28,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-10-15 15:35:28,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2018-10-15 15:35:28,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-10-15 15:35:28,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-10-15 15:35:28,903 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 83 [2018-10-15 15:35:28,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:28,904 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-10-15 15:35:28,904 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 15:35:28,904 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-10-15 15:35:28,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-15 15:35:28,904 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:28,905 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:28,905 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:28,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:28,905 INFO L82 PathProgramCache]: Analyzing trace with hash -860588438, now seen corresponding path program 25 times [2018-10-15 15:35:28,906 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:28,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:29,785 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:35:29,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:29,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-15 15:35:29,786 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-15 15:35:29,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-15 15:35:29,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-10-15 15:35:29,787 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 28 states. [2018-10-15 15:35:30,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:30,836 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-10-15 15:35:30,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-15 15:35:30,843 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 86 [2018-10-15 15:35:30,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:30,844 INFO L225 Difference]: With dead ends: 91 [2018-10-15 15:35:30,844 INFO L226 Difference]: Without dead ends: 91 [2018-10-15 15:35:30,845 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-10-15 15:35:30,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-10-15 15:35:30,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2018-10-15 15:35:30,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-10-15 15:35:30,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-10-15 15:35:30,847 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 86 [2018-10-15 15:35:30,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:30,847 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-10-15 15:35:30,847 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-15 15:35:30,847 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-10-15 15:35:30,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-15 15:35:30,848 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:30,848 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:30,848 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:30,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:30,849 INFO L82 PathProgramCache]: Analyzing trace with hash 776618778, now seen corresponding path program 26 times [2018-10-15 15:35:30,849 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:30,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:32,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:35:32,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:32,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 15:35:32,114 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 15:35:32,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 15:35:32,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-10-15 15:35:32,114 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 29 states. [2018-10-15 15:35:33,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:33,269 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-10-15 15:35:33,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-15 15:35:33,270 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 89 [2018-10-15 15:35:33,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:33,271 INFO L225 Difference]: With dead ends: 94 [2018-10-15 15:35:33,271 INFO L226 Difference]: Without dead ends: 94 [2018-10-15 15:35:33,272 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-10-15 15:35:33,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-10-15 15:35:33,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2018-10-15 15:35:33,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-10-15 15:35:33,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-10-15 15:35:33,276 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 89 [2018-10-15 15:35:33,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:33,276 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-10-15 15:35:33,276 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 15:35:33,276 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-10-15 15:35:33,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-10-15 15:35:33,277 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:33,277 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:33,277 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:33,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:33,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1168177258, now seen corresponding path program 27 times [2018-10-15 15:35:33,278 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:33,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:33,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:35:33,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:33,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-15 15:35:33,988 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-15 15:35:33,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-15 15:35:33,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-10-15 15:35:33,989 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 30 states. [2018-10-15 15:35:35,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:35,276 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-10-15 15:35:35,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-15 15:35:35,277 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 92 [2018-10-15 15:35:35,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:35,278 INFO L225 Difference]: With dead ends: 97 [2018-10-15 15:35:35,278 INFO L226 Difference]: Without dead ends: 97 [2018-10-15 15:35:35,279 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-10-15 15:35:35,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-10-15 15:35:35,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2018-10-15 15:35:35,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-10-15 15:35:35,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-10-15 15:35:35,281 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 92 [2018-10-15 15:35:35,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:35,281 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-10-15 15:35:35,281 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-15 15:35:35,282 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-10-15 15:35:35,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-15 15:35:35,282 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:35,282 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:35,283 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:35,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:35,283 INFO L82 PathProgramCache]: Analyzing trace with hash 955679002, now seen corresponding path program 28 times [2018-10-15 15:35:35,283 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:35,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:35,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:35:35,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:35,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 15:35:35,916 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 15:35:35,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 15:35:35,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-10-15 15:35:35,916 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 31 states. [2018-10-15 15:35:37,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:37,169 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-10-15 15:35:37,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-15 15:35:37,169 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 95 [2018-10-15 15:35:37,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:37,170 INFO L225 Difference]: With dead ends: 100 [2018-10-15 15:35:37,170 INFO L226 Difference]: Without dead ends: 100 [2018-10-15 15:35:37,171 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-10-15 15:35:37,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-10-15 15:35:37,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2018-10-15 15:35:37,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-10-15 15:35:37,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-10-15 15:35:37,174 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 95 [2018-10-15 15:35:37,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:37,174 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-10-15 15:35:37,174 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 15:35:37,175 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-10-15 15:35:37,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-15 15:35:37,175 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:37,175 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:37,175 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:37,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:37,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1201928810, now seen corresponding path program 29 times [2018-10-15 15:35:37,176 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:37,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:37,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:35:37,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:37,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-15 15:35:37,913 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-15 15:35:37,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-15 15:35:37,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-10-15 15:35:37,914 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 32 states. [2018-10-15 15:35:39,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:39,246 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-10-15 15:35:39,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-15 15:35:39,247 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 98 [2018-10-15 15:35:39,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:39,248 INFO L225 Difference]: With dead ends: 103 [2018-10-15 15:35:39,248 INFO L226 Difference]: Without dead ends: 103 [2018-10-15 15:35:39,249 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-10-15 15:35:39,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-10-15 15:35:39,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2018-10-15 15:35:39,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-10-15 15:35:39,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-10-15 15:35:39,252 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 98 [2018-10-15 15:35:39,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:39,252 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-10-15 15:35:39,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-15 15:35:39,252 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-10-15 15:35:39,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-10-15 15:35:39,253 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:39,253 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:39,253 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:39,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:39,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1425817370, now seen corresponding path program 30 times [2018-10-15 15:35:39,254 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:39,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:40,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 0 proven. 1365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:35:40,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:40,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 15:35:40,162 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 15:35:40,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 15:35:40,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 15:35:40,163 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 33 states. [2018-10-15 15:35:41,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:41,624 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-10-15 15:35:41,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-15 15:35:41,624 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 101 [2018-10-15 15:35:41,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:41,625 INFO L225 Difference]: With dead ends: 106 [2018-10-15 15:35:41,626 INFO L226 Difference]: Without dead ends: 106 [2018-10-15 15:35:41,626 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 15:35:41,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-10-15 15:35:41,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2018-10-15 15:35:41,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-10-15 15:35:41,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-10-15 15:35:41,629 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 101 [2018-10-15 15:35:41,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:41,630 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-10-15 15:35:41,630 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 15:35:41,630 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-10-15 15:35:41,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-15 15:35:41,631 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:41,631 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:41,631 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:41,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:41,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1205697642, now seen corresponding path program 31 times [2018-10-15 15:35:41,632 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:41,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:42,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:35:42,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:42,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-15 15:35:42,416 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-15 15:35:42,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-15 15:35:42,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-10-15 15:35:42,417 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 34 states. [2018-10-15 15:35:44,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:44,002 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-10-15 15:35:44,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-15 15:35:44,003 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 104 [2018-10-15 15:35:44,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:44,004 INFO L225 Difference]: With dead ends: 109 [2018-10-15 15:35:44,004 INFO L226 Difference]: Without dead ends: 109 [2018-10-15 15:35:44,005 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-10-15 15:35:44,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-10-15 15:35:44,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2018-10-15 15:35:44,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-10-15 15:35:44,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-10-15 15:35:44,009 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 104 [2018-10-15 15:35:44,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:44,009 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-10-15 15:35:44,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-15 15:35:44,009 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-10-15 15:35:44,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-15 15:35:44,010 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:44,010 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:44,010 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:44,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:44,011 INFO L82 PathProgramCache]: Analyzing trace with hash 2033941786, now seen corresponding path program 32 times [2018-10-15 15:35:44,011 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:44,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:45,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 0 proven. 1552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:35:45,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:45,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 15:35:45,070 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 15:35:45,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 15:35:45,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 15:35:45,071 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 35 states. [2018-10-15 15:35:46,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:46,685 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2018-10-15 15:35:46,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-15 15:35:46,687 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 107 [2018-10-15 15:35:46,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:46,688 INFO L225 Difference]: With dead ends: 112 [2018-10-15 15:35:46,688 INFO L226 Difference]: Without dead ends: 112 [2018-10-15 15:35:46,689 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 15:35:46,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-10-15 15:35:46,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2018-10-15 15:35:46,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-10-15 15:35:46,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-10-15 15:35:46,691 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 107 [2018-10-15 15:35:46,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:46,691 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-10-15 15:35:46,692 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 15:35:46,692 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-10-15 15:35:46,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-15 15:35:46,692 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:46,692 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:46,693 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:46,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:46,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1668120170, now seen corresponding path program 33 times [2018-10-15 15:35:46,694 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:46,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:47,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 0 proven. 1650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:35:47,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:47,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-15 15:35:47,856 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-15 15:35:47,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-15 15:35:47,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-10-15 15:35:47,857 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 36 states. [2018-10-15 15:35:49,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:49,584 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-10-15 15:35:49,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-15 15:35:49,584 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 110 [2018-10-15 15:35:49,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:49,585 INFO L225 Difference]: With dead ends: 115 [2018-10-15 15:35:49,585 INFO L226 Difference]: Without dead ends: 115 [2018-10-15 15:35:49,586 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-10-15 15:35:49,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-10-15 15:35:49,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2018-10-15 15:35:49,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-10-15 15:35:49,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2018-10-15 15:35:49,589 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 110 [2018-10-15 15:35:49,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:49,590 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2018-10-15 15:35:49,590 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-15 15:35:49,590 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-10-15 15:35:49,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-10-15 15:35:49,590 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:49,590 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:49,591 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:49,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:49,591 INFO L82 PathProgramCache]: Analyzing trace with hash -191612134, now seen corresponding path program 34 times [2018-10-15 15:35:49,591 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:49,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:50,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 0 proven. 1751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:35:50,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:50,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 15:35:50,763 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 15:35:50,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 15:35:50,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 15:35:50,764 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 37 states. [2018-10-15 15:35:52,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:52,594 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2018-10-15 15:35:52,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-15 15:35:52,595 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 113 [2018-10-15 15:35:52,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:52,596 INFO L225 Difference]: With dead ends: 118 [2018-10-15 15:35:52,596 INFO L226 Difference]: Without dead ends: 118 [2018-10-15 15:35:52,597 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 15:35:52,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-10-15 15:35:52,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2018-10-15 15:35:52,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-10-15 15:35:52,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-10-15 15:35:52,599 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 113 [2018-10-15 15:35:52,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:52,600 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-10-15 15:35:52,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 15:35:52,600 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-10-15 15:35:52,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-15 15:35:52,600 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:52,600 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:52,601 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:52,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:52,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1601437802, now seen corresponding path program 35 times [2018-10-15 15:35:52,601 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:52,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:53,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 1855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:35:53,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:53,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-15 15:35:53,627 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-15 15:35:53,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-15 15:35:53,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-10-15 15:35:53,628 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 38 states. [2018-10-15 15:35:55,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:55,739 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-10-15 15:35:55,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-15 15:35:55,740 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 116 [2018-10-15 15:35:55,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:55,741 INFO L225 Difference]: With dead ends: 121 [2018-10-15 15:35:55,741 INFO L226 Difference]: Without dead ends: 121 [2018-10-15 15:35:55,742 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-10-15 15:35:55,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-10-15 15:35:55,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2018-10-15 15:35:55,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-10-15 15:35:55,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2018-10-15 15:35:55,744 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 116 [2018-10-15 15:35:55,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:55,745 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2018-10-15 15:35:55,745 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-15 15:35:55,745 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2018-10-15 15:35:55,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-15 15:35:55,745 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:55,745 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:55,745 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:55,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:55,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1843820826, now seen corresponding path program 36 times [2018-10-15 15:35:55,746 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:55,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:57,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1962 backedges. 0 proven. 1962 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:35:57,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:57,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 15:35:57,105 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 15:35:57,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 15:35:57,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 15:35:57,106 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 39 states. [2018-10-15 15:35:59,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:59,117 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2018-10-15 15:35:59,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-15 15:35:59,118 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 119 [2018-10-15 15:35:59,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:59,119 INFO L225 Difference]: With dead ends: 124 [2018-10-15 15:35:59,119 INFO L226 Difference]: Without dead ends: 124 [2018-10-15 15:35:59,120 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 15:35:59,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-10-15 15:35:59,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2018-10-15 15:35:59,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-10-15 15:35:59,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-10-15 15:35:59,122 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 119 [2018-10-15 15:35:59,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:59,123 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-10-15 15:35:59,123 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 15:35:59,123 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-10-15 15:35:59,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-15 15:35:59,124 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:59,124 INFO L375 BasicCegarLoop]: trace histogram [38, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:59,124 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:59,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:59,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1458503062, now seen corresponding path program 37 times [2018-10-15 15:35:59,125 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:59,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:00,490 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 0 proven. 2072 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:36:00,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:00,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-15 15:36:00,490 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-15 15:36:00,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-15 15:36:00,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-10-15 15:36:00,492 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 40 states. [2018-10-15 15:36:02,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:02,650 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-10-15 15:36:02,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-15 15:36:02,651 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 122 [2018-10-15 15:36:02,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:02,652 INFO L225 Difference]: With dead ends: 127 [2018-10-15 15:36:02,652 INFO L226 Difference]: Without dead ends: 127 [2018-10-15 15:36:02,653 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-10-15 15:36:02,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-10-15 15:36:02,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2018-10-15 15:36:02,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-10-15 15:36:02,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2018-10-15 15:36:02,656 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 122 [2018-10-15 15:36:02,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:02,657 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2018-10-15 15:36:02,657 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-15 15:36:02,657 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2018-10-15 15:36:02,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-15 15:36:02,658 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:02,658 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:02,658 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:02,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:02,658 INFO L82 PathProgramCache]: Analyzing trace with hash -468568294, now seen corresponding path program 38 times [2018-10-15 15:36:02,659 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:02,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:03,625 INFO L134 CoverageAnalysis]: Checked inductivity of 2185 backedges. 0 proven. 2185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:36:03,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:03,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 15:36:03,625 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 15:36:03,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 15:36:03,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 15:36:03,626 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 41 states. [2018-10-15 15:36:06,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:06,015 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2018-10-15 15:36:06,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-15 15:36:06,020 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 125 [2018-10-15 15:36:06,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:06,021 INFO L225 Difference]: With dead ends: 130 [2018-10-15 15:36:06,021 INFO L226 Difference]: Without dead ends: 130 [2018-10-15 15:36:06,022 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 15:36:06,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-10-15 15:36:06,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2018-10-15 15:36:06,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-10-15 15:36:06,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-10-15 15:36:06,024 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 125 [2018-10-15 15:36:06,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:06,025 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-10-15 15:36:06,025 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 15:36:06,025 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-10-15 15:36:06,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-15 15:36:06,025 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:06,026 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:06,026 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:06,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:06,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1432650858, now seen corresponding path program 39 times [2018-10-15 15:36:06,027 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:06,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:07,279 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 0 proven. 2301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:36:07,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:07,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-15 15:36:07,279 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-15 15:36:07,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-15 15:36:07,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-10-15 15:36:07,280 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 42 states. [2018-10-15 15:36:09,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:09,880 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-10-15 15:36:09,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-15 15:36:09,880 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 128 [2018-10-15 15:36:09,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:09,882 INFO L225 Difference]: With dead ends: 133 [2018-10-15 15:36:09,882 INFO L226 Difference]: Without dead ends: 133 [2018-10-15 15:36:09,883 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-10-15 15:36:09,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-10-15 15:36:09,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2018-10-15 15:36:09,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-10-15 15:36:09,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2018-10-15 15:36:09,886 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 128 [2018-10-15 15:36:09,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:09,887 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2018-10-15 15:36:09,887 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-15 15:36:09,887 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2018-10-15 15:36:09,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-10-15 15:36:09,887 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:09,888 INFO L375 BasicCegarLoop]: trace histogram [41, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:09,888 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:09,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:09,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1376291558, now seen corresponding path program 40 times [2018-10-15 15:36:09,889 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:09,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:11,594 INFO L134 CoverageAnalysis]: Checked inductivity of 2420 backedges. 0 proven. 2420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:36:11,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:11,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 15:36:11,594 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 15:36:11,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 15:36:11,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 15:36:11,595 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 43 states. [2018-10-15 15:36:14,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:14,053 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2018-10-15 15:36:14,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-15 15:36:14,054 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 131 [2018-10-15 15:36:14,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:14,055 INFO L225 Difference]: With dead ends: 136 [2018-10-15 15:36:14,055 INFO L226 Difference]: Without dead ends: 136 [2018-10-15 15:36:14,056 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 15:36:14,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-10-15 15:36:14,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2018-10-15 15:36:14,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-10-15 15:36:14,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-10-15 15:36:14,059 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 131 [2018-10-15 15:36:14,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:14,059 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-10-15 15:36:14,060 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 15:36:14,060 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-10-15 15:36:14,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-15 15:36:14,060 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:14,060 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:14,061 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:14,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:14,061 INFO L82 PathProgramCache]: Analyzing trace with hash 562988650, now seen corresponding path program 41 times [2018-10-15 15:36:14,062 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:14,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:15,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2542 backedges. 0 proven. 2542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:36:15,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:15,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-15 15:36:15,437 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-15 15:36:15,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-15 15:36:15,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-10-15 15:36:15,438 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 44 states. [2018-10-15 15:36:18,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:18,034 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-10-15 15:36:18,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-15 15:36:18,034 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 134 [2018-10-15 15:36:18,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:18,036 INFO L225 Difference]: With dead ends: 139 [2018-10-15 15:36:18,036 INFO L226 Difference]: Without dead ends: 139 [2018-10-15 15:36:18,037 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-10-15 15:36:18,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-10-15 15:36:18,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2018-10-15 15:36:18,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-10-15 15:36:18,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2018-10-15 15:36:18,041 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 134 [2018-10-15 15:36:18,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:18,041 INFO L481 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2018-10-15 15:36:18,041 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-15 15:36:18,041 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2018-10-15 15:36:18,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-10-15 15:36:18,042 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:18,042 INFO L375 BasicCegarLoop]: trace histogram [43, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:18,042 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:18,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:18,043 INFO L82 PathProgramCache]: Analyzing trace with hash 2054566682, now seen corresponding path program 42 times [2018-10-15 15:36:18,043 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:18,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:19,176 INFO L134 CoverageAnalysis]: Checked inductivity of 2667 backedges. 0 proven. 2667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:36:19,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:19,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 15:36:19,176 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 15:36:19,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 15:36:19,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 15:36:19,177 INFO L87 Difference]: Start difference. First operand 138 states and 138 transitions. Second operand 45 states. [2018-10-15 15:36:22,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:22,214 INFO L93 Difference]: Finished difference Result 142 states and 142 transitions. [2018-10-15 15:36:22,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-15 15:36:22,214 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 137 [2018-10-15 15:36:22,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:22,216 INFO L225 Difference]: With dead ends: 142 [2018-10-15 15:36:22,216 INFO L226 Difference]: Without dead ends: 142 [2018-10-15 15:36:22,217 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 15:36:22,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-10-15 15:36:22,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2018-10-15 15:36:22,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-10-15 15:36:22,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-10-15 15:36:22,219 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 137 [2018-10-15 15:36:22,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:22,220 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-10-15 15:36:22,221 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 15:36:22,221 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-10-15 15:36:22,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-15 15:36:22,221 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:22,222 INFO L375 BasicCegarLoop]: trace histogram [44, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:22,222 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:22,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:22,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1924073578, now seen corresponding path program 43 times [2018-10-15 15:36:22,222 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:22,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:23,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2795 backedges. 0 proven. 2795 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:36:23,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:23,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-15 15:36:23,547 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-15 15:36:23,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-15 15:36:23,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-10-15 15:36:23,548 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 46 states. [2018-10-15 15:36:26,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:26,536 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-10-15 15:36:26,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-15 15:36:26,536 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 140 [2018-10-15 15:36:26,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:26,538 INFO L225 Difference]: With dead ends: 145 [2018-10-15 15:36:26,538 INFO L226 Difference]: Without dead ends: 145 [2018-10-15 15:36:26,538 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-10-15 15:36:26,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-10-15 15:36:26,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2018-10-15 15:36:26,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-10-15 15:36:26,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 144 transitions. [2018-10-15 15:36:26,541 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 144 transitions. Word has length 140 [2018-10-15 15:36:26,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:26,542 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 144 transitions. [2018-10-15 15:36:26,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-15 15:36:26,542 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 144 transitions. [2018-10-15 15:36:26,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-15 15:36:26,542 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:26,542 INFO L375 BasicCegarLoop]: trace histogram [45, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:26,543 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:26,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:26,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1349415194, now seen corresponding path program 44 times [2018-10-15 15:36:26,544 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:26,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:28,072 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:36:28,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:28,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 15:36:28,073 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 15:36:28,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 15:36:28,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 15:36:28,073 INFO L87 Difference]: Start difference. First operand 144 states and 144 transitions. Second operand 47 states. [2018-10-15 15:36:31,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:31,151 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2018-10-15 15:36:31,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-15 15:36:31,152 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 143 [2018-10-15 15:36:31,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:31,153 INFO L225 Difference]: With dead ends: 148 [2018-10-15 15:36:31,153 INFO L226 Difference]: Without dead ends: 148 [2018-10-15 15:36:31,154 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 15:36:31,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-10-15 15:36:31,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2018-10-15 15:36:31,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-10-15 15:36:31,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-10-15 15:36:31,157 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 143 [2018-10-15 15:36:31,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:31,157 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-10-15 15:36:31,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 15:36:31,157 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-10-15 15:36:31,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-10-15 15:36:31,158 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:31,158 INFO L375 BasicCegarLoop]: trace histogram [46, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:31,158 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:31,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:31,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1441139306, now seen corresponding path program 45 times [2018-10-15 15:36:31,159 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:31,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:32,443 INFO L134 CoverageAnalysis]: Checked inductivity of 3060 backedges. 0 proven. 3060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:36:32,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:32,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-15 15:36:32,444 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-15 15:36:32,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-15 15:36:32,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-10-15 15:36:32,444 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 48 states. [2018-10-15 15:36:35,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:35,532 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-10-15 15:36:35,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-15 15:36:35,533 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 146 [2018-10-15 15:36:35,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:35,534 INFO L225 Difference]: With dead ends: 151 [2018-10-15 15:36:35,534 INFO L226 Difference]: Without dead ends: 151 [2018-10-15 15:36:35,535 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-10-15 15:36:35,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-10-15 15:36:35,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 150. [2018-10-15 15:36:35,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-10-15 15:36:35,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2018-10-15 15:36:35,538 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 146 [2018-10-15 15:36:35,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:35,539 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2018-10-15 15:36:35,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-15 15:36:35,539 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2018-10-15 15:36:35,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-15 15:36:35,539 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:35,540 INFO L375 BasicCegarLoop]: trace histogram [47, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:35,540 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:35,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:35,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1900007654, now seen corresponding path program 46 times [2018-10-15 15:36:35,541 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:35,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:37,064 INFO L134 CoverageAnalysis]: Checked inductivity of 3197 backedges. 0 proven. 3197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:36:37,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:37,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 15:36:37,064 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 15:36:37,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 15:36:37,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 15:36:37,065 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 49 states. [2018-10-15 15:36:40,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:40,327 INFO L93 Difference]: Finished difference Result 154 states and 154 transitions. [2018-10-15 15:36:40,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-15 15:36:40,328 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 149 [2018-10-15 15:36:40,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:40,329 INFO L225 Difference]: With dead ends: 154 [2018-10-15 15:36:40,329 INFO L226 Difference]: Without dead ends: 154 [2018-10-15 15:36:40,330 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 15:36:40,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-10-15 15:36:40,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2018-10-15 15:36:40,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-10-15 15:36:40,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-10-15 15:36:40,333 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 149 [2018-10-15 15:36:40,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:40,333 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-10-15 15:36:40,333 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 15:36:40,333 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-10-15 15:36:40,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-10-15 15:36:40,334 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:40,334 INFO L375 BasicCegarLoop]: trace histogram [48, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:40,334 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:40,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:40,335 INFO L82 PathProgramCache]: Analyzing trace with hash -2142008214, now seen corresponding path program 47 times [2018-10-15 15:36:40,335 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:40,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:41,878 INFO L134 CoverageAnalysis]: Checked inductivity of 3337 backedges. 0 proven. 3337 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:36:41,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:41,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-15 15:36:41,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-15 15:36:41,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-15 15:36:41,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-10-15 15:36:41,879 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 50 states. [2018-10-15 15:36:45,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:45,208 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2018-10-15 15:36:45,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-15 15:36:45,208 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 152 [2018-10-15 15:36:45,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:45,209 INFO L225 Difference]: With dead ends: 157 [2018-10-15 15:36:45,210 INFO L226 Difference]: Without dead ends: 157 [2018-10-15 15:36:45,210 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-10-15 15:36:45,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-10-15 15:36:45,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2018-10-15 15:36:45,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-10-15 15:36:45,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2018-10-15 15:36:45,213 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 152 [2018-10-15 15:36:45,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:45,214 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2018-10-15 15:36:45,214 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-15 15:36:45,214 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2018-10-15 15:36:45,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-15 15:36:45,214 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:45,214 INFO L375 BasicCegarLoop]: trace histogram [49, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:45,214 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:45,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:45,215 INFO L82 PathProgramCache]: Analyzing trace with hash -330601190, now seen corresponding path program 48 times [2018-10-15 15:36:45,215 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:45,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:47,052 INFO L134 CoverageAnalysis]: Checked inductivity of 3480 backedges. 0 proven. 3480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:36:47,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:47,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 15:36:47,053 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 15:36:47,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 15:36:47,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 15:36:47,054 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 51 states. [2018-10-15 15:36:50,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:50,519 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2018-10-15 15:36:50,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-15 15:36:50,519 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 155 [2018-10-15 15:36:50,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:50,520 INFO L225 Difference]: With dead ends: 160 [2018-10-15 15:36:50,521 INFO L226 Difference]: Without dead ends: 160 [2018-10-15 15:36:50,521 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 15:36:50,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-10-15 15:36:50,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 159. [2018-10-15 15:36:50,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-10-15 15:36:50,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2018-10-15 15:36:50,525 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 155 [2018-10-15 15:36:50,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:50,525 INFO L481 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2018-10-15 15:36:50,525 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 15:36:50,525 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2018-10-15 15:36:50,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-10-15 15:36:50,526 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:50,526 INFO L375 BasicCegarLoop]: trace histogram [50, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:50,526 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:50,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:50,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1326943850, now seen corresponding path program 49 times [2018-10-15 15:36:50,527 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:50,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:54,044 INFO L134 CoverageAnalysis]: Checked inductivity of 3626 backedges. 0 proven. 3626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:36:54,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:54,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-15 15:36:54,045 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-15 15:36:54,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-15 15:36:54,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-10-15 15:36:54,046 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 52 states. [2018-10-15 15:36:57,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:57,898 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-10-15 15:36:57,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-15 15:36:57,898 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 158 [2018-10-15 15:36:57,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:57,900 INFO L225 Difference]: With dead ends: 163 [2018-10-15 15:36:57,900 INFO L226 Difference]: Without dead ends: 163 [2018-10-15 15:36:57,901 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-10-15 15:36:57,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-10-15 15:36:57,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 162. [2018-10-15 15:36:57,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-10-15 15:36:57,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2018-10-15 15:36:57,908 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 158 [2018-10-15 15:36:57,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:57,908 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2018-10-15 15:36:57,908 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-15 15:36:57,908 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2018-10-15 15:36:57,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-10-15 15:36:57,909 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:57,909 INFO L375 BasicCegarLoop]: trace histogram [51, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:57,909 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:57,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:57,910 INFO L82 PathProgramCache]: Analyzing trace with hash 2012228378, now seen corresponding path program 50 times [2018-10-15 15:36:57,910 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:57,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:59,799 INFO L134 CoverageAnalysis]: Checked inductivity of 3775 backedges. 0 proven. 3775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:36:59,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:59,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 15:36:59,800 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 15:36:59,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 15:36:59,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 15:36:59,800 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 53 states. [2018-10-15 15:37:03,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:37:03,724 INFO L93 Difference]: Finished difference Result 166 states and 166 transitions. [2018-10-15 15:37:03,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-15 15:37:03,725 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 161 [2018-10-15 15:37:03,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:37:03,726 INFO L225 Difference]: With dead ends: 166 [2018-10-15 15:37:03,726 INFO L226 Difference]: Without dead ends: 166 [2018-10-15 15:37:03,727 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 15:37:03,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-10-15 15:37:03,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2018-10-15 15:37:03,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-10-15 15:37:03,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-10-15 15:37:03,729 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 161 [2018-10-15 15:37:03,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:37:03,730 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-10-15 15:37:03,730 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 15:37:03,730 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-10-15 15:37:03,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-10-15 15:37:03,731 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:37:03,731 INFO L375 BasicCegarLoop]: trace histogram [52, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:37:03,731 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:37:03,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:37:03,731 INFO L82 PathProgramCache]: Analyzing trace with hash -950923158, now seen corresponding path program 51 times [2018-10-15 15:37:03,732 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:37:03,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:37:05,878 INFO L134 CoverageAnalysis]: Checked inductivity of 3927 backedges. 0 proven. 3927 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:37:05,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:37:05,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-15 15:37:05,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-15 15:37:05,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-15 15:37:05,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-10-15 15:37:05,880 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 54 states. [2018-10-15 15:37:09,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:37:09,976 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2018-10-15 15:37:09,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-15 15:37:09,978 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 164 [2018-10-15 15:37:09,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:37:09,980 INFO L225 Difference]: With dead ends: 169 [2018-10-15 15:37:09,980 INFO L226 Difference]: Without dead ends: 169 [2018-10-15 15:37:09,980 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-10-15 15:37:09,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-10-15 15:37:09,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 168. [2018-10-15 15:37:09,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-10-15 15:37:09,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 168 transitions. [2018-10-15 15:37:09,983 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 168 transitions. Word has length 164 [2018-10-15 15:37:09,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:37:09,984 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 168 transitions. [2018-10-15 15:37:09,984 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-15 15:37:09,984 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 168 transitions. [2018-10-15 15:37:09,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-10-15 15:37:09,984 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:37:09,984 INFO L375 BasicCegarLoop]: trace histogram [53, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:37:09,984 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:37:09,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:37:09,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1735497446, now seen corresponding path program 52 times [2018-10-15 15:37:09,985 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:37:10,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:37:11,472 INFO L134 CoverageAnalysis]: Checked inductivity of 4082 backedges. 0 proven. 4082 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:37:11,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:37:11,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 15:37:11,472 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 15:37:11,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 15:37:11,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 15:37:11,473 INFO L87 Difference]: Start difference. First operand 168 states and 168 transitions. Second operand 55 states. [2018-10-15 15:37:15,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:37:15,662 INFO L93 Difference]: Finished difference Result 172 states and 172 transitions. [2018-10-15 15:37:15,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-15 15:37:15,662 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 167 [2018-10-15 15:37:15,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:37:15,663 INFO L225 Difference]: With dead ends: 172 [2018-10-15 15:37:15,664 INFO L226 Difference]: Without dead ends: 172 [2018-10-15 15:37:15,665 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 15:37:15,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-10-15 15:37:15,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 171. [2018-10-15 15:37:15,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-10-15 15:37:15,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-10-15 15:37:15,668 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 167 [2018-10-15 15:37:15,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:37:15,668 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-10-15 15:37:15,668 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 15:37:15,668 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-10-15 15:37:15,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-15 15:37:15,669 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:37:15,669 INFO L375 BasicCegarLoop]: trace histogram [54, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:37:15,669 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:37:15,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:37:15,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1776086422, now seen corresponding path program 53 times [2018-10-15 15:37:15,670 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:37:15,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:37:17,512 INFO L134 CoverageAnalysis]: Checked inductivity of 4240 backedges. 0 proven. 4240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:37:17,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:37:17,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-10-15 15:37:17,512 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-15 15:37:17,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-15 15:37:17,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-10-15 15:37:17,513 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 56 states. [2018-10-15 15:37:21,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:37:21,669 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-10-15 15:37:21,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-15 15:37:21,669 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 170 [2018-10-15 15:37:21,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:37:21,671 INFO L225 Difference]: With dead ends: 175 [2018-10-15 15:37:21,671 INFO L226 Difference]: Without dead ends: 175 [2018-10-15 15:37:21,671 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-10-15 15:37:21,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-10-15 15:37:21,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 174. [2018-10-15 15:37:21,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-10-15 15:37:21,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 174 transitions. [2018-10-15 15:37:21,674 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 174 transitions. Word has length 170 [2018-10-15 15:37:21,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:37:21,674 INFO L481 AbstractCegarLoop]: Abstraction has 174 states and 174 transitions. [2018-10-15 15:37:21,674 INFO L482 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-15 15:37:21,674 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 174 transitions. [2018-10-15 15:37:21,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-10-15 15:37:21,675 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:37:21,675 INFO L375 BasicCegarLoop]: trace histogram [55, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:37:21,675 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:37:21,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:37:21,675 INFO L82 PathProgramCache]: Analyzing trace with hash 218507034, now seen corresponding path program 54 times [2018-10-15 15:37:21,676 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:37:21,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:37:23,447 INFO L134 CoverageAnalysis]: Checked inductivity of 4401 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:37:23,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:37:23,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 15:37:23,448 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 15:37:23,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 15:37:23,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 15:37:23,449 INFO L87 Difference]: Start difference. First operand 174 states and 174 transitions. Second operand 57 states. [2018-10-15 15:37:27,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:37:27,963 INFO L93 Difference]: Finished difference Result 178 states and 178 transitions. [2018-10-15 15:37:27,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-15 15:37:27,964 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 173 [2018-10-15 15:37:27,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:37:27,965 INFO L225 Difference]: With dead ends: 178 [2018-10-15 15:37:27,965 INFO L226 Difference]: Without dead ends: 178 [2018-10-15 15:37:27,966 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 15:37:27,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-10-15 15:37:27,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2018-10-15 15:37:27,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-10-15 15:37:27,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-10-15 15:37:27,969 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 173 [2018-10-15 15:37:27,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:37:27,969 INFO L481 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-10-15 15:37:27,969 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 15:37:27,969 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-10-15 15:37:27,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-10-15 15:37:27,970 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:37:27,970 INFO L375 BasicCegarLoop]: trace histogram [56, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:37:27,970 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:37:27,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:37:27,971 INFO L82 PathProgramCache]: Analyzing trace with hash 279614570, now seen corresponding path program 55 times [2018-10-15 15:37:27,971 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:37:28,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:37:29,644 INFO L134 CoverageAnalysis]: Checked inductivity of 4565 backedges. 0 proven. 4565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:37:29,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:37:29,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-10-15 15:37:29,644 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-15 15:37:29,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-15 15:37:29,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-10-15 15:37:29,645 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 58 states. [2018-10-15 15:37:34,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:37:34,281 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2018-10-15 15:37:34,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-15 15:37:34,282 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 176 [2018-10-15 15:37:34,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:37:34,283 INFO L225 Difference]: With dead ends: 181 [2018-10-15 15:37:34,284 INFO L226 Difference]: Without dead ends: 181 [2018-10-15 15:37:34,284 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-10-15 15:37:34,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-10-15 15:37:34,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 180. [2018-10-15 15:37:34,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-10-15 15:37:34,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 180 transitions. [2018-10-15 15:37:34,287 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 180 transitions. Word has length 176 [2018-10-15 15:37:34,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:37:34,287 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 180 transitions. [2018-10-15 15:37:34,288 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-15 15:37:34,288 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 180 transitions. [2018-10-15 15:37:34,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-15 15:37:34,288 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:37:34,289 INFO L375 BasicCegarLoop]: trace histogram [57, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:37:34,289 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:37:34,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:37:34,289 INFO L82 PathProgramCache]: Analyzing trace with hash -331913958, now seen corresponding path program 56 times [2018-10-15 15:37:34,290 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:37:34,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:37:36,132 INFO L134 CoverageAnalysis]: Checked inductivity of 4732 backedges. 0 proven. 4732 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:37:36,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:37:36,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-15 15:37:36,132 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-15 15:37:36,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-15 15:37:36,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 15:37:36,133 INFO L87 Difference]: Start difference. First operand 180 states and 180 transitions. Second operand 59 states. [2018-10-15 15:37:41,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:37:41,058 INFO L93 Difference]: Finished difference Result 184 states and 184 transitions. [2018-10-15 15:37:41,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-15 15:37:41,058 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 179 [2018-10-15 15:37:41,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:37:41,060 INFO L225 Difference]: With dead ends: 184 [2018-10-15 15:37:41,060 INFO L226 Difference]: Without dead ends: 184 [2018-10-15 15:37:41,060 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 15:37:41,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-10-15 15:37:41,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2018-10-15 15:37:41,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-10-15 15:37:41,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-10-15 15:37:41,064 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 179 [2018-10-15 15:37:41,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:37:41,064 INFO L481 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-10-15 15:37:41,064 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-15 15:37:41,064 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-10-15 15:37:41,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-15 15:37:41,065 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:37:41,065 INFO L375 BasicCegarLoop]: trace histogram [58, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:37:41,065 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:37:41,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:37:41,066 INFO L82 PathProgramCache]: Analyzing trace with hash 872978026, now seen corresponding path program 57 times [2018-10-15 15:37:41,066 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:37:41,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:37:43,319 INFO L134 CoverageAnalysis]: Checked inductivity of 4902 backedges. 0 proven. 4902 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:37:43,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:37:43,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-10-15 15:37:43,320 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-15 15:37:43,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-15 15:37:43,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-10-15 15:37:43,321 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 60 states. [2018-10-15 15:37:48,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:37:48,382 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2018-10-15 15:37:48,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-15 15:37:48,383 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 182 [2018-10-15 15:37:48,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:37:48,384 INFO L225 Difference]: With dead ends: 187 [2018-10-15 15:37:48,384 INFO L226 Difference]: Without dead ends: 187 [2018-10-15 15:37:48,385 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-10-15 15:37:48,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-10-15 15:37:48,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2018-10-15 15:37:48,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-10-15 15:37:48,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2018-10-15 15:37:48,388 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 182 [2018-10-15 15:37:48,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:37:48,388 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2018-10-15 15:37:48,388 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-15 15:37:48,388 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2018-10-15 15:37:48,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-10-15 15:37:48,389 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:37:48,389 INFO L375 BasicCegarLoop]: trace histogram [59, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:37:48,389 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:37:48,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:37:48,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1526586598, now seen corresponding path program 58 times [2018-10-15 15:37:48,390 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:37:48,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:37:50,360 INFO L134 CoverageAnalysis]: Checked inductivity of 5075 backedges. 0 proven. 5075 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:37:50,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:37:50,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-15 15:37:50,361 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-15 15:37:50,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-15 15:37:50,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 15:37:50,362 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 61 states. [2018-10-15 15:37:55,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:37:55,518 INFO L93 Difference]: Finished difference Result 190 states and 190 transitions. [2018-10-15 15:37:55,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-15 15:37:55,518 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 185 [2018-10-15 15:37:55,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:37:55,520 INFO L225 Difference]: With dead ends: 190 [2018-10-15 15:37:55,520 INFO L226 Difference]: Without dead ends: 190 [2018-10-15 15:37:55,520 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 15:37:55,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-10-15 15:37:55,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2018-10-15 15:37:55,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-10-15 15:37:55,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2018-10-15 15:37:55,523 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 185 [2018-10-15 15:37:55,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:37:55,524 INFO L481 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2018-10-15 15:37:55,524 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-15 15:37:55,524 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2018-10-15 15:37:55,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-15 15:37:55,525 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:37:55,525 INFO L375 BasicCegarLoop]: trace histogram [60, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:37:55,525 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:37:55,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:37:55,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1520625558, now seen corresponding path program 59 times [2018-10-15 15:37:55,526 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:37:55,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:37:57,638 INFO L134 CoverageAnalysis]: Checked inductivity of 5251 backedges. 0 proven. 5251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:37:57,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:37:57,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-10-15 15:37:57,639 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-15 15:37:57,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-15 15:37:57,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-10-15 15:37:57,640 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 62 states. [2018-10-15 15:38:03,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:38:03,034 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2018-10-15 15:38:03,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-15 15:38:03,034 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 188 [2018-10-15 15:38:03,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:38:03,036 INFO L225 Difference]: With dead ends: 193 [2018-10-15 15:38:03,036 INFO L226 Difference]: Without dead ends: 193 [2018-10-15 15:38:03,036 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-10-15 15:38:03,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-10-15 15:38:03,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 192. [2018-10-15 15:38:03,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-10-15 15:38:03,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 192 transitions. [2018-10-15 15:38:03,039 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 192 transitions. Word has length 188 [2018-10-15 15:38:03,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:38:03,039 INFO L481 AbstractCegarLoop]: Abstraction has 192 states and 192 transitions. [2018-10-15 15:38:03,040 INFO L482 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-15 15:38:03,040 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 192 transitions. [2018-10-15 15:38:03,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-10-15 15:38:03,040 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:38:03,041 INFO L375 BasicCegarLoop]: trace histogram [61, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:38:03,041 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:38:03,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:38:03,041 INFO L82 PathProgramCache]: Analyzing trace with hash -28942054, now seen corresponding path program 60 times [2018-10-15 15:38:03,042 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:38:03,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:38:05,105 INFO L134 CoverageAnalysis]: Checked inductivity of 5430 backedges. 0 proven. 5430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:38:05,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:38:05,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-15 15:38:05,105 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-15 15:38:05,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-15 15:38:05,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 15:38:05,106 INFO L87 Difference]: Start difference. First operand 192 states and 192 transitions. Second operand 63 states. [2018-10-15 15:38:10,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:38:10,543 INFO L93 Difference]: Finished difference Result 196 states and 196 transitions. [2018-10-15 15:38:10,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-15 15:38:10,544 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 191 [2018-10-15 15:38:10,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:38:10,545 INFO L225 Difference]: With dead ends: 196 [2018-10-15 15:38:10,545 INFO L226 Difference]: Without dead ends: 196 [2018-10-15 15:38:10,546 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 15:38:10,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-10-15 15:38:10,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 195. [2018-10-15 15:38:10,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-10-15 15:38:10,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2018-10-15 15:38:10,549 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 191 [2018-10-15 15:38:10,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:38:10,549 INFO L481 AbstractCegarLoop]: Abstraction has 195 states and 195 transitions. [2018-10-15 15:38:10,549 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-15 15:38:10,550 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2018-10-15 15:38:10,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-10-15 15:38:10,550 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:38:10,551 INFO L375 BasicCegarLoop]: trace histogram [62, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:38:10,551 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:38:10,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:38:10,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1312286102, now seen corresponding path program 61 times [2018-10-15 15:38:10,552 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:38:10,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:38:12,567 INFO L134 CoverageAnalysis]: Checked inductivity of 5612 backedges. 0 proven. 5612 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:38:12,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:38:12,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-10-15 15:38:12,568 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-15 15:38:12,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-15 15:38:12,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-10-15 15:38:12,569 INFO L87 Difference]: Start difference. First operand 195 states and 195 transitions. Second operand 64 states. [2018-10-15 15:38:18,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:38:18,220 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2018-10-15 15:38:18,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-15 15:38:18,220 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 194 [2018-10-15 15:38:18,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:38:18,222 INFO L225 Difference]: With dead ends: 199 [2018-10-15 15:38:18,222 INFO L226 Difference]: Without dead ends: 199 [2018-10-15 15:38:18,222 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-10-15 15:38:18,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-10-15 15:38:18,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 198. [2018-10-15 15:38:18,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-10-15 15:38:18,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 198 transitions. [2018-10-15 15:38:18,226 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 198 transitions. Word has length 194 [2018-10-15 15:38:18,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:38:18,226 INFO L481 AbstractCegarLoop]: Abstraction has 198 states and 198 transitions. [2018-10-15 15:38:18,226 INFO L482 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-15 15:38:18,226 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 198 transitions. [2018-10-15 15:38:18,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-10-15 15:38:18,227 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:38:18,227 INFO L375 BasicCegarLoop]: trace histogram [63, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:38:18,227 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:38:18,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:38:18,228 INFO L82 PathProgramCache]: Analyzing trace with hash 384048922, now seen corresponding path program 62 times [2018-10-15 15:38:18,228 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:38:18,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:38:20,387 INFO L134 CoverageAnalysis]: Checked inductivity of 5797 backedges. 0 proven. 5797 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:38:20,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:38:20,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-15 15:38:20,387 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-15 15:38:20,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-15 15:38:20,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-10-15 15:38:20,388 INFO L87 Difference]: Start difference. First operand 198 states and 198 transitions. Second operand 65 states. [2018-10-15 15:38:26,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:38:26,266 INFO L93 Difference]: Finished difference Result 202 states and 202 transitions. [2018-10-15 15:38:26,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-15 15:38:26,267 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 197 [2018-10-15 15:38:26,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:38:26,268 INFO L225 Difference]: With dead ends: 202 [2018-10-15 15:38:26,268 INFO L226 Difference]: Without dead ends: 202 [2018-10-15 15:38:26,269 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-10-15 15:38:26,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-10-15 15:38:26,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2018-10-15 15:38:26,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-10-15 15:38:26,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-10-15 15:38:26,272 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 197 [2018-10-15 15:38:26,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:38:26,272 INFO L481 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-10-15 15:38:26,272 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-15 15:38:26,272 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-10-15 15:38:26,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-10-15 15:38:26,273 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:38:26,273 INFO L375 BasicCegarLoop]: trace histogram [64, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:38:26,273 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:38:26,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:38:26,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1315544170, now seen corresponding path program 63 times [2018-10-15 15:38:26,274 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:38:26,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:38:28,524 INFO L134 CoverageAnalysis]: Checked inductivity of 5985 backedges. 0 proven. 5985 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:38:28,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:38:28,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-10-15 15:38:28,525 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-15 15:38:28,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-15 15:38:28,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-10-15 15:38:28,526 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 66 states. [2018-10-15 15:38:34,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:38:34,641 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2018-10-15 15:38:34,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-15 15:38:34,642 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 200 [2018-10-15 15:38:34,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:38:34,643 INFO L225 Difference]: With dead ends: 205 [2018-10-15 15:38:34,643 INFO L226 Difference]: Without dead ends: 205 [2018-10-15 15:38:34,644 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-10-15 15:38:34,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-10-15 15:38:34,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 204. [2018-10-15 15:38:34,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-10-15 15:38:34,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 204 transitions. [2018-10-15 15:38:34,647 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 204 transitions. Word has length 200 [2018-10-15 15:38:34,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:38:34,647 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 204 transitions. [2018-10-15 15:38:34,647 INFO L482 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-15 15:38:34,648 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 204 transitions. [2018-10-15 15:38:34,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-10-15 15:38:34,648 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:38:34,649 INFO L375 BasicCegarLoop]: trace histogram [65, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:38:34,649 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:38:34,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:38:34,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1706777882, now seen corresponding path program 64 times [2018-10-15 15:38:34,650 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:38:34,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:38:36,917 INFO L134 CoverageAnalysis]: Checked inductivity of 6176 backedges. 0 proven. 6176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:38:36,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:38:36,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-15 15:38:36,918 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-15 15:38:36,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-15 15:38:36,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 15:38:36,918 INFO L87 Difference]: Start difference. First operand 204 states and 204 transitions. Second operand 67 states. [2018-10-15 15:38:43,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:38:43,027 INFO L93 Difference]: Finished difference Result 208 states and 208 transitions. [2018-10-15 15:38:43,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-15 15:38:43,028 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 203 [2018-10-15 15:38:43,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:38:43,029 INFO L225 Difference]: With dead ends: 208 [2018-10-15 15:38:43,029 INFO L226 Difference]: Without dead ends: 208 [2018-10-15 15:38:43,029 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 15:38:43,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-10-15 15:38:43,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 207. [2018-10-15 15:38:43,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-10-15 15:38:43,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2018-10-15 15:38:43,033 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 203 [2018-10-15 15:38:43,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:38:43,033 INFO L481 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2018-10-15 15:38:43,033 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-15 15:38:43,033 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2018-10-15 15:38:43,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-10-15 15:38:43,034 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:38:43,034 INFO L375 BasicCegarLoop]: trace histogram [66, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:38:43,034 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:38:43,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:38:43,034 INFO L82 PathProgramCache]: Analyzing trace with hash 409050730, now seen corresponding path program 65 times [2018-10-15 15:38:43,035 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:38:43,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:38:45,519 INFO L134 CoverageAnalysis]: Checked inductivity of 6370 backedges. 0 proven. 6370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:38:45,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:38:45,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-10-15 15:38:45,519 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-15 15:38:45,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-15 15:38:45,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-10-15 15:38:45,520 INFO L87 Difference]: Start difference. First operand 207 states and 207 transitions. Second operand 68 states. [2018-10-15 15:38:51,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:38:51,900 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2018-10-15 15:38:51,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-15 15:38:51,901 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 206 [2018-10-15 15:38:51,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:38:51,902 INFO L225 Difference]: With dead ends: 211 [2018-10-15 15:38:51,902 INFO L226 Difference]: Without dead ends: 211 [2018-10-15 15:38:51,903 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-10-15 15:38:51,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-10-15 15:38:51,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 210. [2018-10-15 15:38:51,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-10-15 15:38:51,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 210 transitions. [2018-10-15 15:38:51,906 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 210 transitions. Word has length 206 [2018-10-15 15:38:51,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:38:51,906 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 210 transitions. [2018-10-15 15:38:51,906 INFO L482 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-15 15:38:51,907 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 210 transitions. [2018-10-15 15:38:51,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-10-15 15:38:51,907 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:38:51,907 INFO L375 BasicCegarLoop]: trace histogram [67, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:38:51,908 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:38:51,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:38:51,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1179903206, now seen corresponding path program 66 times [2018-10-15 15:38:51,908 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:38:51,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:38:54,454 INFO L134 CoverageAnalysis]: Checked inductivity of 6567 backedges. 0 proven. 6567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:38:54,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:38:54,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-15 15:38:54,455 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-15 15:38:54,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-15 15:38:54,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 15:38:54,456 INFO L87 Difference]: Start difference. First operand 210 states and 210 transitions. Second operand 69 states. [2018-10-15 15:39:01,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:39:01,004 INFO L93 Difference]: Finished difference Result 214 states and 214 transitions. [2018-10-15 15:39:01,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-15 15:39:01,005 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 209 [2018-10-15 15:39:01,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:39:01,006 INFO L225 Difference]: With dead ends: 214 [2018-10-15 15:39:01,006 INFO L226 Difference]: Without dead ends: 214 [2018-10-15 15:39:01,007 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 15:39:01,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-10-15 15:39:01,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 213. [2018-10-15 15:39:01,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-15 15:39:01,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2018-10-15 15:39:01,010 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 209 [2018-10-15 15:39:01,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:39:01,011 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2018-10-15 15:39:01,011 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-15 15:39:01,011 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2018-10-15 15:39:01,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-10-15 15:39:01,012 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:39:01,012 INFO L375 BasicCegarLoop]: trace histogram [68, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:39:01,012 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:39:01,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:39:01,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1422925930, now seen corresponding path program 67 times [2018-10-15 15:39:01,013 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:39:01,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:39:03,399 INFO L134 CoverageAnalysis]: Checked inductivity of 6767 backedges. 0 proven. 6767 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:39:03,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:39:03,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-10-15 15:39:03,400 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-15 15:39:03,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-15 15:39:03,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-10-15 15:39:03,401 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 70 states. [2018-10-15 15:39:10,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:39:10,242 INFO L93 Difference]: Finished difference Result 217 states and 217 transitions. [2018-10-15 15:39:10,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-15 15:39:10,242 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 212 [2018-10-15 15:39:10,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:39:10,243 INFO L225 Difference]: With dead ends: 217 [2018-10-15 15:39:10,243 INFO L226 Difference]: Without dead ends: 217 [2018-10-15 15:39:10,243 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-10-15 15:39:10,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-10-15 15:39:10,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 216. [2018-10-15 15:39:10,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-10-15 15:39:10,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 216 transitions. [2018-10-15 15:39:10,246 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 216 transitions. Word has length 212 [2018-10-15 15:39:10,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:39:10,246 INFO L481 AbstractCegarLoop]: Abstraction has 216 states and 216 transitions. [2018-10-15 15:39:10,246 INFO L482 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-15 15:39:10,246 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 216 transitions. [2018-10-15 15:39:10,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-10-15 15:39:10,247 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:39:10,247 INFO L375 BasicCegarLoop]: trace histogram [69, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:39:10,248 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:39:10,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:39:10,248 INFO L82 PathProgramCache]: Analyzing trace with hash 966154522, now seen corresponding path program 68 times [2018-10-15 15:39:10,248 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:39:10,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:39:12,711 INFO L134 CoverageAnalysis]: Checked inductivity of 6970 backedges. 0 proven. 6970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:39:12,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:39:12,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-15 15:39:12,711 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-15 15:39:12,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-15 15:39:12,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 15:39:12,712 INFO L87 Difference]: Start difference. First operand 216 states and 216 transitions. Second operand 71 states. [2018-10-15 15:39:19,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:39:19,674 INFO L93 Difference]: Finished difference Result 220 states and 220 transitions. [2018-10-15 15:39:19,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-15 15:39:19,674 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 215 [2018-10-15 15:39:19,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:39:19,676 INFO L225 Difference]: With dead ends: 220 [2018-10-15 15:39:19,676 INFO L226 Difference]: Without dead ends: 220 [2018-10-15 15:39:19,676 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 15:39:19,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-10-15 15:39:19,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 219. [2018-10-15 15:39:19,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-10-15 15:39:19,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 219 transitions. [2018-10-15 15:39:19,679 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 219 transitions. Word has length 215 [2018-10-15 15:39:19,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:39:19,679 INFO L481 AbstractCegarLoop]: Abstraction has 219 states and 219 transitions. [2018-10-15 15:39:19,679 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-15 15:39:19,679 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 219 transitions. [2018-10-15 15:39:19,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-10-15 15:39:19,679 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:39:19,680 INFO L375 BasicCegarLoop]: trace histogram [70, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:39:19,680 INFO L424 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:39:19,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:39:19,680 INFO L82 PathProgramCache]: Analyzing trace with hash -254467478, now seen corresponding path program 69 times [2018-10-15 15:39:19,681 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:39:19,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:39:22,366 INFO L134 CoverageAnalysis]: Checked inductivity of 7176 backedges. 0 proven. 7176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:39:22,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:39:22,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-10-15 15:39:22,367 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-15 15:39:22,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-15 15:39:22,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-10-15 15:39:22,367 INFO L87 Difference]: Start difference. First operand 219 states and 219 transitions. Second operand 72 states. [2018-10-15 15:39:29,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:39:29,561 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2018-10-15 15:39:29,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-15 15:39:29,562 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 218 [2018-10-15 15:39:29,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:39:29,563 INFO L225 Difference]: With dead ends: 223 [2018-10-15 15:39:29,563 INFO L226 Difference]: Without dead ends: 223 [2018-10-15 15:39:29,564 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-10-15 15:39:29,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-10-15 15:39:29,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 222. [2018-10-15 15:39:29,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-10-15 15:39:29,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 222 transitions. [2018-10-15 15:39:29,567 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 222 transitions. Word has length 218 [2018-10-15 15:39:29,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:39:29,567 INFO L481 AbstractCegarLoop]: Abstraction has 222 states and 222 transitions. [2018-10-15 15:39:29,567 INFO L482 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-15 15:39:29,567 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 222 transitions. [2018-10-15 15:39:29,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-10-15 15:39:29,568 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:39:29,568 INFO L375 BasicCegarLoop]: trace histogram [71, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:39:29,568 INFO L424 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:39:29,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:39:29,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1683625754, now seen corresponding path program 70 times [2018-10-15 15:39:29,569 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:39:29,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:39:32,417 INFO L134 CoverageAnalysis]: Checked inductivity of 7385 backedges. 0 proven. 7385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:39:32,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:39:32,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-15 15:39:32,418 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-15 15:39:32,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-15 15:39:32,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-10-15 15:39:32,418 INFO L87 Difference]: Start difference. First operand 222 states and 222 transitions. Second operand 73 states. [2018-10-15 15:39:39,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:39:39,808 INFO L93 Difference]: Finished difference Result 226 states and 226 transitions. [2018-10-15 15:39:39,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-15 15:39:39,808 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 221 [2018-10-15 15:39:39,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:39:39,810 INFO L225 Difference]: With dead ends: 226 [2018-10-15 15:39:39,810 INFO L226 Difference]: Without dead ends: 226 [2018-10-15 15:39:39,810 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-10-15 15:39:39,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-10-15 15:39:39,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2018-10-15 15:39:39,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-10-15 15:39:39,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2018-10-15 15:39:39,813 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 221 [2018-10-15 15:39:39,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:39:39,813 INFO L481 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2018-10-15 15:39:39,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-15 15:39:39,813 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2018-10-15 15:39:39,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-10-15 15:39:39,814 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:39:39,814 INFO L375 BasicCegarLoop]: trace histogram [72, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:39:39,814 INFO L424 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:39:39,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:39:39,814 INFO L82 PathProgramCache]: Analyzing trace with hash -2121227158, now seen corresponding path program 71 times [2018-10-15 15:39:39,815 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:39:39,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:39:42,711 INFO L134 CoverageAnalysis]: Checked inductivity of 7597 backedges. 0 proven. 7597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:39:42,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:39:42,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-10-15 15:39:42,711 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-10-15 15:39:42,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-10-15 15:39:42,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-10-15 15:39:42,712 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 74 states. [2018-10-15 15:39:50,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:39:50,325 INFO L93 Difference]: Finished difference Result 229 states and 229 transitions. [2018-10-15 15:39:50,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-15 15:39:50,326 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 224 [2018-10-15 15:39:50,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:39:50,327 INFO L225 Difference]: With dead ends: 229 [2018-10-15 15:39:50,327 INFO L226 Difference]: Without dead ends: 229 [2018-10-15 15:39:50,327 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-10-15 15:39:50,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-10-15 15:39:50,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 228. [2018-10-15 15:39:50,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-10-15 15:39:50,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 228 transitions. [2018-10-15 15:39:50,330 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 228 transitions. Word has length 224 [2018-10-15 15:39:50,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:39:50,330 INFO L481 AbstractCegarLoop]: Abstraction has 228 states and 228 transitions. [2018-10-15 15:39:50,330 INFO L482 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-10-15 15:39:50,331 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 228 transitions. [2018-10-15 15:39:50,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-10-15 15:39:50,332 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:39:50,332 INFO L375 BasicCegarLoop]: trace histogram [73, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:39:50,332 INFO L424 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:39:50,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:39:50,332 INFO L82 PathProgramCache]: Analyzing trace with hash 282547482, now seen corresponding path program 72 times [2018-10-15 15:39:50,333 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:39:50,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:39:53,100 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 7812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:39:53,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:39:53,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-15 15:39:53,101 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-15 15:39:53,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-15 15:39:53,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 15:39:53,101 INFO L87 Difference]: Start difference. First operand 228 states and 228 transitions. Second operand 75 states. [2018-10-15 15:40:00,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:40:00,904 INFO L93 Difference]: Finished difference Result 232 states and 232 transitions. [2018-10-15 15:40:00,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-15 15:40:00,904 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 227 [2018-10-15 15:40:00,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:40:00,906 INFO L225 Difference]: With dead ends: 232 [2018-10-15 15:40:00,906 INFO L226 Difference]: Without dead ends: 232 [2018-10-15 15:40:00,906 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 15:40:00,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-10-15 15:40:00,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 231. [2018-10-15 15:40:00,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-10-15 15:40:00,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2018-10-15 15:40:00,909 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 227 [2018-10-15 15:40:00,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:40:00,910 INFO L481 AbstractCegarLoop]: Abstraction has 231 states and 231 transitions. [2018-10-15 15:40:00,910 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-15 15:40:00,910 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 231 transitions. [2018-10-15 15:40:00,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-15 15:40:00,911 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:40:00,911 INFO L375 BasicCegarLoop]: trace histogram [74, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:40:00,911 INFO L424 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:40:00,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:40:00,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1143121514, now seen corresponding path program 73 times [2018-10-15 15:40:00,912 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:40:00,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:40:03,720 INFO L134 CoverageAnalysis]: Checked inductivity of 8030 backedges. 0 proven. 8030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:40:03,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:40:03,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-10-15 15:40:03,721 INFO L460 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-10-15 15:40:03,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-10-15 15:40:03,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-10-15 15:40:03,722 INFO L87 Difference]: Start difference. First operand 231 states and 231 transitions. Second operand 76 states. [2018-10-15 15:40:11,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:40:11,723 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2018-10-15 15:40:11,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-15 15:40:11,723 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 230 [2018-10-15 15:40:11,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:40:11,725 INFO L225 Difference]: With dead ends: 235 [2018-10-15 15:40:11,725 INFO L226 Difference]: Without dead ends: 235 [2018-10-15 15:40:11,725 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-10-15 15:40:11,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-10-15 15:40:11,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 234. [2018-10-15 15:40:11,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-10-15 15:40:11,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 234 transitions. [2018-10-15 15:40:11,728 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 234 transitions. Word has length 230 [2018-10-15 15:40:11,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:40:11,729 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 234 transitions. [2018-10-15 15:40:11,729 INFO L482 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-10-15 15:40:11,729 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 234 transitions. [2018-10-15 15:40:11,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-10-15 15:40:11,730 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:40:11,730 INFO L375 BasicCegarLoop]: trace histogram [75, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:40:11,730 INFO L424 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:40:11,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:40:11,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1844319002, now seen corresponding path program 74 times [2018-10-15 15:40:11,731 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:40:11,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:40:14,563 INFO L134 CoverageAnalysis]: Checked inductivity of 8251 backedges. 0 proven. 8251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:40:14,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:40:14,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-15 15:40:14,563 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-15 15:40:14,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-15 15:40:14,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 15:40:14,564 INFO L87 Difference]: Start difference. First operand 234 states and 234 transitions. Second operand 77 states. [2018-10-15 15:40:22,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:40:22,812 INFO L93 Difference]: Finished difference Result 238 states and 238 transitions. [2018-10-15 15:40:22,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-15 15:40:22,812 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 233 [2018-10-15 15:40:22,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:40:22,814 INFO L225 Difference]: With dead ends: 238 [2018-10-15 15:40:22,814 INFO L226 Difference]: Without dead ends: 238 [2018-10-15 15:40:22,814 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 15:40:22,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-10-15 15:40:22,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 237. [2018-10-15 15:40:22,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-10-15 15:40:22,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2018-10-15 15:40:22,817 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 233 [2018-10-15 15:40:22,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:40:22,817 INFO L481 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2018-10-15 15:40:22,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-15 15:40:22,817 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2018-10-15 15:40:22,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-10-15 15:40:22,818 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:40:22,818 INFO L375 BasicCegarLoop]: trace histogram [76, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:40:22,818 INFO L424 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:40:22,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:40:22,819 INFO L82 PathProgramCache]: Analyzing trace with hash 497756266, now seen corresponding path program 75 times [2018-10-15 15:40:22,819 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:40:22,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:40:25,849 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-15 15:40:25,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:40:25,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-10-15 15:40:25,850 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-15 15:40:25,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-15 15:40:25,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-10-15 15:40:25,851 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 78 states. [2018-10-15 15:40:34,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:40:34,323 INFO L93 Difference]: Finished difference Result 241 states and 241 transitions. [2018-10-15 15:40:34,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-15 15:40:34,323 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 236 [2018-10-15 15:40:34,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:40:34,325 INFO L225 Difference]: With dead ends: 241 [2018-10-15 15:40:34,325 INFO L226 Difference]: Without dead ends: 241 [2018-10-15 15:40:34,325 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-10-15 15:40:34,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-10-15 15:40:34,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 240. [2018-10-15 15:40:34,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-10-15 15:40:34,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 240 transitions. [2018-10-15 15:40:34,328 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 240 transitions. Word has length 236 [2018-10-15 15:40:34,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:40:34,328 INFO L481 AbstractCegarLoop]: Abstraction has 240 states and 240 transitions. [2018-10-15 15:40:34,328 INFO L482 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-15 15:40:34,328 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 240 transitions. [2018-10-15 15:40:34,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-10-15 15:40:34,334 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:40:34,335 INFO L375 BasicCegarLoop]: trace histogram [77, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:40:34,335 INFO L424 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:40:34,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:40:34,335 INFO L82 PathProgramCache]: Analyzing trace with hash 41832730, now seen corresponding path program 76 times [2018-10-15 15:40:34,336 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:40:34,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:40:37,389 INFO L134 CoverageAnalysis]: Checked inductivity of 8702 backedges. 0 proven. 8702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:40:37,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:40:37,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-15 15:40:37,389 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-15 15:40:37,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-15 15:40:37,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 15:40:37,390 INFO L87 Difference]: Start difference. First operand 240 states and 240 transitions. Second operand 79 states. [2018-10-15 15:40:45,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:40:45,880 INFO L93 Difference]: Finished difference Result 244 states and 244 transitions. [2018-10-15 15:40:45,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-15 15:40:45,881 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 239 [2018-10-15 15:40:45,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:40:45,882 INFO L225 Difference]: With dead ends: 244 [2018-10-15 15:40:45,882 INFO L226 Difference]: Without dead ends: 244 [2018-10-15 15:40:45,883 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 15:40:45,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-10-15 15:40:45,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 243. [2018-10-15 15:40:45,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-10-15 15:40:45,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 243 transitions. [2018-10-15 15:40:45,886 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 243 transitions. Word has length 239 [2018-10-15 15:40:45,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:40:45,886 INFO L481 AbstractCegarLoop]: Abstraction has 243 states and 243 transitions. [2018-10-15 15:40:45,886 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-15 15:40:45,887 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 243 transitions. [2018-10-15 15:40:45,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-10-15 15:40:45,888 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:40:45,888 INFO L375 BasicCegarLoop]: trace histogram [78, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:40:45,888 INFO L424 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:40:45,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:40:45,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1689638294, now seen corresponding path program 77 times [2018-10-15 15:40:45,889 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:40:45,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:40:48,974 INFO L134 CoverageAnalysis]: Checked inductivity of 8932 backedges. 0 proven. 8932 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:40:48,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:40:48,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-10-15 15:40:48,975 INFO L460 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-10-15 15:40:48,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-10-15 15:40:48,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-10-15 15:40:48,976 INFO L87 Difference]: Start difference. First operand 243 states and 243 transitions. Second operand 80 states. [2018-10-15 15:40:57,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:40:57,680 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2018-10-15 15:40:57,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-15 15:40:57,680 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 242 [2018-10-15 15:40:57,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:40:57,682 INFO L225 Difference]: With dead ends: 247 [2018-10-15 15:40:57,682 INFO L226 Difference]: Without dead ends: 247 [2018-10-15 15:40:57,682 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-10-15 15:40:57,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-10-15 15:40:57,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 246. [2018-10-15 15:40:57,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-10-15 15:40:57,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 246 transitions. [2018-10-15 15:40:57,685 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 246 transitions. Word has length 242 [2018-10-15 15:40:57,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:40:57,685 INFO L481 AbstractCegarLoop]: Abstraction has 246 states and 246 transitions. [2018-10-15 15:40:57,685 INFO L482 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-10-15 15:40:57,685 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 246 transitions. [2018-10-15 15:40:57,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-10-15 15:40:57,686 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:40:57,686 INFO L375 BasicCegarLoop]: trace histogram [79, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:40:57,686 INFO L424 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:40:57,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:40:57,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1385689318, now seen corresponding path program 78 times [2018-10-15 15:40:57,687 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:40:57,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:41:00,787 INFO L134 CoverageAnalysis]: Checked inductivity of 9165 backedges. 0 proven. 9165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:41:00,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:41:00,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-15 15:41:00,788 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-15 15:41:00,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-15 15:41:00,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 15:41:00,789 INFO L87 Difference]: Start difference. First operand 246 states and 246 transitions. Second operand 81 states. [2018-10-15 15:41:09,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:41:09,778 INFO L93 Difference]: Finished difference Result 250 states and 250 transitions. [2018-10-15 15:41:09,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-15 15:41:09,779 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 245 [2018-10-15 15:41:09,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:41:09,781 INFO L225 Difference]: With dead ends: 250 [2018-10-15 15:41:09,781 INFO L226 Difference]: Without dead ends: 250 [2018-10-15 15:41:09,781 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 15:41:09,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-10-15 15:41:09,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2018-10-15 15:41:09,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-10-15 15:41:09,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2018-10-15 15:41:09,784 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 245 [2018-10-15 15:41:09,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:41:09,784 INFO L481 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2018-10-15 15:41:09,784 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-15 15:41:09,784 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2018-10-15 15:41:09,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-10-15 15:41:09,785 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:41:09,785 INFO L375 BasicCegarLoop]: trace histogram [80, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:41:09,785 INFO L424 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:41:09,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:41:09,786 INFO L82 PathProgramCache]: Analyzing trace with hash -232805270, now seen corresponding path program 79 times [2018-10-15 15:41:09,786 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:41:09,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:41:13,089 INFO L134 CoverageAnalysis]: Checked inductivity of 9401 backedges. 0 proven. 9401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:41:13,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:41:13,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-10-15 15:41:13,090 INFO L460 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-10-15 15:41:13,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-10-15 15:41:13,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2018-10-15 15:41:13,090 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 82 states. [2018-10-15 15:41:22,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:41:22,141 INFO L93 Difference]: Finished difference Result 253 states and 253 transitions. [2018-10-15 15:41:22,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-15 15:41:22,142 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 248 [2018-10-15 15:41:22,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:41:22,143 INFO L225 Difference]: With dead ends: 253 [2018-10-15 15:41:22,143 INFO L226 Difference]: Without dead ends: 253 [2018-10-15 15:41:22,144 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2018-10-15 15:41:22,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-10-15 15:41:22,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 252. [2018-10-15 15:41:22,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-10-15 15:41:22,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 252 transitions. [2018-10-15 15:41:22,147 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 252 transitions. Word has length 248 [2018-10-15 15:41:22,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:41:22,147 INFO L481 AbstractCegarLoop]: Abstraction has 252 states and 252 transitions. [2018-10-15 15:41:22,147 INFO L482 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-10-15 15:41:22,148 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 252 transitions. [2018-10-15 15:41:22,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-10-15 15:41:22,148 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:41:22,149 INFO L375 BasicCegarLoop]: trace histogram [81, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:41:22,149 INFO L424 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:41:22,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:41:22,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1517597414, now seen corresponding path program 80 times [2018-10-15 15:41:22,150 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:41:22,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:41:25,543 INFO L134 CoverageAnalysis]: Checked inductivity of 9640 backedges. 0 proven. 9640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:41:25,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:41:25,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-15 15:41:25,543 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-15 15:41:25,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-15 15:41:25,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 15:41:25,544 INFO L87 Difference]: Start difference. First operand 252 states and 252 transitions. Second operand 83 states. [2018-10-15 15:41:34,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:41:34,777 INFO L93 Difference]: Finished difference Result 256 states and 256 transitions. [2018-10-15 15:41:34,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-10-15 15:41:34,778 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 251 [2018-10-15 15:41:34,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:41:34,780 INFO L225 Difference]: With dead ends: 256 [2018-10-15 15:41:34,780 INFO L226 Difference]: Without dead ends: 256 [2018-10-15 15:41:34,781 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 15:41:34,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-10-15 15:41:34,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 255. [2018-10-15 15:41:34,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-10-15 15:41:34,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 255 transitions. [2018-10-15 15:41:34,784 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 255 transitions. Word has length 251 [2018-10-15 15:41:34,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:41:34,784 INFO L481 AbstractCegarLoop]: Abstraction has 255 states and 255 transitions. [2018-10-15 15:41:34,784 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-15 15:41:34,784 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 255 transitions. [2018-10-15 15:41:34,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-10-15 15:41:34,785 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:41:34,785 INFO L375 BasicCegarLoop]: trace histogram [82, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:41:34,785 INFO L424 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:41:34,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:41:34,786 INFO L82 PathProgramCache]: Analyzing trace with hash -11817366, now seen corresponding path program 81 times [2018-10-15 15:41:34,786 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:41:34,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:41:38,219 INFO L134 CoverageAnalysis]: Checked inductivity of 9882 backedges. 0 proven. 9882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:41:38,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:41:38,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-10-15 15:41:38,220 INFO L460 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-10-15 15:41:38,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-10-15 15:41:38,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2018-10-15 15:41:38,220 INFO L87 Difference]: Start difference. First operand 255 states and 255 transitions. Second operand 84 states. [2018-10-15 15:41:47,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:41:47,662 INFO L93 Difference]: Finished difference Result 259 states and 259 transitions. [2018-10-15 15:41:47,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-15 15:41:47,662 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 254 [2018-10-15 15:41:47,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:41:47,664 INFO L225 Difference]: With dead ends: 259 [2018-10-15 15:41:47,664 INFO L226 Difference]: Without dead ends: 259 [2018-10-15 15:41:47,664 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2018-10-15 15:41:47,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-10-15 15:41:47,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 258. [2018-10-15 15:41:47,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-10-15 15:41:47,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 258 transitions. [2018-10-15 15:41:47,667 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 258 transitions. Word has length 254 [2018-10-15 15:41:47,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:41:47,668 INFO L481 AbstractCegarLoop]: Abstraction has 258 states and 258 transitions. [2018-10-15 15:41:47,668 INFO L482 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-10-15 15:41:47,668 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 258 transitions. [2018-10-15 15:41:47,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-10-15 15:41:47,669 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:41:47,669 INFO L375 BasicCegarLoop]: trace histogram [83, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:41:47,669 INFO L424 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:41:47,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:41:47,669 INFO L82 PathProgramCache]: Analyzing trace with hash 2043153178, now seen corresponding path program 82 times [2018-10-15 15:41:47,670 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:41:47,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:41:51,039 INFO L134 CoverageAnalysis]: Checked inductivity of 10127 backedges. 0 proven. 10127 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:41:51,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:41:51,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-15 15:41:51,040 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-15 15:41:51,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-15 15:41:51,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2018-10-15 15:41:51,041 INFO L87 Difference]: Start difference. First operand 258 states and 258 transitions. Second operand 85 states. [2018-10-15 15:42:00,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:42:00,771 INFO L93 Difference]: Finished difference Result 262 states and 262 transitions. [2018-10-15 15:42:00,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-15 15:42:00,772 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 257 [2018-10-15 15:42:00,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:42:00,773 INFO L225 Difference]: With dead ends: 262 [2018-10-15 15:42:00,773 INFO L226 Difference]: Without dead ends: 262 [2018-10-15 15:42:00,774 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2018-10-15 15:42:00,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-10-15 15:42:00,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 261. [2018-10-15 15:42:00,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-10-15 15:42:00,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2018-10-15 15:42:00,776 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 257 [2018-10-15 15:42:00,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:42:00,776 INFO L481 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2018-10-15 15:42:00,776 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-15 15:42:00,776 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2018-10-15 15:42:00,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-10-15 15:42:00,777 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:42:00,777 INFO L375 BasicCegarLoop]: trace histogram [84, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:42:00,778 INFO L424 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:42:00,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:42:00,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1206792298, now seen corresponding path program 83 times [2018-10-15 15:42:00,778 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:42:00,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:42:04,238 INFO L134 CoverageAnalysis]: Checked inductivity of 10375 backedges. 0 proven. 10375 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:42:04,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:42:04,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-10-15 15:42:04,239 INFO L460 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-10-15 15:42:04,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-10-15 15:42:04,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2018-10-15 15:42:04,239 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 86 states. [2018-10-15 15:42:14,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:42:14,228 INFO L93 Difference]: Finished difference Result 265 states and 265 transitions. [2018-10-15 15:42:14,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-10-15 15:42:14,229 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 260 [2018-10-15 15:42:14,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:42:14,230 INFO L225 Difference]: With dead ends: 265 [2018-10-15 15:42:14,230 INFO L226 Difference]: Without dead ends: 265 [2018-10-15 15:42:14,231 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2018-10-15 15:42:14,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-10-15 15:42:14,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 264. [2018-10-15 15:42:14,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-10-15 15:42:14,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 264 transitions. [2018-10-15 15:42:14,234 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 264 transitions. Word has length 260 [2018-10-15 15:42:14,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:42:14,234 INFO L481 AbstractCegarLoop]: Abstraction has 264 states and 264 transitions. [2018-10-15 15:42:14,235 INFO L482 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-10-15 15:42:14,235 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 264 transitions. [2018-10-15 15:42:14,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-10-15 15:42:14,235 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:42:14,236 INFO L375 BasicCegarLoop]: trace histogram [85, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:42:14,236 INFO L424 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:42:14,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:42:14,236 INFO L82 PathProgramCache]: Analyzing trace with hash 285100314, now seen corresponding path program 84 times [2018-10-15 15:42:14,237 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:42:14,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:42:17,783 INFO L134 CoverageAnalysis]: Checked inductivity of 10626 backedges. 0 proven. 10626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:42:17,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:42:17,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-15 15:42:17,783 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-15 15:42:17,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-15 15:42:17,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 15:42:17,784 INFO L87 Difference]: Start difference. First operand 264 states and 264 transitions. Second operand 87 states. [2018-10-15 15:42:28,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:42:28,013 INFO L93 Difference]: Finished difference Result 268 states and 268 transitions. [2018-10-15 15:42:28,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-15 15:42:28,013 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 263 [2018-10-15 15:42:28,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:42:28,015 INFO L225 Difference]: With dead ends: 268 [2018-10-15 15:42:28,015 INFO L226 Difference]: Without dead ends: 268 [2018-10-15 15:42:28,015 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 15:42:28,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-10-15 15:42:28,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 267. [2018-10-15 15:42:28,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-10-15 15:42:28,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 267 transitions. [2018-10-15 15:42:28,019 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 267 transitions. Word has length 263 [2018-10-15 15:42:28,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:42:28,019 INFO L481 AbstractCegarLoop]: Abstraction has 267 states and 267 transitions. [2018-10-15 15:42:28,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-15 15:42:28,019 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 267 transitions. [2018-10-15 15:42:28,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-10-15 15:42:28,020 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:42:28,021 INFO L375 BasicCegarLoop]: trace histogram [86, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:42:28,021 INFO L424 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:42:28,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:42:28,021 INFO L82 PathProgramCache]: Analyzing trace with hash -114871702, now seen corresponding path program 85 times [2018-10-15 15:42:28,022 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:42:28,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:42:31,671 INFO L134 CoverageAnalysis]: Checked inductivity of 10880 backedges. 0 proven. 10880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:42:31,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:42:31,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-10-15 15:42:31,672 INFO L460 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-10-15 15:42:31,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-10-15 15:42:31,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2018-10-15 15:42:31,672 INFO L87 Difference]: Start difference. First operand 267 states and 267 transitions. Second operand 88 states. [2018-10-15 15:42:42,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:42:42,167 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions. [2018-10-15 15:42:42,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-15 15:42:42,168 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 266 [2018-10-15 15:42:42,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:42:42,169 INFO L225 Difference]: With dead ends: 271 [2018-10-15 15:42:42,170 INFO L226 Difference]: Without dead ends: 271 [2018-10-15 15:42:42,170 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2018-10-15 15:42:42,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-10-15 15:42:42,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 270. [2018-10-15 15:42:42,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-10-15 15:42:42,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 270 transitions. [2018-10-15 15:42:42,173 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 270 transitions. Word has length 266 [2018-10-15 15:42:42,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:42:42,174 INFO L481 AbstractCegarLoop]: Abstraction has 270 states and 270 transitions. [2018-10-15 15:42:42,174 INFO L482 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-10-15 15:42:42,174 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 270 transitions. [2018-10-15 15:42:42,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-10-15 15:42:42,175 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:42:42,175 INFO L375 BasicCegarLoop]: trace histogram [87, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:42:42,175 INFO L424 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:42:42,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:42:42,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1441921254, now seen corresponding path program 86 times [2018-10-15 15:42:42,176 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:42:42,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:42:45,915 INFO L134 CoverageAnalysis]: Checked inductivity of 11137 backedges. 0 proven. 11137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:42:45,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:42:45,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-15 15:42:45,916 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-15 15:42:45,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-15 15:42:45,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2018-10-15 15:42:45,917 INFO L87 Difference]: Start difference. First operand 270 states and 270 transitions. Second operand 89 states. [2018-10-15 15:42:56,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:42:56,634 INFO L93 Difference]: Finished difference Result 274 states and 274 transitions. [2018-10-15 15:42:56,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-10-15 15:42:56,634 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 269 [2018-10-15 15:42:56,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:42:56,636 INFO L225 Difference]: With dead ends: 274 [2018-10-15 15:42:56,636 INFO L226 Difference]: Without dead ends: 274 [2018-10-15 15:42:56,636 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2018-10-15 15:42:56,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-10-15 15:42:56,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 273. [2018-10-15 15:42:56,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-10-15 15:42:56,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2018-10-15 15:42:56,639 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 269 [2018-10-15 15:42:56,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:42:56,639 INFO L481 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2018-10-15 15:42:56,639 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-15 15:42:56,639 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2018-10-15 15:42:56,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-10-15 15:42:56,640 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:42:56,640 INFO L375 BasicCegarLoop]: trace histogram [88, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:42:56,640 INFO L424 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:42:56,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:42:56,640 INFO L82 PathProgramCache]: Analyzing trace with hash -401165206, now seen corresponding path program 87 times [2018-10-15 15:42:56,641 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:42:56,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:43:00,436 INFO L134 CoverageAnalysis]: Checked inductivity of 11397 backedges. 0 proven. 11397 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:43:00,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:43:00,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-10-15 15:43:00,436 INFO L460 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-10-15 15:43:00,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-10-15 15:43:00,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=7833, Unknown=0, NotChecked=0, Total=8010 [2018-10-15 15:43:00,437 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 90 states. [2018-10-15 15:43:11,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:43:11,313 INFO L93 Difference]: Finished difference Result 277 states and 277 transitions. [2018-10-15 15:43:11,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-15 15:43:11,314 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 272 [2018-10-15 15:43:11,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:43:11,315 INFO L225 Difference]: With dead ends: 277 [2018-10-15 15:43:11,315 INFO L226 Difference]: Without dead ends: 277 [2018-10-15 15:43:11,316 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=177, Invalid=7833, Unknown=0, NotChecked=0, Total=8010 [2018-10-15 15:43:11,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-10-15 15:43:11,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 276. [2018-10-15 15:43:11,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-10-15 15:43:11,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 276 transitions. [2018-10-15 15:43:11,318 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 276 transitions. Word has length 272 [2018-10-15 15:43:11,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:43:11,318 INFO L481 AbstractCegarLoop]: Abstraction has 276 states and 276 transitions. [2018-10-15 15:43:11,318 INFO L482 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-10-15 15:43:11,319 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 276 transitions. [2018-10-15 15:43:11,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-10-15 15:43:11,319 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:43:11,319 INFO L375 BasicCegarLoop]: trace histogram [89, 88, 88, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:43:11,320 INFO L424 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:43:11,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:43:11,320 INFO L82 PathProgramCache]: Analyzing trace with hash -606649062, now seen corresponding path program 88 times [2018-10-15 15:43:11,320 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:43:11,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:43:15,234 INFO L134 CoverageAnalysis]: Checked inductivity of 11660 backedges. 0 proven. 11660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:43:15,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:43:15,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-15 15:43:15,235 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-15 15:43:15,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-15 15:43:15,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=8011, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 15:43:15,236 INFO L87 Difference]: Start difference. First operand 276 states and 276 transitions. Second operand 91 states. [2018-10-15 15:43:26,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:43:26,325 INFO L93 Difference]: Finished difference Result 280 states and 280 transitions. [2018-10-15 15:43:26,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-10-15 15:43:26,326 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 275 [2018-10-15 15:43:26,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:43:26,328 INFO L225 Difference]: With dead ends: 280 [2018-10-15 15:43:26,328 INFO L226 Difference]: Without dead ends: 280 [2018-10-15 15:43:26,328 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=179, Invalid=8011, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 15:43:26,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-10-15 15:43:26,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 279. [2018-10-15 15:43:26,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-10-15 15:43:26,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 279 transitions. [2018-10-15 15:43:26,330 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 279 transitions. Word has length 275 [2018-10-15 15:43:26,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:43:26,330 INFO L481 AbstractCegarLoop]: Abstraction has 279 states and 279 transitions. [2018-10-15 15:43:26,330 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-15 15:43:26,331 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 279 transitions. [2018-10-15 15:43:26,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-10-15 15:43:26,331 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:43:26,332 INFO L375 BasicCegarLoop]: trace histogram [90, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:43:26,332 INFO L424 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:43:26,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:43:26,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1847806358, now seen corresponding path program 89 times [2018-10-15 15:43:26,333 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:43:26,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:43:30,308 INFO L134 CoverageAnalysis]: Checked inductivity of 11926 backedges. 0 proven. 11926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:43:30,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:43:30,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-10-15 15:43:30,308 INFO L460 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-10-15 15:43:30,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-10-15 15:43:30,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=8191, Unknown=0, NotChecked=0, Total=8372 [2018-10-15 15:43:30,309 INFO L87 Difference]: Start difference. First operand 279 states and 279 transitions. Second operand 92 states.