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/count_by_2.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d769cf3 [2018-10-15 15:23:32,578 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 15:23:32,580 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 15:23:32,592 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 15:23:32,593 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 15:23:32,594 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 15:23:32,595 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 15:23:32,597 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 15:23:32,599 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 15:23:32,600 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 15:23:32,601 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 15:23:32,602 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 15:23:32,603 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 15:23:32,604 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 15:23:32,605 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 15:23:32,606 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 15:23:32,607 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 15:23:32,609 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 15:23:32,611 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 15:23:32,613 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 15:23:32,614 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 15:23:32,616 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 15:23:32,619 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 15:23:32,619 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 15:23:32,619 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 15:23:32,620 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 15:23:32,621 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 15:23:32,622 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 15:23:32,623 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 15:23:32,625 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 15:23:32,625 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 15:23:32,626 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 15:23:32,626 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 15:23:32,626 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 15:23:32,628 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 15:23:32,628 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 15:23:32,629 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:23:32,639 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 15:23:32,640 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 15:23:32,641 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 15:23:32,641 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 15:23:32,644 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 15:23:32,644 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 15:23:32,645 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 15:23:32,645 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 15:23:32,645 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 15:23:32,646 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 15:23:32,646 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 15:23:32,646 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 15:23:32,646 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 15:23:32,647 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 15:23:32,648 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 15:23:32,697 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 15:23:32,710 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 15:23:32,714 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 15:23:32,716 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 15:23:32,716 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 15:23:32,717 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/count_by_2.i_3.bpl [2018-10-15 15:23:32,717 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/count_by_2.i_3.bpl' [2018-10-15 15:23:32,768 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 15:23:32,770 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-15 15:23:32,771 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 15:23:32,771 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 15:23:32,771 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 15:23:32,800 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "count_by_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:23:32" (1/1) ... [2018-10-15 15:23:32,803 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "count_by_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:23:32" (1/1) ... [2018-10-15 15:23:32,814 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "count_by_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:23:32" (1/1) ... [2018-10-15 15:23:32,814 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "count_by_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:23:32" (1/1) ... [2018-10-15 15:23:32,819 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "count_by_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:23:32" (1/1) ... [2018-10-15 15:23:32,822 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "count_by_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:23:32" (1/1) ... [2018-10-15 15:23:32,823 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "count_by_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:23:32" (1/1) ... [2018-10-15 15:23:32,824 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 15:23:32,825 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 15:23:32,828 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 15:23:32,829 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 15:23:32,830 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "count_by_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:23:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-15 15:23:32,916 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 15:23:32,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 15:23:33,098 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 15:23:33,098 INFO L202 PluginConnector]: Adding new model count_by_2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:23:33 BoogieIcfgContainer [2018-10-15 15:23:33,099 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 15:23:33,099 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-15 15:23:33,099 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-15 15:23:33,101 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-15 15:23:33,104 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "count_by_2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:23:33" (1/1) ... [2018-10-15 15:23:33,109 WARN L219 ansformationObserver]: HeapSeparator: input icfg has no '#valid' array -- returning unchanged Icfg! [2018-10-15 15:23:33,127 INFO L202 PluginConnector]: Adding new model count_by_2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 03:23:33 BasicIcfg [2018-10-15 15:23:33,127 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-15 15:23:33,128 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 15:23:33,128 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 15:23:33,133 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 15:23:33,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "count_by_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:23:32" (1/3) ... [2018-10-15 15:23:33,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20cf2e26 and model type count_by_2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:23:33, skipping insertion in model container [2018-10-15 15:23:33,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "count_by_2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:23:33" (2/3) ... [2018-10-15 15:23:33,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20cf2e26 and model type count_by_2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:23:33, skipping insertion in model container [2018-10-15 15:23:33,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "count_by_2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 03:23:33" (3/3) ... [2018-10-15 15:23:33,138 INFO L112 eAbstractionObserver]: Analyzing ICFG count_by_2.i_3.bplleft_unchanged_by_heapseparator [2018-10-15 15:23:33,148 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 15:23:33,158 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 15:23:33,175 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 15:23:33,203 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 15:23:33,203 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 15:23:33,204 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 15:23:33,204 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 15:23:33,204 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 15:23:33,204 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 15:23:33,204 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 15:23:33,205 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 15:23:33,205 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 15:23:33,219 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2018-10-15 15:23:33,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-15 15:23:33,228 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:33,229 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:33,230 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:33,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:33,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1370752216, now seen corresponding path program 1 times [2018-10-15 15:23:33,288 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:33,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:33,383 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:23:33,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:23:33,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:23:33,390 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:23:33,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:23:33,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:23:33,407 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 3 states. [2018-10-15 15:23:33,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:33,505 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-10-15 15:23:33,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:23:33,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-10-15 15:23:33,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:33,525 INFO L225 Difference]: With dead ends: 17 [2018-10-15 15:23:33,525 INFO L226 Difference]: Without dead ends: 17 [2018-10-15 15:23:33,538 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 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:23:33,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-10-15 15:23:33,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2018-10-15 15:23:33,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-15 15:23:33,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-10-15 15:23:33,605 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 12 [2018-10-15 15:23:33,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:33,606 INFO L481 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-10-15 15:23:33,606 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:23:33,606 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-10-15 15:23:33,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-15 15:23:33,607 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:33,607 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:33,607 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:33,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:33,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1918196386, now seen corresponding path program 1 times [2018-10-15 15:23:33,609 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:33,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:33,676 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:23:33,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:33,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-10-15 15:23:33,680 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-15 15:23:33,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-15 15:23:33,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-15 15:23:33,681 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 4 states. [2018-10-15 15:23:33,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:33,845 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-10-15 15:23:33,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-15 15:23:33,846 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-10-15 15:23:33,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:33,847 INFO L225 Difference]: With dead ends: 20 [2018-10-15 15:23:33,847 INFO L226 Difference]: Without dead ends: 20 [2018-10-15 15:23:33,848 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-15 15:23:33,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-10-15 15:23:33,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-10-15 15:23:33,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-15 15:23:33,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-10-15 15:23:33,852 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 15 [2018-10-15 15:23:33,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:33,853 INFO L481 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-10-15 15:23:33,853 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-15 15:23:33,853 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-10-15 15:23:33,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-15 15:23:33,854 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:33,854 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:33,854 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:33,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:33,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1458325352, now seen corresponding path program 2 times [2018-10-15 15:23:33,856 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:33,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:34,018 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:23:34,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:34,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-15 15:23:34,019 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 15:23:34,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 15:23:34,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-15 15:23:34,020 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 5 states. [2018-10-15 15:23:34,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:34,107 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-10-15 15:23:34,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-15 15:23:34,109 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-10-15 15:23:34,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:34,111 INFO L225 Difference]: With dead ends: 23 [2018-10-15 15:23:34,111 INFO L226 Difference]: Without dead ends: 23 [2018-10-15 15:23:34,111 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-15 15:23:34,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-15 15:23:34,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-10-15 15:23:34,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-15 15:23:34,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-10-15 15:23:34,119 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 18 [2018-10-15 15:23:34,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:34,120 INFO L481 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-10-15 15:23:34,120 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 15:23:34,120 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-10-15 15:23:34,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-15 15:23:34,121 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:34,121 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:34,121 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:34,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:34,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1011617506, now seen corresponding path program 3 times [2018-10-15 15:23:34,123 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:34,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:34,334 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:23:34,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:34,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-15 15:23:34,335 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-15 15:23:34,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-15 15:23:34,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-15 15:23:34,336 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 6 states. [2018-10-15 15:23:34,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:34,578 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-10-15 15:23:34,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-15 15:23:34,578 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-10-15 15:23:34,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:34,579 INFO L225 Difference]: With dead ends: 26 [2018-10-15 15:23:34,580 INFO L226 Difference]: Without dead ends: 26 [2018-10-15 15:23:34,580 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-15 15:23:34,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-10-15 15:23:34,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-10-15 15:23:34,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-15 15:23:34,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-10-15 15:23:34,585 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 21 [2018-10-15 15:23:34,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:34,585 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-10-15 15:23:34,585 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-15 15:23:34,586 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-10-15 15:23:34,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-15 15:23:34,586 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:34,587 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:34,588 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:34,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:34,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1699585112, now seen corresponding path program 4 times [2018-10-15 15:23:34,590 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:34,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:34,716 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:23:34,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:34,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-15 15:23:34,718 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 15:23:34,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 15:23:34,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-15 15:23:34,719 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 7 states. [2018-10-15 15:23:34,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:34,807 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-10-15 15:23:34,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-15 15:23:34,811 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-10-15 15:23:34,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:34,812 INFO L225 Difference]: With dead ends: 29 [2018-10-15 15:23:34,812 INFO L226 Difference]: Without dead ends: 29 [2018-10-15 15:23:34,813 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-15 15:23:34,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-15 15:23:34,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-10-15 15:23:34,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-15 15:23:34,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-10-15 15:23:34,819 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 24 [2018-10-15 15:23:34,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:34,819 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-10-15 15:23:34,820 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 15:23:34,821 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-10-15 15:23:34,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-15 15:23:34,822 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:34,822 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:34,822 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:34,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:34,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1358598946, now seen corresponding path program 5 times [2018-10-15 15:23:34,824 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:34,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:35,047 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:23:35,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:35,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-15 15:23:35,048 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-15 15:23:35,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-15 15:23:35,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-15 15:23:35,049 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 8 states. [2018-10-15 15:23:35,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:35,120 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-10-15 15:23:35,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-15 15:23:35,125 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-10-15 15:23:35,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:35,126 INFO L225 Difference]: With dead ends: 32 [2018-10-15 15:23:35,126 INFO L226 Difference]: Without dead ends: 32 [2018-10-15 15:23:35,127 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-15 15:23:35,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-10-15 15:23:35,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-10-15 15:23:35,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-15 15:23:35,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-10-15 15:23:35,131 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 27 [2018-10-15 15:23:35,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:35,132 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-10-15 15:23:35,132 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-15 15:23:35,132 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-10-15 15:23:35,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-15 15:23:35,133 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:35,133 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:35,134 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:35,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:35,134 INFO L82 PathProgramCache]: Analyzing trace with hash -637382680, now seen corresponding path program 6 times [2018-10-15 15:23:35,135 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:35,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:35,265 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:23:35,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:35,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 15:23:35,266 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 15:23:35,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 15:23:35,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-15 15:23:35,267 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 9 states. [2018-10-15 15:23:35,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:35,455 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-10-15 15:23:35,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-15 15:23:35,455 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-10-15 15:23:35,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:35,456 INFO L225 Difference]: With dead ends: 35 [2018-10-15 15:23:35,456 INFO L226 Difference]: Without dead ends: 35 [2018-10-15 15:23:35,457 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-15 15:23:35,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-15 15:23:35,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-10-15 15:23:35,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-15 15:23:35,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-10-15 15:23:35,466 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 30 [2018-10-15 15:23:35,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:35,467 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-10-15 15:23:35,468 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 15:23:35,468 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-10-15 15:23:35,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-15 15:23:35,469 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:35,469 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:35,469 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:35,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:35,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1689983134, now seen corresponding path program 7 times [2018-10-15 15:23:35,474 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:35,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:35,760 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:23:35,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:35,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-15 15:23:35,761 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-15 15:23:35,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-15 15:23:35,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-15 15:23:35,762 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 10 states. [2018-10-15 15:23:35,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:35,843 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-10-15 15:23:35,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-15 15:23:35,844 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2018-10-15 15:23:35,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:35,845 INFO L225 Difference]: With dead ends: 38 [2018-10-15 15:23:35,846 INFO L226 Difference]: Without dead ends: 38 [2018-10-15 15:23:35,846 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-15 15:23:35,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-10-15 15:23:35,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-10-15 15:23:35,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-15 15:23:35,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-10-15 15:23:35,851 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 33 [2018-10-15 15:23:35,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:35,852 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-10-15 15:23:35,852 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-15 15:23:35,852 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-10-15 15:23:35,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-15 15:23:35,853 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:35,853 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:35,853 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:35,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:35,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1707078616, now seen corresponding path program 8 times [2018-10-15 15:23:35,855 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:35,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:36,014 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:23:36,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:36,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 15:23:36,016 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 15:23:36,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 15:23:36,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-15 15:23:36,017 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 11 states. [2018-10-15 15:23:36,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:36,198 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-10-15 15:23:36,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-15 15:23:36,200 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2018-10-15 15:23:36,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:36,204 INFO L225 Difference]: With dead ends: 41 [2018-10-15 15:23:36,204 INFO L226 Difference]: Without dead ends: 41 [2018-10-15 15:23:36,205 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-15 15:23:36,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-15 15:23:36,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-10-15 15:23:36,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-15 15:23:36,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-10-15 15:23:36,215 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 36 [2018-10-15 15:23:36,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:36,216 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-10-15 15:23:36,216 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 15:23:36,216 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-10-15 15:23:36,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-15 15:23:36,217 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:36,217 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:36,218 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:36,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:36,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1259277218, now seen corresponding path program 9 times [2018-10-15 15:23:36,221 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:36,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:36,509 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:23:36,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:36,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-15 15:23:36,510 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-15 15:23:36,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-15 15:23:36,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-10-15 15:23:36,512 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 12 states. [2018-10-15 15:23:36,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:36,674 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-10-15 15:23:36,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-15 15:23:36,675 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2018-10-15 15:23:36,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:36,677 INFO L225 Difference]: With dead ends: 44 [2018-10-15 15:23:36,677 INFO L226 Difference]: Without dead ends: 44 [2018-10-15 15:23:36,678 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-10-15 15:23:36,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-15 15:23:36,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2018-10-15 15:23:36,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-15 15:23:36,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-10-15 15:23:36,683 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 39 [2018-10-15 15:23:36,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:36,683 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-10-15 15:23:36,683 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-15 15:23:36,683 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-10-15 15:23:36,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-15 15:23:36,684 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:36,685 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:36,685 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:36,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:36,685 INFO L82 PathProgramCache]: Analyzing trace with hash -976250776, now seen corresponding path program 10 times [2018-10-15 15:23:36,686 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:36,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:36,923 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:23:36,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:36,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 15:23:36,924 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 15:23:36,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 15:23:36,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-10-15 15:23:36,925 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 13 states. [2018-10-15 15:23:36,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:36,990 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-10-15 15:23:36,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-15 15:23:36,991 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 42 [2018-10-15 15:23:36,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:36,992 INFO L225 Difference]: With dead ends: 47 [2018-10-15 15:23:36,992 INFO L226 Difference]: Without dead ends: 47 [2018-10-15 15:23:36,993 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-10-15 15:23:36,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-15 15:23:36,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-10-15 15:23:36,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-15 15:23:36,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-10-15 15:23:36,997 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 42 [2018-10-15 15:23:36,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:36,998 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-10-15 15:23:36,998 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 15:23:36,998 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-10-15 15:23:36,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-15 15:23:36,999 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:36,999 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:36,999 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:37,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:37,000 INFO L82 PathProgramCache]: Analyzing trace with hash -356319202, now seen corresponding path program 11 times [2018-10-15 15:23:37,001 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:37,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:37,269 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:23:37,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:37,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-15 15:23:37,270 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-15 15:23:37,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-15 15:23:37,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-10-15 15:23:37,271 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 14 states. [2018-10-15 15:23:37,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:37,360 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-10-15 15:23:37,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-15 15:23:37,361 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 45 [2018-10-15 15:23:37,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:37,362 INFO L225 Difference]: With dead ends: 50 [2018-10-15 15:23:37,362 INFO L226 Difference]: Without dead ends: 50 [2018-10-15 15:23:37,363 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-10-15 15:23:37,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-15 15:23:37,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-10-15 15:23:37,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-15 15:23:37,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-10-15 15:23:37,370 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 45 [2018-10-15 15:23:37,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:37,370 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-10-15 15:23:37,371 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-15 15:23:37,371 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-10-15 15:23:37,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-15 15:23:37,372 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:37,372 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:37,372 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:37,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:37,373 INFO L82 PathProgramCache]: Analyzing trace with hash -334170968, now seen corresponding path program 12 times [2018-10-15 15:23:37,374 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:37,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:37,763 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:23:37,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:37,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 15:23:37,764 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 15:23:37,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 15:23:37,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-10-15 15:23:37,765 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 15 states. [2018-10-15 15:23:37,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:37,863 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-10-15 15:23:37,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-15 15:23:37,864 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 48 [2018-10-15 15:23:37,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:37,865 INFO L225 Difference]: With dead ends: 53 [2018-10-15 15:23:37,865 INFO L226 Difference]: Without dead ends: 53 [2018-10-15 15:23:37,866 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-10-15 15:23:37,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-15 15:23:37,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2018-10-15 15:23:37,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-15 15:23:37,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-10-15 15:23:37,870 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 48 [2018-10-15 15:23:37,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:37,871 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-10-15 15:23:37,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 15:23:37,871 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-10-15 15:23:37,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-15 15:23:37,872 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:37,872 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:37,872 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:37,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:37,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1941095458, now seen corresponding path program 13 times [2018-10-15 15:23:37,874 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:37,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:38,091 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:23:38,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:38,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-15 15:23:38,092 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-15 15:23:38,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-15 15:23:38,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-10-15 15:23:38,093 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 16 states. [2018-10-15 15:23:38,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:38,187 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-10-15 15:23:38,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-15 15:23:38,192 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 51 [2018-10-15 15:23:38,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:38,193 INFO L225 Difference]: With dead ends: 56 [2018-10-15 15:23:38,193 INFO L226 Difference]: Without dead ends: 56 [2018-10-15 15:23:38,194 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-10-15 15:23:38,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-10-15 15:23:38,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2018-10-15 15:23:38,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-15 15:23:38,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-10-15 15:23:38,198 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 51 [2018-10-15 15:23:38,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:38,199 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-10-15 15:23:38,199 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-15 15:23:38,199 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-10-15 15:23:38,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-15 15:23:38,200 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:38,200 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:38,201 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:38,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:38,201 INFO L82 PathProgramCache]: Analyzing trace with hash -2123095832, now seen corresponding path program 14 times [2018-10-15 15:23:38,202 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:38,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:38,421 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:23:38,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:38,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 15:23:38,422 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 15:23:38,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 15:23:38,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-10-15 15:23:38,423 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 17 states. [2018-10-15 15:23:38,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:38,545 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-10-15 15:23:38,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-15 15:23:38,546 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2018-10-15 15:23:38,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:38,547 INFO L225 Difference]: With dead ends: 59 [2018-10-15 15:23:38,547 INFO L226 Difference]: Without dead ends: 59 [2018-10-15 15:23:38,548 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-10-15 15:23:38,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-15 15:23:38,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2018-10-15 15:23:38,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-10-15 15:23:38,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-10-15 15:23:38,553 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 54 [2018-10-15 15:23:38,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:38,554 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-10-15 15:23:38,554 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 15:23:38,554 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-10-15 15:23:38,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-15 15:23:38,555 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:38,555 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:38,556 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:38,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:38,556 INFO L82 PathProgramCache]: Analyzing trace with hash 447457182, now seen corresponding path program 15 times [2018-10-15 15:23:38,557 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:38,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:38,843 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:23:38,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:38,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-15 15:23:38,844 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-15 15:23:38,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-15 15:23:38,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-10-15 15:23:38,845 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 18 states. [2018-10-15 15:23:38,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:38,998 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-10-15 15:23:38,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-15 15:23:38,998 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 57 [2018-10-15 15:23:38,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:38,999 INFO L225 Difference]: With dead ends: 62 [2018-10-15 15:23:38,999 INFO L226 Difference]: Without dead ends: 62 [2018-10-15 15:23:39,000 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-10-15 15:23:39,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-10-15 15:23:39,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-10-15 15:23:39,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-15 15:23:39,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-10-15 15:23:39,004 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 57 [2018-10-15 15:23:39,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:39,004 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-10-15 15:23:39,005 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-15 15:23:39,005 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-10-15 15:23:39,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-15 15:23:39,006 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:39,006 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:39,006 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:39,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:39,007 INFO L82 PathProgramCache]: Analyzing trace with hash 525409576, now seen corresponding path program 16 times [2018-10-15 15:23:39,007 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:39,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:39,668 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:23:39,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:39,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 15:23:39,669 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 15:23:39,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 15:23:39,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-10-15 15:23:39,670 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 19 states. [2018-10-15 15:23:40,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:40,029 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-10-15 15:23:40,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-15 15:23:40,032 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2018-10-15 15:23:40,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:40,033 INFO L225 Difference]: With dead ends: 65 [2018-10-15 15:23:40,033 INFO L226 Difference]: Without dead ends: 65 [2018-10-15 15:23:40,034 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-10-15 15:23:40,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-15 15:23:40,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2018-10-15 15:23:40,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-10-15 15:23:40,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-10-15 15:23:40,038 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 60 [2018-10-15 15:23:40,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:40,039 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-10-15 15:23:40,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 15:23:40,039 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-10-15 15:23:40,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-15 15:23:40,040 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:40,040 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:40,040 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:40,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:40,041 INFO L82 PathProgramCache]: Analyzing trace with hash -772127906, now seen corresponding path program 17 times [2018-10-15 15:23:40,041 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:40,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:40,373 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:23:40,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:40,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-15 15:23:40,373 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-15 15:23:40,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-15 15:23:40,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-10-15 15:23:40,374 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 20 states. [2018-10-15 15:23:40,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:40,449 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-10-15 15:23:40,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-15 15:23:40,450 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 63 [2018-10-15 15:23:40,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:40,451 INFO L225 Difference]: With dead ends: 68 [2018-10-15 15:23:40,451 INFO L226 Difference]: Without dead ends: 68 [2018-10-15 15:23:40,452 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-10-15 15:23:40,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-10-15 15:23:40,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2018-10-15 15:23:40,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-15 15:23:40,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-10-15 15:23:40,456 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 63 [2018-10-15 15:23:40,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:40,456 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-10-15 15:23:40,456 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-15 15:23:40,456 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-10-15 15:23:40,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-15 15:23:40,457 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:40,457 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:40,457 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:40,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:40,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1005590168, now seen corresponding path program 18 times [2018-10-15 15:23:40,459 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:40,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:40,755 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:23:40,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:40,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 15:23:40,756 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 15:23:40,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 15:23:40,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-10-15 15:23:40,757 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 21 states. [2018-10-15 15:23:40,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:40,980 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-10-15 15:23:40,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-15 15:23:40,980 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 66 [2018-10-15 15:23:40,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:40,981 INFO L225 Difference]: With dead ends: 71 [2018-10-15 15:23:40,981 INFO L226 Difference]: Without dead ends: 71 [2018-10-15 15:23:40,982 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-10-15 15:23:40,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-10-15 15:23:40,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2018-10-15 15:23:40,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-10-15 15:23:40,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-10-15 15:23:40,987 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 66 [2018-10-15 15:23:40,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:40,987 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-10-15 15:23:40,987 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 15:23:40,987 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-10-15 15:23:40,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-10-15 15:23:40,990 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:40,991 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:40,991 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:40,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:40,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1767182110, now seen corresponding path program 19 times [2018-10-15 15:23:40,992 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:41,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:41,353 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:23:41,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:41,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-15 15:23:41,354 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-15 15:23:41,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-15 15:23:41,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-10-15 15:23:41,355 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 22 states. [2018-10-15 15:23:41,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:41,416 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-10-15 15:23:41,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-15 15:23:41,417 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 69 [2018-10-15 15:23:41,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:41,418 INFO L225 Difference]: With dead ends: 74 [2018-10-15 15:23:41,418 INFO L226 Difference]: Without dead ends: 74 [2018-10-15 15:23:41,419 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-10-15 15:23:41,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-15 15:23:41,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-10-15 15:23:41,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-15 15:23:41,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-10-15 15:23:41,422 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 69 [2018-10-15 15:23:41,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:41,422 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-10-15 15:23:41,422 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-15 15:23:41,422 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-10-15 15:23:41,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-15 15:23:41,423 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:41,423 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:41,423 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:41,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:41,424 INFO L82 PathProgramCache]: Analyzing trace with hash 320112040, now seen corresponding path program 20 times [2018-10-15 15:23:41,425 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:41,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:41,697 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:23:41,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:41,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 15:23:41,698 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 15:23:41,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 15:23:41,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-10-15 15:23:41,698 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 23 states. [2018-10-15 15:23:41,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:41,817 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-10-15 15:23:41,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-15 15:23:41,817 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 72 [2018-10-15 15:23:41,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:41,818 INFO L225 Difference]: With dead ends: 77 [2018-10-15 15:23:41,819 INFO L226 Difference]: Without dead ends: 77 [2018-10-15 15:23:41,819 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-10-15 15:23:41,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-10-15 15:23:41,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2018-10-15 15:23:41,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-15 15:23:41,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-10-15 15:23:41,823 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 72 [2018-10-15 15:23:41,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:41,823 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-10-15 15:23:41,823 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 15:23:41,823 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-10-15 15:23:41,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-15 15:23:41,824 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:41,824 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:41,824 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:41,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:41,825 INFO L82 PathProgramCache]: Analyzing trace with hash -757593378, now seen corresponding path program 21 times [2018-10-15 15:23:41,825 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:41,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:42,100 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:23:42,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:42,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-15 15:23:42,101 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-15 15:23:42,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-15 15:23:42,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-10-15 15:23:42,102 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 24 states. [2018-10-15 15:23:42,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:42,264 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-10-15 15:23:42,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-15 15:23:42,267 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 75 [2018-10-15 15:23:42,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:42,268 INFO L225 Difference]: With dead ends: 80 [2018-10-15 15:23:42,268 INFO L226 Difference]: Without dead ends: 80 [2018-10-15 15:23:42,268 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-10-15 15:23:42,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-10-15 15:23:42,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2018-10-15 15:23:42,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-10-15 15:23:42,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-10-15 15:23:42,271 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 75 [2018-10-15 15:23:42,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:42,271 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-10-15 15:23:42,271 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-15 15:23:42,271 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-10-15 15:23:42,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-15 15:23:42,272 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:42,272 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:42,272 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:42,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:42,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1799163416, now seen corresponding path program 22 times [2018-10-15 15:23:42,273 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:42,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:43,015 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:23:43,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:43,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 15:23:43,016 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 15:23:43,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 15:23:43,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-10-15 15:23:43,016 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 25 states. [2018-10-15 15:23:43,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:43,140 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-10-15 15:23:43,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-15 15:23:43,140 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 78 [2018-10-15 15:23:43,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:43,141 INFO L225 Difference]: With dead ends: 83 [2018-10-15 15:23:43,141 INFO L226 Difference]: Without dead ends: 83 [2018-10-15 15:23:43,142 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-10-15 15:23:43,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-10-15 15:23:43,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2018-10-15 15:23:43,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-10-15 15:23:43,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-10-15 15:23:43,144 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 78 [2018-10-15 15:23:43,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:43,145 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-10-15 15:23:43,145 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 15:23:43,145 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-10-15 15:23:43,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-10-15 15:23:43,145 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:43,146 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:43,146 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:43,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:43,146 INFO L82 PathProgramCache]: Analyzing trace with hash -73451874, now seen corresponding path program 23 times [2018-10-15 15:23:43,147 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:43,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:44,201 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:23:44,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:44,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-15 15:23:44,202 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-15 15:23:44,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-15 15:23:44,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-10-15 15:23:44,203 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 26 states. [2018-10-15 15:23:44,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:44,399 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-10-15 15:23:44,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-15 15:23:44,399 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 81 [2018-10-15 15:23:44,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:44,400 INFO L225 Difference]: With dead ends: 86 [2018-10-15 15:23:44,400 INFO L226 Difference]: Without dead ends: 86 [2018-10-15 15:23:44,401 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-10-15 15:23:44,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-10-15 15:23:44,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2018-10-15 15:23:44,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-15 15:23:44,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-10-15 15:23:44,404 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 81 [2018-10-15 15:23:44,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:44,404 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-10-15 15:23:44,405 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-15 15:23:44,405 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-10-15 15:23:44,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-15 15:23:44,405 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:44,405 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:44,406 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:44,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:44,406 INFO L82 PathProgramCache]: Analyzing trace with hash -159437272, now seen corresponding path program 24 times [2018-10-15 15:23:44,407 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:44,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:44,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:23:44,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:44,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 15:23:44,919 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 15:23:44,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 15:23:44,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-10-15 15:23:44,920 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 27 states. [2018-10-15 15:23:45,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:45,085 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-10-15 15:23:45,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-15 15:23:45,086 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 84 [2018-10-15 15:23:45,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:45,086 INFO L225 Difference]: With dead ends: 89 [2018-10-15 15:23:45,086 INFO L226 Difference]: Without dead ends: 89 [2018-10-15 15:23:45,087 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-10-15 15:23:45,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-10-15 15:23:45,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2018-10-15 15:23:45,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-10-15 15:23:45,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-10-15 15:23:45,089 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 84 [2018-10-15 15:23:45,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:45,089 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-10-15 15:23:45,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 15:23:45,089 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-10-15 15:23:45,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-15 15:23:45,090 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:45,090 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:45,091 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:45,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:45,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1949920674, now seen corresponding path program 25 times [2018-10-15 15:23:45,092 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:45,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:45,842 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:23:45,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:45,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-15 15:23:45,842 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-15 15:23:45,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-15 15:23:45,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-10-15 15:23:45,843 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 28 states. [2018-10-15 15:23:45,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:45,986 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-10-15 15:23:45,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-15 15:23:45,986 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 87 [2018-10-15 15:23:45,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:45,987 INFO L225 Difference]: With dead ends: 92 [2018-10-15 15:23:45,988 INFO L226 Difference]: Without dead ends: 92 [2018-10-15 15:23:45,988 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-10-15 15:23:45,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-10-15 15:23:45,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2018-10-15 15:23:45,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-15 15:23:45,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-10-15 15:23:45,991 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 87 [2018-10-15 15:23:45,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:45,992 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-10-15 15:23:45,992 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-15 15:23:45,992 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-10-15 15:23:45,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-15 15:23:45,992 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:45,993 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:45,993 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:45,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:45,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1252866664, now seen corresponding path program 26 times [2018-10-15 15:23:45,994 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:46,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:46,544 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:23:46,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:46,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 15:23:46,545 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 15:23:46,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 15:23:46,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-10-15 15:23:46,545 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 29 states. [2018-10-15 15:23:46,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:46,681 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-10-15 15:23:46,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-15 15:23:46,681 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 90 [2018-10-15 15:23:46,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:46,682 INFO L225 Difference]: With dead ends: 95 [2018-10-15 15:23:46,682 INFO L226 Difference]: Without dead ends: 95 [2018-10-15 15:23:46,683 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-10-15 15:23:46,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-10-15 15:23:46,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2018-10-15 15:23:46,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-10-15 15:23:46,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-10-15 15:23:46,686 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 90 [2018-10-15 15:23:46,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:46,686 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-10-15 15:23:46,687 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 15:23:46,687 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-10-15 15:23:46,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-10-15 15:23:46,687 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:46,687 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:46,687 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:46,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:46,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1502994914, now seen corresponding path program 27 times [2018-10-15 15:23:46,688 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:46,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:47,304 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:23:47,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:47,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-15 15:23:47,304 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-15 15:23:47,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-15 15:23:47,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-10-15 15:23:47,305 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 30 states. [2018-10-15 15:23:47,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:47,492 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-10-15 15:23:47,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-15 15:23:47,493 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 93 [2018-10-15 15:23:47,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:47,494 INFO L225 Difference]: With dead ends: 98 [2018-10-15 15:23:47,494 INFO L226 Difference]: Without dead ends: 98 [2018-10-15 15:23:47,495 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-10-15 15:23:47,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-10-15 15:23:47,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2018-10-15 15:23:47,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-10-15 15:23:47,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-10-15 15:23:47,497 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 93 [2018-10-15 15:23:47,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:47,497 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-10-15 15:23:47,497 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-15 15:23:47,497 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-10-15 15:23:47,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-15 15:23:47,497 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:47,498 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:47,498 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:47,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:47,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1219565224, now seen corresponding path program 28 times [2018-10-15 15:23:47,499 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:47,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:48,023 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:23:48,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:48,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 15:23:48,024 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 15:23:48,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 15:23:48,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-10-15 15:23:48,025 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 31 states. [2018-10-15 15:23:48,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:48,260 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-10-15 15:23:48,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-15 15:23:48,260 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 96 [2018-10-15 15:23:48,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:48,261 INFO L225 Difference]: With dead ends: 101 [2018-10-15 15:23:48,262 INFO L226 Difference]: Without dead ends: 101 [2018-10-15 15:23:48,262 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-10-15 15:23:48,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-10-15 15:23:48,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2018-10-15 15:23:48,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-10-15 15:23:48,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-10-15 15:23:48,268 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 96 [2018-10-15 15:23:48,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:48,268 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-10-15 15:23:48,268 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 15:23:48,268 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-10-15 15:23:48,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-15 15:23:48,269 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:48,269 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:48,269 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:48,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:48,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1448748578, now seen corresponding path program 29 times [2018-10-15 15:23:48,270 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:48,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:48,994 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:23:48,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:48,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-15 15:23:48,995 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-15 15:23:48,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-15 15:23:48,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-10-15 15:23:48,995 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 32 states. [2018-10-15 15:23:49,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:49,468 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-10-15 15:23:49,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-15 15:23:49,468 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 99 [2018-10-15 15:23:49,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:49,469 INFO L225 Difference]: With dead ends: 104 [2018-10-15 15:23:49,469 INFO L226 Difference]: Without dead ends: 104 [2018-10-15 15:23:49,470 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-10-15 15:23:49,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-10-15 15:23:49,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2018-10-15 15:23:49,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-10-15 15:23:49,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-10-15 15:23:49,474 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 99 [2018-10-15 15:23:49,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:49,474 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-10-15 15:23:49,474 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-15 15:23:49,474 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-10-15 15:23:49,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-15 15:23:49,475 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:49,475 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:49,475 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:49,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:49,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1930509592, now seen corresponding path program 30 times [2018-10-15 15:23:49,476 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:49,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:50,038 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:23:50,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:50,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 15:23:50,039 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 15:23:50,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 15:23:50,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 15:23:50,040 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 33 states. [2018-10-15 15:23:50,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:50,234 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-10-15 15:23:50,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-15 15:23:50,235 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 102 [2018-10-15 15:23:50,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:50,239 INFO L225 Difference]: With dead ends: 107 [2018-10-15 15:23:50,240 INFO L226 Difference]: Without dead ends: 107 [2018-10-15 15:23:50,240 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 15:23:50,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-10-15 15:23:50,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2018-10-15 15:23:50,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-10-15 15:23:50,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-10-15 15:23:50,243 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 102 [2018-10-15 15:23:50,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:50,244 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-10-15 15:23:50,244 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 15:23:50,244 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-10-15 15:23:50,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-10-15 15:23:50,245 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:50,245 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:50,245 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:50,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:50,245 INFO L82 PathProgramCache]: Analyzing trace with hash -292174434, now seen corresponding path program 31 times [2018-10-15 15:23:50,247 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:50,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:50,808 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:23:50,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:50,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-15 15:23:50,808 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-15 15:23:50,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-15 15:23:50,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-10-15 15:23:50,809 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 34 states. [2018-10-15 15:23:50,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:50,934 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-10-15 15:23:50,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-15 15:23:50,934 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 105 [2018-10-15 15:23:50,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:50,935 INFO L225 Difference]: With dead ends: 110 [2018-10-15 15:23:50,935 INFO L226 Difference]: Without dead ends: 110 [2018-10-15 15:23:50,936 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-10-15 15:23:50,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-10-15 15:23:50,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2018-10-15 15:23:50,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-15 15:23:50,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-10-15 15:23:50,939 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 105 [2018-10-15 15:23:50,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:50,939 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-10-15 15:23:50,939 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-15 15:23:50,939 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-10-15 15:23:50,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-15 15:23:50,940 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:50,940 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:50,940 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:50,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:50,940 INFO L82 PathProgramCache]: Analyzing trace with hash -657834200, now seen corresponding path program 32 times [2018-10-15 15:23:50,941 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:50,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:51,402 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:23:51,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:51,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 15:23:51,402 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 15:23:51,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 15:23:51,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 15:23:51,403 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 35 states. [2018-10-15 15:23:51,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:51,555 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-10-15 15:23:51,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-15 15:23:51,555 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 108 [2018-10-15 15:23:51,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:51,556 INFO L225 Difference]: With dead ends: 113 [2018-10-15 15:23:51,557 INFO L226 Difference]: Without dead ends: 113 [2018-10-15 15:23:51,558 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 15:23:51,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-10-15 15:23:51,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2018-10-15 15:23:51,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-10-15 15:23:51,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-10-15 15:23:51,561 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 108 [2018-10-15 15:23:51,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:51,561 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-10-15 15:23:51,561 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 15:23:51,561 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-10-15 15:23:51,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-10-15 15:23:51,562 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:51,562 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:51,562 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:51,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:51,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1990860450, now seen corresponding path program 33 times [2018-10-15 15:23:51,563 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:51,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:52,127 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:23:52,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:52,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-15 15:23:52,128 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-15 15:23:52,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-15 15:23:52,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-10-15 15:23:52,129 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 36 states. [2018-10-15 15:23:52,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:52,266 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-10-15 15:23:52,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-15 15:23:52,266 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 111 [2018-10-15 15:23:52,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:52,267 INFO L225 Difference]: With dead ends: 116 [2018-10-15 15:23:52,268 INFO L226 Difference]: Without dead ends: 116 [2018-10-15 15:23:52,268 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-10-15 15:23:52,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-10-15 15:23:52,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2018-10-15 15:23:52,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-15 15:23:52,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-10-15 15:23:52,271 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 111 [2018-10-15 15:23:52,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:52,271 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-10-15 15:23:52,271 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-15 15:23:52,271 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-10-15 15:23:52,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-15 15:23:52,271 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:52,272 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:52,272 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:52,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:52,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1386711912, now seen corresponding path program 34 times [2018-10-15 15:23:52,273 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:52,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:52,889 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:23:52,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:52,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 15:23:52,890 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 15:23:52,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 15:23:52,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 15:23:52,891 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 37 states. [2018-10-15 15:23:53,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:53,107 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-10-15 15:23:53,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-15 15:23:53,107 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 114 [2018-10-15 15:23:53,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:53,108 INFO L225 Difference]: With dead ends: 119 [2018-10-15 15:23:53,109 INFO L226 Difference]: Without dead ends: 119 [2018-10-15 15:23:53,109 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 15:23:53,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-10-15 15:23:53,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2018-10-15 15:23:53,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-10-15 15:23:53,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2018-10-15 15:23:53,112 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 114 [2018-10-15 15:23:53,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:53,113 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2018-10-15 15:23:53,113 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 15:23:53,113 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2018-10-15 15:23:53,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-10-15 15:23:53,114 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:53,114 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:53,114 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:53,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:53,114 INFO L82 PathProgramCache]: Analyzing trace with hash 151137566, now seen corresponding path program 35 times [2018-10-15 15:23:53,115 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:53,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:53,698 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:23:53,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:53,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-15 15:23:53,698 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-15 15:23:53,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-15 15:23:53,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-10-15 15:23:53,699 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 38 states. [2018-10-15 15:23:53,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:53,907 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2018-10-15 15:23:53,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-15 15:23:53,907 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 117 [2018-10-15 15:23:53,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:53,909 INFO L225 Difference]: With dead ends: 122 [2018-10-15 15:23:53,909 INFO L226 Difference]: Without dead ends: 122 [2018-10-15 15:23:53,909 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-10-15 15:23:53,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-10-15 15:23:53,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2018-10-15 15:23:53,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-10-15 15:23:53,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-10-15 15:23:53,912 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 117 [2018-10-15 15:23:53,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:53,913 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-10-15 15:23:53,913 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-15 15:23:53,913 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-10-15 15:23:53,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-15 15:23:53,914 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:53,914 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:53,914 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:53,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:53,915 INFO L82 PathProgramCache]: Analyzing trace with hash -974477400, now seen corresponding path program 36 times [2018-10-15 15:23:53,915 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:53,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:54,618 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:23:54,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:54,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 15:23:54,619 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 15:23:54,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 15:23:54,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 15:23:54,620 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 39 states. [2018-10-15 15:23:54,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:54,734 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-10-15 15:23:54,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-15 15:23:54,734 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 120 [2018-10-15 15:23:54,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:54,735 INFO L225 Difference]: With dead ends: 125 [2018-10-15 15:23:54,736 INFO L226 Difference]: Without dead ends: 125 [2018-10-15 15:23:54,737 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 15:23:54,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-10-15 15:23:54,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2018-10-15 15:23:54,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-10-15 15:23:54,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2018-10-15 15:23:54,740 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 120 [2018-10-15 15:23:54,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:54,740 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2018-10-15 15:23:54,740 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 15:23:54,740 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2018-10-15 15:23:54,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-10-15 15:23:54,741 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:54,741 INFO L375 BasicCegarLoop]: trace histogram [38, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:54,741 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:54,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:54,742 INFO L82 PathProgramCache]: Analyzing trace with hash 934717662, now seen corresponding path program 37 times [2018-10-15 15:23:54,742 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:54,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:55,534 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:23:55,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:55,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-15 15:23:55,535 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-15 15:23:55,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-15 15:23:55,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-10-15 15:23:55,536 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 40 states. [2018-10-15 15:23:55,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:55,735 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2018-10-15 15:23:55,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-15 15:23:55,735 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 123 [2018-10-15 15:23:55,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:55,736 INFO L225 Difference]: With dead ends: 128 [2018-10-15 15:23:55,736 INFO L226 Difference]: Without dead ends: 128 [2018-10-15 15:23:55,737 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-10-15 15:23:55,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-10-15 15:23:55,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2018-10-15 15:23:55,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-10-15 15:23:55,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-10-15 15:23:55,739 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 123 [2018-10-15 15:23:55,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:55,740 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-10-15 15:23:55,740 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-15 15:23:55,740 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-10-15 15:23:55,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-10-15 15:23:55,741 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:55,741 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:55,741 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:55,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:55,741 INFO L82 PathProgramCache]: Analyzing trace with hash -487091224, now seen corresponding path program 38 times [2018-10-15 15:23:55,742 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:55,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:56,445 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:23:56,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:56,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 15:23:56,446 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 15:23:56,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 15:23:56,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 15:23:56,447 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 41 states. [2018-10-15 15:23:56,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:56,643 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-10-15 15:23:56,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-15 15:23:56,643 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 126 [2018-10-15 15:23:56,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:56,645 INFO L225 Difference]: With dead ends: 131 [2018-10-15 15:23:56,645 INFO L226 Difference]: Without dead ends: 131 [2018-10-15 15:23:56,646 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 15:23:56,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-10-15 15:23:56,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2018-10-15 15:23:56,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-10-15 15:23:56,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2018-10-15 15:23:56,650 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 126 [2018-10-15 15:23:56,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:56,650 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2018-10-15 15:23:56,650 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 15:23:56,650 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2018-10-15 15:23:56,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-10-15 15:23:56,651 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:56,651 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:56,651 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:56,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:56,651 INFO L82 PathProgramCache]: Analyzing trace with hash -628140898, now seen corresponding path program 39 times [2018-10-15 15:23:56,652 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:56,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:57,310 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:23:57,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:57,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-15 15:23:57,310 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-15 15:23:57,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-15 15:23:57,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-10-15 15:23:57,311 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 42 states. [2018-10-15 15:23:57,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:57,527 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2018-10-15 15:23:57,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-15 15:23:57,527 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 129 [2018-10-15 15:23:57,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:57,528 INFO L225 Difference]: With dead ends: 134 [2018-10-15 15:23:57,529 INFO L226 Difference]: Without dead ends: 134 [2018-10-15 15:23:57,530 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-10-15 15:23:57,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-10-15 15:23:57,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2018-10-15 15:23:57,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-10-15 15:23:57,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-10-15 15:23:57,532 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 129 [2018-10-15 15:23:57,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:57,533 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-10-15 15:23:57,533 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-15 15:23:57,533 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-10-15 15:23:57,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-15 15:23:57,534 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:57,534 INFO L375 BasicCegarLoop]: trace histogram [41, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:57,534 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:57,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:57,534 INFO L82 PathProgramCache]: Analyzing trace with hash 2134003752, now seen corresponding path program 40 times [2018-10-15 15:23:57,535 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:57,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:59,035 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:23:59,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:59,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 15:23:59,036 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 15:23:59,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 15:23:59,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 15:23:59,036 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 43 states. [2018-10-15 15:23:59,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:59,250 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-10-15 15:23:59,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-15 15:23:59,251 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 132 [2018-10-15 15:23:59,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:59,252 INFO L225 Difference]: With dead ends: 137 [2018-10-15 15:23:59,252 INFO L226 Difference]: Without dead ends: 137 [2018-10-15 15:23:59,253 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 15:23:59,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-10-15 15:23:59,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2018-10-15 15:23:59,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-10-15 15:23:59,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2018-10-15 15:23:59,257 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 132 [2018-10-15 15:23:59,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:59,257 INFO L481 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2018-10-15 15:23:59,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 15:23:59,257 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2018-10-15 15:23:59,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-15 15:23:59,258 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:59,258 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:59,258 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:59,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:59,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1906847838, now seen corresponding path program 41 times [2018-10-15 15:23:59,259 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:59,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:59,980 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:23:59,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:59,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-15 15:23:59,980 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-15 15:23:59,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-15 15:23:59,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-10-15 15:23:59,981 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 44 states. [2018-10-15 15:24:00,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:00,261 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2018-10-15 15:24:00,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-15 15:24:00,261 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 135 [2018-10-15 15:24:00,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:00,262 INFO L225 Difference]: With dead ends: 140 [2018-10-15 15:24:00,262 INFO L226 Difference]: Without dead ends: 140 [2018-10-15 15:24:00,263 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-10-15 15:24:00,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-10-15 15:24:00,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2018-10-15 15:24:00,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-10-15 15:24:00,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2018-10-15 15:24:00,266 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 135 [2018-10-15 15:24:00,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:00,267 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2018-10-15 15:24:00,267 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-15 15:24:00,267 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2018-10-15 15:24:00,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-10-15 15:24:00,268 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:00,268 INFO L375 BasicCegarLoop]: trace histogram [43, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:00,268 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:00,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:00,268 INFO L82 PathProgramCache]: Analyzing trace with hash -721494936, now seen corresponding path program 42 times [2018-10-15 15:24:00,269 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:00,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:01,096 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:24:01,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:01,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 15:24:01,096 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 15:24:01,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 15:24:01,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 15:24:01,097 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 45 states. [2018-10-15 15:24:01,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:01,871 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-10-15 15:24:01,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-15 15:24:01,871 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 138 [2018-10-15 15:24:01,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:01,872 INFO L225 Difference]: With dead ends: 143 [2018-10-15 15:24:01,872 INFO L226 Difference]: Without dead ends: 143 [2018-10-15 15:24:01,873 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 15:24:01,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-10-15 15:24:01,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2018-10-15 15:24:01,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-10-15 15:24:01,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2018-10-15 15:24:01,876 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 138 [2018-10-15 15:24:01,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:01,876 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2018-10-15 15:24:01,876 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 15:24:01,876 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2018-10-15 15:24:01,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-10-15 15:24:01,877 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:01,877 INFO L375 BasicCegarLoop]: trace histogram [44, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:01,877 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:01,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:01,878 INFO L82 PathProgramCache]: Analyzing trace with hash -132301794, now seen corresponding path program 43 times [2018-10-15 15:24:01,878 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:01,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:03,141 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:24:03,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:03,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-15 15:24:03,142 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-15 15:24:03,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-15 15:24:03,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-10-15 15:24:03,143 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 46 states. [2018-10-15 15:24:03,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:03,439 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2018-10-15 15:24:03,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-15 15:24:03,440 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 141 [2018-10-15 15:24:03,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:03,441 INFO L225 Difference]: With dead ends: 146 [2018-10-15 15:24:03,441 INFO L226 Difference]: Without dead ends: 146 [2018-10-15 15:24:03,442 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-10-15 15:24:03,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-10-15 15:24:03,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2018-10-15 15:24:03,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-10-15 15:24:03,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-10-15 15:24:03,445 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 141 [2018-10-15 15:24:03,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:03,445 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-10-15 15:24:03,446 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-15 15:24:03,446 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-10-15 15:24:03,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-15 15:24:03,446 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:03,447 INFO L375 BasicCegarLoop]: trace histogram [45, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:03,447 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:03,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:03,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1010747224, now seen corresponding path program 44 times [2018-10-15 15:24:03,448 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:03,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:05,167 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:24:05,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:05,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 15:24:05,168 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 15:24:05,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 15:24:05,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 15:24:05,169 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 47 states. [2018-10-15 15:24:05,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:05,355 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-10-15 15:24:05,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-15 15:24:05,355 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 144 [2018-10-15 15:24:05,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:05,356 INFO L225 Difference]: With dead ends: 149 [2018-10-15 15:24:05,357 INFO L226 Difference]: Without dead ends: 149 [2018-10-15 15:24:05,357 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 15:24:05,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-10-15 15:24:05,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2018-10-15 15:24:05,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-10-15 15:24:05,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2018-10-15 15:24:05,360 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 144 [2018-10-15 15:24:05,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:05,360 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2018-10-15 15:24:05,361 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 15:24:05,361 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2018-10-15 15:24:05,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-15 15:24:05,361 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:05,361 INFO L375 BasicCegarLoop]: trace histogram [46, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:05,361 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:05,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:05,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1542817826, now seen corresponding path program 45 times [2018-10-15 15:24:05,362 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:05,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:06,503 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:24:06,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:06,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-15 15:24:06,503 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-15 15:24:06,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-15 15:24:06,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-10-15 15:24:06,504 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 48 states. [2018-10-15 15:24:07,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:07,458 INFO L93 Difference]: Finished difference Result 152 states and 152 transitions. [2018-10-15 15:24:07,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-15 15:24:07,458 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 147 [2018-10-15 15:24:07,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:07,459 INFO L225 Difference]: With dead ends: 152 [2018-10-15 15:24:07,459 INFO L226 Difference]: Without dead ends: 152 [2018-10-15 15:24:07,459 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-10-15 15:24:07,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-10-15 15:24:07,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2018-10-15 15:24:07,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-10-15 15:24:07,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-10-15 15:24:07,461 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 147 [2018-10-15 15:24:07,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:07,462 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-10-15 15:24:07,462 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-15 15:24:07,462 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-10-15 15:24:07,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-15 15:24:07,463 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:07,463 INFO L375 BasicCegarLoop]: trace histogram [47, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:07,463 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:07,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:07,464 INFO L82 PathProgramCache]: Analyzing trace with hash 266167528, now seen corresponding path program 46 times [2018-10-15 15:24:07,464 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:07,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:08,771 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:24:08,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:08,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 15:24:08,771 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 15:24:08,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 15:24:08,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 15:24:08,772 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 49 states. [2018-10-15 15:24:08,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:08,923 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-10-15 15:24:08,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-15 15:24:08,923 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 150 [2018-10-15 15:24:08,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:08,924 INFO L225 Difference]: With dead ends: 155 [2018-10-15 15:24:08,925 INFO L226 Difference]: Without dead ends: 155 [2018-10-15 15:24:08,925 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 15:24:08,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-10-15 15:24:08,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2018-10-15 15:24:08,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-10-15 15:24:08,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 154 transitions. [2018-10-15 15:24:08,928 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 154 transitions. Word has length 150 [2018-10-15 15:24:08,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:08,929 INFO L481 AbstractCegarLoop]: Abstraction has 154 states and 154 transitions. [2018-10-15 15:24:08,929 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 15:24:08,929 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 154 transitions. [2018-10-15 15:24:08,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-10-15 15:24:08,930 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:08,930 INFO L375 BasicCegarLoop]: trace histogram [48, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:08,930 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:08,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:08,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1500781666, now seen corresponding path program 47 times [2018-10-15 15:24:08,931 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:08,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:09,939 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:24:09,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:09,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-15 15:24:09,940 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-15 15:24:09,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-15 15:24:09,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-10-15 15:24:09,941 INFO L87 Difference]: Start difference. First operand 154 states and 154 transitions. Second operand 50 states. [2018-10-15 15:24:10,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:10,196 INFO L93 Difference]: Finished difference Result 158 states and 158 transitions. [2018-10-15 15:24:10,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-15 15:24:10,196 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 153 [2018-10-15 15:24:10,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:10,197 INFO L225 Difference]: With dead ends: 158 [2018-10-15 15:24:10,197 INFO L226 Difference]: Without dead ends: 158 [2018-10-15 15:24:10,197 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-10-15 15:24:10,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-10-15 15:24:10,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2018-10-15 15:24:10,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-10-15 15:24:10,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-10-15 15:24:10,201 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 153 [2018-10-15 15:24:10,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:10,201 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-10-15 15:24:10,201 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-15 15:24:10,201 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-10-15 15:24:10,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-15 15:24:10,202 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:10,202 INFO L375 BasicCegarLoop]: trace histogram [49, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:10,202 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:10,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:10,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1565040344, now seen corresponding path program 48 times [2018-10-15 15:24:10,203 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:10,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:11,524 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:24:11,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:11,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 15:24:11,525 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 15:24:11,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 15:24:11,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 15:24:11,526 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 51 states. [2018-10-15 15:24:11,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:11,775 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-10-15 15:24:11,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-15 15:24:11,776 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 156 [2018-10-15 15:24:11,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:11,777 INFO L225 Difference]: With dead ends: 161 [2018-10-15 15:24:11,777 INFO L226 Difference]: Without dead ends: 161 [2018-10-15 15:24:11,777 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 15:24:11,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-10-15 15:24:11,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2018-10-15 15:24:11,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-10-15 15:24:11,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 160 transitions. [2018-10-15 15:24:11,780 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 160 transitions. Word has length 156 [2018-10-15 15:24:11,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:11,781 INFO L481 AbstractCegarLoop]: Abstraction has 160 states and 160 transitions. [2018-10-15 15:24:11,781 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 15:24:11,781 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 160 transitions. [2018-10-15 15:24:11,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-15 15:24:11,782 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:11,782 INFO L375 BasicCegarLoop]: trace histogram [50, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:11,782 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:11,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:11,782 INFO L82 PathProgramCache]: Analyzing trace with hash -339902626, now seen corresponding path program 49 times [2018-10-15 15:24:11,783 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:11,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:12,780 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:24:12,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:12,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-15 15:24:12,781 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-15 15:24:12,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-15 15:24:12,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-10-15 15:24:12,782 INFO L87 Difference]: Start difference. First operand 160 states and 160 transitions. Second operand 52 states. [2018-10-15 15:24:13,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:13,064 INFO L93 Difference]: Finished difference Result 164 states and 164 transitions. [2018-10-15 15:24:13,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-15 15:24:13,064 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 159 [2018-10-15 15:24:13,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:13,065 INFO L225 Difference]: With dead ends: 164 [2018-10-15 15:24:13,065 INFO L226 Difference]: Without dead ends: 164 [2018-10-15 15:24:13,066 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-10-15 15:24:13,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-10-15 15:24:13,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 163. [2018-10-15 15:24:13,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-10-15 15:24:13,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-10-15 15:24:13,068 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 159 [2018-10-15 15:24:13,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:13,069 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-10-15 15:24:13,069 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-15 15:24:13,069 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-10-15 15:24:13,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-10-15 15:24:13,070 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:13,070 INFO L375 BasicCegarLoop]: trace histogram [51, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:13,071 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:13,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:13,071 INFO L82 PathProgramCache]: Analyzing trace with hash -894227096, now seen corresponding path program 50 times [2018-10-15 15:24:13,071 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:13,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:15,317 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:24:15,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:15,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 15:24:15,317 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 15:24:15,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 15:24:15,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 15:24:15,318 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 53 states. [2018-10-15 15:24:15,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:15,595 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-10-15 15:24:15,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-15 15:24:15,595 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 162 [2018-10-15 15:24:15,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:15,596 INFO L225 Difference]: With dead ends: 167 [2018-10-15 15:24:15,596 INFO L226 Difference]: Without dead ends: 167 [2018-10-15 15:24:15,597 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 15:24:15,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-10-15 15:24:15,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2018-10-15 15:24:15,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-10-15 15:24:15,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2018-10-15 15:24:15,600 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 162 [2018-10-15 15:24:15,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:15,600 INFO L481 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2018-10-15 15:24:15,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 15:24:15,600 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2018-10-15 15:24:15,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-10-15 15:24:15,601 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:15,601 INFO L375 BasicCegarLoop]: trace histogram [52, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:15,601 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:15,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:15,602 INFO L82 PathProgramCache]: Analyzing trace with hash -625259746, now seen corresponding path program 51 times [2018-10-15 15:24:15,602 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:15,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:19,074 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:24:19,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:19,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-15 15:24:19,075 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-15 15:24:19,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-15 15:24:19,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-10-15 15:24:19,076 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 54 states. [2018-10-15 15:24:19,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:19,344 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2018-10-15 15:24:19,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-15 15:24:19,344 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 165 [2018-10-15 15:24:19,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:19,345 INFO L225 Difference]: With dead ends: 170 [2018-10-15 15:24:19,345 INFO L226 Difference]: Without dead ends: 170 [2018-10-15 15:24:19,346 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-10-15 15:24:19,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-10-15 15:24:19,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2018-10-15 15:24:19,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-10-15 15:24:19,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2018-10-15 15:24:19,348 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 165 [2018-10-15 15:24:19,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:19,349 INFO L481 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2018-10-15 15:24:19,349 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-15 15:24:19,349 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2018-10-15 15:24:19,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-10-15 15:24:19,350 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:19,350 INFO L375 BasicCegarLoop]: trace histogram [53, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:19,350 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:19,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:19,351 INFO L82 PathProgramCache]: Analyzing trace with hash 2067057064, now seen corresponding path program 52 times [2018-10-15 15:24:19,351 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:19,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:21,054 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:24:21,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:21,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 15:24:21,054 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 15:24:21,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 15:24:21,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 15:24:21,055 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 55 states. [2018-10-15 15:24:21,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:21,329 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2018-10-15 15:24:21,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-15 15:24:21,329 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 168 [2018-10-15 15:24:21,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:21,330 INFO L225 Difference]: With dead ends: 173 [2018-10-15 15:24:21,330 INFO L226 Difference]: Without dead ends: 173 [2018-10-15 15:24:21,331 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 15:24:21,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-10-15 15:24:21,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 172. [2018-10-15 15:24:21,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-10-15 15:24:21,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2018-10-15 15:24:21,333 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 168 [2018-10-15 15:24:21,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:21,334 INFO L481 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2018-10-15 15:24:21,334 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 15:24:21,334 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2018-10-15 15:24:21,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-10-15 15:24:21,335 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:21,335 INFO L375 BasicCegarLoop]: trace histogram [54, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:21,335 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:21,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:21,335 INFO L82 PathProgramCache]: Analyzing trace with hash 362890974, now seen corresponding path program 53 times [2018-10-15 15:24:21,336 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:21,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:22,532 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:24:22,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:22,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-10-15 15:24:22,533 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-15 15:24:22,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-15 15:24:22,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-10-15 15:24:22,534 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 56 states. [2018-10-15 15:24:22,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:22,871 INFO L93 Difference]: Finished difference Result 176 states and 176 transitions. [2018-10-15 15:24:22,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-15 15:24:22,871 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 171 [2018-10-15 15:24:22,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:22,872 INFO L225 Difference]: With dead ends: 176 [2018-10-15 15:24:22,872 INFO L226 Difference]: Without dead ends: 176 [2018-10-15 15:24:22,872 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-10-15 15:24:22,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-10-15 15:24:22,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 175. [2018-10-15 15:24:22,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-10-15 15:24:22,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2018-10-15 15:24:22,875 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 171 [2018-10-15 15:24:22,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:22,875 INFO L481 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2018-10-15 15:24:22,875 INFO L482 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-15 15:24:22,875 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2018-10-15 15:24:22,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-10-15 15:24:22,876 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:22,876 INFO L375 BasicCegarLoop]: trace histogram [55, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:22,877 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:22,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:22,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1935657496, now seen corresponding path program 54 times [2018-10-15 15:24:22,878 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:22,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:24,440 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:24:24,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:24,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 15:24:24,440 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 15:24:24,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 15:24:24,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 15:24:24,441 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 57 states. [2018-10-15 15:24:24,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:24,622 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-10-15 15:24:24,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-15 15:24:24,623 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 174 [2018-10-15 15:24:24,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:24,624 INFO L225 Difference]: With dead ends: 179 [2018-10-15 15:24:24,624 INFO L226 Difference]: Without dead ends: 179 [2018-10-15 15:24:24,625 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 15:24:24,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-10-15 15:24:24,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 178. [2018-10-15 15:24:24,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-10-15 15:24:24,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2018-10-15 15:24:24,628 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 174 [2018-10-15 15:24:24,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:24,628 INFO L481 AbstractCegarLoop]: Abstraction has 178 states and 178 transitions. [2018-10-15 15:24:24,628 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 15:24:24,628 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2018-10-15 15:24:24,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-10-15 15:24:24,629 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:24,629 INFO L375 BasicCegarLoop]: trace histogram [56, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:24,629 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:24,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:24,629 INFO L82 PathProgramCache]: Analyzing trace with hash 965440158, now seen corresponding path program 55 times [2018-10-15 15:24:24,630 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:24,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:25,863 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:24:25,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:25,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-10-15 15:24:25,863 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-15 15:24:25,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-15 15:24:25,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-10-15 15:24:25,864 INFO L87 Difference]: Start difference. First operand 178 states and 178 transitions. Second operand 58 states. [2018-10-15 15:24:26,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:26,113 INFO L93 Difference]: Finished difference Result 182 states and 182 transitions. [2018-10-15 15:24:26,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-15 15:24:26,113 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 177 [2018-10-15 15:24:26,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:26,115 INFO L225 Difference]: With dead ends: 182 [2018-10-15 15:24:26,115 INFO L226 Difference]: Without dead ends: 182 [2018-10-15 15:24:26,115 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-10-15 15:24:26,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-10-15 15:24:26,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2018-10-15 15:24:26,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-10-15 15:24:26,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-10-15 15:24:26,119 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 177 [2018-10-15 15:24:26,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:26,120 INFO L481 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-10-15 15:24:26,120 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-15 15:24:26,120 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-10-15 15:24:26,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-15 15:24:26,121 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:26,121 INFO L375 BasicCegarLoop]: trace histogram [57, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:26,121 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:26,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:26,122 INFO L82 PathProgramCache]: Analyzing trace with hash -61246936, now seen corresponding path program 56 times [2018-10-15 15:24:26,122 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:26,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:27,355 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:24:27,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:27,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-15 15:24:27,356 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-15 15:24:27,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-15 15:24:27,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 15:24:27,356 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 59 states. [2018-10-15 15:24:27,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:27,720 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2018-10-15 15:24:27,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-15 15:24:27,720 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 180 [2018-10-15 15:24:27,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:27,721 INFO L225 Difference]: With dead ends: 185 [2018-10-15 15:24:27,722 INFO L226 Difference]: Without dead ends: 185 [2018-10-15 15:24:27,722 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 15:24:27,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-10-15 15:24:27,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 184. [2018-10-15 15:24:27,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-10-15 15:24:27,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 184 transitions. [2018-10-15 15:24:27,725 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 184 transitions. Word has length 180 [2018-10-15 15:24:27,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:27,725 INFO L481 AbstractCegarLoop]: Abstraction has 184 states and 184 transitions. [2018-10-15 15:24:27,726 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-15 15:24:27,726 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 184 transitions. [2018-10-15 15:24:27,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-10-15 15:24:27,727 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:27,727 INFO L375 BasicCegarLoop]: trace histogram [58, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:27,727 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:27,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:27,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1634349474, now seen corresponding path program 57 times [2018-10-15 15:24:27,728 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:27,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:29,332 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:24:29,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:29,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-10-15 15:24:29,333 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-15 15:24:29,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-15 15:24:29,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-10-15 15:24:29,334 INFO L87 Difference]: Start difference. First operand 184 states and 184 transitions. Second operand 60 states. [2018-10-15 15:24:29,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:29,725 INFO L93 Difference]: Finished difference Result 188 states and 188 transitions. [2018-10-15 15:24:29,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-15 15:24:29,725 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 183 [2018-10-15 15:24:29,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:29,726 INFO L225 Difference]: With dead ends: 188 [2018-10-15 15:24:29,726 INFO L226 Difference]: Without dead ends: 188 [2018-10-15 15:24:29,726 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-10-15 15:24:29,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-10-15 15:24:29,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 187. [2018-10-15 15:24:29,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-10-15 15:24:29,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2018-10-15 15:24:29,728 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 183 [2018-10-15 15:24:29,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:29,728 INFO L481 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2018-10-15 15:24:29,728 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-15 15:24:29,728 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2018-10-15 15:24:29,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-10-15 15:24:29,729 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:29,729 INFO L375 BasicCegarLoop]: trace histogram [59, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:29,729 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:29,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:29,730 INFO L82 PathProgramCache]: Analyzing trace with hash 751074920, now seen corresponding path program 58 times [2018-10-15 15:24:29,730 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:29,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:31,088 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:24:31,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:31,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-15 15:24:31,089 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-15 15:24:31,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-15 15:24:31,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 15:24:31,090 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 61 states. [2018-10-15 15:24:31,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:31,368 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-10-15 15:24:31,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-15 15:24:31,369 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 186 [2018-10-15 15:24:31,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:31,370 INFO L225 Difference]: With dead ends: 191 [2018-10-15 15:24:31,371 INFO L226 Difference]: Without dead ends: 191 [2018-10-15 15:24:31,371 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 15:24:31,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-10-15 15:24:31,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 190. [2018-10-15 15:24:31,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-10-15 15:24:31,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 190 transitions. [2018-10-15 15:24:31,374 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 190 transitions. Word has length 186 [2018-10-15 15:24:31,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:31,374 INFO L481 AbstractCegarLoop]: Abstraction has 190 states and 190 transitions. [2018-10-15 15:24:31,374 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-15 15:24:31,374 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 190 transitions. [2018-10-15 15:24:31,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-10-15 15:24:31,375 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:31,375 INFO L375 BasicCegarLoop]: trace histogram [60, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:31,376 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:31,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:31,376 INFO L82 PathProgramCache]: Analyzing trace with hash 400316958, now seen corresponding path program 59 times [2018-10-15 15:24:31,377 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:31,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:32,973 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:24:32,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:32,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-10-15 15:24:32,974 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-15 15:24:32,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-15 15:24:32,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-10-15 15:24:32,975 INFO L87 Difference]: Start difference. First operand 190 states and 190 transitions. Second operand 62 states. [2018-10-15 15:24:33,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:33,363 INFO L93 Difference]: Finished difference Result 194 states and 194 transitions. [2018-10-15 15:24:33,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-15 15:24:33,363 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 189 [2018-10-15 15:24:33,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:33,364 INFO L225 Difference]: With dead ends: 194 [2018-10-15 15:24:33,364 INFO L226 Difference]: Without dead ends: 194 [2018-10-15 15:24:33,364 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-10-15 15:24:33,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-10-15 15:24:33,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2018-10-15 15:24:33,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-10-15 15:24:33,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-10-15 15:24:33,367 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 189 [2018-10-15 15:24:33,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:33,367 INFO L481 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-10-15 15:24:33,367 INFO L482 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-15 15:24:33,367 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-10-15 15:24:33,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-10-15 15:24:33,368 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:33,368 INFO L375 BasicCegarLoop]: trace histogram [61, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:33,368 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:33,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:33,369 INFO L82 PathProgramCache]: Analyzing trace with hash 625302184, now seen corresponding path program 60 times [2018-10-15 15:24:33,369 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:33,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:35,045 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:24:35,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:35,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-15 15:24:35,046 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-15 15:24:35,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-15 15:24:35,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 15:24:35,047 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 63 states. [2018-10-15 15:24:35,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:35,325 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2018-10-15 15:24:35,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-15 15:24:35,326 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 192 [2018-10-15 15:24:35,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:35,327 INFO L225 Difference]: With dead ends: 197 [2018-10-15 15:24:35,327 INFO L226 Difference]: Without dead ends: 197 [2018-10-15 15:24:35,327 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 15:24:35,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-10-15 15:24:35,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 196. [2018-10-15 15:24:35,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-10-15 15:24:35,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2018-10-15 15:24:35,329 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 192 [2018-10-15 15:24:35,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:35,330 INFO L481 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2018-10-15 15:24:35,330 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-15 15:24:35,330 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2018-10-15 15:24:35,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-10-15 15:24:35,331 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:35,331 INFO L375 BasicCegarLoop]: trace histogram [62, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:35,331 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:35,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:35,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1283779106, now seen corresponding path program 61 times [2018-10-15 15:24:35,332 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:35,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:36,776 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:24:36,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:36,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-10-15 15:24:36,776 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-15 15:24:36,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-15 15:24:36,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-10-15 15:24:36,777 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 64 states. [2018-10-15 15:24:37,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:37,132 INFO L93 Difference]: Finished difference Result 200 states and 200 transitions. [2018-10-15 15:24:37,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-15 15:24:37,132 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 195 [2018-10-15 15:24:37,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:37,133 INFO L225 Difference]: With dead ends: 200 [2018-10-15 15:24:37,133 INFO L226 Difference]: Without dead ends: 200 [2018-10-15 15:24:37,134 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-10-15 15:24:37,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-10-15 15:24:37,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 199. [2018-10-15 15:24:37,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-10-15 15:24:37,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2018-10-15 15:24:37,136 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 195 [2018-10-15 15:24:37,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:37,137 INFO L481 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2018-10-15 15:24:37,137 INFO L482 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-15 15:24:37,137 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2018-10-15 15:24:37,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-10-15 15:24:37,138 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:37,138 INFO L375 BasicCegarLoop]: trace histogram [63, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:37,139 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:37,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:37,139 INFO L82 PathProgramCache]: Analyzing trace with hash -767555864, now seen corresponding path program 62 times [2018-10-15 15:24:37,140 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:37,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:38,706 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:24:38,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:38,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-15 15:24:38,707 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-15 15:24:38,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-15 15:24:38,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-10-15 15:24:38,708 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand 65 states. [2018-10-15 15:24:39,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:39,187 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2018-10-15 15:24:39,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-15 15:24:39,188 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 198 [2018-10-15 15:24:39,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:39,188 INFO L225 Difference]: With dead ends: 203 [2018-10-15 15:24:39,188 INFO L226 Difference]: Without dead ends: 203 [2018-10-15 15:24:39,189 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-10-15 15:24:39,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-10-15 15:24:39,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2018-10-15 15:24:39,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-10-15 15:24:39,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 202 transitions. [2018-10-15 15:24:39,191 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 202 transitions. Word has length 198 [2018-10-15 15:24:39,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:39,191 INFO L481 AbstractCegarLoop]: Abstraction has 202 states and 202 transitions. [2018-10-15 15:24:39,191 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-15 15:24:39,191 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 202 transitions. [2018-10-15 15:24:39,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-10-15 15:24:39,192 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:39,192 INFO L375 BasicCegarLoop]: trace histogram [64, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:39,192 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:39,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:39,193 INFO L82 PathProgramCache]: Analyzing trace with hash 2056126878, now seen corresponding path program 63 times [2018-10-15 15:24:39,193 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:39,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:40,848 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:24:40,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:40,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-10-15 15:24:40,849 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-15 15:24:40,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-15 15:24:40,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-10-15 15:24:40,850 INFO L87 Difference]: Start difference. First operand 202 states and 202 transitions. Second operand 66 states. [2018-10-15 15:24:41,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:41,095 INFO L93 Difference]: Finished difference Result 206 states and 206 transitions. [2018-10-15 15:24:41,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-15 15:24:41,095 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 201 [2018-10-15 15:24:41,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:41,097 INFO L225 Difference]: With dead ends: 206 [2018-10-15 15:24:41,097 INFO L226 Difference]: Without dead ends: 206 [2018-10-15 15:24:41,098 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-10-15 15:24:41,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-10-15 15:24:41,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2018-10-15 15:24:41,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-10-15 15:24:41,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2018-10-15 15:24:41,101 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 201 [2018-10-15 15:24:41,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:41,101 INFO L481 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2018-10-15 15:24:41,101 INFO L482 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-15 15:24:41,101 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2018-10-15 15:24:41,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-10-15 15:24:41,102 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:41,102 INFO L375 BasicCegarLoop]: trace histogram [65, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:41,103 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:41,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:41,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1159234344, now seen corresponding path program 64 times [2018-10-15 15:24:41,103 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:41,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:42,770 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:24:42,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:42,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-15 15:24:42,771 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-15 15:24:42,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-15 15:24:42,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 15:24:42,772 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 67 states. [2018-10-15 15:24:43,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:43,156 INFO L93 Difference]: Finished difference Result 209 states and 209 transitions. [2018-10-15 15:24:43,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-15 15:24:43,156 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 204 [2018-10-15 15:24:43,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:43,157 INFO L225 Difference]: With dead ends: 209 [2018-10-15 15:24:43,157 INFO L226 Difference]: Without dead ends: 209 [2018-10-15 15:24:43,157 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 15:24:43,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-10-15 15:24:43,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 208. [2018-10-15 15:24:43,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-10-15 15:24:43,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 208 transitions. [2018-10-15 15:24:43,160 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 208 transitions. Word has length 204 [2018-10-15 15:24:43,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:43,160 INFO L481 AbstractCegarLoop]: Abstraction has 208 states and 208 transitions. [2018-10-15 15:24:43,160 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-15 15:24:43,161 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 208 transitions. [2018-10-15 15:24:43,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-10-15 15:24:43,161 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:43,161 INFO L375 BasicCegarLoop]: trace histogram [66, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:43,162 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:43,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:43,162 INFO L82 PathProgramCache]: Analyzing trace with hash 825302366, now seen corresponding path program 65 times [2018-10-15 15:24:43,162 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:43,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:45,100 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:24:45,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:45,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-10-15 15:24:45,100 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-15 15:24:45,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-15 15:24:45,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-10-15 15:24:45,101 INFO L87 Difference]: Start difference. First operand 208 states and 208 transitions. Second operand 68 states. [2018-10-15 15:24:45,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:45,491 INFO L93 Difference]: Finished difference Result 212 states and 212 transitions. [2018-10-15 15:24:45,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-15 15:24:45,491 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 207 [2018-10-15 15:24:45,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:45,492 INFO L225 Difference]: With dead ends: 212 [2018-10-15 15:24:45,492 INFO L226 Difference]: Without dead ends: 212 [2018-10-15 15:24:45,493 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-10-15 15:24:45,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-10-15 15:24:45,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 211. [2018-10-15 15:24:45,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-10-15 15:24:45,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2018-10-15 15:24:45,495 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 207 [2018-10-15 15:24:45,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:45,495 INFO L481 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2018-10-15 15:24:45,495 INFO L482 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-15 15:24:45,495 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2018-10-15 15:24:45,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-10-15 15:24:45,496 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:45,496 INFO L375 BasicCegarLoop]: trace histogram [67, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:45,497 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:45,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:45,497 INFO L82 PathProgramCache]: Analyzing trace with hash -197996696, now seen corresponding path program 66 times [2018-10-15 15:24:45,497 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:45,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:47,270 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:24:47,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:47,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-15 15:24:47,271 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-15 15:24:47,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-15 15:24:47,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 15:24:47,272 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 69 states. [2018-10-15 15:24:47,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:47,689 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2018-10-15 15:24:47,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-15 15:24:47,690 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 210 [2018-10-15 15:24:47,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:47,691 INFO L225 Difference]: With dead ends: 215 [2018-10-15 15:24:47,691 INFO L226 Difference]: Without dead ends: 215 [2018-10-15 15:24:47,691 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 15:24:47,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-10-15 15:24:47,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 214. [2018-10-15 15:24:47,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-10-15 15:24:47,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 214 transitions. [2018-10-15 15:24:47,695 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 214 transitions. Word has length 210 [2018-10-15 15:24:47,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:47,695 INFO L481 AbstractCegarLoop]: Abstraction has 214 states and 214 transitions. [2018-10-15 15:24:47,695 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-15 15:24:47,695 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 214 transitions. [2018-10-15 15:24:47,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-10-15 15:24:47,696 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:47,697 INFO L375 BasicCegarLoop]: trace histogram [68, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:47,697 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:47,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:47,697 INFO L82 PathProgramCache]: Analyzing trace with hash 377514270, now seen corresponding path program 67 times [2018-10-15 15:24:47,698 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:47,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:49,739 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:24:49,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:49,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-10-15 15:24:49,739 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-15 15:24:49,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-15 15:24:49,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-10-15 15:24:49,740 INFO L87 Difference]: Start difference. First operand 214 states and 214 transitions. Second operand 70 states. [2018-10-15 15:24:50,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:50,133 INFO L93 Difference]: Finished difference Result 218 states and 218 transitions. [2018-10-15 15:24:50,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-15 15:24:50,133 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 213 [2018-10-15 15:24:50,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:50,134 INFO L225 Difference]: With dead ends: 218 [2018-10-15 15:24:50,134 INFO L226 Difference]: Without dead ends: 218 [2018-10-15 15:24:50,135 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-10-15 15:24:50,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-10-15 15:24:50,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2018-10-15 15:24:50,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-10-15 15:24:50,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2018-10-15 15:24:50,138 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 213 [2018-10-15 15:24:50,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:50,138 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2018-10-15 15:24:50,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-15 15:24:50,138 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2018-10-15 15:24:50,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-10-15 15:24:50,139 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:50,139 INFO L375 BasicCegarLoop]: trace histogram [69, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:50,139 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:50,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:50,140 INFO L82 PathProgramCache]: Analyzing trace with hash -84743256, now seen corresponding path program 68 times [2018-10-15 15:24:50,141 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:50,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:51,894 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:24:51,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:51,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-15 15:24:51,895 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-15 15:24:51,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-15 15:24:51,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 15:24:51,896 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 71 states. [2018-10-15 15:24:52,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:52,262 INFO L93 Difference]: Finished difference Result 221 states and 221 transitions. [2018-10-15 15:24:52,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-15 15:24:52,262 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 216 [2018-10-15 15:24:52,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:52,264 INFO L225 Difference]: With dead ends: 221 [2018-10-15 15:24:52,264 INFO L226 Difference]: Without dead ends: 221 [2018-10-15 15:24:52,264 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 15:24:52,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-10-15 15:24:52,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 220. [2018-10-15 15:24:52,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-10-15 15:24:52,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 220 transitions. [2018-10-15 15:24:52,267 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 220 transitions. Word has length 216 [2018-10-15 15:24:52,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:52,267 INFO L481 AbstractCegarLoop]: Abstraction has 220 states and 220 transitions. [2018-10-15 15:24:52,267 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-15 15:24:52,267 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 220 transitions. [2018-10-15 15:24:52,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-10-15 15:24:52,268 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:52,268 INFO L375 BasicCegarLoop]: trace histogram [70, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:52,268 INFO L424 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:52,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:52,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1533549346, now seen corresponding path program 69 times [2018-10-15 15:24:52,269 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:52,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:54,090 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:24:54,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:54,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-10-15 15:24:54,091 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-15 15:24:54,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-15 15:24:54,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-10-15 15:24:54,091 INFO L87 Difference]: Start difference. First operand 220 states and 220 transitions. Second operand 72 states. [2018-10-15 15:24:54,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:54,590 INFO L93 Difference]: Finished difference Result 224 states and 224 transitions. [2018-10-15 15:24:54,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-15 15:24:54,590 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 219 [2018-10-15 15:24:54,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:54,591 INFO L225 Difference]: With dead ends: 224 [2018-10-15 15:24:54,591 INFO L226 Difference]: Without dead ends: 224 [2018-10-15 15:24:54,592 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-10-15 15:24:54,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-10-15 15:24:54,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 223. [2018-10-15 15:24:54,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-10-15 15:24:54,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 223 transitions. [2018-10-15 15:24:54,594 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 223 transitions. Word has length 219 [2018-10-15 15:24:54,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:54,594 INFO L481 AbstractCegarLoop]: Abstraction has 223 states and 223 transitions. [2018-10-15 15:24:54,594 INFO L482 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-15 15:24:54,594 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 223 transitions. [2018-10-15 15:24:54,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-10-15 15:24:54,595 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:54,595 INFO L375 BasicCegarLoop]: trace histogram [71, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:54,596 INFO L424 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:54,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:54,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1505548264, now seen corresponding path program 70 times [2018-10-15 15:24:54,596 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:54,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:56,522 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:24:56,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:56,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-15 15:24:56,523 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-15 15:24:56,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-15 15:24:56,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-10-15 15:24:56,524 INFO L87 Difference]: Start difference. First operand 223 states and 223 transitions. Second operand 73 states. [2018-10-15 15:24:56,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:56,941 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2018-10-15 15:24:56,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-15 15:24:56,941 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 222 [2018-10-15 15:24:56,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:56,942 INFO L225 Difference]: With dead ends: 227 [2018-10-15 15:24:56,942 INFO L226 Difference]: Without dead ends: 227 [2018-10-15 15:24:56,942 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-10-15 15:24:56,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-10-15 15:24:56,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 226. [2018-10-15 15:24:56,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-10-15 15:24:56,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 226 transitions. [2018-10-15 15:24:56,945 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 226 transitions. Word has length 222 [2018-10-15 15:24:56,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:56,946 INFO L481 AbstractCegarLoop]: Abstraction has 226 states and 226 transitions. [2018-10-15 15:24:56,946 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-15 15:24:56,946 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 226 transitions. [2018-10-15 15:24:56,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-10-15 15:24:56,947 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:56,947 INFO L375 BasicCegarLoop]: trace histogram [72, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:56,947 INFO L424 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:56,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:56,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1351848094, now seen corresponding path program 71 times [2018-10-15 15:24:56,948 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:56,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:58,911 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:24:58,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:58,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-10-15 15:24:58,911 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-10-15 15:24:58,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-10-15 15:24:58,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-10-15 15:24:58,912 INFO L87 Difference]: Start difference. First operand 226 states and 226 transitions. Second operand 74 states. [2018-10-15 15:24:59,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:59,474 INFO L93 Difference]: Finished difference Result 230 states and 230 transitions. [2018-10-15 15:24:59,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-15 15:24:59,475 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 225 [2018-10-15 15:24:59,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:59,475 INFO L225 Difference]: With dead ends: 230 [2018-10-15 15:24:59,476 INFO L226 Difference]: Without dead ends: 230 [2018-10-15 15:24:59,476 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-10-15 15:24:59,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-10-15 15:24:59,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2018-10-15 15:24:59,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-10-15 15:24:59,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2018-10-15 15:24:59,479 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 225 [2018-10-15 15:24:59,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:59,479 INFO L481 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2018-10-15 15:24:59,479 INFO L482 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-10-15 15:24:59,479 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2018-10-15 15:24:59,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-10-15 15:24:59,480 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:59,481 INFO L375 BasicCegarLoop]: trace histogram [73, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:59,481 INFO L424 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:59,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:59,481 INFO L82 PathProgramCache]: Analyzing trace with hash 905221160, now seen corresponding path program 72 times [2018-10-15 15:24:59,482 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:59,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:25:01,803 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:25:01,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:25:01,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-15 15:25:01,803 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-15 15:25:01,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-15 15:25:01,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 15:25:01,804 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 75 states. [2018-10-15 15:25:02,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:25:02,277 INFO L93 Difference]: Finished difference Result 233 states and 233 transitions. [2018-10-15 15:25:02,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-15 15:25:02,277 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 228 [2018-10-15 15:25:02,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:25:02,278 INFO L225 Difference]: With dead ends: 233 [2018-10-15 15:25:02,278 INFO L226 Difference]: Without dead ends: 233 [2018-10-15 15:25:02,279 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 15:25:02,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-10-15 15:25:02,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 232. [2018-10-15 15:25:02,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-10-15 15:25:02,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 232 transitions. [2018-10-15 15:25:02,281 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 232 transitions. Word has length 228 [2018-10-15 15:25:02,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:25:02,281 INFO L481 AbstractCegarLoop]: Abstraction has 232 states and 232 transitions. [2018-10-15 15:25:02,281 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-15 15:25:02,281 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 232 transitions. [2018-10-15 15:25:02,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-10-15 15:25:02,282 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:25:02,282 INFO L375 BasicCegarLoop]: trace histogram [74, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:25:02,282 INFO L424 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:25:02,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:25:02,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1250913374, now seen corresponding path program 73 times [2018-10-15 15:25:02,283 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:25:02,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:25:04,847 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:25:04,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:25:04,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-10-15 15:25:04,847 INFO L460 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-10-15 15:25:04,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-10-15 15:25:04,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-10-15 15:25:04,848 INFO L87 Difference]: Start difference. First operand 232 states and 232 transitions. Second operand 76 states. [2018-10-15 15:25:05,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:25:05,342 INFO L93 Difference]: Finished difference Result 236 states and 236 transitions. [2018-10-15 15:25:05,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-15 15:25:05,343 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 231 [2018-10-15 15:25:05,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:25:05,344 INFO L225 Difference]: With dead ends: 236 [2018-10-15 15:25:05,344 INFO L226 Difference]: Without dead ends: 236 [2018-10-15 15:25:05,344 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-10-15 15:25:05,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-10-15 15:25:05,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 235. [2018-10-15 15:25:05,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-10-15 15:25:05,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 235 transitions. [2018-10-15 15:25:05,347 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 235 transitions. Word has length 231 [2018-10-15 15:25:05,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:25:05,347 INFO L481 AbstractCegarLoop]: Abstraction has 235 states and 235 transitions. [2018-10-15 15:25:05,347 INFO L482 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-10-15 15:25:05,347 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 235 transitions. [2018-10-15 15:25:05,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-10-15 15:25:05,348 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:25:05,348 INFO L375 BasicCegarLoop]: trace histogram [75, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:25:05,348 INFO L424 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:25:05,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:25:05,349 INFO L82 PathProgramCache]: Analyzing trace with hash 436084840, now seen corresponding path program 74 times [2018-10-15 15:25:05,349 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:25:05,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:25:07,467 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:25:07,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:25:07,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-15 15:25:07,468 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-15 15:25:07,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-15 15:25:07,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 15:25:07,468 INFO L87 Difference]: Start difference. First operand 235 states and 235 transitions. Second operand 77 states. [2018-10-15 15:25:07,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:25:07,787 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2018-10-15 15:25:07,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-15 15:25:07,787 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 234 [2018-10-15 15:25:07,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:25:07,789 INFO L225 Difference]: With dead ends: 239 [2018-10-15 15:25:07,789 INFO L226 Difference]: Without dead ends: 239 [2018-10-15 15:25:07,789 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 15:25:07,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-10-15 15:25:07,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 238. [2018-10-15 15:25:07,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-10-15 15:25:07,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 238 transitions. [2018-10-15 15:25:07,792 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 238 transitions. Word has length 234 [2018-10-15 15:25:07,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:25:07,792 INFO L481 AbstractCegarLoop]: Abstraction has 238 states and 238 transitions. [2018-10-15 15:25:07,792 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-15 15:25:07,792 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 238 transitions. [2018-10-15 15:25:07,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-10-15 15:25:07,793 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:25:07,793 INFO L375 BasicCegarLoop]: trace histogram [76, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:25:07,794 INFO L424 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:25:07,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:25:07,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1034385438, now seen corresponding path program 75 times [2018-10-15 15:25:07,794 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:25:07,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:25:10,188 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:25:10,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:25:10,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-10-15 15:25:10,189 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-15 15:25:10,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-15 15:25:10,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-10-15 15:25:10,190 INFO L87 Difference]: Start difference. First operand 238 states and 238 transitions. Second operand 78 states. [2018-10-15 15:25:10,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:25:10,724 INFO L93 Difference]: Finished difference Result 242 states and 242 transitions. [2018-10-15 15:25:10,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-15 15:25:10,725 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 237 [2018-10-15 15:25:10,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:25:10,726 INFO L225 Difference]: With dead ends: 242 [2018-10-15 15:25:10,726 INFO L226 Difference]: Without dead ends: 242 [2018-10-15 15:25:10,726 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-10-15 15:25:10,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-10-15 15:25:10,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2018-10-15 15:25:10,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-10-15 15:25:10,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2018-10-15 15:25:10,729 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 237 [2018-10-15 15:25:10,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:25:10,729 INFO L481 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2018-10-15 15:25:10,729 INFO L482 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-15 15:25:10,729 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2018-10-15 15:25:10,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-10-15 15:25:10,730 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:25:10,730 INFO L375 BasicCegarLoop]: trace histogram [77, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:25:10,731 INFO L424 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:25:10,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:25:10,731 INFO L82 PathProgramCache]: Analyzing trace with hash 893222056, now seen corresponding path program 76 times [2018-10-15 15:25:10,731 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:25:10,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:25:12,866 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:25:12,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:25:12,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-15 15:25:12,866 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-15 15:25:12,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-15 15:25:12,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 15:25:12,867 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 79 states. [2018-10-15 15:25:13,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:25:13,395 INFO L93 Difference]: Finished difference Result 245 states and 245 transitions. [2018-10-15 15:25:13,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-15 15:25:13,395 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 240 [2018-10-15 15:25:13,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:25:13,396 INFO L225 Difference]: With dead ends: 245 [2018-10-15 15:25:13,396 INFO L226 Difference]: Without dead ends: 245 [2018-10-15 15:25:13,396 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 15:25:13,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-10-15 15:25:13,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 244. [2018-10-15 15:25:13,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-10-15 15:25:13,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 244 transitions. [2018-10-15 15:25:13,399 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 244 transitions. Word has length 240 [2018-10-15 15:25:13,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:25:13,399 INFO L481 AbstractCegarLoop]: Abstraction has 244 states and 244 transitions. [2018-10-15 15:25:13,399 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-15 15:25:13,399 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 244 transitions. [2018-10-15 15:25:13,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-10-15 15:25:13,400 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:25:13,400 INFO L375 BasicCegarLoop]: trace histogram [78, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:25:13,401 INFO L424 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:25:13,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:25:13,401 INFO L82 PathProgramCache]: Analyzing trace with hash 267891678, now seen corresponding path program 77 times [2018-10-15 15:25:13,401 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:25:13,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:25:16,073 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:25:16,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:25:16,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-10-15 15:25:16,074 INFO L460 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-10-15 15:25:16,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-10-15 15:25:16,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-10-15 15:25:16,075 INFO L87 Difference]: Start difference. First operand 244 states and 244 transitions. Second operand 80 states. [2018-10-15 15:25:16,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:25:16,519 INFO L93 Difference]: Finished difference Result 248 states and 248 transitions. [2018-10-15 15:25:16,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-15 15:25:16,519 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 243 [2018-10-15 15:25:16,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:25:16,520 INFO L225 Difference]: With dead ends: 248 [2018-10-15 15:25:16,520 INFO L226 Difference]: Without dead ends: 248 [2018-10-15 15:25:16,521 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-10-15 15:25:16,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-10-15 15:25:16,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 247. [2018-10-15 15:25:16,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-10-15 15:25:16,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 247 transitions. [2018-10-15 15:25:16,523 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 247 transitions. Word has length 243 [2018-10-15 15:25:16,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:25:16,523 INFO L481 AbstractCegarLoop]: Abstraction has 247 states and 247 transitions. [2018-10-15 15:25:16,523 INFO L482 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-10-15 15:25:16,523 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 247 transitions. [2018-10-15 15:25:16,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-10-15 15:25:16,524 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:25:16,524 INFO L375 BasicCegarLoop]: trace histogram [79, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:25:16,524 INFO L424 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:25:16,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:25:16,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1676236568, now seen corresponding path program 78 times [2018-10-15 15:25:16,525 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:25:16,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:25:18,942 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:25:18,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:25:18,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-15 15:25:18,943 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-15 15:25:18,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-15 15:25:18,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 15:25:18,944 INFO L87 Difference]: Start difference. First operand 247 states and 247 transitions. Second operand 81 states. [2018-10-15 15:25:19,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:25:19,511 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2018-10-15 15:25:19,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-15 15:25:19,511 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 246 [2018-10-15 15:25:19,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:25:19,512 INFO L225 Difference]: With dead ends: 251 [2018-10-15 15:25:19,512 INFO L226 Difference]: Without dead ends: 251 [2018-10-15 15:25:19,512 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 15:25:19,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-10-15 15:25:19,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 250. [2018-10-15 15:25:19,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-10-15 15:25:19,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 250 transitions. [2018-10-15 15:25:19,514 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 250 transitions. Word has length 246 [2018-10-15 15:25:19,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:25:19,515 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 250 transitions. [2018-10-15 15:25:19,515 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-15 15:25:19,515 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 250 transitions. [2018-10-15 15:25:19,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-10-15 15:25:19,515 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:25:19,516 INFO L375 BasicCegarLoop]: trace histogram [80, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:25:19,516 INFO L424 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:25:19,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:25:19,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1566826594, now seen corresponding path program 79 times [2018-10-15 15:25:19,517 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:25:19,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:25:22,106 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:25:22,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:25:22,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-10-15 15:25:22,106 INFO L460 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-10-15 15:25:22,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-10-15 15:25:22,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-10-15 15:25:22,107 INFO L87 Difference]: Start difference. First operand 250 states and 250 transitions. Second operand 82 states. [2018-10-15 15:25:22,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:25:22,600 INFO L93 Difference]: Finished difference Result 254 states and 254 transitions. [2018-10-15 15:25:22,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-15 15:25:22,601 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 249 [2018-10-15 15:25:22,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:25:22,601 INFO L225 Difference]: With dead ends: 254 [2018-10-15 15:25:22,602 INFO L226 Difference]: Without dead ends: 254 [2018-10-15 15:25:22,602 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-10-15 15:25:22,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-10-15 15:25:22,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 253. [2018-10-15 15:25:22,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-10-15 15:25:22,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2018-10-15 15:25:22,604 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 249 [2018-10-15 15:25:22,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:25:22,605 INFO L481 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2018-10-15 15:25:22,605 INFO L482 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-10-15 15:25:22,605 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2018-10-15 15:25:22,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-10-15 15:25:22,606 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:25:22,606 INFO L375 BasicCegarLoop]: trace histogram [81, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:25:22,606 INFO L424 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:25:22,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:25:22,607 INFO L82 PathProgramCache]: Analyzing trace with hash -2014468824, now seen corresponding path program 80 times [2018-10-15 15:25:22,607 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:25:22,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:25:25,304 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:25:25,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:25:25,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-15 15:25:25,304 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-15 15:25:25,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-15 15:25:25,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 15:25:25,305 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 83 states. [2018-10-15 15:25:25,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:25:25,667 INFO L93 Difference]: Finished difference Result 257 states and 257 transitions. [2018-10-15 15:25:25,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-10-15 15:25:25,667 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 252 [2018-10-15 15:25:25,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:25:25,668 INFO L225 Difference]: With dead ends: 257 [2018-10-15 15:25:25,668 INFO L226 Difference]: Without dead ends: 257 [2018-10-15 15:25:25,669 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 15:25:25,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-10-15 15:25:25,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 256. [2018-10-15 15:25:25,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-10-15 15:25:25,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 256 transitions. [2018-10-15 15:25:25,671 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 256 transitions. Word has length 252 [2018-10-15 15:25:25,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:25:25,671 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 256 transitions. [2018-10-15 15:25:25,671 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-15 15:25:25,671 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 256 transitions. [2018-10-15 15:25:25,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-10-15 15:25:25,672 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:25:25,672 INFO L375 BasicCegarLoop]: trace histogram [82, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:25:25,672 INFO L424 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:25:25,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:25:25,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1850688674, now seen corresponding path program 81 times [2018-10-15 15:25:25,673 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:25:25,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:25:28,058 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:25:28,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:25:28,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-10-15 15:25:28,059 INFO L460 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-10-15 15:25:28,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-10-15 15:25:28,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-10-15 15:25:28,060 INFO L87 Difference]: Start difference. First operand 256 states and 256 transitions. Second operand 84 states. [2018-10-15 15:25:28,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:25:28,683 INFO L93 Difference]: Finished difference Result 260 states and 260 transitions. [2018-10-15 15:25:28,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-15 15:25:28,683 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 255 [2018-10-15 15:25:28,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:25:28,684 INFO L225 Difference]: With dead ends: 260 [2018-10-15 15:25:28,684 INFO L226 Difference]: Without dead ends: 260 [2018-10-15 15:25:28,684 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-10-15 15:25:28,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-10-15 15:25:28,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 259. [2018-10-15 15:25:28,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-10-15 15:25:28,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 259 transitions. [2018-10-15 15:25:28,687 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 259 transitions. Word has length 255 [2018-10-15 15:25:28,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:25:28,688 INFO L481 AbstractCegarLoop]: Abstraction has 259 states and 259 transitions. [2018-10-15 15:25:28,688 INFO L482 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-10-15 15:25:28,688 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 259 transitions. [2018-10-15 15:25:28,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-10-15 15:25:28,689 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:25:28,689 INFO L375 BasicCegarLoop]: trace histogram [83, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:25:28,689 INFO L424 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:25:28,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:25:28,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1759088280, now seen corresponding path program 82 times [2018-10-15 15:25:28,690 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:25:28,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:25:31,524 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:25:31,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:25:31,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-15 15:25:31,525 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-15 15:25:31,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-15 15:25:31,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-10-15 15:25:31,526 INFO L87 Difference]: Start difference. First operand 259 states and 259 transitions. Second operand 85 states. [2018-10-15 15:25:32,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:25:32,035 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions. [2018-10-15 15:25:32,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-15 15:25:32,035 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 258 [2018-10-15 15:25:32,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:25:32,036 INFO L225 Difference]: With dead ends: 263 [2018-10-15 15:25:32,036 INFO L226 Difference]: Without dead ends: 263 [2018-10-15 15:25:32,037 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-10-15 15:25:32,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-10-15 15:25:32,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 262. [2018-10-15 15:25:32,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-10-15 15:25:32,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 262 transitions. [2018-10-15 15:25:32,039 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 262 transitions. Word has length 258 [2018-10-15 15:25:32,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:25:32,039 INFO L481 AbstractCegarLoop]: Abstraction has 262 states and 262 transitions. [2018-10-15 15:25:32,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-15 15:25:32,039 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 262 transitions. [2018-10-15 15:25:32,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-10-15 15:25:32,040 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:25:32,040 INFO L375 BasicCegarLoop]: trace histogram [84, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:25:32,040 INFO L424 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:25:32,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:25:32,041 INFO L82 PathProgramCache]: Analyzing trace with hash -195983586, now seen corresponding path program 83 times [2018-10-15 15:25:32,041 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:25:32,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:25:34,638 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:25:34,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:25:34,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-10-15 15:25:34,639 INFO L460 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-10-15 15:25:34,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-10-15 15:25:34,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-10-15 15:25:34,640 INFO L87 Difference]: Start difference. First operand 262 states and 262 transitions. Second operand 86 states. [2018-10-15 15:25:35,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:25:35,008 INFO L93 Difference]: Finished difference Result 266 states and 266 transitions. [2018-10-15 15:25:35,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-10-15 15:25:35,009 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 261 [2018-10-15 15:25:35,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:25:35,010 INFO L225 Difference]: With dead ends: 266 [2018-10-15 15:25:35,010 INFO L226 Difference]: Without dead ends: 266 [2018-10-15 15:25:35,010 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-10-15 15:25:35,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-10-15 15:25:35,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2018-10-15 15:25:35,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-10-15 15:25:35,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2018-10-15 15:25:35,012 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 261 [2018-10-15 15:25:35,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:25:35,013 INFO L481 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2018-10-15 15:25:35,013 INFO L482 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-10-15 15:25:35,013 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2018-10-15 15:25:35,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-10-15 15:25:35,014 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:25:35,014 INFO L375 BasicCegarLoop]: trace histogram [85, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:25:35,016 INFO L424 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:25:35,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:25:35,016 INFO L82 PathProgramCache]: Analyzing trace with hash 220532136, now seen corresponding path program 84 times [2018-10-15 15:25:35,017 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:25:35,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:25:37,965 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:25:37,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:25:37,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-15 15:25:37,966 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-15 15:25:37,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-15 15:25:37,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 15:25:37,967 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 87 states. [2018-10-15 15:25:38,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:25:38,377 INFO L93 Difference]: Finished difference Result 269 states and 269 transitions. [2018-10-15 15:25:38,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-15 15:25:38,381 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 264 [2018-10-15 15:25:38,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:25:38,382 INFO L225 Difference]: With dead ends: 269 [2018-10-15 15:25:38,382 INFO L226 Difference]: Without dead ends: 269 [2018-10-15 15:25:38,383 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 15:25:38,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-10-15 15:25:38,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 268. [2018-10-15 15:25:38,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-10-15 15:25:38,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 268 transitions. [2018-10-15 15:25:38,386 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 268 transitions. Word has length 264 [2018-10-15 15:25:38,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:25:38,386 INFO L481 AbstractCegarLoop]: Abstraction has 268 states and 268 transitions. [2018-10-15 15:25:38,386 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-15 15:25:38,387 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 268 transitions. [2018-10-15 15:25:38,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-10-15 15:25:38,388 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:25:38,388 INFO L375 BasicCegarLoop]: trace histogram [86, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:25:38,388 INFO L424 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:25:38,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:25:38,388 INFO L82 PathProgramCache]: Analyzing trace with hash 479888094, now seen corresponding path program 85 times [2018-10-15 15:25:38,389 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:25:38,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:25:41,320 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:25:41,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:25:41,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-10-15 15:25:41,320 INFO L460 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-10-15 15:25:41,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-10-15 15:25:41,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-10-15 15:25:41,321 INFO L87 Difference]: Start difference. First operand 268 states and 268 transitions. Second operand 88 states. [2018-10-15 15:25:41,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:25:41,970 INFO L93 Difference]: Finished difference Result 272 states and 272 transitions. [2018-10-15 15:25:41,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-15 15:25:41,970 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 267 [2018-10-15 15:25:41,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:25:41,971 INFO L225 Difference]: With dead ends: 272 [2018-10-15 15:25:41,971 INFO L226 Difference]: Without dead ends: 272 [2018-10-15 15:25:41,972 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-10-15 15:25:41,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-10-15 15:25:41,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 271. [2018-10-15 15:25:41,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-10-15 15:25:41,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 271 transitions. [2018-10-15 15:25:41,974 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 271 transitions. Word has length 267 [2018-10-15 15:25:41,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:25:41,975 INFO L481 AbstractCegarLoop]: Abstraction has 271 states and 271 transitions. [2018-10-15 15:25:41,975 INFO L482 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-10-15 15:25:41,975 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 271 transitions. [2018-10-15 15:25:41,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-10-15 15:25:41,976 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:25:41,976 INFO L375 BasicCegarLoop]: trace histogram [87, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:25:41,976 INFO L424 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:25:41,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:25:41,977 INFO L82 PathProgramCache]: Analyzing trace with hash 307067368, now seen corresponding path program 86 times [2018-10-15 15:25:41,977 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:25:41,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:25:44,709 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:25:44,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:25:44,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-15 15:25:44,710 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-15 15:25:44,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-15 15:25:44,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-10-15 15:25:44,711 INFO L87 Difference]: Start difference. First operand 271 states and 271 transitions. Second operand 89 states. [2018-10-15 15:25:45,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:25:45,380 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2018-10-15 15:25:45,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-10-15 15:25:45,381 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 270 [2018-10-15 15:25:45,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:25:45,382 INFO L225 Difference]: With dead ends: 275 [2018-10-15 15:25:45,382 INFO L226 Difference]: Without dead ends: 275 [2018-10-15 15:25:45,383 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-10-15 15:25:45,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-10-15 15:25:45,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 274. [2018-10-15 15:25:45,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-10-15 15:25:45,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 274 transitions. [2018-10-15 15:25:45,385 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 274 transitions. Word has length 270 [2018-10-15 15:25:45,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:25:45,386 INFO L481 AbstractCegarLoop]: Abstraction has 274 states and 274 transitions. [2018-10-15 15:25:45,386 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-15 15:25:45,386 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 274 transitions. [2018-10-15 15:25:45,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-10-15 15:25:45,387 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:25:45,387 INFO L375 BasicCegarLoop]: trace histogram [88, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:25:45,387 INFO L424 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:25:45,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:25:45,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1470607006, now seen corresponding path program 87 times [2018-10-15 15:25:45,388 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:25:45,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:25:48,374 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:25:48,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:25:48,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-10-15 15:25:48,375 INFO L460 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-10-15 15:25:48,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-10-15 15:25:48,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-10-15 15:25:48,375 INFO L87 Difference]: Start difference. First operand 274 states and 274 transitions. Second operand 90 states. [2018-10-15 15:25:49,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:25:49,055 INFO L93 Difference]: Finished difference Result 278 states and 278 transitions. [2018-10-15 15:25:49,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-15 15:25:49,056 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 273 [2018-10-15 15:25:49,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:25:49,057 INFO L225 Difference]: With dead ends: 278 [2018-10-15 15:25:49,057 INFO L226 Difference]: Without dead ends: 278 [2018-10-15 15:25:49,057 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-10-15 15:25:49,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-10-15 15:25:49,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 277. [2018-10-15 15:25:49,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-10-15 15:25:49,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2018-10-15 15:25:49,059 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 273 [2018-10-15 15:25:49,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:25:49,059 INFO L481 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2018-10-15 15:25:49,059 INFO L482 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-10-15 15:25:49,059 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2018-10-15 15:25:49,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-10-15 15:25:49,060 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:25:49,060 INFO L375 BasicCegarLoop]: trace histogram [89, 88, 88, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:25:49,061 INFO L424 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:25:49,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:25:49,061 INFO L82 PathProgramCache]: Analyzing trace with hash -201083352, now seen corresponding path program 88 times [2018-10-15 15:25:49,061 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:25:49,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:25:52,230 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:25:52,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:25:52,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-15 15:25:52,231 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-15 15:25:52,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-15 15:25:52,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 15:25:52,232 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 91 states. [2018-10-15 15:25:52,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:25:52,933 INFO L93 Difference]: Finished difference Result 281 states and 281 transitions. [2018-10-15 15:25:52,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-10-15 15:25:52,933 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 276 [2018-10-15 15:25:52,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:25:52,934 INFO L225 Difference]: With dead ends: 281 [2018-10-15 15:25:52,934 INFO L226 Difference]: Without dead ends: 281 [2018-10-15 15:25:52,934 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 15:25:52,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-10-15 15:25:52,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 280. [2018-10-15 15:25:52,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-10-15 15:25:52,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 280 transitions. [2018-10-15 15:25:52,936 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 280 transitions. Word has length 276 [2018-10-15 15:25:52,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:25:52,937 INFO L481 AbstractCegarLoop]: Abstraction has 280 states and 280 transitions. [2018-10-15 15:25:52,937 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-15 15:25:52,937 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 280 transitions. [2018-10-15 15:25:52,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-10-15 15:25:52,938 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:25:52,938 INFO L375 BasicCegarLoop]: trace histogram [90, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:25:52,938 INFO L424 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:25:52,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:25:52,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1382741410, now seen corresponding path program 89 times [2018-10-15 15:25:52,939 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:25:52,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:25:56,196 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:25:56,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:25:56,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-10-15 15:25:56,197 INFO L460 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-10-15 15:25:56,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-10-15 15:25:56,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-10-15 15:25:56,198 INFO L87 Difference]: Start difference. First operand 280 states and 280 transitions. Second operand 92 states. [2018-10-15 15:25:56,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:25:56,672 INFO L93 Difference]: Finished difference Result 284 states and 284 transitions. [2018-10-15 15:25:56,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-10-15 15:25:56,673 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 279 [2018-10-15 15:25:56,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:25:56,675 INFO L225 Difference]: With dead ends: 284 [2018-10-15 15:25:56,675 INFO L226 Difference]: Without dead ends: 284 [2018-10-15 15:25:56,675 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-10-15 15:25:56,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-10-15 15:25:56,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 283. [2018-10-15 15:25:56,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-10-15 15:25:56,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 283 transitions. [2018-10-15 15:25:56,679 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 283 transitions. Word has length 279 [2018-10-15 15:25:56,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:25:56,679 INFO L481 AbstractCegarLoop]: Abstraction has 283 states and 283 transitions. [2018-10-15 15:25:56,679 INFO L482 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-10-15 15:25:56,679 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 283 transitions. [2018-10-15 15:25:56,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-10-15 15:25:56,680 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:25:56,680 INFO L375 BasicCegarLoop]: trace histogram [91, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:25:56,680 INFO L424 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:25:56,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:25:56,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1688978024, now seen corresponding path program 90 times [2018-10-15 15:25:56,681 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:25:56,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:25:59,707 INFO L134 CoverageAnalysis]: Checked inductivity of 12195 backedges. 0 proven. 12195 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:25:59,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:25:59,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-15 15:25:59,707 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-15 15:25:59,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-15 15:25:59,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-10-15 15:25:59,708 INFO L87 Difference]: Start difference. First operand 283 states and 283 transitions. Second operand 93 states. [2018-10-15 15:26:00,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:26:00,124 INFO L93 Difference]: Finished difference Result 287 states and 287 transitions. [2018-10-15 15:26:00,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-15 15:26:00,124 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 282 [2018-10-15 15:26:00,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:26:00,125 INFO L225 Difference]: With dead ends: 287 [2018-10-15 15:26:00,126 INFO L226 Difference]: Without dead ends: 287 [2018-10-15 15:26:00,126 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-10-15 15:26:00,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-10-15 15:26:00,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 286. [2018-10-15 15:26:00,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-10-15 15:26:00,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 286 transitions. [2018-10-15 15:26:00,128 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 286 transitions. Word has length 282 [2018-10-15 15:26:00,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:26:00,128 INFO L481 AbstractCegarLoop]: Abstraction has 286 states and 286 transitions. [2018-10-15 15:26:00,128 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-15 15:26:00,129 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 286 transitions. [2018-10-15 15:26:00,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-10-15 15:26:00,129 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:26:00,130 INFO L375 BasicCegarLoop]: trace histogram [92, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:26:00,130 INFO L424 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:26:00,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:26:00,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1585539554, now seen corresponding path program 91 times [2018-10-15 15:26:00,130 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:26:00,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:26:03,418 INFO L134 CoverageAnalysis]: Checked inductivity of 12467 backedges. 0 proven. 12467 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:26:03,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:26:03,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-10-15 15:26:03,419 INFO L460 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-10-15 15:26:03,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-10-15 15:26:03,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-10-15 15:26:03,420 INFO L87 Difference]: Start difference. First operand 286 states and 286 transitions. Second operand 94 states. [2018-10-15 15:26:03,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:26:03,917 INFO L93 Difference]: Finished difference Result 290 states and 290 transitions. [2018-10-15 15:26:03,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-10-15 15:26:03,917 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 285 [2018-10-15 15:26:03,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:26:03,918 INFO L225 Difference]: With dead ends: 290 [2018-10-15 15:26:03,918 INFO L226 Difference]: Without dead ends: 290 [2018-10-15 15:26:03,918 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-10-15 15:26:03,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-10-15 15:26:03,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 289. [2018-10-15 15:26:03,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-10-15 15:26:03,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 289 transitions. [2018-10-15 15:26:03,922 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 289 transitions. Word has length 285 [2018-10-15 15:26:03,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:26:03,922 INFO L481 AbstractCegarLoop]: Abstraction has 289 states and 289 transitions. [2018-10-15 15:26:03,922 INFO L482 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-10-15 15:26:03,922 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 289 transitions. [2018-10-15 15:26:03,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-10-15 15:26:03,923 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:26:03,923 INFO L375 BasicCegarLoop]: trace histogram [93, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:26:03,923 INFO L424 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:26:03,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:26:03,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1146511704, now seen corresponding path program 92 times [2018-10-15 15:26:03,924 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:26:03,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:26:07,363 INFO L134 CoverageAnalysis]: Checked inductivity of 12742 backedges. 0 proven. 12742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:26:07,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:26:07,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-10-15 15:26:07,364 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-15 15:26:07,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-15 15:26:07,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 15:26:07,365 INFO L87 Difference]: Start difference. First operand 289 states and 289 transitions. Second operand 95 states. [2018-10-15 15:26:08,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:26:08,123 INFO L93 Difference]: Finished difference Result 293 states and 293 transitions. [2018-10-15 15:26:08,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-10-15 15:26:08,123 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 288 [2018-10-15 15:26:08,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:26:08,124 INFO L225 Difference]: With dead ends: 293 [2018-10-15 15:26:08,124 INFO L226 Difference]: Without dead ends: 293 [2018-10-15 15:26:08,125 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 15:26:08,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-10-15 15:26:08,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 292. [2018-10-15 15:26:08,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-10-15 15:26:08,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 292 transitions. [2018-10-15 15:26:08,128 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 292 transitions. Word has length 288 [2018-10-15 15:26:08,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:26:08,128 INFO L481 AbstractCegarLoop]: Abstraction has 292 states and 292 transitions. [2018-10-15 15:26:08,128 INFO L482 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-15 15:26:08,128 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 292 transitions. [2018-10-15 15:26:08,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2018-10-15 15:26:08,129 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:26:08,129 INFO L375 BasicCegarLoop]: trace histogram [94, 93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:26:08,129 INFO L424 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:26:08,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:26:08,130 INFO L82 PathProgramCache]: Analyzing trace with hash -243248674, now seen corresponding path program 93 times [2018-10-15 15:26:08,130 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:26:08,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:26:11,457 INFO L134 CoverageAnalysis]: Checked inductivity of 13020 backedges. 0 proven. 13020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:26:11,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:26:11,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-10-15 15:26:11,457 INFO L460 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-10-15 15:26:11,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-10-15 15:26:11,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-10-15 15:26:11,458 INFO L87 Difference]: Start difference. First operand 292 states and 292 transitions. Second operand 96 states. [2018-10-15 15:26:12,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:26:12,013 INFO L93 Difference]: Finished difference Result 296 states and 296 transitions. [2018-10-15 15:26:12,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-15 15:26:12,013 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 291 [2018-10-15 15:26:12,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:26:12,014 INFO L225 Difference]: With dead ends: 296 [2018-10-15 15:26:12,014 INFO L226 Difference]: Without dead ends: 296 [2018-10-15 15:26:12,014 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-10-15 15:26:12,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-10-15 15:26:12,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 295. [2018-10-15 15:26:12,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-10-15 15:26:12,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 295 transitions. [2018-10-15 15:26:12,018 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 295 transitions. Word has length 291 [2018-10-15 15:26:12,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:26:12,018 INFO L481 AbstractCegarLoop]: Abstraction has 295 states and 295 transitions. [2018-10-15 15:26:12,018 INFO L482 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-10-15 15:26:12,018 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 295 transitions. [2018-10-15 15:26:12,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-10-15 15:26:12,019 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:26:12,019 INFO L375 BasicCegarLoop]: trace histogram [95, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:26:12,019 INFO L424 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:26:12,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:26:12,020 INFO L82 PathProgramCache]: Analyzing trace with hash 895568616, now seen corresponding path program 94 times [2018-10-15 15:26:12,020 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:26:12,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:26:15,863 INFO L134 CoverageAnalysis]: Checked inductivity of 13301 backedges. 0 proven. 13301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:26:15,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:26:15,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-10-15 15:26:15,864 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-15 15:26:15,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-15 15:26:15,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-10-15 15:26:15,865 INFO L87 Difference]: Start difference. First operand 295 states and 295 transitions. Second operand 97 states. [2018-10-15 15:26:16,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:26:16,422 INFO L93 Difference]: Finished difference Result 299 states and 299 transitions. [2018-10-15 15:26:16,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-10-15 15:26:16,423 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 294 [2018-10-15 15:26:16,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:26:16,424 INFO L225 Difference]: With dead ends: 299 [2018-10-15 15:26:16,424 INFO L226 Difference]: Without dead ends: 299 [2018-10-15 15:26:16,424 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-10-15 15:26:16,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-10-15 15:26:16,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 298. [2018-10-15 15:26:16,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-10-15 15:26:16,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 298 transitions. [2018-10-15 15:26:16,427 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 298 transitions. Word has length 294 [2018-10-15 15:26:16,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:26:16,427 INFO L481 AbstractCegarLoop]: Abstraction has 298 states and 298 transitions. [2018-10-15 15:26:16,427 INFO L482 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-15 15:26:16,427 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 298 transitions. [2018-10-15 15:26:16,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-10-15 15:26:16,428 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:26:16,428 INFO L375 BasicCegarLoop]: trace histogram [96, 95, 95, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:26:16,428 INFO L424 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:26:16,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:26:16,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1454783902, now seen corresponding path program 95 times [2018-10-15 15:26:16,429 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:26:16,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:26:19,700 INFO L134 CoverageAnalysis]: Checked inductivity of 13585 backedges. 0 proven. 13585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:26:19,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:26:19,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-10-15 15:26:19,701 INFO L460 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-10-15 15:26:19,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-10-15 15:26:19,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-10-15 15:26:19,702 INFO L87 Difference]: Start difference. First operand 298 states and 298 transitions. Second operand 98 states. [2018-10-15 15:26:20,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:26:20,535 INFO L93 Difference]: Finished difference Result 302 states and 302 transitions. [2018-10-15 15:26:20,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-10-15 15:26:20,535 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 297 [2018-10-15 15:26:20,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:26:20,537 INFO L225 Difference]: With dead ends: 302 [2018-10-15 15:26:20,537 INFO L226 Difference]: Without dead ends: 302 [2018-10-15 15:26:20,537 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-10-15 15:26:20,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-10-15 15:26:20,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 301. [2018-10-15 15:26:20,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-10-15 15:26:20,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2018-10-15 15:26:20,539 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 297 [2018-10-15 15:26:20,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:26:20,540 INFO L481 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2018-10-15 15:26:20,540 INFO L482 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-10-15 15:26:20,540 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2018-10-15 15:26:20,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-10-15 15:26:20,541 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:26:20,541 INFO L375 BasicCegarLoop]: trace histogram [97, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:26:20,542 INFO L424 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:26:20,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:26:20,542 INFO L82 PathProgramCache]: Analyzing trace with hash 859227944, now seen corresponding path program 96 times [2018-10-15 15:26:20,542 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:26:20,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:26:24,207 INFO L134 CoverageAnalysis]: Checked inductivity of 13872 backedges. 0 proven. 13872 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:26:24,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:26:24,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-10-15 15:26:24,208 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-15 15:26:24,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-15 15:26:24,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 15:26:24,209 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 99 states. [2018-10-15 15:26:24,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:26:24,819 INFO L93 Difference]: Finished difference Result 305 states and 305 transitions. [2018-10-15 15:26:24,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-10-15 15:26:24,819 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 300 [2018-10-15 15:26:24,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:26:24,820 INFO L225 Difference]: With dead ends: 305 [2018-10-15 15:26:24,821 INFO L226 Difference]: Without dead ends: 305 [2018-10-15 15:26:24,821 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 15:26:24,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-10-15 15:26:24,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 304. [2018-10-15 15:26:24,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-10-15 15:26:24,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 304 transitions. [2018-10-15 15:26:24,823 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 304 transitions. Word has length 300 [2018-10-15 15:26:24,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:26:24,824 INFO L481 AbstractCegarLoop]: Abstraction has 304 states and 304 transitions. [2018-10-15 15:26:24,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-15 15:26:24,824 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 304 transitions. [2018-10-15 15:26:24,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-10-15 15:26:24,825 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:26:24,825 INFO L375 BasicCegarLoop]: trace histogram [98, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:26:24,825 INFO L424 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:26:24,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:26:24,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1161582942, now seen corresponding path program 97 times [2018-10-15 15:26:24,826 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:26:24,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:26:28,530 INFO L134 CoverageAnalysis]: Checked inductivity of 14162 backedges. 0 proven. 14162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:26:28,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:26:28,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-10-15 15:26:28,531 INFO L460 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-10-15 15:26:28,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-10-15 15:26:28,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-10-15 15:26:28,532 INFO L87 Difference]: Start difference. First operand 304 states and 304 transitions. Second operand 100 states. [2018-10-15 15:26:29,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:26:29,382 INFO L93 Difference]: Finished difference Result 308 states and 308 transitions. [2018-10-15 15:26:29,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-10-15 15:26:29,383 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 303 [2018-10-15 15:26:29,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:26:29,384 INFO L225 Difference]: With dead ends: 308 [2018-10-15 15:26:29,384 INFO L226 Difference]: Without dead ends: 308 [2018-10-15 15:26:29,384 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-10-15 15:26:29,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-10-15 15:26:29,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 307. [2018-10-15 15:26:29,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-10-15 15:26:29,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 307 transitions. [2018-10-15 15:26:29,386 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 307 transitions. Word has length 303 [2018-10-15 15:26:29,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:26:29,387 INFO L481 AbstractCegarLoop]: Abstraction has 307 states and 307 transitions. [2018-10-15 15:26:29,387 INFO L482 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-10-15 15:26:29,387 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 307 transitions. [2018-10-15 15:26:29,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-10-15 15:26:29,388 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:26:29,388 INFO L375 BasicCegarLoop]: trace histogram [99, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:26:29,388 INFO L424 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:26:29,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:26:29,388 INFO L82 PathProgramCache]: Analyzing trace with hash 2072908648, now seen corresponding path program 98 times [2018-10-15 15:26:29,389 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:26:29,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:26:33,296 INFO L134 CoverageAnalysis]: Checked inductivity of 14455 backedges. 0 proven. 14455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:26:33,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:26:33,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-10-15 15:26:33,297 INFO L460 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-10-15 15:26:33,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-10-15 15:26:33,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-10-15 15:26:33,298 INFO L87 Difference]: Start difference. First operand 307 states and 307 transitions. Second operand 101 states. [2018-10-15 15:26:33,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:26:33,845 INFO L93 Difference]: Finished difference Result 311 states and 311 transitions. [2018-10-15 15:26:33,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-10-15 15:26:33,845 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 306 [2018-10-15 15:26:33,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:26:33,847 INFO L225 Difference]: With dead ends: 311 [2018-10-15 15:26:33,847 INFO L226 Difference]: Without dead ends: 311 [2018-10-15 15:26:33,847 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-10-15 15:26:33,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-10-15 15:26:33,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 310. [2018-10-15 15:26:33,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-10-15 15:26:33,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 310 transitions. [2018-10-15 15:26:33,850 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 310 transitions. Word has length 306 [2018-10-15 15:26:33,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:26:33,851 INFO L481 AbstractCegarLoop]: Abstraction has 310 states and 310 transitions. [2018-10-15 15:26:33,851 INFO L482 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-10-15 15:26:33,851 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 310 transitions. [2018-10-15 15:26:33,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2018-10-15 15:26:33,852 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:26:33,852 INFO L375 BasicCegarLoop]: trace histogram [100, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:26:33,852 INFO L424 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:26:33,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:26:33,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1406229218, now seen corresponding path program 99 times [2018-10-15 15:26:33,853 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:26:33,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:26:37,816 INFO L134 CoverageAnalysis]: Checked inductivity of 14751 backedges. 0 proven. 14751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:26:37,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:26:37,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-10-15 15:26:37,817 INFO L460 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-10-15 15:26:37,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-10-15 15:26:37,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-10-15 15:26:37,818 INFO L87 Difference]: Start difference. First operand 310 states and 310 transitions. Second operand 102 states. [2018-10-15 15:26:38,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:26:38,388 INFO L93 Difference]: Finished difference Result 314 states and 314 transitions. [2018-10-15 15:26:38,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-10-15 15:26:38,388 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 309 [2018-10-15 15:26:38,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:26:38,390 INFO L225 Difference]: With dead ends: 314 [2018-10-15 15:26:38,390 INFO L226 Difference]: Without dead ends: 314 [2018-10-15 15:26:38,391 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-10-15 15:26:38,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-10-15 15:26:38,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 313. [2018-10-15 15:26:38,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-10-15 15:26:38,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 313 transitions. [2018-10-15 15:26:38,395 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 313 transitions. Word has length 309 [2018-10-15 15:26:38,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:26:38,395 INFO L481 AbstractCegarLoop]: Abstraction has 313 states and 313 transitions. [2018-10-15 15:26:38,395 INFO L482 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-10-15 15:26:38,395 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 313 transitions. [2018-10-15 15:26:38,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-10-15 15:26:38,396 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:26:38,397 INFO L375 BasicCegarLoop]: trace histogram [101, 100, 100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:26:38,397 INFO L424 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:26:38,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:26:38,397 INFO L82 PathProgramCache]: Analyzing trace with hash 2043359144, now seen corresponding path program 100 times [2018-10-15 15:26:38,398 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:26:38,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:26:42,374 INFO L134 CoverageAnalysis]: Checked inductivity of 15050 backedges. 0 proven. 15050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:26:42,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:26:42,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-10-15 15:26:42,374 INFO L460 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-10-15 15:26:42,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-10-15 15:26:42,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 15:26:42,376 INFO L87 Difference]: Start difference. First operand 313 states and 313 transitions. Second operand 103 states. [2018-10-15 15:26:43,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:26:43,300 INFO L93 Difference]: Finished difference Result 317 states and 317 transitions. [2018-10-15 15:26:43,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-10-15 15:26:43,301 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 312 [2018-10-15 15:26:43,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:26:43,302 INFO L225 Difference]: With dead ends: 317 [2018-10-15 15:26:43,302 INFO L226 Difference]: Without dead ends: 317 [2018-10-15 15:26:43,303 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 15:26:43,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-10-15 15:26:43,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 316. [2018-10-15 15:26:43,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-10-15 15:26:43,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 316 transitions. [2018-10-15 15:26:43,306 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 316 transitions. Word has length 312 [2018-10-15 15:26:43,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:26:43,306 INFO L481 AbstractCegarLoop]: Abstraction has 316 states and 316 transitions. [2018-10-15 15:26:43,306 INFO L482 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-10-15 15:26:43,306 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 316 transitions. [2018-10-15 15:26:43,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2018-10-15 15:26:43,308 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:26:43,308 INFO L375 BasicCegarLoop]: trace histogram [102, 101, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:26:43,308 INFO L424 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:26:43,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:26:43,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1247207202, now seen corresponding path program 101 times [2018-10-15 15:26:43,309 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:26:43,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:26:47,406 INFO L134 CoverageAnalysis]: Checked inductivity of 15352 backedges. 0 proven. 15352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:26:47,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:26:47,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2018-10-15 15:26:47,407 INFO L460 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-10-15 15:26:47,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-10-15 15:26:47,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-10-15 15:26:47,408 INFO L87 Difference]: Start difference. First operand 316 states and 316 transitions. Second operand 104 states. [2018-10-15 15:26:48,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:26:48,191 INFO L93 Difference]: Finished difference Result 320 states and 320 transitions. [2018-10-15 15:26:48,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-10-15 15:26:48,191 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 315 [2018-10-15 15:26:48,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:26:48,192 INFO L225 Difference]: With dead ends: 320 [2018-10-15 15:26:48,192 INFO L226 Difference]: Without dead ends: 320 [2018-10-15 15:26:48,193 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-10-15 15:26:48,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-10-15 15:26:48,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 319. [2018-10-15 15:26:48,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-10-15 15:26:48,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 319 transitions. [2018-10-15 15:26:48,196 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 319 transitions. Word has length 315 [2018-10-15 15:26:48,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:26:48,196 INFO L481 AbstractCegarLoop]: Abstraction has 319 states and 319 transitions. [2018-10-15 15:26:48,196 INFO L482 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-10-15 15:26:48,196 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 319 transitions. [2018-10-15 15:26:48,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-10-15 15:26:48,197 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:26:48,197 INFO L375 BasicCegarLoop]: trace histogram [103, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:26:48,197 INFO L424 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:26:48,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:26:48,197 INFO L82 PathProgramCache]: Analyzing trace with hash 2119310312, now seen corresponding path program 102 times [2018-10-15 15:26:48,198 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:26:48,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:26:52,450 INFO L134 CoverageAnalysis]: Checked inductivity of 15657 backedges. 0 proven. 15657 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:26:52,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:26:52,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-10-15 15:26:52,451 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-10-15 15:26:52,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-10-15 15:26:52,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2018-10-15 15:26:52,452 INFO L87 Difference]: Start difference. First operand 319 states and 319 transitions. Second operand 105 states. [2018-10-15 15:26:53,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:26:53,225 INFO L93 Difference]: Finished difference Result 323 states and 323 transitions. [2018-10-15 15:26:53,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-10-15 15:26:53,226 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 318 [2018-10-15 15:26:53,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:26:53,226 INFO L225 Difference]: With dead ends: 323 [2018-10-15 15:26:53,227 INFO L226 Difference]: Without dead ends: 323 [2018-10-15 15:26:53,227 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2018-10-15 15:26:53,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-10-15 15:26:53,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 322. [2018-10-15 15:26:53,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2018-10-15 15:26:53,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 322 transitions. [2018-10-15 15:26:53,230 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 322 transitions. Word has length 318 [2018-10-15 15:26:53,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:26:53,231 INFO L481 AbstractCegarLoop]: Abstraction has 322 states and 322 transitions. [2018-10-15 15:26:53,231 INFO L482 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-10-15 15:26:53,231 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 322 transitions. [2018-10-15 15:26:53,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2018-10-15 15:26:53,232 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:26:53,232 INFO L375 BasicCegarLoop]: trace histogram [104, 103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:26:53,233 INFO L424 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:26:53,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:26:53,233 INFO L82 PathProgramCache]: Analyzing trace with hash -2033726306, now seen corresponding path program 103 times [2018-10-15 15:26:53,233 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:26:53,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:26:57,266 INFO L134 CoverageAnalysis]: Checked inductivity of 15965 backedges. 0 proven. 15965 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:26:57,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:26:57,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2018-10-15 15:26:57,266 INFO L460 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-10-15 15:26:57,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-10-15 15:26:57,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-10-15 15:26:57,267 INFO L87 Difference]: Start difference. First operand 322 states and 322 transitions. Second operand 106 states. [2018-10-15 15:26:58,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:26:58,136 INFO L93 Difference]: Finished difference Result 326 states and 326 transitions. [2018-10-15 15:26:58,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-10-15 15:26:58,137 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 321 [2018-10-15 15:26:58,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:26:58,137 INFO L225 Difference]: With dead ends: 326 [2018-10-15 15:26:58,137 INFO L226 Difference]: Without dead ends: 326 [2018-10-15 15:26:58,138 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-10-15 15:26:58,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-10-15 15:26:58,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 325. [2018-10-15 15:26:58,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-10-15 15:26:58,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 325 transitions. [2018-10-15 15:26:58,141 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 325 transitions. Word has length 321 [2018-10-15 15:26:58,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:26:58,141 INFO L481 AbstractCegarLoop]: Abstraction has 325 states and 325 transitions. [2018-10-15 15:26:58,141 INFO L482 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-10-15 15:26:58,141 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 325 transitions. [2018-10-15 15:26:58,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-10-15 15:26:58,143 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:26:58,143 INFO L375 BasicCegarLoop]: trace histogram [105, 104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:26:58,143 INFO L424 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:26:58,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:26:58,143 INFO L82 PathProgramCache]: Analyzing trace with hash -24717272, now seen corresponding path program 104 times [2018-10-15 15:26:58,144 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:26:58,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:27:02,129 INFO L134 CoverageAnalysis]: Checked inductivity of 16276 backedges. 0 proven. 16276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:27:02,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:27:02,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-10-15 15:27:02,129 INFO L460 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-10-15 15:27:02,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-10-15 15:27:02,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 15:27:02,130 INFO L87 Difference]: Start difference. First operand 325 states and 325 transitions. Second operand 107 states. [2018-10-15 15:27:03,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:27:03,161 INFO L93 Difference]: Finished difference Result 329 states and 329 transitions. [2018-10-15 15:27:03,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-10-15 15:27:03,161 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 324 [2018-10-15 15:27:03,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:27:03,162 INFO L225 Difference]: With dead ends: 329 [2018-10-15 15:27:03,162 INFO L226 Difference]: Without dead ends: 329 [2018-10-15 15:27:03,162 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 15:27:03,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-10-15 15:27:03,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 328. [2018-10-15 15:27:03,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-10-15 15:27:03,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 328 transitions. [2018-10-15 15:27:03,164 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 328 transitions. Word has length 324 [2018-10-15 15:27:03,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:27:03,165 INFO L481 AbstractCegarLoop]: Abstraction has 328 states and 328 transitions. [2018-10-15 15:27:03,165 INFO L482 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-10-15 15:27:03,165 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 328 transitions. [2018-10-15 15:27:03,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-10-15 15:27:03,165 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:27:03,166 INFO L375 BasicCegarLoop]: trace histogram [106, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:27:03,166 INFO L424 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:27:03,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:27:03,166 INFO L82 PathProgramCache]: Analyzing trace with hash -5855138, now seen corresponding path program 105 times [2018-10-15 15:27:03,166 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:27:03,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:27:07,198 INFO L134 CoverageAnalysis]: Checked inductivity of 16590 backedges. 0 proven. 16590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:27:07,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:27:07,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-10-15 15:27:07,199 INFO L460 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-10-15 15:27:07,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-10-15 15:27:07,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-10-15 15:27:07,200 INFO L87 Difference]: Start difference. First operand 328 states and 328 transitions. Second operand 108 states. [2018-10-15 15:27:08,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:27:08,227 INFO L93 Difference]: Finished difference Result 332 states and 332 transitions. [2018-10-15 15:27:08,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-10-15 15:27:08,227 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 327 [2018-10-15 15:27:08,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:27:08,228 INFO L225 Difference]: With dead ends: 332 [2018-10-15 15:27:08,228 INFO L226 Difference]: Without dead ends: 332 [2018-10-15 15:27:08,228 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-10-15 15:27:08,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-10-15 15:27:08,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 331. [2018-10-15 15:27:08,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-10-15 15:27:08,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 331 transitions. [2018-10-15 15:27:08,230 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 331 transitions. Word has length 327 [2018-10-15 15:27:08,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:27:08,230 INFO L481 AbstractCegarLoop]: Abstraction has 331 states and 331 transitions. [2018-10-15 15:27:08,230 INFO L482 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-10-15 15:27:08,231 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 331 transitions. [2018-10-15 15:27:08,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-10-15 15:27:08,231 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:27:08,232 INFO L375 BasicCegarLoop]: trace histogram [107, 106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:27:08,232 INFO L424 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:27:08,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:27:08,232 INFO L82 PathProgramCache]: Analyzing trace with hash -724736920, now seen corresponding path program 106 times [2018-10-15 15:27:08,232 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:27:08,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:27:12,304 INFO L134 CoverageAnalysis]: Checked inductivity of 16907 backedges. 0 proven. 16907 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:27:12,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:27:12,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-10-15 15:27:12,305 INFO L460 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-10-15 15:27:12,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-10-15 15:27:12,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2018-10-15 15:27:12,306 INFO L87 Difference]: Start difference. First operand 331 states and 331 transitions. Second operand 109 states. [2018-10-15 15:27:13,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:27:13,327 INFO L93 Difference]: Finished difference Result 335 states and 335 transitions. [2018-10-15 15:27:13,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-10-15 15:27:13,327 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 330 [2018-10-15 15:27:13,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:27:13,328 INFO L225 Difference]: With dead ends: 335 [2018-10-15 15:27:13,328 INFO L226 Difference]: Without dead ends: 335 [2018-10-15 15:27:13,328 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2018-10-15 15:27:13,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-10-15 15:27:13,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 334. [2018-10-15 15:27:13,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-10-15 15:27:13,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 334 transitions. [2018-10-15 15:27:13,330 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 334 transitions. Word has length 330 [2018-10-15 15:27:13,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:27:13,331 INFO L481 AbstractCegarLoop]: Abstraction has 334 states and 334 transitions. [2018-10-15 15:27:13,331 INFO L482 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-10-15 15:27:13,331 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 334 transitions. [2018-10-15 15:27:13,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-10-15 15:27:13,332 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:27:13,332 INFO L375 BasicCegarLoop]: trace histogram [108, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:27:13,332 INFO L424 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:27:13,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:27:13,332 INFO L82 PathProgramCache]: Analyzing trace with hash 2070000670, now seen corresponding path program 107 times [2018-10-15 15:27:13,333 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:27:13,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:27:17,573 INFO L134 CoverageAnalysis]: Checked inductivity of 17227 backedges. 0 proven. 17227 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:27:17,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:27:17,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2018-10-15 15:27:17,573 INFO L460 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-10-15 15:27:17,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-10-15 15:27:17,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-10-15 15:27:17,574 INFO L87 Difference]: Start difference. First operand 334 states and 334 transitions. Second operand 110 states. [2018-10-15 15:27:18,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:27:18,599 INFO L93 Difference]: Finished difference Result 338 states and 338 transitions. [2018-10-15 15:27:18,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-10-15 15:27:18,599 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 333 [2018-10-15 15:27:18,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:27:18,600 INFO L225 Difference]: With dead ends: 338 [2018-10-15 15:27:18,600 INFO L226 Difference]: Without dead ends: 338 [2018-10-15 15:27:18,600 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-10-15 15:27:18,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-10-15 15:27:18,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 337. [2018-10-15 15:27:18,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-10-15 15:27:18,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 337 transitions. [2018-10-15 15:27:18,602 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 337 transitions. Word has length 333 [2018-10-15 15:27:18,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:27:18,602 INFO L481 AbstractCegarLoop]: Abstraction has 337 states and 337 transitions. [2018-10-15 15:27:18,602 INFO L482 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-10-15 15:27:18,602 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 337 transitions. [2018-10-15 15:27:18,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-10-15 15:27:18,603 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:27:18,603 INFO L375 BasicCegarLoop]: trace histogram [109, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:27:18,603 INFO L424 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:27:18,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:27:18,604 INFO L82 PathProgramCache]: Analyzing trace with hash -2138455896, now seen corresponding path program 108 times [2018-10-15 15:27:18,604 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:27:18,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:27:23,179 INFO L134 CoverageAnalysis]: Checked inductivity of 17550 backedges. 0 proven. 17550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:27:23,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:27:23,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-10-15 15:27:23,180 INFO L460 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-10-15 15:27:23,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-10-15 15:27:23,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 15:27:23,181 INFO L87 Difference]: Start difference. First operand 337 states and 337 transitions. Second operand 111 states. [2018-10-15 15:27:24,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:27:24,027 INFO L93 Difference]: Finished difference Result 341 states and 341 transitions. [2018-10-15 15:27:24,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-10-15 15:27:24,028 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 336 [2018-10-15 15:27:24,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:27:24,028 INFO L225 Difference]: With dead ends: 341 [2018-10-15 15:27:24,029 INFO L226 Difference]: Without dead ends: 341 [2018-10-15 15:27:24,029 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 15:27:24,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-10-15 15:27:24,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 340. [2018-10-15 15:27:24,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-10-15 15:27:24,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 340 transitions. [2018-10-15 15:27:24,031 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 340 transitions. Word has length 336 [2018-10-15 15:27:24,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:27:24,031 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 340 transitions. [2018-10-15 15:27:24,031 INFO L482 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-10-15 15:27:24,031 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 340 transitions. [2018-10-15 15:27:24,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2018-10-15 15:27:24,032 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:27:24,032 INFO L375 BasicCegarLoop]: trace histogram [110, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:27:24,033 INFO L424 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:27:24,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:27:24,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1877676066, now seen corresponding path program 109 times [2018-10-15 15:27:24,033 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:27:24,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:27:28,652 INFO L134 CoverageAnalysis]: Checked inductivity of 17876 backedges. 0 proven. 17876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:27:28,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:27:28,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2018-10-15 15:27:28,652 INFO L460 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-10-15 15:27:28,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-10-15 15:27:28,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-10-15 15:27:28,654 INFO L87 Difference]: Start difference. First operand 340 states and 340 transitions. Second operand 112 states. [2018-10-15 15:27:29,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:27:29,564 INFO L93 Difference]: Finished difference Result 344 states and 344 transitions. [2018-10-15 15:27:29,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-10-15 15:27:29,565 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 339 [2018-10-15 15:27:29,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:27:29,565 INFO L225 Difference]: With dead ends: 344 [2018-10-15 15:27:29,565 INFO L226 Difference]: Without dead ends: 344 [2018-10-15 15:27:29,566 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-10-15 15:27:29,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-10-15 15:27:29,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 343. [2018-10-15 15:27:29,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-10-15 15:27:29,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 343 transitions. [2018-10-15 15:27:29,568 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 343 transitions. Word has length 339 [2018-10-15 15:27:29,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:27:29,569 INFO L481 AbstractCegarLoop]: Abstraction has 343 states and 343 transitions. [2018-10-15 15:27:29,569 INFO L482 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-10-15 15:27:29,569 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 343 transitions. [2018-10-15 15:27:29,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-10-15 15:27:29,570 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:27:29,570 INFO L375 BasicCegarLoop]: trace histogram [111, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:27:29,571 INFO L424 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:27:29,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:27:29,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1713368296, now seen corresponding path program 110 times [2018-10-15 15:27:29,571 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:27:29,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:27:34,323 INFO L134 CoverageAnalysis]: Checked inductivity of 18205 backedges. 0 proven. 18205 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:27:34,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:27:34,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-10-15 15:27:34,323 INFO L460 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-10-15 15:27:34,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-10-15 15:27:34,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2018-10-15 15:27:34,324 INFO L87 Difference]: Start difference. First operand 343 states and 343 transitions. Second operand 113 states. [2018-10-15 15:27:35,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:27:35,443 INFO L93 Difference]: Finished difference Result 347 states and 347 transitions. [2018-10-15 15:27:35,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-10-15 15:27:35,443 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 342 [2018-10-15 15:27:35,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:27:35,444 INFO L225 Difference]: With dead ends: 347 [2018-10-15 15:27:35,444 INFO L226 Difference]: Without dead ends: 347 [2018-10-15 15:27:35,444 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2018-10-15 15:27:35,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-10-15 15:27:35,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 346. [2018-10-15 15:27:35,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-10-15 15:27:35,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 346 transitions. [2018-10-15 15:27:35,446 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 346 transitions. Word has length 342 [2018-10-15 15:27:35,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:27:35,446 INFO L481 AbstractCegarLoop]: Abstraction has 346 states and 346 transitions. [2018-10-15 15:27:35,447 INFO L482 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-10-15 15:27:35,447 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 346 transitions. [2018-10-15 15:27:35,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2018-10-15 15:27:35,447 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:27:35,448 INFO L375 BasicCegarLoop]: trace histogram [112, 111, 111, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:27:35,448 INFO L424 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:27:35,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:27:35,448 INFO L82 PathProgramCache]: Analyzing trace with hash -824419426, now seen corresponding path program 111 times [2018-10-15 15:27:35,448 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:27:35,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:27:40,360 INFO L134 CoverageAnalysis]: Checked inductivity of 18537 backedges. 0 proven. 18537 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:27:40,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:27:40,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2018-10-15 15:27:40,361 INFO L460 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-10-15 15:27:40,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-10-15 15:27:40,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-10-15 15:27:40,362 INFO L87 Difference]: Start difference. First operand 346 states and 346 transitions. Second operand 114 states. [2018-10-15 15:27:41,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:27:41,069 INFO L93 Difference]: Finished difference Result 350 states and 350 transitions. [2018-10-15 15:27:41,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-10-15 15:27:41,069 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 345 [2018-10-15 15:27:41,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:27:41,070 INFO L225 Difference]: With dead ends: 350 [2018-10-15 15:27:41,070 INFO L226 Difference]: Without dead ends: 350 [2018-10-15 15:27:41,071 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-10-15 15:27:41,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-10-15 15:27:41,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 349. [2018-10-15 15:27:41,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-10-15 15:27:41,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 349 transitions. [2018-10-15 15:27:41,074 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 349 transitions. Word has length 345 [2018-10-15 15:27:41,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:27:41,075 INFO L481 AbstractCegarLoop]: Abstraction has 349 states and 349 transitions. [2018-10-15 15:27:41,075 INFO L482 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-10-15 15:27:41,075 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 349 transitions. [2018-10-15 15:27:41,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-10-15 15:27:41,076 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:27:41,076 INFO L375 BasicCegarLoop]: trace histogram [113, 112, 112, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:27:41,076 INFO L424 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:27:41,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:27:41,076 INFO L82 PathProgramCache]: Analyzing trace with hash 250865960, now seen corresponding path program 112 times [2018-10-15 15:27:41,077 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:27:41,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:27:45,966 INFO L134 CoverageAnalysis]: Checked inductivity of 18872 backedges. 0 proven. 18872 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:27:45,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:27:45,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-10-15 15:27:45,967 INFO L460 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-10-15 15:27:45,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-10-15 15:27:45,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 15:27:45,968 INFO L87 Difference]: Start difference. First operand 349 states and 349 transitions. Second operand 115 states. [2018-10-15 15:27:46,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:27:46,663 INFO L93 Difference]: Finished difference Result 353 states and 353 transitions. [2018-10-15 15:27:46,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-10-15 15:27:46,663 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 348 [2018-10-15 15:27:46,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:27:46,664 INFO L225 Difference]: With dead ends: 353 [2018-10-15 15:27:46,664 INFO L226 Difference]: Without dead ends: 353 [2018-10-15 15:27:46,664 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 15:27:46,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-10-15 15:27:46,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 352. [2018-10-15 15:27:46,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2018-10-15 15:27:46,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 352 transitions. [2018-10-15 15:27:46,667 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 352 transitions. Word has length 348 [2018-10-15 15:27:46,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:27:46,667 INFO L481 AbstractCegarLoop]: Abstraction has 352 states and 352 transitions. [2018-10-15 15:27:46,667 INFO L482 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-10-15 15:27:46,667 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 352 transitions. [2018-10-15 15:27:46,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2018-10-15 15:27:46,668 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:27:46,668 INFO L375 BasicCegarLoop]: trace histogram [114, 113, 113, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:27:46,669 INFO L424 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:27:46,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:27:46,669 INFO L82 PathProgramCache]: Analyzing trace with hash -2083260578, now seen corresponding path program 113 times [2018-10-15 15:27:46,669 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:27:46,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:27:51,620 INFO L134 CoverageAnalysis]: Checked inductivity of 19210 backedges. 0 proven. 19210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:27:51,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:27:51,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2018-10-15 15:27:51,621 INFO L460 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-10-15 15:27:51,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-10-15 15:27:51,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-10-15 15:27:51,622 INFO L87 Difference]: Start difference. First operand 352 states and 352 transitions. Second operand 116 states. [2018-10-15 15:27:52,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:27:52,831 INFO L93 Difference]: Finished difference Result 356 states and 356 transitions. [2018-10-15 15:27:52,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-10-15 15:27:52,831 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 351 [2018-10-15 15:27:52,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:27:52,832 INFO L225 Difference]: With dead ends: 356 [2018-10-15 15:27:52,832 INFO L226 Difference]: Without dead ends: 356 [2018-10-15 15:27:52,832 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-10-15 15:27:52,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-10-15 15:27:52,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 355. [2018-10-15 15:27:52,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-10-15 15:27:52,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 355 transitions. [2018-10-15 15:27:52,835 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 355 transitions. Word has length 351 [2018-10-15 15:27:52,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:27:52,835 INFO L481 AbstractCegarLoop]: Abstraction has 355 states and 355 transitions. [2018-10-15 15:27:52,835 INFO L482 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-10-15 15:27:52,835 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 355 transitions. [2018-10-15 15:27:52,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2018-10-15 15:27:52,836 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:27:52,836 INFO L375 BasicCegarLoop]: trace histogram [115, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:27:52,836 INFO L424 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:27:52,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:27:52,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1768535400, now seen corresponding path program 114 times [2018-10-15 15:27:52,837 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:27:52,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:27:57,670 INFO L134 CoverageAnalysis]: Checked inductivity of 19551 backedges. 0 proven. 19551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:27:57,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:27:57,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-10-15 15:27:57,670 INFO L460 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-10-15 15:27:57,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-10-15 15:27:57,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2018-10-15 15:27:57,671 INFO L87 Difference]: Start difference. First operand 355 states and 355 transitions. Second operand 117 states. [2018-10-15 15:27:58,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:27:58,806 INFO L93 Difference]: Finished difference Result 359 states and 359 transitions. [2018-10-15 15:27:58,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-10-15 15:27:58,806 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 354 [2018-10-15 15:27:58,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:27:58,807 INFO L225 Difference]: With dead ends: 359 [2018-10-15 15:27:58,807 INFO L226 Difference]: Without dead ends: 359 [2018-10-15 15:27:58,808 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2018-10-15 15:27:58,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-10-15 15:27:58,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 358. [2018-10-15 15:27:58,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2018-10-15 15:27:58,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 358 transitions. [2018-10-15 15:27:58,810 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 358 transitions. Word has length 354 [2018-10-15 15:27:58,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:27:58,810 INFO L481 AbstractCegarLoop]: Abstraction has 358 states and 358 transitions. [2018-10-15 15:27:58,810 INFO L482 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-10-15 15:27:58,810 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 358 transitions. [2018-10-15 15:27:58,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2018-10-15 15:27:58,811 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:27:58,811 INFO L375 BasicCegarLoop]: trace histogram [116, 115, 115, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:27:58,811 INFO L424 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:27:58,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:27:58,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1981268766, now seen corresponding path program 115 times [2018-10-15 15:27:58,812 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:27:58,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:28:03,748 INFO L134 CoverageAnalysis]: Checked inductivity of 19895 backedges. 0 proven. 19895 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:28:03,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:28:03,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2018-10-15 15:28:03,749 INFO L460 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-10-15 15:28:03,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-10-15 15:28:03,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-10-15 15:28:03,750 INFO L87 Difference]: Start difference. First operand 358 states and 358 transitions. Second operand 118 states. [2018-10-15 15:28:05,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:28:05,068 INFO L93 Difference]: Finished difference Result 362 states and 362 transitions. [2018-10-15 15:28:05,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-10-15 15:28:05,068 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 357 [2018-10-15 15:28:05,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:28:05,069 INFO L225 Difference]: With dead ends: 362 [2018-10-15 15:28:05,069 INFO L226 Difference]: Without dead ends: 362 [2018-10-15 15:28:05,069 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-10-15 15:28:05,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2018-10-15 15:28:05,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 361. [2018-10-15 15:28:05,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-10-15 15:28:05,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 361 transitions. [2018-10-15 15:28:05,071 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 361 transitions. Word has length 357 [2018-10-15 15:28:05,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:28:05,071 INFO L481 AbstractCegarLoop]: Abstraction has 361 states and 361 transitions. [2018-10-15 15:28:05,072 INFO L482 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-10-15 15:28:05,072 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 361 transitions. [2018-10-15 15:28:05,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2018-10-15 15:28:05,073 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:28:05,073 INFO L375 BasicCegarLoop]: trace histogram [117, 116, 116, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:28:05,073 INFO L424 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:28:05,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:28:05,073 INFO L82 PathProgramCache]: Analyzing trace with hash 149246376, now seen corresponding path program 116 times [2018-10-15 15:28:05,074 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:28:05,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:28:10,170 INFO L134 CoverageAnalysis]: Checked inductivity of 20242 backedges. 0 proven. 20242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:28:10,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:28:10,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-10-15 15:28:10,171 INFO L460 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-10-15 15:28:10,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-10-15 15:28:10,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 15:28:10,172 INFO L87 Difference]: Start difference. First operand 361 states and 361 transitions. Second operand 119 states. [2018-10-15 15:28:10,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:28:10,855 INFO L93 Difference]: Finished difference Result 365 states and 365 transitions. [2018-10-15 15:28:10,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-10-15 15:28:10,856 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 360 [2018-10-15 15:28:10,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:28:10,856 INFO L225 Difference]: With dead ends: 365 [2018-10-15 15:28:10,856 INFO L226 Difference]: Without dead ends: 365 [2018-10-15 15:28:10,857 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 15:28:10,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-10-15 15:28:10,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 364. [2018-10-15 15:28:10,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-10-15 15:28:10,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 364 transitions. [2018-10-15 15:28:10,860 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 364 transitions. Word has length 360 [2018-10-15 15:28:10,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:28:10,860 INFO L481 AbstractCegarLoop]: Abstraction has 364 states and 364 transitions. [2018-10-15 15:28:10,860 INFO L482 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-10-15 15:28:10,860 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 364 transitions. [2018-10-15 15:28:10,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2018-10-15 15:28:10,862 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:28:10,862 INFO L375 BasicCegarLoop]: trace histogram [118, 117, 117, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:28:10,862 INFO L424 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:28:10,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:28:10,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1480343842, now seen corresponding path program 117 times [2018-10-15 15:28:10,862 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:28:10,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:28:16,196 INFO L134 CoverageAnalysis]: Checked inductivity of 20592 backedges. 0 proven. 20592 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:28:16,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:28:16,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [120] total 120 [2018-10-15 15:28:16,196 INFO L460 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-10-15 15:28:16,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-10-15 15:28:16,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-10-15 15:28:16,198 INFO L87 Difference]: Start difference. First operand 364 states and 364 transitions. Second operand 120 states. [2018-10-15 15:28:17,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:28:17,471 INFO L93 Difference]: Finished difference Result 368 states and 368 transitions. [2018-10-15 15:28:17,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-10-15 15:28:17,471 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 363 [2018-10-15 15:28:17,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:28:17,472 INFO L225 Difference]: With dead ends: 368 [2018-10-15 15:28:17,472 INFO L226 Difference]: Without dead ends: 368 [2018-10-15 15:28:17,472 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-10-15 15:28:17,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-10-15 15:28:17,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 367. [2018-10-15 15:28:17,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-10-15 15:28:17,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 367 transitions. [2018-10-15 15:28:17,474 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 367 transitions. Word has length 363 [2018-10-15 15:28:17,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:28:17,475 INFO L481 AbstractCegarLoop]: Abstraction has 367 states and 367 transitions. [2018-10-15 15:28:17,475 INFO L482 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-10-15 15:28:17,475 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 367 transitions. [2018-10-15 15:28:17,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2018-10-15 15:28:17,476 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:28:17,477 INFO L375 BasicCegarLoop]: trace histogram [119, 118, 118, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:28:17,477 INFO L424 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:28:17,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:28:17,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1707785704, now seen corresponding path program 118 times [2018-10-15 15:28:17,477 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:28:17,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:28:22,730 INFO L134 CoverageAnalysis]: Checked inductivity of 20945 backedges. 0 proven. 20945 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:28:22,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:28:22,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-10-15 15:28:22,730 INFO L460 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-10-15 15:28:22,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-10-15 15:28:22,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7260, Invalid=7260, Unknown=0, NotChecked=0, Total=14520 [2018-10-15 15:28:22,731 INFO L87 Difference]: Start difference. First operand 367 states and 367 transitions. Second operand 121 states. [2018-10-15 15:28:23,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:28:23,939 INFO L93 Difference]: Finished difference Result 371 states and 371 transitions. [2018-10-15 15:28:23,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-10-15 15:28:23,940 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 366 [2018-10-15 15:28:23,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:28:23,940 INFO L225 Difference]: With dead ends: 371 [2018-10-15 15:28:23,940 INFO L226 Difference]: Without dead ends: 371 [2018-10-15 15:28:23,941 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7260, Invalid=7260, Unknown=0, NotChecked=0, Total=14520 [2018-10-15 15:28:23,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-10-15 15:28:23,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 370. [2018-10-15 15:28:23,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2018-10-15 15:28:23,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 370 transitions. [2018-10-15 15:28:23,943 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 370 transitions. Word has length 366 [2018-10-15 15:28:23,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:28:23,943 INFO L481 AbstractCegarLoop]: Abstraction has 370 states and 370 transitions. [2018-10-15 15:28:23,943 INFO L482 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-10-15 15:28:23,943 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 370 transitions. [2018-10-15 15:28:23,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2018-10-15 15:28:23,944 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:28:23,944 INFO L375 BasicCegarLoop]: trace histogram [120, 119, 119, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:28:23,945 INFO L424 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:28:23,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:28:23,945 INFO L82 PathProgramCache]: Analyzing trace with hash 368306846, now seen corresponding path program 119 times [2018-10-15 15:28:23,945 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:28:23,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:28:29,383 INFO L134 CoverageAnalysis]: Checked inductivity of 21301 backedges. 0 proven. 21301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:28:29,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:28:29,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [122] total 122 [2018-10-15 15:28:29,384 INFO L460 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-10-15 15:28:29,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-10-15 15:28:29,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-10-15 15:28:29,385 INFO L87 Difference]: Start difference. First operand 370 states and 370 transitions. Second operand 122 states. [2018-10-15 15:28:30,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:28:30,239 INFO L93 Difference]: Finished difference Result 374 states and 374 transitions. [2018-10-15 15:28:30,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-10-15 15:28:30,239 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 369 [2018-10-15 15:28:30,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:28:30,240 INFO L225 Difference]: With dead ends: 374 [2018-10-15 15:28:30,240 INFO L226 Difference]: Without dead ends: 374 [2018-10-15 15:28:30,241 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-10-15 15:28:30,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2018-10-15 15:28:30,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 373. [2018-10-15 15:28:30,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-10-15 15:28:30,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 373 transitions. [2018-10-15 15:28:30,243 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 373 transitions. Word has length 369 [2018-10-15 15:28:30,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:28:30,243 INFO L481 AbstractCegarLoop]: Abstraction has 373 states and 373 transitions. [2018-10-15 15:28:30,243 INFO L482 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-10-15 15:28:30,243 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 373 transitions. [2018-10-15 15:28:30,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2018-10-15 15:28:30,244 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:28:30,244 INFO L375 BasicCegarLoop]: trace histogram [121, 120, 120, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:28:30,244 INFO L424 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:28:30,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:28:30,245 INFO L82 PathProgramCache]: Analyzing trace with hash 494795304, now seen corresponding path program 120 times [2018-10-15 15:28:30,245 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:28:30,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:28:35,740 INFO L134 CoverageAnalysis]: Checked inductivity of 21660 backedges. 0 proven. 21660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:28:35,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:28:35,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-10-15 15:28:35,741 INFO L460 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-10-15 15:28:35,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-10-15 15:28:35,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7503, Invalid=7503, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 15:28:35,742 INFO L87 Difference]: Start difference. First operand 373 states and 373 transitions. Second operand 123 states. [2018-10-15 15:28:36,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:28:36,936 INFO L93 Difference]: Finished difference Result 377 states and 377 transitions. [2018-10-15 15:28:36,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-10-15 15:28:36,937 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 372 [2018-10-15 15:28:36,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:28:36,938 INFO L225 Difference]: With dead ends: 377 [2018-10-15 15:28:36,938 INFO L226 Difference]: Without dead ends: 377 [2018-10-15 15:28:36,938 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7503, Invalid=7503, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 15:28:36,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-10-15 15:28:36,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 376. [2018-10-15 15:28:36,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-10-15 15:28:36,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 376 transitions. [2018-10-15 15:28:36,940 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 376 transitions. Word has length 372 [2018-10-15 15:28:36,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:28:36,940 INFO L481 AbstractCegarLoop]: Abstraction has 376 states and 376 transitions. [2018-10-15 15:28:36,941 INFO L482 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-10-15 15:28:36,941 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 376 transitions. [2018-10-15 15:28:36,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2018-10-15 15:28:36,942 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:28:36,942 INFO L375 BasicCegarLoop]: trace histogram [122, 121, 121, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:28:36,942 INFO L424 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:28:36,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:28:36,942 INFO L82 PathProgramCache]: Analyzing trace with hash 2026128990, now seen corresponding path program 121 times [2018-10-15 15:28:36,943 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:28:36,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:28:42,588 INFO L134 CoverageAnalysis]: Checked inductivity of 22022 backedges. 0 proven. 22022 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:28:42,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:28:42,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [124] total 124 [2018-10-15 15:28:42,589 INFO L460 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-10-15 15:28:42,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-10-15 15:28:42,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-10-15 15:28:42,590 INFO L87 Difference]: Start difference. First operand 376 states and 376 transitions. Second operand 124 states. [2018-10-15 15:28:43,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:28:43,440 INFO L93 Difference]: Finished difference Result 380 states and 380 transitions. [2018-10-15 15:28:43,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-10-15 15:28:43,440 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 375 [2018-10-15 15:28:43,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:28:43,440 INFO L225 Difference]: With dead ends: 380 [2018-10-15 15:28:43,441 INFO L226 Difference]: Without dead ends: 380 [2018-10-15 15:28:43,441 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-10-15 15:28:43,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-10-15 15:28:43,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 379. [2018-10-15 15:28:43,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-10-15 15:28:43,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 379 transitions. [2018-10-15 15:28:43,444 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 379 transitions. Word has length 375 [2018-10-15 15:28:43,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:28:43,444 INFO L481 AbstractCegarLoop]: Abstraction has 379 states and 379 transitions. [2018-10-15 15:28:43,444 INFO L482 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-10-15 15:28:43,444 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 379 transitions. [2018-10-15 15:28:43,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2018-10-15 15:28:43,445 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:28:43,445 INFO L375 BasicCegarLoop]: trace histogram [123, 122, 122, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:28:43,446 INFO L424 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:28:43,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:28:43,446 INFO L82 PathProgramCache]: Analyzing trace with hash 845350504, now seen corresponding path program 122 times [2018-10-15 15:28:43,446 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:28:43,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:28:49,086 INFO L134 CoverageAnalysis]: Checked inductivity of 22387 backedges. 0 proven. 22387 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:28:49,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:28:49,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-10-15 15:28:49,087 INFO L460 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-10-15 15:28:49,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-10-15 15:28:49,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7750, Invalid=7750, Unknown=0, NotChecked=0, Total=15500 [2018-10-15 15:28:49,088 INFO L87 Difference]: Start difference. First operand 379 states and 379 transitions. Second operand 125 states. [2018-10-15 15:28:50,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:28:50,438 INFO L93 Difference]: Finished difference Result 383 states and 383 transitions. [2018-10-15 15:28:50,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-10-15 15:28:50,438 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 378 [2018-10-15 15:28:50,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:28:50,439 INFO L225 Difference]: With dead ends: 383 [2018-10-15 15:28:50,439 INFO L226 Difference]: Without dead ends: 383 [2018-10-15 15:28:50,439 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7750, Invalid=7750, Unknown=0, NotChecked=0, Total=15500 [2018-10-15 15:28:50,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-10-15 15:28:50,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 382. [2018-10-15 15:28:50,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-10-15 15:28:50,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 382 transitions. [2018-10-15 15:28:50,441 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 382 transitions. Word has length 378 [2018-10-15 15:28:50,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:28:50,442 INFO L481 AbstractCegarLoop]: Abstraction has 382 states and 382 transitions. [2018-10-15 15:28:50,442 INFO L482 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-10-15 15:28:50,442 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 382 transitions. [2018-10-15 15:28:50,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2018-10-15 15:28:50,443 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:28:50,443 INFO L375 BasicCegarLoop]: trace histogram [124, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:28:50,444 INFO L424 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:28:50,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:28:50,444 INFO L82 PathProgramCache]: Analyzing trace with hash 55628318, now seen corresponding path program 123 times [2018-10-15 15:28:50,444 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:28:50,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:28:56,141 INFO L134 CoverageAnalysis]: Checked inductivity of 22755 backedges. 0 proven. 22755 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:28:56,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:28:56,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [126] total 126 [2018-10-15 15:28:56,142 INFO L460 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-10-15 15:28:56,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-10-15 15:28:56,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-10-15 15:28:56,143 INFO L87 Difference]: Start difference. First operand 382 states and 382 transitions. Second operand 126 states. [2018-10-15 15:28:57,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:28:57,227 INFO L93 Difference]: Finished difference Result 386 states and 386 transitions. [2018-10-15 15:28:57,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-10-15 15:28:57,228 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 381 [2018-10-15 15:28:57,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:28:57,229 INFO L225 Difference]: With dead ends: 386 [2018-10-15 15:28:57,229 INFO L226 Difference]: Without dead ends: 386 [2018-10-15 15:28:57,230 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-10-15 15:28:57,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-10-15 15:28:57,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 385. [2018-10-15 15:28:57,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-10-15 15:28:57,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 385 transitions. [2018-10-15 15:28:57,233 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 385 transitions. Word has length 381 [2018-10-15 15:28:57,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:28:57,233 INFO L481 AbstractCegarLoop]: Abstraction has 385 states and 385 transitions. [2018-10-15 15:28:57,233 INFO L482 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-10-15 15:28:57,233 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 385 transitions. [2018-10-15 15:28:57,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2018-10-15 15:28:57,234 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:28:57,235 INFO L375 BasicCegarLoop]: trace histogram [125, 124, 124, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:28:57,235 INFO L424 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:28:57,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:28:57,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1272832680, now seen corresponding path program 124 times [2018-10-15 15:28:57,235 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:28:57,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:29:03,088 INFO L134 CoverageAnalysis]: Checked inductivity of 23126 backedges. 0 proven. 23126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:29:03,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:29:03,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-10-15 15:29:03,088 INFO L460 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-10-15 15:29:03,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-10-15 15:29:03,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8001, Invalid=8001, Unknown=0, NotChecked=0, Total=16002 [2018-10-15 15:29:03,090 INFO L87 Difference]: Start difference. First operand 385 states and 385 transitions. Second operand 127 states. [2018-10-15 15:29:04,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:29:04,580 INFO L93 Difference]: Finished difference Result 389 states and 389 transitions. [2018-10-15 15:29:04,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-10-15 15:29:04,580 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 384 [2018-10-15 15:29:04,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:29:04,581 INFO L225 Difference]: With dead ends: 389 [2018-10-15 15:29:04,581 INFO L226 Difference]: Without dead ends: 389 [2018-10-15 15:29:04,582 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=8001, Invalid=8001, Unknown=0, NotChecked=0, Total=16002 [2018-10-15 15:29:04,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-10-15 15:29:04,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 388. [2018-10-15 15:29:04,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-10-15 15:29:04,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 388 transitions. [2018-10-15 15:29:04,585 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 388 transitions. Word has length 384 [2018-10-15 15:29:04,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:29:04,585 INFO L481 AbstractCegarLoop]: Abstraction has 388 states and 388 transitions. [2018-10-15 15:29:04,585 INFO L482 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-10-15 15:29:04,585 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 388 transitions. [2018-10-15 15:29:04,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2018-10-15 15:29:04,587 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:29:04,587 INFO L375 BasicCegarLoop]: trace histogram [126, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:29:04,587 INFO L424 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:29:04,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:29:04,588 INFO L82 PathProgramCache]: Analyzing trace with hash 599100894, now seen corresponding path program 125 times [2018-10-15 15:29:04,588 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:29:04,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:29:10,753 INFO L134 CoverageAnalysis]: Checked inductivity of 23500 backedges. 0 proven. 23500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:29:10,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:29:10,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [128] total 128 [2018-10-15 15:29:10,754 INFO L460 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-10-15 15:29:10,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-10-15 15:29:10,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-10-15 15:29:10,756 INFO L87 Difference]: Start difference. First operand 388 states and 388 transitions. Second operand 128 states. [2018-10-15 15:29:11,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:29:11,723 INFO L93 Difference]: Finished difference Result 392 states and 392 transitions. [2018-10-15 15:29:11,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-10-15 15:29:11,724 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 387 [2018-10-15 15:29:11,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:29:11,725 INFO L225 Difference]: With dead ends: 392 [2018-10-15 15:29:11,725 INFO L226 Difference]: Without dead ends: 392 [2018-10-15 15:29:11,726 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-10-15 15:29:11,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2018-10-15 15:29:11,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 391. [2018-10-15 15:29:11,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-10-15 15:29:11,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 391 transitions. [2018-10-15 15:29:11,730 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 391 transitions. Word has length 387 [2018-10-15 15:29:11,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:29:11,730 INFO L481 AbstractCegarLoop]: Abstraction has 391 states and 391 transitions. [2018-10-15 15:29:11,730 INFO L482 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-10-15 15:29:11,731 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 391 transitions. [2018-10-15 15:29:11,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2018-10-15 15:29:11,732 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:29:11,732 INFO L375 BasicCegarLoop]: trace histogram [127, 126, 126, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:29:11,732 INFO L424 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:29:11,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:29:11,732 INFO L82 PathProgramCache]: Analyzing trace with hash -162361624, now seen corresponding path program 126 times [2018-10-15 15:29:11,733 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:29:11,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:29:17,613 INFO L134 CoverageAnalysis]: Checked inductivity of 23877 backedges. 0 proven. 23877 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:29:17,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:29:17,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-10-15 15:29:17,614 INFO L460 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-10-15 15:29:17,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-10-15 15:29:17,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8256, Invalid=8256, Unknown=0, NotChecked=0, Total=16512 [2018-10-15 15:29:17,615 INFO L87 Difference]: Start difference. First operand 391 states and 391 transitions. Second operand 129 states. [2018-10-15 15:29:19,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:29:19,086 INFO L93 Difference]: Finished difference Result 395 states and 395 transitions. [2018-10-15 15:29:19,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-10-15 15:29:19,086 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 390 [2018-10-15 15:29:19,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:29:19,087 INFO L225 Difference]: With dead ends: 395 [2018-10-15 15:29:19,087 INFO L226 Difference]: Without dead ends: 395 [2018-10-15 15:29:19,087 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8256, Invalid=8256, Unknown=0, NotChecked=0, Total=16512 [2018-10-15 15:29:19,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-10-15 15:29:19,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 394. [2018-10-15 15:29:19,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-10-15 15:29:19,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 394 transitions. [2018-10-15 15:29:19,090 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 394 transitions. Word has length 390 [2018-10-15 15:29:19,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:29:19,090 INFO L481 AbstractCegarLoop]: Abstraction has 394 states and 394 transitions. [2018-10-15 15:29:19,091 INFO L482 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-10-15 15:29:19,091 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 394 transitions. [2018-10-15 15:29:19,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2018-10-15 15:29:19,092 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:29:19,092 INFO L375 BasicCegarLoop]: trace histogram [128, 127, 127, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:29:19,093 INFO L424 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:29:19,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:29:19,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1125022110, now seen corresponding path program 127 times [2018-10-15 15:29:19,094 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:29:19,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:29:25,166 INFO L134 CoverageAnalysis]: Checked inductivity of 24257 backedges. 0 proven. 24257 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:29:25,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:29:25,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [130] total 130 [2018-10-15 15:29:25,167 INFO L460 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-10-15 15:29:25,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-10-15 15:29:25,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-10-15 15:29:25,169 INFO L87 Difference]: Start difference. First operand 394 states and 394 transitions. Second operand 130 states. [2018-10-15 15:29:25,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:29:25,987 INFO L93 Difference]: Finished difference Result 398 states and 398 transitions. [2018-10-15 15:29:25,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-10-15 15:29:25,987 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 393 [2018-10-15 15:29:25,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:29:25,988 INFO L225 Difference]: With dead ends: 398 [2018-10-15 15:29:25,988 INFO L226 Difference]: Without dead ends: 398 [2018-10-15 15:29:25,989 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-10-15 15:29:25,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-10-15 15:29:25,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 397. [2018-10-15 15:29:25,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-10-15 15:29:25,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 397 transitions. [2018-10-15 15:29:25,992 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 397 transitions. Word has length 393 [2018-10-15 15:29:25,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:29:25,993 INFO L481 AbstractCegarLoop]: Abstraction has 397 states and 397 transitions. [2018-10-15 15:29:25,993 INFO L482 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-10-15 15:29:25,993 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 397 transitions. [2018-10-15 15:29:25,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2018-10-15 15:29:25,994 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:29:25,995 INFO L375 BasicCegarLoop]: trace histogram [129, 128, 128, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:29:25,995 INFO L424 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:29:25,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:29:25,995 INFO L82 PathProgramCache]: Analyzing trace with hash -484111576, now seen corresponding path program 128 times [2018-10-15 15:29:25,995 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:29:26,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:29:32,162 INFO L134 CoverageAnalysis]: Checked inductivity of 24640 backedges. 0 proven. 24640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:29:32,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:29:32,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-10-15 15:29:32,163 INFO L460 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-10-15 15:29:32,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-10-15 15:29:32,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8515, Invalid=8515, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 15:29:32,164 INFO L87 Difference]: Start difference. First operand 397 states and 397 transitions. Second operand 131 states. [2018-10-15 15:29:33,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:29:33,497 INFO L93 Difference]: Finished difference Result 401 states and 401 transitions. [2018-10-15 15:29:33,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-10-15 15:29:33,497 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 396 [2018-10-15 15:29:33,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:29:33,498 INFO L225 Difference]: With dead ends: 401 [2018-10-15 15:29:33,498 INFO L226 Difference]: Without dead ends: 401 [2018-10-15 15:29:33,499 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=8515, Invalid=8515, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 15:29:33,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2018-10-15 15:29:33,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 400. [2018-10-15 15:29:33,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-10-15 15:29:33,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 400 transitions. [2018-10-15 15:29:33,502 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 400 transitions. Word has length 396 [2018-10-15 15:29:33,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:29:33,502 INFO L481 AbstractCegarLoop]: Abstraction has 400 states and 400 transitions. [2018-10-15 15:29:33,502 INFO L482 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-10-15 15:29:33,503 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 400 transitions. [2018-10-15 15:29:33,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2018-10-15 15:29:33,504 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:29:33,504 INFO L375 BasicCegarLoop]: trace histogram [130, 129, 129, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:29:33,504 INFO L424 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:29:33,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:29:33,505 INFO L82 PathProgramCache]: Analyzing trace with hash -2055760546, now seen corresponding path program 129 times [2018-10-15 15:29:33,505 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:29:33,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:29:40,011 INFO L134 CoverageAnalysis]: Checked inductivity of 25026 backedges. 0 proven. 25026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:29:40,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:29:40,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [132] total 132 [2018-10-15 15:29:40,012 INFO L460 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-10-15 15:29:40,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-10-15 15:29:40,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-10-15 15:29:40,013 INFO L87 Difference]: Start difference. First operand 400 states and 400 transitions. Second operand 132 states. [2018-10-15 15:29:41,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:29:41,530 INFO L93 Difference]: Finished difference Result 404 states and 404 transitions. [2018-10-15 15:29:41,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-10-15 15:29:41,530 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 399 [2018-10-15 15:29:41,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:29:41,531 INFO L225 Difference]: With dead ends: 404 [2018-10-15 15:29:41,531 INFO L226 Difference]: Without dead ends: 404 [2018-10-15 15:29:41,531 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-10-15 15:29:41,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2018-10-15 15:29:41,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 403. [2018-10-15 15:29:41,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-10-15 15:29:41,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 403 transitions. [2018-10-15 15:29:41,533 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 403 transitions. Word has length 399 [2018-10-15 15:29:41,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:29:41,533 INFO L481 AbstractCegarLoop]: Abstraction has 403 states and 403 transitions. [2018-10-15 15:29:41,534 INFO L482 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-10-15 15:29:41,534 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 403 transitions. [2018-10-15 15:29:41,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2018-10-15 15:29:41,535 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:29:41,535 INFO L375 BasicCegarLoop]: trace histogram [131, 130, 130, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:29:41,535 INFO L424 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:29:41,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:29:41,535 INFO L82 PathProgramCache]: Analyzing trace with hash 683235176, now seen corresponding path program 130 times [2018-10-15 15:29:41,535 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:29:41,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:29:47,889 INFO L134 CoverageAnalysis]: Checked inductivity of 25415 backedges. 0 proven. 25415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:29:47,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:29:47,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-10-15 15:29:47,890 INFO L460 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-10-15 15:29:47,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-10-15 15:29:47,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8778, Invalid=8778, Unknown=0, NotChecked=0, Total=17556 [2018-10-15 15:29:47,891 INFO L87 Difference]: Start difference. First operand 403 states and 403 transitions. Second operand 133 states. [2018-10-15 15:29:48,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:29:48,732 INFO L93 Difference]: Finished difference Result 407 states and 407 transitions. [2018-10-15 15:29:48,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-10-15 15:29:48,732 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 402 [2018-10-15 15:29:48,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:29:48,733 INFO L225 Difference]: With dead ends: 407 [2018-10-15 15:29:48,733 INFO L226 Difference]: Without dead ends: 407 [2018-10-15 15:29:48,734 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=8778, Invalid=8778, Unknown=0, NotChecked=0, Total=17556 [2018-10-15 15:29:48,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2018-10-15 15:29:48,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 406. [2018-10-15 15:29:48,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2018-10-15 15:29:48,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 406 transitions. [2018-10-15 15:29:48,737 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 406 transitions. Word has length 402 [2018-10-15 15:29:48,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:29:48,737 INFO L481 AbstractCegarLoop]: Abstraction has 406 states and 406 transitions. [2018-10-15 15:29:48,737 INFO L482 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-10-15 15:29:48,737 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 406 transitions. [2018-10-15 15:29:48,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2018-10-15 15:29:48,738 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:29:48,738 INFO L375 BasicCegarLoop]: trace histogram [132, 131, 131, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:29:48,738 INFO L424 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:29:48,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:29:48,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1978867426, now seen corresponding path program 131 times [2018-10-15 15:29:48,739 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:29:48,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:29:55,127 INFO L134 CoverageAnalysis]: Checked inductivity of 25807 backedges. 0 proven. 25807 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:29:55,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:29:55,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [134] total 134 [2018-10-15 15:29:55,128 INFO L460 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-10-15 15:29:55,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-10-15 15:29:55,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-10-15 15:29:55,129 INFO L87 Difference]: Start difference. First operand 406 states and 406 transitions. Second operand 134 states. [2018-10-15 15:29:56,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:29:56,670 INFO L93 Difference]: Finished difference Result 410 states and 410 transitions. [2018-10-15 15:29:56,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-10-15 15:29:56,671 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 405 [2018-10-15 15:29:56,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:29:56,671 INFO L225 Difference]: With dead ends: 410 [2018-10-15 15:29:56,671 INFO L226 Difference]: Without dead ends: 410 [2018-10-15 15:29:56,672 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-10-15 15:29:56,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-10-15 15:29:56,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 409. [2018-10-15 15:29:56,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-10-15 15:29:56,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 409 transitions. [2018-10-15 15:29:56,674 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 409 transitions. Word has length 405 [2018-10-15 15:29:56,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:29:56,674 INFO L481 AbstractCegarLoop]: Abstraction has 409 states and 409 transitions. [2018-10-15 15:29:56,675 INFO L482 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-10-15 15:29:56,675 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 409 transitions. [2018-10-15 15:29:56,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2018-10-15 15:29:56,676 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:29:56,676 INFO L375 BasicCegarLoop]: trace histogram [133, 132, 132, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:29:56,676 INFO L424 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:29:56,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:29:56,676 INFO L82 PathProgramCache]: Analyzing trace with hash -2106362968, now seen corresponding path program 132 times [2018-10-15 15:29:56,677 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:29:56,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:30:03,182 INFO L134 CoverageAnalysis]: Checked inductivity of 26202 backedges. 0 proven. 26202 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:30:03,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:30:03,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-10-15 15:30:03,183 INFO L460 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-10-15 15:30:03,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-10-15 15:30:03,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9045, Invalid=9045, Unknown=0, NotChecked=0, Total=18090 [2018-10-15 15:30:03,184 INFO L87 Difference]: Start difference. First operand 409 states and 409 transitions. Second operand 135 states. [2018-10-15 15:30:04,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:30:04,940 INFO L93 Difference]: Finished difference Result 413 states and 413 transitions. [2018-10-15 15:30:04,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-10-15 15:30:04,941 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 408 [2018-10-15 15:30:04,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:30:04,941 INFO L225 Difference]: With dead ends: 413 [2018-10-15 15:30:04,942 INFO L226 Difference]: Without dead ends: 413 [2018-10-15 15:30:04,942 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=9045, Invalid=9045, Unknown=0, NotChecked=0, Total=18090 [2018-10-15 15:30:04,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2018-10-15 15:30:04,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 412. [2018-10-15 15:30:04,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2018-10-15 15:30:04,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 412 transitions. [2018-10-15 15:30:04,946 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 412 transitions. Word has length 408 [2018-10-15 15:30:04,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:30:04,946 INFO L481 AbstractCegarLoop]: Abstraction has 412 states and 412 transitions. [2018-10-15 15:30:04,946 INFO L482 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-10-15 15:30:04,946 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 412 transitions. [2018-10-15 15:30:04,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2018-10-15 15:30:04,948 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:30:04,948 INFO L375 BasicCegarLoop]: trace histogram [134, 133, 133, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:30:04,948 INFO L424 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:30:04,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:30:04,949 INFO L82 PathProgramCache]: Analyzing trace with hash 720002270, now seen corresponding path program 133 times [2018-10-15 15:30:04,949 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:30:05,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:30:11,633 INFO L134 CoverageAnalysis]: Checked inductivity of 26600 backedges. 0 proven. 26600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:30:11,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:30:11,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [136] total 136 [2018-10-15 15:30:11,634 INFO L460 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-10-15 15:30:11,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-10-15 15:30:11,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-10-15 15:30:11,635 INFO L87 Difference]: Start difference. First operand 412 states and 412 transitions. Second operand 136 states. [2018-10-15 15:30:12,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:30:12,729 INFO L93 Difference]: Finished difference Result 416 states and 416 transitions. [2018-10-15 15:30:12,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-10-15 15:30:12,729 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 411 [2018-10-15 15:30:12,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:30:12,730 INFO L225 Difference]: With dead ends: 416 [2018-10-15 15:30:12,730 INFO L226 Difference]: Without dead ends: 416 [2018-10-15 15:30:12,730 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-10-15 15:30:12,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2018-10-15 15:30:12,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 415. [2018-10-15 15:30:12,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2018-10-15 15:30:12,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 415 transitions. [2018-10-15 15:30:12,733 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 415 transitions. Word has length 411 [2018-10-15 15:30:12,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:30:12,733 INFO L481 AbstractCegarLoop]: Abstraction has 415 states and 415 transitions. [2018-10-15 15:30:12,733 INFO L482 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-10-15 15:30:12,733 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 415 transitions. [2018-10-15 15:30:12,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2018-10-15 15:30:12,734 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:30:12,734 INFO L375 BasicCegarLoop]: trace histogram [135, 134, 134, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:30:12,735 INFO L424 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:30:12,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:30:12,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1867030552, now seen corresponding path program 134 times [2018-10-15 15:30:12,735 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:30:12,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:30:19,523 INFO L134 CoverageAnalysis]: Checked inductivity of 27001 backedges. 0 proven. 27001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:30:19,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:30:19,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-10-15 15:30:19,524 INFO L460 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-10-15 15:30:19,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-10-15 15:30:19,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9316, Invalid=9316, Unknown=0, NotChecked=0, Total=18632 [2018-10-15 15:30:19,525 INFO L87 Difference]: Start difference. First operand 415 states and 415 transitions. Second operand 137 states. [2018-10-15 15:30:20,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:30:20,505 INFO L93 Difference]: Finished difference Result 419 states and 419 transitions. [2018-10-15 15:30:20,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-10-15 15:30:20,505 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 414 [2018-10-15 15:30:20,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:30:20,506 INFO L225 Difference]: With dead ends: 419 [2018-10-15 15:30:20,506 INFO L226 Difference]: Without dead ends: 419 [2018-10-15 15:30:20,507 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=9316, Invalid=9316, Unknown=0, NotChecked=0, Total=18632 [2018-10-15 15:30:20,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-10-15 15:30:20,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 418. [2018-10-15 15:30:20,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2018-10-15 15:30:20,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 418 transitions. [2018-10-15 15:30:20,510 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 418 transitions. Word has length 414 [2018-10-15 15:30:20,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:30:20,511 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 418 transitions. [2018-10-15 15:30:20,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-10-15 15:30:20,511 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 418 transitions. [2018-10-15 15:30:20,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2018-10-15 15:30:20,512 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:30:20,513 INFO L375 BasicCegarLoop]: trace histogram [136, 135, 135, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:30:20,513 INFO L424 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:30:20,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:30:20,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1026295966, now seen corresponding path program 135 times [2018-10-15 15:30:20,513 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:30:20,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:30:27,704 INFO L134 CoverageAnalysis]: Checked inductivity of 27405 backedges. 0 proven. 27405 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:30:27,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:30:27,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [138] total 138 [2018-10-15 15:30:27,705 INFO L460 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-10-15 15:30:27,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-10-15 15:30:27,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-10-15 15:30:27,706 INFO L87 Difference]: Start difference. First operand 418 states and 418 transitions. Second operand 138 states. [2018-10-15 15:30:29,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:30:29,221 INFO L93 Difference]: Finished difference Result 422 states and 422 transitions. [2018-10-15 15:30:29,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-10-15 15:30:29,222 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 417 [2018-10-15 15:30:29,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:30:29,222 INFO L225 Difference]: With dead ends: 422 [2018-10-15 15:30:29,223 INFO L226 Difference]: Without dead ends: 422 [2018-10-15 15:30:29,223 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-10-15 15:30:29,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2018-10-15 15:30:29,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 421. [2018-10-15 15:30:29,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-10-15 15:30:29,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 421 transitions. [2018-10-15 15:30:29,225 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 421 transitions. Word has length 417 [2018-10-15 15:30:29,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:30:29,226 INFO L481 AbstractCegarLoop]: Abstraction has 421 states and 421 transitions. [2018-10-15 15:30:29,226 INFO L482 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-10-15 15:30:29,226 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 421 transitions. [2018-10-15 15:30:29,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2018-10-15 15:30:29,227 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:30:29,227 INFO L375 BasicCegarLoop]: trace histogram [137, 136, 136, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:30:29,227 INFO L424 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:30:29,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:30:29,228 INFO L82 PathProgramCache]: Analyzing trace with hash 417930280, now seen corresponding path program 136 times [2018-10-15 15:30:29,228 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:30:29,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:30:36,279 INFO L134 CoverageAnalysis]: Checked inductivity of 27812 backedges. 0 proven. 27812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:30:36,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:30:36,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-10-15 15:30:36,280 INFO L460 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-10-15 15:30:36,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-10-15 15:30:36,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9591, Invalid=9591, Unknown=0, NotChecked=0, Total=19182 [2018-10-15 15:30:36,281 INFO L87 Difference]: Start difference. First operand 421 states and 421 transitions. Second operand 139 states. [2018-10-15 15:30:37,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:30:37,743 INFO L93 Difference]: Finished difference Result 425 states and 425 transitions. [2018-10-15 15:30:37,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-10-15 15:30:37,743 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 420 [2018-10-15 15:30:37,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:30:37,744 INFO L225 Difference]: With dead ends: 425 [2018-10-15 15:30:37,744 INFO L226 Difference]: Without dead ends: 425 [2018-10-15 15:30:37,745 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=9591, Invalid=9591, Unknown=0, NotChecked=0, Total=19182 [2018-10-15 15:30:37,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2018-10-15 15:30:37,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 424. [2018-10-15 15:30:37,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-10-15 15:30:37,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 424 transitions. [2018-10-15 15:30:37,748 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 424 transitions. Word has length 420 [2018-10-15 15:30:37,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:30:37,749 INFO L481 AbstractCegarLoop]: Abstraction has 424 states and 424 transitions. [2018-10-15 15:30:37,749 INFO L482 AbstractCegarLoop]: Interpolant automaton has 139 states. [2018-10-15 15:30:37,749 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 424 transitions. [2018-10-15 15:30:37,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2018-10-15 15:30:37,751 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:30:37,751 INFO L375 BasicCegarLoop]: trace histogram [138, 137, 137, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:30:37,751 INFO L424 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:30:37,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:30:37,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1357767774, now seen corresponding path program 137 times [2018-10-15 15:30:37,752 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:30:37,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:30:44,922 INFO L134 CoverageAnalysis]: Checked inductivity of 28222 backedges. 0 proven. 28222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:30:44,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:30:44,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [140] total 140 [2018-10-15 15:30:44,922 INFO L460 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-10-15 15:30:44,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-10-15 15:30:44,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-10-15 15:30:44,924 INFO L87 Difference]: Start difference. First operand 424 states and 424 transitions. Second operand 140 states. [2018-10-15 15:30:46,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:30:46,679 INFO L93 Difference]: Finished difference Result 428 states and 428 transitions. [2018-10-15 15:30:46,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2018-10-15 15:30:46,679 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 423 [2018-10-15 15:30:46,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:30:46,680 INFO L225 Difference]: With dead ends: 428 [2018-10-15 15:30:46,680 INFO L226 Difference]: Without dead ends: 428 [2018-10-15 15:30:46,681 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-10-15 15:30:46,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2018-10-15 15:30:46,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 427. [2018-10-15 15:30:46,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2018-10-15 15:30:46,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 427 transitions. [2018-10-15 15:30:46,683 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 427 transitions. Word has length 423 [2018-10-15 15:30:46,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:30:46,683 INFO L481 AbstractCegarLoop]: Abstraction has 427 states and 427 transitions. [2018-10-15 15:30:46,683 INFO L482 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-10-15 15:30:46,683 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 427 transitions. [2018-10-15 15:30:46,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2018-10-15 15:30:46,684 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:30:46,685 INFO L375 BasicCegarLoop]: trace histogram [139, 138, 138, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:30:46,685 INFO L424 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:30:46,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:30:46,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1164748904, now seen corresponding path program 138 times [2018-10-15 15:30:46,685 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:30:46,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:30:53,938 INFO L134 CoverageAnalysis]: Checked inductivity of 28635 backedges. 0 proven. 28635 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:30:53,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:30:53,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2018-10-15 15:30:53,939 INFO L460 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-10-15 15:30:53,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-10-15 15:30:53,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9870, Invalid=9870, Unknown=0, NotChecked=0, Total=19740 [2018-10-15 15:30:53,940 INFO L87 Difference]: Start difference. First operand 427 states and 427 transitions. Second operand 141 states. [2018-10-15 15:30:55,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:30:55,586 INFO L93 Difference]: Finished difference Result 431 states and 431 transitions. [2018-10-15 15:30:55,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-10-15 15:30:55,587 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 426 [2018-10-15 15:30:55,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:30:55,587 INFO L225 Difference]: With dead ends: 431 [2018-10-15 15:30:55,587 INFO L226 Difference]: Without dead ends: 431 [2018-10-15 15:30:55,588 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=9870, Invalid=9870, Unknown=0, NotChecked=0, Total=19740 [2018-10-15 15:30:55,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-10-15 15:30:55,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 430. [2018-10-15 15:30:55,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-10-15 15:30:55,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 430 transitions. [2018-10-15 15:30:55,590 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 430 transitions. Word has length 426 [2018-10-15 15:30:55,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:30:55,591 INFO L481 AbstractCegarLoop]: Abstraction has 430 states and 430 transitions. [2018-10-15 15:30:55,591 INFO L482 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-10-15 15:30:55,591 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 430 transitions. [2018-10-15 15:30:55,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2018-10-15 15:30:55,593 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:30:55,593 INFO L375 BasicCegarLoop]: trace histogram [140, 139, 139, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:30:55,593 INFO L424 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:30:55,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:30:55,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1900802078, now seen corresponding path program 139 times [2018-10-15 15:30:55,594 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:30:55,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:31:02,977 INFO L134 CoverageAnalysis]: Checked inductivity of 29051 backedges. 0 proven. 29051 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:31:02,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:31:02,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [142] total 142 [2018-10-15 15:31:02,978 INFO L460 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-10-15 15:31:02,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-10-15 15:31:02,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-10-15 15:31:02,979 INFO L87 Difference]: Start difference. First operand 430 states and 430 transitions. Second operand 142 states. [2018-10-15 15:31:04,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:31:04,440 INFO L93 Difference]: Finished difference Result 434 states and 434 transitions. [2018-10-15 15:31:04,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2018-10-15 15:31:04,440 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 429 [2018-10-15 15:31:04,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:31:04,441 INFO L225 Difference]: With dead ends: 434 [2018-10-15 15:31:04,441 INFO L226 Difference]: Without dead ends: 434 [2018-10-15 15:31:04,441 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-10-15 15:31:04,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-10-15 15:31:04,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 433. [2018-10-15 15:31:04,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2018-10-15 15:31:04,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 433 transitions. [2018-10-15 15:31:04,444 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 433 transitions. Word has length 429 [2018-10-15 15:31:04,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:31:04,444 INFO L481 AbstractCegarLoop]: Abstraction has 433 states and 433 transitions. [2018-10-15 15:31:04,444 INFO L482 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-10-15 15:31:04,444 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 433 transitions. [2018-10-15 15:31:04,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2018-10-15 15:31:04,445 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:31:04,445 INFO L375 BasicCegarLoop]: trace histogram [141, 140, 140, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:31:04,446 INFO L424 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:31:04,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:31:04,446 INFO L82 PathProgramCache]: Analyzing trace with hash -442104664, now seen corresponding path program 140 times [2018-10-15 15:31:04,446 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:31:04,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:31:11,675 INFO L134 CoverageAnalysis]: Checked inductivity of 29470 backedges. 0 proven. 29470 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:31:11,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:31:11,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2018-10-15 15:31:11,676 INFO L460 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-10-15 15:31:11,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-10-15 15:31:11,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10153, Invalid=10153, Unknown=0, NotChecked=0, Total=20306 [2018-10-15 15:31:11,677 INFO L87 Difference]: Start difference. First operand 433 states and 433 transitions. Second operand 143 states. [2018-10-15 15:31:12,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:31:12,950 INFO L93 Difference]: Finished difference Result 437 states and 437 transitions. [2018-10-15 15:31:12,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-10-15 15:31:12,950 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 432 [2018-10-15 15:31:12,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:31:12,951 INFO L225 Difference]: With dead ends: 437 [2018-10-15 15:31:12,951 INFO L226 Difference]: Without dead ends: 437 [2018-10-15 15:31:12,951 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=10153, Invalid=10153, Unknown=0, NotChecked=0, Total=20306 [2018-10-15 15:31:12,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2018-10-15 15:31:12,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 436. [2018-10-15 15:31:12,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2018-10-15 15:31:12,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 436 transitions. [2018-10-15 15:31:12,954 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 436 transitions. Word has length 432 [2018-10-15 15:31:12,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:31:12,954 INFO L481 AbstractCegarLoop]: Abstraction has 436 states and 436 transitions. [2018-10-15 15:31:12,954 INFO L482 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-10-15 15:31:12,954 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 436 transitions. [2018-10-15 15:31:12,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2018-10-15 15:31:12,955 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:31:12,956 INFO L375 BasicCegarLoop]: trace histogram [142, 141, 141, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:31:12,956 INFO L424 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:31:12,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:31:12,956 INFO L82 PathProgramCache]: Analyzing trace with hash -463328290, now seen corresponding path program 141 times [2018-10-15 15:31:12,956 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:31:13,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:31:20,688 INFO L134 CoverageAnalysis]: Checked inductivity of 29892 backedges. 0 proven. 29892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:31:20,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:31:20,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [144] total 144 [2018-10-15 15:31:20,688 INFO L460 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-10-15 15:31:20,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-10-15 15:31:20,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-10-15 15:31:20,690 INFO L87 Difference]: Start difference. First operand 436 states and 436 transitions. Second operand 144 states. [2018-10-15 15:31:21,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:31:21,856 INFO L93 Difference]: Finished difference Result 440 states and 440 transitions. [2018-10-15 15:31:21,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-10-15 15:31:21,856 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 435 [2018-10-15 15:31:21,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:31:21,857 INFO L225 Difference]: With dead ends: 440 [2018-10-15 15:31:21,857 INFO L226 Difference]: Without dead ends: 440 [2018-10-15 15:31:21,858 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-10-15 15:31:21,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2018-10-15 15:31:21,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 439. [2018-10-15 15:31:21,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2018-10-15 15:31:21,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 439 transitions. [2018-10-15 15:31:21,860 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 439 transitions. Word has length 435 [2018-10-15 15:31:21,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:31:21,860 INFO L481 AbstractCegarLoop]: Abstraction has 439 states and 439 transitions. [2018-10-15 15:31:21,860 INFO L482 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-10-15 15:31:21,860 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 439 transitions. [2018-10-15 15:31:21,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2018-10-15 15:31:21,862 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:31:21,862 INFO L375 BasicCegarLoop]: trace histogram [143, 142, 142, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:31:21,862 INFO L424 AbstractCegarLoop]: === Iteration 143 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:31:21,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:31:21,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1376177944, now seen corresponding path program 142 times [2018-10-15 15:31:21,863 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:31:21,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:31:29,742 INFO L134 CoverageAnalysis]: Checked inductivity of 30317 backedges. 0 proven. 30317 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:31:29,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:31:29,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2018-10-15 15:31:29,742 INFO L460 AbstractCegarLoop]: Interpolant automaton has 145 states [2018-10-15 15:31:29,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2018-10-15 15:31:29,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10440, Invalid=10440, Unknown=0, NotChecked=0, Total=20880 [2018-10-15 15:31:29,744 INFO L87 Difference]: Start difference. First operand 439 states and 439 transitions. Second operand 145 states. [2018-10-15 15:31:30,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:31:30,933 INFO L93 Difference]: Finished difference Result 443 states and 443 transitions. [2018-10-15 15:31:30,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2018-10-15 15:31:30,933 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 438 [2018-10-15 15:31:30,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:31:30,934 INFO L225 Difference]: With dead ends: 443 [2018-10-15 15:31:30,934 INFO L226 Difference]: Without dead ends: 443 [2018-10-15 15:31:30,934 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=10440, Invalid=10440, Unknown=0, NotChecked=0, Total=20880 [2018-10-15 15:31:30,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-10-15 15:31:30,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 442. [2018-10-15 15:31:30,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2018-10-15 15:31:30,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 442 transitions. [2018-10-15 15:31:30,937 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 442 transitions. Word has length 438 [2018-10-15 15:31:30,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:31:30,937 INFO L481 AbstractCegarLoop]: Abstraction has 442 states and 442 transitions. [2018-10-15 15:31:30,937 INFO L482 AbstractCegarLoop]: Interpolant automaton has 145 states. [2018-10-15 15:31:30,937 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 442 transitions. [2018-10-15 15:31:30,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2018-10-15 15:31:30,938 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:31:30,938 INFO L375 BasicCegarLoop]: trace histogram [144, 143, 143, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:31:30,939 INFO L424 AbstractCegarLoop]: === Iteration 144 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:31:30,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:31:30,939 INFO L82 PathProgramCache]: Analyzing trace with hash -347301986, now seen corresponding path program 143 times [2018-10-15 15:31:30,939 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:31:30,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:31:38,602 INFO L134 CoverageAnalysis]: Checked inductivity of 30745 backedges. 0 proven. 30745 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:31:38,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:31:38,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [146] total 146 [2018-10-15 15:31:38,603 INFO L460 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-10-15 15:31:38,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-10-15 15:31:38,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-10-15 15:31:38,604 INFO L87 Difference]: Start difference. First operand 442 states and 442 transitions. Second operand 146 states. [2018-10-15 15:31:39,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:31:39,951 INFO L93 Difference]: Finished difference Result 446 states and 446 transitions. [2018-10-15 15:31:39,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-10-15 15:31:39,952 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 441 [2018-10-15 15:31:39,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:31:39,952 INFO L225 Difference]: With dead ends: 446 [2018-10-15 15:31:39,952 INFO L226 Difference]: Without dead ends: 446 [2018-10-15 15:31:39,953 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-10-15 15:31:39,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2018-10-15 15:31:39,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 445. [2018-10-15 15:31:39,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-10-15 15:31:39,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 445 transitions. [2018-10-15 15:31:39,955 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 445 transitions. Word has length 441 [2018-10-15 15:31:39,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:31:39,956 INFO L481 AbstractCegarLoop]: Abstraction has 445 states and 445 transitions. [2018-10-15 15:31:39,956 INFO L482 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-10-15 15:31:39,956 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 445 transitions. [2018-10-15 15:31:39,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2018-10-15 15:31:39,957 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:31:39,957 INFO L375 BasicCegarLoop]: trace histogram [145, 144, 144, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:31:39,957 INFO L424 AbstractCegarLoop]: === Iteration 145 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:31:39,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:31:39,958 INFO L82 PathProgramCache]: Analyzing trace with hash 2009738536, now seen corresponding path program 144 times [2018-10-15 15:31:39,958 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:31:40,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:31:47,727 INFO L134 CoverageAnalysis]: Checked inductivity of 31176 backedges. 0 proven. 31176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:31:47,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:31:47,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147] total 147 [2018-10-15 15:31:47,728 INFO L460 AbstractCegarLoop]: Interpolant automaton has 147 states [2018-10-15 15:31:47,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2018-10-15 15:31:47,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10731, Invalid=10731, Unknown=0, NotChecked=0, Total=21462 [2018-10-15 15:31:47,729 INFO L87 Difference]: Start difference. First operand 445 states and 445 transitions. Second operand 147 states. [2018-10-15 15:31:49,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:31:49,242 INFO L93 Difference]: Finished difference Result 449 states and 449 transitions. [2018-10-15 15:31:49,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-10-15 15:31:49,243 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 444 [2018-10-15 15:31:49,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:31:49,243 INFO L225 Difference]: With dead ends: 449 [2018-10-15 15:31:49,243 INFO L226 Difference]: Without dead ends: 449 [2018-10-15 15:31:49,244 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=10731, Invalid=10731, Unknown=0, NotChecked=0, Total=21462 [2018-10-15 15:31:49,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-10-15 15:31:49,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 448. [2018-10-15 15:31:49,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2018-10-15 15:31:49,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 448 transitions. [2018-10-15 15:31:49,246 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 448 transitions. Word has length 444 [2018-10-15 15:31:49,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:31:49,247 INFO L481 AbstractCegarLoop]: Abstraction has 448 states and 448 transitions. [2018-10-15 15:31:49,247 INFO L482 AbstractCegarLoop]: Interpolant automaton has 147 states. [2018-10-15 15:31:49,247 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 448 transitions. [2018-10-15 15:31:49,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2018-10-15 15:31:49,248 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:31:49,248 INFO L375 BasicCegarLoop]: trace histogram [146, 145, 145, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:31:49,248 INFO L424 AbstractCegarLoop]: === Iteration 146 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:31:49,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:31:49,249 INFO L82 PathProgramCache]: Analyzing trace with hash -2111360162, now seen corresponding path program 145 times [2018-10-15 15:31:49,249 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:31:49,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:31:57,062 INFO L134 CoverageAnalysis]: Checked inductivity of 31610 backedges. 0 proven. 31610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:31:57,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:31:57,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [148] total 148 [2018-10-15 15:31:57,062 INFO L460 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-10-15 15:31:57,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-10-15 15:31:57,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-10-15 15:31:57,064 INFO L87 Difference]: Start difference. First operand 448 states and 448 transitions. Second operand 148 states.