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/20181015-LoopsPathprograms/diamond_true-unreach-call1_true-termination.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2d08e6e [2018-10-15 13:03:40,969 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 13:03:40,971 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 13:03:40,987 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 13:03:40,987 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 13:03:40,989 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 13:03:40,990 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 13:03:40,994 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 13:03:40,997 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 13:03:40,998 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 13:03:40,999 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 13:03:41,000 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 13:03:41,001 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 13:03:41,002 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 13:03:41,003 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 13:03:41,004 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 13:03:41,012 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 13:03:41,014 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 13:03:41,018 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 13:03:41,020 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 13:03:41,021 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 13:03:41,025 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 13:03:41,030 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 13:03:41,031 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 13:03:41,031 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 13:03:41,032 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 13:03:41,033 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 13:03:41,034 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 13:03:41,037 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 13:03:41,038 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 13:03:41,038 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 13:03:41,039 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 13:03:41,039 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 13:03:41,039 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 13:03:41,041 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 13:03:41,043 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 13:03:41,044 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 13:03:41,062 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 13:03:41,062 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 13:03:41,063 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 13:03:41,063 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 13:03:41,064 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 13:03:41,064 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 13:03:41,064 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 13:03:41,065 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 13:03:41,065 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 13:03:41,066 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 13:03:41,066 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 13:03:41,066 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 13:03:41,066 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 13:03:41,068 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 13:03:41,068 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 13:03:41,123 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 13:03:41,139 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 13:03:41,144 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 13:03:41,146 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 13:03:41,147 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 13:03:41,148 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/diamond_true-unreach-call1_true-termination.i_3.bpl [2018-10-15 13:03:41,148 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/diamond_true-unreach-call1_true-termination.i_3.bpl' [2018-10-15 13:03:41,235 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 13:03:41,237 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-15 13:03:41,237 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 13:03:41,237 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 13:03:41,238 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 13:03:41,268 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "diamond_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:03:41" (1/1) ... [2018-10-15 13:03:41,270 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "diamond_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:03:41" (1/1) ... [2018-10-15 13:03:41,282 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "diamond_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:03:41" (1/1) ... [2018-10-15 13:03:41,283 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "diamond_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:03:41" (1/1) ... [2018-10-15 13:03:41,297 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "diamond_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:03:41" (1/1) ... [2018-10-15 13:03:41,301 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "diamond_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:03:41" (1/1) ... [2018-10-15 13:03:41,303 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "diamond_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:03:41" (1/1) ... [2018-10-15 13:03:41,308 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 13:03:41,309 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 13:03:41,313 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 13:03:41,313 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 13:03:41,314 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "diamond_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:03:41" (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 13:03:41,399 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-15 13:03:41,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 13:03:41,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 13:03:41,629 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 13:03:41,630 INFO L202 PluginConnector]: Adding new model diamond_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:03:41 BoogieIcfgContainer [2018-10-15 13:03:41,630 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 13:03:41,630 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-15 13:03:41,631 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-15 13:03:41,632 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-15 13:03:41,635 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "diamond_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:03:41" (1/1) ... [2018-10-15 13:03:41,640 WARN L219 ansformationObserver]: HeapSeparator: input icfg has no '#valid' array -- returning unchanged Icfg! [2018-10-15 13:03:41,656 INFO L202 PluginConnector]: Adding new model diamond_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 01:03:41 BasicIcfg [2018-10-15 13:03:41,657 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-15 13:03:41,658 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 13:03:41,658 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 13:03:41,661 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 13:03:41,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "diamond_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:03:41" (1/3) ... [2018-10-15 13:03:41,663 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62996ce0 and model type diamond_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:03:41, skipping insertion in model container [2018-10-15 13:03:41,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "diamond_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:03:41" (2/3) ... [2018-10-15 13:03:41,664 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62996ce0 and model type diamond_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 01:03:41, skipping insertion in model container [2018-10-15 13:03:41,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "diamond_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 01:03:41" (3/3) ... [2018-10-15 13:03:41,666 INFO L112 eAbstractionObserver]: Analyzing ICFG diamond_true-unreach-call1_true-termination.i_3.bplleft_unchanged_by_heapseparator [2018-10-15 13:03:41,676 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 13:03:41,685 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 13:03:41,703 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 13:03:41,733 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 13:03:41,734 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 13:03:41,734 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 13:03:41,734 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 13:03:41,734 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 13:03:41,734 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 13:03:41,735 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 13:03:41,735 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 13:03:41,735 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 13:03:41,751 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-10-15 13:03:41,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-15 13:03:41,761 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:41,762 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:41,763 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:41,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:41,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1912306728, now seen corresponding path program 1 times [2018-10-15 13:03:41,823 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:41,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:42,073 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 13:03:42,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 13:03:42,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 13:03:42,084 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 13:03:42,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 13:03:42,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 13:03:42,111 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2018-10-15 13:03:42,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:42,228 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-10-15 13:03:42,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 13:03:42,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-10-15 13:03:42,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:42,245 INFO L225 Difference]: With dead ends: 18 [2018-10-15 13:03:42,245 INFO L226 Difference]: Without dead ends: 18 [2018-10-15 13:03:42,251 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 13:03:42,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-10-15 13:03:42,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2018-10-15 13:03:42,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-15 13:03:42,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-10-15 13:03:42,288 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 12 [2018-10-15 13:03:42,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:42,288 INFO L481 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-10-15 13:03:42,289 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 13:03:42,289 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-10-15 13:03:42,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-15 13:03:42,290 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:42,290 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:42,290 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:42,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:42,291 INFO L82 PathProgramCache]: Analyzing trace with hash -354587143, now seen corresponding path program 1 times [2018-10-15 13:03:42,292 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:42,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:42,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:42,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:42,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-10-15 13:03:42,601 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-15 13:03:42,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-15 13:03:42,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-15 13:03:42,602 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 4 states. [2018-10-15 13:03:42,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:42,729 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-10-15 13:03:42,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-15 13:03:42,730 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-10-15 13:03:42,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:42,731 INFO L225 Difference]: With dead ends: 21 [2018-10-15 13:03:42,731 INFO L226 Difference]: Without dead ends: 21 [2018-10-15 13:03:42,732 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-15 13:03:42,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-15 13:03:42,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-10-15 13:03:42,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-15 13:03:42,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-10-15 13:03:42,736 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 15 [2018-10-15 13:03:42,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:42,736 INFO L481 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-10-15 13:03:42,737 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-15 13:03:42,737 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-10-15 13:03:42,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-15 13:03:42,738 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:42,738 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:42,738 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:42,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:42,739 INFO L82 PathProgramCache]: Analyzing trace with hash 675864200, now seen corresponding path program 2 times [2018-10-15 13:03:42,740 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:42,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:42,923 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:42,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:42,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-15 13:03:42,924 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 13:03:42,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 13:03:42,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-15 13:03:42,925 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 5 states. [2018-10-15 13:03:43,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:43,062 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-10-15 13:03:43,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-15 13:03:43,063 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-10-15 13:03:43,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:43,064 INFO L225 Difference]: With dead ends: 24 [2018-10-15 13:03:43,064 INFO L226 Difference]: Without dead ends: 24 [2018-10-15 13:03:43,065 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-15 13:03:43,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-15 13:03:43,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2018-10-15 13:03:43,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-15 13:03:43,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-10-15 13:03:43,072 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 18 [2018-10-15 13:03:43,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:43,072 INFO L481 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-10-15 13:03:43,072 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 13:03:43,073 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-10-15 13:03:43,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-15 13:03:43,073 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:43,074 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:43,075 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:43,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:43,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1574408295, now seen corresponding path program 3 times [2018-10-15 13:03:43,080 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:43,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:43,476 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:43,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:43,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-15 13:03:43,477 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-15 13:03:43,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-15 13:03:43,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-15 13:03:43,478 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 6 states. [2018-10-15 13:03:43,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:43,717 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-10-15 13:03:43,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-15 13:03:43,718 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-10-15 13:03:43,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:43,719 INFO L225 Difference]: With dead ends: 27 [2018-10-15 13:03:43,720 INFO L226 Difference]: Without dead ends: 27 [2018-10-15 13:03:43,720 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-15 13:03:43,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-15 13:03:43,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-10-15 13:03:43,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-15 13:03:43,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-10-15 13:03:43,728 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 21 [2018-10-15 13:03:43,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:43,728 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-10-15 13:03:43,728 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-15 13:03:43,729 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-10-15 13:03:43,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-15 13:03:43,730 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:43,731 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:43,731 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:43,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:43,731 INFO L82 PathProgramCache]: Analyzing trace with hash 702216424, now seen corresponding path program 4 times [2018-10-15 13:03:43,733 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:43,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:44,299 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:44,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:44,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-15 13:03:44,300 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 13:03:44,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 13:03:44,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-15 13:03:44,301 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 7 states. [2018-10-15 13:03:44,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:44,526 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-10-15 13:03:44,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-15 13:03:44,527 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-10-15 13:03:44,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:44,528 INFO L225 Difference]: With dead ends: 30 [2018-10-15 13:03:44,528 INFO L226 Difference]: Without dead ends: 30 [2018-10-15 13:03:44,529 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-15 13:03:44,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-15 13:03:44,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-10-15 13:03:44,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-15 13:03:44,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-10-15 13:03:44,533 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 24 [2018-10-15 13:03:44,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:44,534 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-10-15 13:03:44,534 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 13:03:44,534 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-10-15 13:03:44,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-15 13:03:44,535 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:44,535 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:44,535 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:44,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:44,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1800649017, now seen corresponding path program 5 times [2018-10-15 13:03:44,537 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:44,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:44,852 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:44,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:44,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-15 13:03:44,853 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-15 13:03:44,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-15 13:03:44,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-15 13:03:44,854 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 8 states. [2018-10-15 13:03:45,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:45,299 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-10-15 13:03:45,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-15 13:03:45,299 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-10-15 13:03:45,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:45,300 INFO L225 Difference]: With dead ends: 33 [2018-10-15 13:03:45,300 INFO L226 Difference]: Without dead ends: 33 [2018-10-15 13:03:45,301 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-15 13:03:45,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-15 13:03:45,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-10-15 13:03:45,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-15 13:03:45,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-10-15 13:03:45,304 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 27 [2018-10-15 13:03:45,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:45,305 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-10-15 13:03:45,305 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-15 13:03:45,305 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-10-15 13:03:45,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-15 13:03:45,306 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:45,306 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:45,307 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:45,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:45,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1850198856, now seen corresponding path program 6 times [2018-10-15 13:03:45,309 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:45,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:45,661 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:45,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:45,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 13:03:45,662 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 13:03:45,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 13:03:45,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-15 13:03:45,663 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 9 states. [2018-10-15 13:03:45,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:45,817 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-10-15 13:03:45,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-15 13:03:45,819 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-10-15 13:03:45,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:45,821 INFO L225 Difference]: With dead ends: 36 [2018-10-15 13:03:45,821 INFO L226 Difference]: Without dead ends: 36 [2018-10-15 13:03:45,822 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-15 13:03:45,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-15 13:03:45,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-10-15 13:03:45,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-15 13:03:45,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-10-15 13:03:45,826 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 30 [2018-10-15 13:03:45,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:45,826 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-10-15 13:03:45,826 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 13:03:45,826 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-10-15 13:03:45,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-15 13:03:45,827 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:45,828 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:45,828 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:45,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:45,828 INFO L82 PathProgramCache]: Analyzing trace with hash 520702681, now seen corresponding path program 7 times [2018-10-15 13:03:45,829 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:45,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:46,351 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:46,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:46,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-15 13:03:46,352 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-15 13:03:46,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-15 13:03:46,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-10-15 13:03:46,353 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 10 states. [2018-10-15 13:03:46,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:46,615 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-10-15 13:03:46,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-15 13:03:46,620 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2018-10-15 13:03:46,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:46,621 INFO L225 Difference]: With dead ends: 39 [2018-10-15 13:03:46,621 INFO L226 Difference]: Without dead ends: 39 [2018-10-15 13:03:46,622 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-10-15 13:03:46,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-15 13:03:46,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-10-15 13:03:46,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-15 13:03:46,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-10-15 13:03:46,626 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 33 [2018-10-15 13:03:46,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:46,627 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-10-15 13:03:46,627 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-15 13:03:46,627 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-10-15 13:03:46,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-15 13:03:46,628 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:46,628 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:46,628 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:46,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:46,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1688556968, now seen corresponding path program 8 times [2018-10-15 13:03:46,630 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:46,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:46,919 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:46,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:46,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 13:03:46,920 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 13:03:46,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 13:03:46,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-10-15 13:03:46,920 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 11 states. [2018-10-15 13:03:47,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:47,299 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-10-15 13:03:47,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-15 13:03:47,300 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2018-10-15 13:03:47,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:47,302 INFO L225 Difference]: With dead ends: 42 [2018-10-15 13:03:47,302 INFO L226 Difference]: Without dead ends: 42 [2018-10-15 13:03:47,303 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-10-15 13:03:47,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-10-15 13:03:47,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-10-15 13:03:47,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-15 13:03:47,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-10-15 13:03:47,307 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 36 [2018-10-15 13:03:47,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:47,307 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-10-15 13:03:47,307 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 13:03:47,308 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-10-15 13:03:47,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-15 13:03:47,309 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:47,309 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:47,309 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:47,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:47,310 INFO L82 PathProgramCache]: Analyzing trace with hash -294443911, now seen corresponding path program 9 times [2018-10-15 13:03:47,310 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:47,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:47,542 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:47,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:47,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-15 13:03:47,543 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-15 13:03:47,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-15 13:03:47,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-10-15 13:03:47,544 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 12 states. [2018-10-15 13:03:47,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:47,855 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-10-15 13:03:47,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-15 13:03:47,856 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2018-10-15 13:03:47,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:47,857 INFO L225 Difference]: With dead ends: 45 [2018-10-15 13:03:47,857 INFO L226 Difference]: Without dead ends: 45 [2018-10-15 13:03:47,858 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-10-15 13:03:47,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-15 13:03:47,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-10-15 13:03:47,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-15 13:03:47,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-10-15 13:03:47,863 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 39 [2018-10-15 13:03:47,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:47,864 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-10-15 13:03:47,864 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-15 13:03:47,864 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-10-15 13:03:47,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-15 13:03:47,865 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:47,865 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:47,866 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:47,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:47,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1401526280, now seen corresponding path program 10 times [2018-10-15 13:03:47,867 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:47,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:48,166 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:48,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:48,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 13:03:48,167 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 13:03:48,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 13:03:48,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-10-15 13:03:48,168 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 13 states. [2018-10-15 13:03:48,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:48,682 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-10-15 13:03:48,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-15 13:03:48,683 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 42 [2018-10-15 13:03:48,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:48,685 INFO L225 Difference]: With dead ends: 48 [2018-10-15 13:03:48,685 INFO L226 Difference]: Without dead ends: 48 [2018-10-15 13:03:48,686 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-10-15 13:03:48,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-10-15 13:03:48,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-10-15 13:03:48,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-15 13:03:48,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-10-15 13:03:48,691 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 42 [2018-10-15 13:03:48,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:48,691 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-10-15 13:03:48,691 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 13:03:48,691 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-10-15 13:03:48,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-15 13:03:48,692 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:48,692 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:48,693 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:48,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:48,693 INFO L82 PathProgramCache]: Analyzing trace with hash 54216217, now seen corresponding path program 11 times [2018-10-15 13:03:48,694 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:48,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:48,993 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:48,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:48,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-15 13:03:48,994 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-15 13:03:48,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-15 13:03:48,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-10-15 13:03:48,995 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 14 states. [2018-10-15 13:03:49,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:49,406 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-10-15 13:03:49,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-15 13:03:49,407 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 45 [2018-10-15 13:03:49,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:49,408 INFO L225 Difference]: With dead ends: 51 [2018-10-15 13:03:49,408 INFO L226 Difference]: Without dead ends: 51 [2018-10-15 13:03:49,409 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-10-15 13:03:49,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-15 13:03:49,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2018-10-15 13:03:49,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-15 13:03:49,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-10-15 13:03:49,413 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 45 [2018-10-15 13:03:49,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:49,414 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-10-15 13:03:49,414 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-15 13:03:49,414 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-10-15 13:03:49,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-15 13:03:49,415 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:49,415 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:49,415 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:49,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:49,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1190489496, now seen corresponding path program 12 times [2018-10-15 13:03:49,417 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:49,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:49,941 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:49,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:49,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 13:03:49,942 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 13:03:49,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 13:03:49,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-10-15 13:03:49,942 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 15 states. [2018-10-15 13:03:50,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:50,278 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-10-15 13:03:50,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-15 13:03:50,279 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 48 [2018-10-15 13:03:50,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:50,280 INFO L225 Difference]: With dead ends: 54 [2018-10-15 13:03:50,280 INFO L226 Difference]: Without dead ends: 54 [2018-10-15 13:03:50,281 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-10-15 13:03:50,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-15 13:03:50,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-10-15 13:03:50,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-15 13:03:50,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-10-15 13:03:50,286 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 48 [2018-10-15 13:03:50,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:50,286 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-10-15 13:03:50,286 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 13:03:50,286 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-10-15 13:03:50,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-15 13:03:50,287 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:50,287 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:50,288 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:50,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:50,288 INFO L82 PathProgramCache]: Analyzing trace with hash 529248185, now seen corresponding path program 13 times [2018-10-15 13:03:50,289 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:50,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:51,771 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:51,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:51,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-15 13:03:51,772 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-15 13:03:51,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-15 13:03:51,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-10-15 13:03:51,772 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 16 states. [2018-10-15 13:03:52,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:52,237 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-10-15 13:03:52,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-15 13:03:52,238 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 51 [2018-10-15 13:03:52,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:52,239 INFO L225 Difference]: With dead ends: 57 [2018-10-15 13:03:52,239 INFO L226 Difference]: Without dead ends: 57 [2018-10-15 13:03:52,240 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-10-15 13:03:52,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-15 13:03:52,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-10-15 13:03:52,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-15 13:03:52,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-10-15 13:03:52,245 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 51 [2018-10-15 13:03:52,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:52,245 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-10-15 13:03:52,245 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-15 13:03:52,245 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-10-15 13:03:52,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-15 13:03:52,246 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:52,246 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:52,247 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:52,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:52,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1430371128, now seen corresponding path program 14 times [2018-10-15 13:03:52,248 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:52,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:52,559 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:52,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:52,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 13:03:52,559 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 13:03:52,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 13:03:52,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-10-15 13:03:52,560 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 17 states. [2018-10-15 13:03:53,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:53,383 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-10-15 13:03:53,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-15 13:03:53,384 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2018-10-15 13:03:53,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:53,385 INFO L225 Difference]: With dead ends: 60 [2018-10-15 13:03:53,385 INFO L226 Difference]: Without dead ends: 60 [2018-10-15 13:03:53,386 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-10-15 13:03:53,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-10-15 13:03:53,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2018-10-15 13:03:53,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-10-15 13:03:53,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-10-15 13:03:53,390 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 54 [2018-10-15 13:03:53,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:53,390 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-10-15 13:03:53,390 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 13:03:53,390 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-10-15 13:03:53,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-15 13:03:53,393 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:53,393 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:53,393 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:53,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:53,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1041129817, now seen corresponding path program 15 times [2018-10-15 13:03:53,394 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:53,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:54,157 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:54,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:54,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-15 13:03:54,158 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-15 13:03:54,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-15 13:03:54,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-10-15 13:03:54,159 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 18 states. [2018-10-15 13:03:55,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:55,003 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-10-15 13:03:55,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-15 13:03:55,009 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 57 [2018-10-15 13:03:55,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:55,009 INFO L225 Difference]: With dead ends: 63 [2018-10-15 13:03:55,009 INFO L226 Difference]: Without dead ends: 63 [2018-10-15 13:03:55,010 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-10-15 13:03:55,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-15 13:03:55,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2018-10-15 13:03:55,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-15 13:03:55,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-10-15 13:03:55,014 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 57 [2018-10-15 13:03:55,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:55,014 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-10-15 13:03:55,014 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-15 13:03:55,014 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-10-15 13:03:55,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-15 13:03:55,015 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:55,015 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:55,015 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:55,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:55,015 INFO L82 PathProgramCache]: Analyzing trace with hash 901426984, now seen corresponding path program 16 times [2018-10-15 13:03:55,016 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:55,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:56,163 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:56,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:56,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 13:03:56,164 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 13:03:56,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 13:03:56,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-10-15 13:03:56,165 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 19 states. [2018-10-15 13:03:56,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:56,750 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-10-15 13:03:56,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-15 13:03:56,751 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2018-10-15 13:03:56,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:56,752 INFO L225 Difference]: With dead ends: 66 [2018-10-15 13:03:56,752 INFO L226 Difference]: Without dead ends: 66 [2018-10-15 13:03:56,753 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-10-15 13:03:56,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-10-15 13:03:56,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2018-10-15 13:03:56,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-10-15 13:03:56,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-10-15 13:03:56,756 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 60 [2018-10-15 13:03:56,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:56,756 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-10-15 13:03:56,756 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 13:03:56,757 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-10-15 13:03:56,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-15 13:03:56,757 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:56,757 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:56,758 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:56,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:56,758 INFO L82 PathProgramCache]: Analyzing trace with hash 837638905, now seen corresponding path program 17 times [2018-10-15 13:03:56,759 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:56,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:58,039 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:58,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:58,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-15 13:03:58,040 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-15 13:03:58,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-15 13:03:58,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-10-15 13:03:58,041 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 20 states. [2018-10-15 13:03:58,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:58,648 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-10-15 13:03:58,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-15 13:03:58,649 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 63 [2018-10-15 13:03:58,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:58,650 INFO L225 Difference]: With dead ends: 69 [2018-10-15 13:03:58,650 INFO L226 Difference]: Without dead ends: 69 [2018-10-15 13:03:58,651 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-10-15 13:03:58,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-15 13:03:58,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-10-15 13:03:58,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-15 13:03:58,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-10-15 13:03:58,654 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 63 [2018-10-15 13:03:58,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:58,655 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-10-15 13:03:58,655 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-15 13:03:58,655 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-10-15 13:03:58,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-15 13:03:58,656 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:58,656 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:58,656 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:58,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:58,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1097477752, now seen corresponding path program 18 times [2018-10-15 13:03:58,657 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:58,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:59,698 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 0 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:59,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:59,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 13:03:59,699 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 13:03:59,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 13:03:59,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-10-15 13:03:59,700 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 21 states. [2018-10-15 13:04:00,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:00,367 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-10-15 13:04:00,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-15 13:04:00,368 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 66 [2018-10-15 13:04:00,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:00,369 INFO L225 Difference]: With dead ends: 72 [2018-10-15 13:04:00,369 INFO L226 Difference]: Without dead ends: 72 [2018-10-15 13:04:00,370 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-10-15 13:04:00,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-10-15 13:04:00,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2018-10-15 13:04:00,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-10-15 13:04:00,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-10-15 13:04:00,373 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 66 [2018-10-15 13:04:00,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:00,373 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-10-15 13:04:00,373 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 13:04:00,374 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-10-15 13:04:00,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-10-15 13:04:00,374 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:00,374 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:00,375 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:00,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:00,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1188207769, now seen corresponding path program 19 times [2018-10-15 13:04:00,376 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:00,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:01,737 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:01,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:01,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-15 13:04:01,738 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-15 13:04:01,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-15 13:04:01,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-10-15 13:04:01,739 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 22 states. [2018-10-15 13:04:02,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:02,376 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-10-15 13:04:02,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-15 13:04:02,376 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 69 [2018-10-15 13:04:02,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:02,378 INFO L225 Difference]: With dead ends: 75 [2018-10-15 13:04:02,378 INFO L226 Difference]: Without dead ends: 75 [2018-10-15 13:04:02,379 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-10-15 13:04:02,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-10-15 13:04:02,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2018-10-15 13:04:02,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-15 13:04:02,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-10-15 13:04:02,381 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 69 [2018-10-15 13:04:02,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:02,382 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-10-15 13:04:02,382 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-15 13:04:02,382 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-10-15 13:04:02,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-15 13:04:02,383 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:02,383 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:02,384 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:02,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:02,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1634053096, now seen corresponding path program 20 times [2018-10-15 13:04:02,385 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:02,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:02,779 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:02,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:02,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 13:04:02,780 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 13:04:02,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 13:04:02,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-10-15 13:04:02,781 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 23 states. [2018-10-15 13:04:03,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:03,471 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-10-15 13:04:03,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-15 13:04:03,471 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 72 [2018-10-15 13:04:03,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:03,472 INFO L225 Difference]: With dead ends: 78 [2018-10-15 13:04:03,472 INFO L226 Difference]: Without dead ends: 78 [2018-10-15 13:04:03,473 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-10-15 13:04:03,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-10-15 13:04:03,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2018-10-15 13:04:03,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-15 13:04:03,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-10-15 13:04:03,475 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 72 [2018-10-15 13:04:03,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:03,476 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-10-15 13:04:03,476 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 13:04:03,476 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-10-15 13:04:03,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-15 13:04:03,476 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:03,477 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:03,477 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:03,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:03,477 INFO L82 PathProgramCache]: Analyzing trace with hash -521656775, now seen corresponding path program 21 times [2018-10-15 13:04:03,478 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:03,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:04,296 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:04,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:04,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-15 13:04:04,297 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-15 13:04:04,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-15 13:04:04,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-10-15 13:04:04,298 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 24 states. [2018-10-15 13:04:05,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:05,108 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-10-15 13:04:05,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-15 13:04:05,111 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 75 [2018-10-15 13:04:05,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:05,112 INFO L225 Difference]: With dead ends: 81 [2018-10-15 13:04:05,112 INFO L226 Difference]: Without dead ends: 81 [2018-10-15 13:04:05,113 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-10-15 13:04:05,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-10-15 13:04:05,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2018-10-15 13:04:05,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-10-15 13:04:05,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-10-15 13:04:05,115 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 75 [2018-10-15 13:04:05,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:05,115 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-10-15 13:04:05,115 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-15 13:04:05,115 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-10-15 13:04:05,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-15 13:04:05,116 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:05,116 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:05,116 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:05,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:05,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1371553352, now seen corresponding path program 22 times [2018-10-15 13:04:05,117 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:05,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:05,773 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:05,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:05,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 13:04:05,774 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 13:04:05,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 13:04:05,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-10-15 13:04:05,774 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 25 states. [2018-10-15 13:04:06,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:06,637 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-10-15 13:04:06,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-15 13:04:06,638 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 78 [2018-10-15 13:04:06,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:06,639 INFO L225 Difference]: With dead ends: 84 [2018-10-15 13:04:06,639 INFO L226 Difference]: Without dead ends: 84 [2018-10-15 13:04:06,640 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-10-15 13:04:06,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-10-15 13:04:06,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2018-10-15 13:04:06,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-10-15 13:04:06,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-10-15 13:04:06,643 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 78 [2018-10-15 13:04:06,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:06,644 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-10-15 13:04:06,644 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 13:04:06,644 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-10-15 13:04:06,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-10-15 13:04:06,645 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:06,645 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:06,645 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:06,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:06,646 INFO L82 PathProgramCache]: Analyzing trace with hash 483915737, now seen corresponding path program 23 times [2018-10-15 13:04:06,646 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:06,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:07,635 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 0 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:07,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:07,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-15 13:04:07,635 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-15 13:04:07,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-15 13:04:07,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-10-15 13:04:07,636 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 26 states. [2018-10-15 13:04:08,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:08,616 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-10-15 13:04:08,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-15 13:04:08,617 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 81 [2018-10-15 13:04:08,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:08,618 INFO L225 Difference]: With dead ends: 87 [2018-10-15 13:04:08,618 INFO L226 Difference]: Without dead ends: 87 [2018-10-15 13:04:08,619 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-10-15 13:04:08,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-10-15 13:04:08,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2018-10-15 13:04:08,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-15 13:04:08,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-10-15 13:04:08,622 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 81 [2018-10-15 13:04:08,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:08,622 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-10-15 13:04:08,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-15 13:04:08,622 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-10-15 13:04:08,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-15 13:04:08,623 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:08,623 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:08,623 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:08,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:08,623 INFO L82 PathProgramCache]: Analyzing trace with hash 985368744, now seen corresponding path program 24 times [2018-10-15 13:04:08,624 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:08,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:10,140 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 0 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:10,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:10,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 13:04:10,140 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 13:04:10,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 13:04:10,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-10-15 13:04:10,141 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 27 states. [2018-10-15 13:04:11,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:11,096 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-10-15 13:04:11,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-15 13:04:11,097 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 84 [2018-10-15 13:04:11,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:11,098 INFO L225 Difference]: With dead ends: 90 [2018-10-15 13:04:11,098 INFO L226 Difference]: Without dead ends: 90 [2018-10-15 13:04:11,099 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-10-15 13:04:11,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-15 13:04:11,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2018-10-15 13:04:11,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-10-15 13:04:11,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-10-15 13:04:11,101 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 84 [2018-10-15 13:04:11,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:11,102 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-10-15 13:04:11,102 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 13:04:11,102 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-10-15 13:04:11,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-15 13:04:11,103 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:11,103 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:11,103 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:11,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:11,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1875644793, now seen corresponding path program 25 times [2018-10-15 13:04:11,104 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:11,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:11,697 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 0 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:11,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:11,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-15 13:04:11,698 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-15 13:04:11,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-15 13:04:11,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-10-15 13:04:11,699 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 28 states. [2018-10-15 13:04:12,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:12,730 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-10-15 13:04:12,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-15 13:04:12,731 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 87 [2018-10-15 13:04:12,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:12,732 INFO L225 Difference]: With dead ends: 93 [2018-10-15 13:04:12,733 INFO L226 Difference]: Without dead ends: 93 [2018-10-15 13:04:12,733 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-10-15 13:04:12,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-10-15 13:04:12,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2018-10-15 13:04:12,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-15 13:04:12,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-10-15 13:04:12,735 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 87 [2018-10-15 13:04:12,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:12,736 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-10-15 13:04:12,736 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-15 13:04:12,736 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-10-15 13:04:12,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-15 13:04:12,737 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:12,737 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:12,737 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:12,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:12,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1628599544, now seen corresponding path program 26 times [2018-10-15 13:04:12,738 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:12,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:13,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 0 proven. 1001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:13,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:13,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 13:04:13,721 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 13:04:13,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 13:04:13,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-10-15 13:04:13,722 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 29 states. [2018-10-15 13:04:14,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:14,992 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-10-15 13:04:14,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-15 13:04:14,993 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 90 [2018-10-15 13:04:14,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:14,994 INFO L225 Difference]: With dead ends: 96 [2018-10-15 13:04:14,994 INFO L226 Difference]: Without dead ends: 96 [2018-10-15 13:04:14,995 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-10-15 13:04:14,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-10-15 13:04:14,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2018-10-15 13:04:14,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-10-15 13:04:14,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-10-15 13:04:14,998 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 90 [2018-10-15 13:04:14,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:14,998 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-10-15 13:04:14,998 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 13:04:14,999 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-10-15 13:04:14,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-10-15 13:04:14,999 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:14,999 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:14,999 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:15,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:15,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1198420761, now seen corresponding path program 27 times [2018-10-15 13:04:15,000 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:15,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:15,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 0 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:15,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:15,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-15 13:04:15,891 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-15 13:04:15,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-15 13:04:15,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-10-15 13:04:15,891 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 30 states. [2018-10-15 13:04:17,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:17,156 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-10-15 13:04:17,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-15 13:04:17,157 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 93 [2018-10-15 13:04:17,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:17,158 INFO L225 Difference]: With dead ends: 99 [2018-10-15 13:04:17,158 INFO L226 Difference]: Without dead ends: 99 [2018-10-15 13:04:17,159 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-10-15 13:04:17,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-10-15 13:04:17,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2018-10-15 13:04:17,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-10-15 13:04:17,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-10-15 13:04:17,162 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 93 [2018-10-15 13:04:17,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:17,163 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-10-15 13:04:17,163 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-15 13:04:17,163 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-10-15 13:04:17,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-15 13:04:17,163 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:17,163 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:17,164 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:17,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:17,164 INFO L82 PathProgramCache]: Analyzing trace with hash 946619752, now seen corresponding path program 28 times [2018-10-15 13:04:17,165 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:17,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:17,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 0 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:17,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:17,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 13:04:17,942 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 13:04:17,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 13:04:17,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-10-15 13:04:17,943 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 31 states. [2018-10-15 13:04:19,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:19,325 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-10-15 13:04:19,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-15 13:04:19,326 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 96 [2018-10-15 13:04:19,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:19,327 INFO L225 Difference]: With dead ends: 102 [2018-10-15 13:04:19,327 INFO L226 Difference]: Without dead ends: 102 [2018-10-15 13:04:19,328 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-10-15 13:04:19,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-10-15 13:04:19,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2018-10-15 13:04:19,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-10-15 13:04:19,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-10-15 13:04:19,332 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 96 [2018-10-15 13:04:19,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:19,332 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-10-15 13:04:19,332 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 13:04:19,332 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-10-15 13:04:19,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-15 13:04:19,333 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:19,333 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:19,333 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:19,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:19,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1444340551, now seen corresponding path program 29 times [2018-10-15 13:04:19,334 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:19,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:20,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 0 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:20,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:20,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-15 13:04:20,067 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-15 13:04:20,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-15 13:04:20,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-10-15 13:04:20,068 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 32 states. [2018-10-15 13:04:21,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:21,403 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-10-15 13:04:21,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-15 13:04:21,403 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 99 [2018-10-15 13:04:21,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:21,404 INFO L225 Difference]: With dead ends: 105 [2018-10-15 13:04:21,404 INFO L226 Difference]: Without dead ends: 105 [2018-10-15 13:04:21,405 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-10-15 13:04:21,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-10-15 13:04:21,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2018-10-15 13:04:21,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-10-15 13:04:21,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-10-15 13:04:21,408 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 99 [2018-10-15 13:04:21,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:21,408 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-10-15 13:04:21,408 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-15 13:04:21,408 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-10-15 13:04:21,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-15 13:04:21,409 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:21,409 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:21,409 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:21,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:21,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1489876936, now seen corresponding path program 30 times [2018-10-15 13:04:21,410 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:21,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:22,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:22,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:22,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 13:04:22,176 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 13:04:22,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 13:04:22,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 13:04:22,177 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 33 states. [2018-10-15 13:04:23,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:23,815 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-10-15 13:04:23,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-15 13:04:23,815 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 102 [2018-10-15 13:04:23,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:23,817 INFO L225 Difference]: With dead ends: 108 [2018-10-15 13:04:23,817 INFO L226 Difference]: Without dead ends: 108 [2018-10-15 13:04:23,818 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 13:04:23,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-10-15 13:04:23,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2018-10-15 13:04:23,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-10-15 13:04:23,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-10-15 13:04:23,821 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 102 [2018-10-15 13:04:23,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:23,821 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-10-15 13:04:23,821 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 13:04:23,821 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-10-15 13:04:23,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-10-15 13:04:23,822 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:23,822 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:23,822 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:23,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:23,822 INFO L82 PathProgramCache]: Analyzing trace with hash -706343335, now seen corresponding path program 31 times [2018-10-15 13:04:23,823 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:23,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:24,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:24,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:24,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-15 13:04:24,831 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-15 13:04:24,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-15 13:04:24,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-10-15 13:04:24,832 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 34 states. [2018-10-15 13:04:26,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:26,336 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-10-15 13:04:26,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-15 13:04:26,336 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 105 [2018-10-15 13:04:26,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:26,338 INFO L225 Difference]: With dead ends: 111 [2018-10-15 13:04:26,338 INFO L226 Difference]: Without dead ends: 111 [2018-10-15 13:04:26,339 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-10-15 13:04:26,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-10-15 13:04:26,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2018-10-15 13:04:26,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-15 13:04:26,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-10-15 13:04:26,341 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 105 [2018-10-15 13:04:26,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:26,342 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-10-15 13:04:26,342 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-15 13:04:26,342 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-10-15 13:04:26,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-15 13:04:26,343 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:26,343 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:26,343 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:26,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:26,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1227350568, now seen corresponding path program 32 times [2018-10-15 13:04:26,344 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:26,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:27,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 0 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:27,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:27,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 13:04:27,113 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 13:04:27,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 13:04:27,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 13:04:27,114 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 35 states. [2018-10-15 13:04:28,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:28,721 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-10-15 13:04:28,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-15 13:04:28,721 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 108 [2018-10-15 13:04:28,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:28,722 INFO L225 Difference]: With dead ends: 114 [2018-10-15 13:04:28,723 INFO L226 Difference]: Without dead ends: 114 [2018-10-15 13:04:28,724 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 13:04:28,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-10-15 13:04:28,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2018-10-15 13:04:28,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-10-15 13:04:28,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-10-15 13:04:28,727 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 108 [2018-10-15 13:04:28,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:28,727 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-10-15 13:04:28,727 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 13:04:28,727 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-10-15 13:04:28,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-10-15 13:04:28,728 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:28,728 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:28,728 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:28,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:28,729 INFO L82 PathProgramCache]: Analyzing trace with hash -493926407, now seen corresponding path program 33 times [2018-10-15 13:04:28,729 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:28,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:29,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 0 proven. 1617 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:29,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:29,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-15 13:04:29,953 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-15 13:04:29,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-15 13:04:29,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-10-15 13:04:29,953 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 36 states. [2018-10-15 13:04:31,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:31,737 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-10-15 13:04:31,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-15 13:04:31,737 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 111 [2018-10-15 13:04:31,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:31,739 INFO L225 Difference]: With dead ends: 117 [2018-10-15 13:04:31,739 INFO L226 Difference]: Without dead ends: 117 [2018-10-15 13:04:31,740 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-10-15 13:04:31,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-10-15 13:04:31,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-10-15 13:04:31,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-15 13:04:31,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-10-15 13:04:31,742 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 111 [2018-10-15 13:04:31,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:31,743 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-10-15 13:04:31,743 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-15 13:04:31,743 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-10-15 13:04:31,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-15 13:04:31,744 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:31,744 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:31,744 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:31,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:31,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1441741688, now seen corresponding path program 34 times [2018-10-15 13:04:31,745 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:31,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:32,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 0 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:32,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:32,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 13:04:32,685 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 13:04:32,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 13:04:32,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 13:04:32,686 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 37 states. [2018-10-15 13:04:34,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:34,558 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2018-10-15 13:04:34,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-15 13:04:34,559 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 114 [2018-10-15 13:04:34,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:34,560 INFO L225 Difference]: With dead ends: 120 [2018-10-15 13:04:34,560 INFO L226 Difference]: Without dead ends: 120 [2018-10-15 13:04:34,561 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 13:04:34,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-10-15 13:04:34,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2018-10-15 13:04:34,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-10-15 13:04:34,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2018-10-15 13:04:34,564 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 114 [2018-10-15 13:04:34,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:34,565 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2018-10-15 13:04:34,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 13:04:34,565 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2018-10-15 13:04:34,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-10-15 13:04:34,566 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:34,566 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:34,566 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:34,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:34,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1603193241, now seen corresponding path program 35 times [2018-10-15 13:04:34,567 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:34,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:35,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 0 proven. 1820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:35,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:35,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-15 13:04:35,603 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-15 13:04:35,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-15 13:04:35,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-10-15 13:04:35,604 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 38 states. [2018-10-15 13:04:37,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:37,489 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-10-15 13:04:37,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-15 13:04:37,489 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 117 [2018-10-15 13:04:37,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:37,490 INFO L225 Difference]: With dead ends: 123 [2018-10-15 13:04:37,490 INFO L226 Difference]: Without dead ends: 123 [2018-10-15 13:04:37,491 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-10-15 13:04:37,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-10-15 13:04:37,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2018-10-15 13:04:37,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-10-15 13:04:37,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-10-15 13:04:37,494 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 117 [2018-10-15 13:04:37,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:37,494 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-10-15 13:04:37,494 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-15 13:04:37,494 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-10-15 13:04:37,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-15 13:04:37,495 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:37,495 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:37,495 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:37,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:37,496 INFO L82 PathProgramCache]: Analyzing trace with hash -744595736, now seen corresponding path program 36 times [2018-10-15 13:04:37,496 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:37,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:38,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 0 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:38,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:38,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 13:04:38,588 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 13:04:38,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 13:04:38,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 13:04:38,589 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 39 states. [2018-10-15 13:04:40,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:40,802 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2018-10-15 13:04:40,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-15 13:04:40,802 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 120 [2018-10-15 13:04:40,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:40,803 INFO L225 Difference]: With dead ends: 126 [2018-10-15 13:04:40,804 INFO L226 Difference]: Without dead ends: 126 [2018-10-15 13:04:40,804 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 13:04:40,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-10-15 13:04:40,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2018-10-15 13:04:40,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-10-15 13:04:40,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2018-10-15 13:04:40,808 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 120 [2018-10-15 13:04:40,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:40,808 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2018-10-15 13:04:40,808 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 13:04:40,809 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2018-10-15 13:04:40,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-10-15 13:04:40,809 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:40,809 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:40,810 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:40,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:40,810 INFO L82 PathProgramCache]: Analyzing trace with hash -183594183, now seen corresponding path program 37 times [2018-10-15 13:04:40,811 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:40,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:42,264 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 0 proven. 2035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:42,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:42,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-15 13:04:42,265 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-15 13:04:42,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-15 13:04:42,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-10-15 13:04:42,267 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 40 states. [2018-10-15 13:04:44,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:44,388 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-10-15 13:04:44,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-15 13:04:44,396 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 123 [2018-10-15 13:04:44,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:44,397 INFO L225 Difference]: With dead ends: 129 [2018-10-15 13:04:44,397 INFO L226 Difference]: Without dead ends: 129 [2018-10-15 13:04:44,398 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-10-15 13:04:44,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-10-15 13:04:44,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2018-10-15 13:04:44,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-10-15 13:04:44,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-10-15 13:04:44,401 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 123 [2018-10-15 13:04:44,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:44,401 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-10-15 13:04:44,401 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-15 13:04:44,401 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-10-15 13:04:44,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-10-15 13:04:44,402 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:44,402 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:44,402 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:44,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:44,403 INFO L82 PathProgramCache]: Analyzing trace with hash 895922504, now seen corresponding path program 38 times [2018-10-15 13:04:44,403 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:44,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:45,636 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 0 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:45,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:45,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 13:04:45,637 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 13:04:45,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 13:04:45,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 13:04:45,638 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 41 states. [2018-10-15 13:04:47,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:47,878 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2018-10-15 13:04:47,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-15 13:04:47,879 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 126 [2018-10-15 13:04:47,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:47,881 INFO L225 Difference]: With dead ends: 132 [2018-10-15 13:04:47,881 INFO L226 Difference]: Without dead ends: 132 [2018-10-15 13:04:47,882 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 13:04:47,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-10-15 13:04:47,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2018-10-15 13:04:47,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-10-15 13:04:47,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2018-10-15 13:04:47,886 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 126 [2018-10-15 13:04:47,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:47,886 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2018-10-15 13:04:47,886 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 13:04:47,886 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2018-10-15 13:04:47,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-10-15 13:04:47,887 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:47,887 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:47,888 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:47,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:47,888 INFO L82 PathProgramCache]: Analyzing trace with hash 62432473, now seen corresponding path program 39 times [2018-10-15 13:04:47,889 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:47,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:49,102 INFO L134 CoverageAnalysis]: Checked inductivity of 2262 backedges. 0 proven. 2262 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:49,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:49,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-15 13:04:49,103 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-15 13:04:49,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-15 13:04:49,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-10-15 13:04:49,104 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 42 states. [2018-10-15 13:04:51,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:51,619 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-10-15 13:04:51,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-15 13:04:51,620 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 129 [2018-10-15 13:04:51,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:51,621 INFO L225 Difference]: With dead ends: 135 [2018-10-15 13:04:51,621 INFO L226 Difference]: Without dead ends: 135 [2018-10-15 13:04:51,622 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-10-15 13:04:51,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-10-15 13:04:51,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2018-10-15 13:04:51,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-10-15 13:04:51,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-10-15 13:04:51,626 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 129 [2018-10-15 13:04:51,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:51,626 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-10-15 13:04:51,626 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-15 13:04:51,627 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-10-15 13:04:51,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-15 13:04:51,627 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:51,627 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:51,628 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:51,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:51,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1233142872, now seen corresponding path program 40 times [2018-10-15 13:04:51,629 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:51,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:53,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 2380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:53,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:53,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 13:04:53,590 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 13:04:53,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 13:04:53,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 13:04:53,591 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 43 states. [2018-10-15 13:04:56,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:56,197 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2018-10-15 13:04:56,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-15 13:04:56,197 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 132 [2018-10-15 13:04:56,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:56,199 INFO L225 Difference]: With dead ends: 138 [2018-10-15 13:04:56,199 INFO L226 Difference]: Without dead ends: 138 [2018-10-15 13:04:56,200 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 13:04:56,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-10-15 13:04:56,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2018-10-15 13:04:56,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-10-15 13:04:56,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2018-10-15 13:04:56,203 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 132 [2018-10-15 13:04:56,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:56,203 INFO L481 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2018-10-15 13:04:56,203 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 13:04:56,204 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2018-10-15 13:04:56,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-15 13:04:56,204 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:56,204 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:56,205 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:56,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:56,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1152843385, now seen corresponding path program 41 times [2018-10-15 13:04:56,206 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:56,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:57,335 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 0 proven. 2501 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:57,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:57,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-15 13:04:57,335 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-15 13:04:57,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-15 13:04:57,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-10-15 13:04:57,336 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 44 states. [2018-10-15 13:04:59,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:59,959 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-10-15 13:04:59,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-15 13:04:59,959 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 135 [2018-10-15 13:04:59,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:59,960 INFO L225 Difference]: With dead ends: 141 [2018-10-15 13:04:59,960 INFO L226 Difference]: Without dead ends: 141 [2018-10-15 13:04:59,961 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-10-15 13:04:59,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-10-15 13:04:59,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2018-10-15 13:04:59,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-10-15 13:04:59,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2018-10-15 13:04:59,965 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 135 [2018-10-15 13:04:59,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:59,965 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2018-10-15 13:04:59,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-15 13:04:59,965 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2018-10-15 13:04:59,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-10-15 13:04:59,966 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:59,966 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:59,966 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:59,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:59,967 INFO L82 PathProgramCache]: Analyzing trace with hash 360676872, now seen corresponding path program 42 times [2018-10-15 13:04:59,967 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:59,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:01,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 0 proven. 2625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:05:01,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:01,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 13:05:01,208 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 13:05:01,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 13:05:01,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 13:05:01,209 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 45 states. [2018-10-15 13:05:04,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:04,510 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2018-10-15 13:05:04,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-15 13:05:04,511 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 138 [2018-10-15 13:05:04,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:04,512 INFO L225 Difference]: With dead ends: 144 [2018-10-15 13:05:04,512 INFO L226 Difference]: Without dead ends: 144 [2018-10-15 13:05:04,513 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 13:05:04,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-10-15 13:05:04,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2018-10-15 13:05:04,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-10-15 13:05:04,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2018-10-15 13:05:04,518 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 138 [2018-10-15 13:05:04,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:04,518 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2018-10-15 13:05:04,518 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 13:05:04,518 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2018-10-15 13:05:04,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-10-15 13:05:04,520 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:04,520 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:04,520 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:04,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:04,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1773379609, now seen corresponding path program 43 times [2018-10-15 13:05:04,521 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:04,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:05,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 0 proven. 2752 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:05:05,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:05,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-15 13:05:05,893 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-15 13:05:05,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-15 13:05:05,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-10-15 13:05:05,895 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 46 states. [2018-10-15 13:05:08,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:08,691 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-10-15 13:05:08,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-15 13:05:08,692 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 141 [2018-10-15 13:05:08,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:08,693 INFO L225 Difference]: With dead ends: 147 [2018-10-15 13:05:08,693 INFO L226 Difference]: Without dead ends: 147 [2018-10-15 13:05:08,694 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-10-15 13:05:08,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-10-15 13:05:08,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2018-10-15 13:05:08,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-10-15 13:05:08,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-10-15 13:05:08,698 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 141 [2018-10-15 13:05:08,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:08,698 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-10-15 13:05:08,698 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-15 13:05:08,698 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-10-15 13:05:08,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-15 13:05:08,699 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:08,699 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:08,699 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:08,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:08,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1216084072, now seen corresponding path program 44 times [2018-10-15 13:05:08,700 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:08,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:11,006 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 0 proven. 2882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:05:11,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:11,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 13:05:11,007 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 13:05:11,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 13:05:11,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 13:05:11,008 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 47 states. [2018-10-15 13:05:13,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:13,970 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2018-10-15 13:05:13,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-15 13:05:13,970 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 144 [2018-10-15 13:05:13,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:13,971 INFO L225 Difference]: With dead ends: 150 [2018-10-15 13:05:13,972 INFO L226 Difference]: Without dead ends: 150 [2018-10-15 13:05:13,972 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 13:05:13,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-10-15 13:05:13,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2018-10-15 13:05:13,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-10-15 13:05:13,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2018-10-15 13:05:13,975 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 144 [2018-10-15 13:05:13,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:13,975 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2018-10-15 13:05:13,975 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 13:05:13,975 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2018-10-15 13:05:13,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-15 13:05:13,975 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:13,976 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:13,976 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:13,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:13,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1126659655, now seen corresponding path program 45 times [2018-10-15 13:05:13,977 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:13,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:15,457 INFO L134 CoverageAnalysis]: Checked inductivity of 3015 backedges. 0 proven. 3015 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:05:15,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:15,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-15 13:05:15,458 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-15 13:05:15,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-15 13:05:15,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-10-15 13:05:15,459 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 48 states. [2018-10-15 13:05:18,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:18,644 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-10-15 13:05:18,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-15 13:05:18,645 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 147 [2018-10-15 13:05:18,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:18,646 INFO L225 Difference]: With dead ends: 153 [2018-10-15 13:05:18,646 INFO L226 Difference]: Without dead ends: 153 [2018-10-15 13:05:18,647 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-10-15 13:05:18,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-10-15 13:05:18,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2018-10-15 13:05:18,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-10-15 13:05:18,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-10-15 13:05:18,650 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 147 [2018-10-15 13:05:18,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:18,650 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-10-15 13:05:18,650 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-15 13:05:18,650 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-10-15 13:05:18,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-15 13:05:18,651 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:18,651 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:18,652 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:18,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:18,652 INFO L82 PathProgramCache]: Analyzing trace with hash -586470712, now seen corresponding path program 46 times [2018-10-15 13:05:18,653 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:18,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:19,907 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:05:19,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:19,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 13:05:19,908 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 13:05:19,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 13:05:19,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 13:05:19,908 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 49 states. [2018-10-15 13:05:23,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:23,229 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2018-10-15 13:05:23,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-15 13:05:23,229 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 150 [2018-10-15 13:05:23,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:23,230 INFO L225 Difference]: With dead ends: 156 [2018-10-15 13:05:23,231 INFO L226 Difference]: Without dead ends: 156 [2018-10-15 13:05:23,231 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 13:05:23,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-10-15 13:05:23,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 154. [2018-10-15 13:05:23,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-10-15 13:05:23,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 154 transitions. [2018-10-15 13:05:23,233 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 154 transitions. Word has length 150 [2018-10-15 13:05:23,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:23,234 INFO L481 AbstractCegarLoop]: Abstraction has 154 states and 154 transitions. [2018-10-15 13:05:23,234 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 13:05:23,234 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 154 transitions. [2018-10-15 13:05:23,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-10-15 13:05:23,234 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:23,234 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:23,235 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:23,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:23,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1060127911, now seen corresponding path program 47 times [2018-10-15 13:05:23,235 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:23,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:24,749 INFO L134 CoverageAnalysis]: Checked inductivity of 3290 backedges. 0 proven. 3290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:05:24,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:24,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-15 13:05:24,750 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-15 13:05:24,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-15 13:05:24,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-10-15 13:05:24,751 INFO L87 Difference]: Start difference. First operand 154 states and 154 transitions. Second operand 50 states. [2018-10-15 13:05:28,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:28,228 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-10-15 13:05:28,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-15 13:05:28,228 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 153 [2018-10-15 13:05:28,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:28,229 INFO L225 Difference]: With dead ends: 159 [2018-10-15 13:05:28,229 INFO L226 Difference]: Without dead ends: 159 [2018-10-15 13:05:28,230 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-10-15 13:05:28,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-10-15 13:05:28,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2018-10-15 13:05:28,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-10-15 13:05:28,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-10-15 13:05:28,233 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 153 [2018-10-15 13:05:28,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:28,234 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-10-15 13:05:28,234 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-15 13:05:28,234 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-10-15 13:05:28,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-15 13:05:28,235 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:28,235 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:28,235 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:28,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:28,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1480791336, now seen corresponding path program 48 times [2018-10-15 13:05:28,236 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:28,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:30,379 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 0 proven. 3432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:05:30,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:30,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 13:05:30,380 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 13:05:30,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 13:05:30,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 13:05:30,380 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 51 states. [2018-10-15 13:05:33,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:33,970 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2018-10-15 13:05:33,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-15 13:05:33,970 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 156 [2018-10-15 13:05:33,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:33,972 INFO L225 Difference]: With dead ends: 162 [2018-10-15 13:05:33,972 INFO L226 Difference]: Without dead ends: 162 [2018-10-15 13:05:33,973 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 13:05:33,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-10-15 13:05:33,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2018-10-15 13:05:33,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-10-15 13:05:33,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 160 transitions. [2018-10-15 13:05:33,975 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 160 transitions. Word has length 156 [2018-10-15 13:05:33,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:33,975 INFO L481 AbstractCegarLoop]: Abstraction has 160 states and 160 transitions. [2018-10-15 13:05:33,975 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 13:05:33,975 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 160 transitions. [2018-10-15 13:05:33,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-15 13:05:33,976 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:33,976 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:33,977 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:33,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:33,977 INFO L82 PathProgramCache]: Analyzing trace with hash -792513287, now seen corresponding path program 49 times [2018-10-15 13:05:33,978 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:34,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:35,854 INFO L134 CoverageAnalysis]: Checked inductivity of 3577 backedges. 0 proven. 3577 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:05:35,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:35,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-15 13:05:35,855 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-15 13:05:35,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-15 13:05:35,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-10-15 13:05:35,855 INFO L87 Difference]: Start difference. First operand 160 states and 160 transitions. Second operand 52 states. [2018-10-15 13:05:39,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:39,585 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-10-15 13:05:39,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-15 13:05:39,585 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 159 [2018-10-15 13:05:39,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:39,586 INFO L225 Difference]: With dead ends: 165 [2018-10-15 13:05:39,587 INFO L226 Difference]: Without dead ends: 165 [2018-10-15 13:05:39,587 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-10-15 13:05:39,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-10-15 13:05:39,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 163. [2018-10-15 13:05:39,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-10-15 13:05:39,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-10-15 13:05:39,591 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 159 [2018-10-15 13:05:39,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:39,591 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-10-15 13:05:39,591 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-15 13:05:39,591 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-10-15 13:05:39,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-10-15 13:05:39,592 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:39,592 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:39,593 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:39,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:39,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1766213752, now seen corresponding path program 50 times [2018-10-15 13:05:39,594 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:39,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:06:40,550 WARN L179 SmtUtils]: Spent 1.00 m on a formula simplification. DAG size of input: 40 DAG size of output: 16 [2018-10-15 13:06:52,755 WARN L179 SmtUtils]: Spent 12.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 17 [2018-10-15 13:07:16,881 WARN L179 SmtUtils]: Spent 24.08 s on a formula simplification. DAG size of input: 41 DAG size of output: 17 [2018-10-15 13:07:28,990 WARN L179 SmtUtils]: Spent 12.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 17 [2018-10-15 13:08:17,121 WARN L179 SmtUtils]: Spent 48.11 s on a formula simplification. DAG size of input: 41 DAG size of output: 17 [2018-10-15 13:09:05,266 WARN L179 SmtUtils]: Spent 48.11 s on a formula simplification. DAG size of input: 41 DAG size of output: 17 [2018-10-15 13:09:29,370 WARN L179 SmtUtils]: Spent 24.08 s on a formula simplification. DAG size of input: 41 DAG size of output: 17 [2018-10-15 13:09:41,457 WARN L179 SmtUtils]: Spent 12.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 17 [2018-10-15 13:09:53,618 WARN L179 SmtUtils]: Spent 12.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 17 [2018-10-15 13:10:05,702 WARN L179 SmtUtils]: Spent 12.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 17 [2018-10-15 13:10:29,811 WARN L179 SmtUtils]: Spent 24.07 s on a formula simplification. DAG size of input: 41 DAG size of output: 17 [2018-10-15 13:10:41,984 WARN L179 SmtUtils]: Spent 12.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 17 [2018-10-15 13:11:06,192 WARN L179 SmtUtils]: Spent 24.07 s on a formula simplification. DAG size of input: 41 DAG size of output: 17 [2018-10-15 13:11:18,286 WARN L179 SmtUtils]: Spent 12.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 17 [2018-10-15 13:11:30,378 WARN L179 SmtUtils]: Spent 12.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 17 [2018-10-15 13:12:06,543 WARN L179 SmtUtils]: Spent 36.10 s on a formula simplification. DAG size of input: 41 DAG size of output: 17 [2018-10-15 13:12:30,666 WARN L179 SmtUtils]: Spent 24.07 s on a formula simplification. DAG size of input: 41 DAG size of output: 17