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/functions_true-unreach-call1_true-termination.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2d08e6e [2018-10-15 13:03:49,971 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 13:03:49,973 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 13:03:49,985 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 13:03:49,986 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 13:03:49,987 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 13:03:49,988 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 13:03:49,990 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 13:03:49,992 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 13:03:49,992 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 13:03:49,993 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 13:03:49,994 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 13:03:49,995 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 13:03:49,996 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 13:03:49,997 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 13:03:49,997 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 13:03:49,998 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 13:03:50,000 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 13:03:50,002 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 13:03:50,004 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 13:03:50,005 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 13:03:50,006 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 13:03:50,008 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 13:03:50,009 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 13:03:50,009 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 13:03:50,010 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 13:03:50,011 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 13:03:50,011 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 13:03:50,012 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 13:03:50,013 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 13:03:50,014 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 13:03:50,014 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 13:03:50,014 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 13:03:50,015 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 13:03:50,016 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 13:03:50,016 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 13:03:50,017 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:50,027 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 13:03:50,028 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 13:03:50,029 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 13:03:50,029 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 13:03:50,029 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 13:03:50,029 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 13:03:50,030 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 13:03:50,030 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 13:03:50,030 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 13:03:50,031 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 13:03:50,031 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 13:03:50,031 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 13:03:50,031 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 13:03:50,032 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 13:03:50,032 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 13:03:50,086 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 13:03:50,100 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 13:03:50,104 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 13:03:50,105 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 13:03:50,106 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 13:03:50,107 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/functions_true-unreach-call1_true-termination.i_3.bpl [2018-10-15 13:03:50,107 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/functions_true-unreach-call1_true-termination.i_3.bpl' [2018-10-15 13:03:50,163 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 13:03:50,165 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-15 13:03:50,165 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 13:03:50,165 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 13:03:50,166 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 13:03:50,193 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "functions_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:03:50" (1/1) ... [2018-10-15 13:03:50,195 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "functions_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:03:50" (1/1) ... [2018-10-15 13:03:50,206 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "functions_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:03:50" (1/1) ... [2018-10-15 13:03:50,206 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "functions_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:03:50" (1/1) ... [2018-10-15 13:03:50,209 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "functions_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:03:50" (1/1) ... [2018-10-15 13:03:50,211 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "functions_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:03:50" (1/1) ... [2018-10-15 13:03:50,212 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "functions_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:03:50" (1/1) ... [2018-10-15 13:03:50,213 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 13:03:50,214 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 13:03:50,215 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 13:03:50,215 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 13:03:50,216 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "functions_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:03:50" (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:50,294 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-15 13:03:50,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 13:03:50,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 13:03:50,617 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 13:03:50,618 INFO L202 PluginConnector]: Adding new model functions_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:03:50 BoogieIcfgContainer [2018-10-15 13:03:50,618 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 13:03:50,619 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-15 13:03:50,619 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-15 13:03:50,620 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-15 13:03:50,624 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "functions_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:03:50" (1/1) ... [2018-10-15 13:03:50,630 WARN L219 ansformationObserver]: HeapSeparator: input icfg has no '#valid' array -- returning unchanged Icfg! [2018-10-15 13:03:50,652 INFO L202 PluginConnector]: Adding new model functions_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 01:03:50 BasicIcfg [2018-10-15 13:03:50,652 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-15 13:03:50,654 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 13:03:50,655 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 13:03:50,658 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 13:03:50,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "functions_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:03:50" (1/3) ... [2018-10-15 13:03:50,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fe47227 and model type functions_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:03:50, skipping insertion in model container [2018-10-15 13:03:50,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "functions_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:03:50" (2/3) ... [2018-10-15 13:03:50,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fe47227 and model type functions_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 01:03:50, skipping insertion in model container [2018-10-15 13:03:50,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "functions_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 01:03:50" (3/3) ... [2018-10-15 13:03:50,663 INFO L112 eAbstractionObserver]: Analyzing ICFG functions_true-unreach-call1_true-termination.i_3.bplleft_unchanged_by_heapseparator [2018-10-15 13:03:50,675 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 13:03:50,686 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 13:03:50,708 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 13:03:50,753 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 13:03:50,757 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 13:03:50,757 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 13:03:50,757 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 13:03:50,757 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 13:03:50,757 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 13:03:50,758 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 13:03:50,758 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 13:03:50,758 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 13:03:50,773 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-10-15 13:03:50,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-15 13:03:50,782 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:50,783 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:50,785 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:50,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:50,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1071124471, now seen corresponding path program 1 times [2018-10-15 13:03:50,845 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:50,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:50,970 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:50,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 13:03:50,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 13:03:50,976 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 13:03:50,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 13:03:50,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 13:03:50,993 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2018-10-15 13:03:51,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:51,083 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-10-15 13:03:51,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 13:03:51,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-10-15 13:03:51,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:51,097 INFO L225 Difference]: With dead ends: 27 [2018-10-15 13:03:51,097 INFO L226 Difference]: Without dead ends: 27 [2018-10-15 13:03:51,099 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 13:03:51,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-15 13:03:51,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2018-10-15 13:03:51,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-15 13:03:51,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-10-15 13:03:51,130 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 10 [2018-10-15 13:03:51,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:51,130 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-10-15 13:03:51,130 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 13:03:51,130 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-10-15 13:03:51,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-15 13:03:51,131 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:51,131 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:51,132 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:51,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:51,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1619287688, now seen corresponding path program 1 times [2018-10-15 13:03:51,133 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:51,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:51,465 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:51,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:51,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-15 13:03:51,468 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-15 13:03:51,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-15 13:03:51,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-15 13:03:51,469 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 8 states. [2018-10-15 13:03:52,058 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-15 13:03:52,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:52,198 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-10-15 13:03:52,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-15 13:03:52,200 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-10-15 13:03:52,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:52,201 INFO L225 Difference]: With dead ends: 36 [2018-10-15 13:03:52,202 INFO L226 Difference]: Without dead ends: 36 [2018-10-15 13:03:52,203 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-10-15 13:03:52,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-15 13:03:52,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 29. [2018-10-15 13:03:52,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-15 13:03:52,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-10-15 13:03:52,209 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 19 [2018-10-15 13:03:52,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:52,209 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-10-15 13:03:52,209 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-15 13:03:52,210 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-10-15 13:03:52,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-15 13:03:52,211 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:52,211 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:52,212 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:52,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:52,212 INFO L82 PathProgramCache]: Analyzing trace with hash 9903337, now seen corresponding path program 2 times [2018-10-15 13:03:52,213 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:52,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:52,911 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:52,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:52,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 13:03:52,913 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 13:03:52,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 13:03:52,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-10-15 13:03:52,914 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 13 states. [2018-10-15 13:03:53,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:53,847 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-10-15 13:03:53,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-15 13:03:53,849 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2018-10-15 13:03:53,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:53,851 INFO L225 Difference]: With dead ends: 45 [2018-10-15 13:03:53,851 INFO L226 Difference]: Without dead ends: 45 [2018-10-15 13:03:53,852 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=135, Invalid=677, Unknown=0, NotChecked=0, Total=812 [2018-10-15 13:03:53,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-15 13:03:53,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 38. [2018-10-15 13:03:53,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-15 13:03:53,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-10-15 13:03:53,859 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 28 [2018-10-15 13:03:53,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:53,859 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-10-15 13:03:53,859 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 13:03:53,860 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-10-15 13:03:53,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-15 13:03:53,861 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:53,861 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:53,861 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:53,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:53,862 INFO L82 PathProgramCache]: Analyzing trace with hash -878645096, now seen corresponding path program 3 times [2018-10-15 13:03:53,863 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:53,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:54,533 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:54,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:54,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-15 13:03:54,534 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-15 13:03:54,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-15 13:03:54,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-10-15 13:03:54,536 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 18 states. [2018-10-15 13:03:56,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:56,006 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-10-15 13:03:56,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-15 13:03:56,008 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 37 [2018-10-15 13:03:56,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:56,010 INFO L225 Difference]: With dead ends: 54 [2018-10-15 13:03:56,010 INFO L226 Difference]: Without dead ends: 54 [2018-10-15 13:03:56,012 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=201, Invalid=1521, Unknown=0, NotChecked=0, Total=1722 [2018-10-15 13:03:56,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-15 13:03:56,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 47. [2018-10-15 13:03:56,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-15 13:03:56,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-10-15 13:03:56,018 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 37 [2018-10-15 13:03:56,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:56,018 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-10-15 13:03:56,018 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-15 13:03:56,019 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-10-15 13:03:56,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-15 13:03:56,020 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:56,020 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:56,021 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:56,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:56,021 INFO L82 PathProgramCache]: Analyzing trace with hash -517418551, now seen corresponding path program 4 times [2018-10-15 13:03:56,022 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:56,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:56,494 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:56,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:56,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 13:03:56,495 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 13:03:56,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 13:03:56,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-10-15 13:03:56,496 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 23 states. [2018-10-15 13:03:58,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:58,017 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-10-15 13:03:58,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-15 13:03:58,019 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 46 [2018-10-15 13:03:58,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:58,020 INFO L225 Difference]: With dead ends: 63 [2018-10-15 13:03:58,020 INFO L226 Difference]: Without dead ends: 63 [2018-10-15 13:03:58,022 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=267, Invalid=2703, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 13:03:58,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-15 13:03:58,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2018-10-15 13:03:58,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-15 13:03:58,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-10-15 13:03:58,028 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 46 [2018-10-15 13:03:58,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:58,029 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-10-15 13:03:58,029 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 13:03:58,029 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-10-15 13:03:58,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-15 13:03:58,030 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:58,030 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:58,031 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:58,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:58,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1643952056, now seen corresponding path program 5 times [2018-10-15 13:03:58,032 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:58,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:58,685 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:58,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:58,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-15 13:03:58,686 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-15 13:03:58,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-15 13:03:58,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-10-15 13:03:58,687 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 28 states. [2018-10-15 13:04:00,506 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-15 13:04:00,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:00,775 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-10-15 13:04:00,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-15 13:04:00,775 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 55 [2018-10-15 13:04:00,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:00,777 INFO L225 Difference]: With dead ends: 72 [2018-10-15 13:04:00,777 INFO L226 Difference]: Without dead ends: 72 [2018-10-15 13:04:00,778 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 750 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=333, Invalid=4223, Unknown=0, NotChecked=0, Total=4556 [2018-10-15 13:04:00,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-10-15 13:04:00,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 65. [2018-10-15 13:04:00,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-10-15 13:04:00,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-10-15 13:04:00,785 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 55 [2018-10-15 13:04:00,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:00,785 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-10-15 13:04:00,785 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-15 13:04:00,785 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-10-15 13:04:00,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-15 13:04:00,787 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:00,787 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:00,787 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:00,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:00,788 INFO L82 PathProgramCache]: Analyzing trace with hash -515174743, now seen corresponding path program 6 times [2018-10-15 13:04:00,789 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:00,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:01,988 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:01,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:01,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 13:04:01,989 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 13:04:01,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 13:04:01,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 13:04:01,990 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 33 states. [2018-10-15 13:04:05,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:05,439 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-10-15 13:04:05,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-15 13:04:05,441 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2018-10-15 13:04:05,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:05,443 INFO L225 Difference]: With dead ends: 81 [2018-10-15 13:04:05,443 INFO L226 Difference]: Without dead ends: 81 [2018-10-15 13:04:05,445 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1092 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=399, Invalid=6081, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 13:04:05,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-10-15 13:04:05,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2018-10-15 13:04:05,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-10-15 13:04:05,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-10-15 13:04:05,452 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 64 [2018-10-15 13:04:05,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:05,453 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-10-15 13:04:05,453 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 13:04:05,453 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-10-15 13:04:05,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-15 13:04:05,454 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:05,454 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:05,455 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:05,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:05,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1591801560, now seen corresponding path program 7 times [2018-10-15 13:04:05,456 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:05,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:06,370 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:06,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:06,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-15 13:04:06,371 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-15 13:04:06,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-15 13:04:06,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-10-15 13:04:06,373 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 38 states. [2018-10-15 13:04:08,783 WARN L179 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-15 13:04:10,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:10,100 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-10-15 13:04:10,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-15 13:04:10,101 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 73 [2018-10-15 13:04:10,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:10,102 INFO L225 Difference]: With dead ends: 90 [2018-10-15 13:04:10,102 INFO L226 Difference]: Without dead ends: 90 [2018-10-15 13:04:10,106 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1498 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=465, Invalid=8277, Unknown=0, NotChecked=0, Total=8742 [2018-10-15 13:04:10,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-15 13:04:10,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 83. [2018-10-15 13:04:10,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-10-15 13:04:10,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-10-15 13:04:10,111 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 73 [2018-10-15 13:04:10,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:10,112 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-10-15 13:04:10,112 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-15 13:04:10,112 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-10-15 13:04:10,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-15 13:04:10,113 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:10,113 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:10,114 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:10,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:10,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1058286711, now seen corresponding path program 8 times [2018-10-15 13:04:10,115 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:10,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:11,891 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:11,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:11,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 13:04:11,892 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 13:04:11,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 13:04:11,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 13:04:11,893 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 43 states. [2018-10-15 13:04:13,176 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-15 13:04:16,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:16,803 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-10-15 13:04:16,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-15 13:04:16,804 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 82 [2018-10-15 13:04:16,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:16,805 INFO L225 Difference]: With dead ends: 99 [2018-10-15 13:04:16,805 INFO L226 Difference]: Without dead ends: 99 [2018-10-15 13:04:16,810 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1968 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=531, Invalid=10811, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 13:04:16,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-10-15 13:04:16,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 92. [2018-10-15 13:04:16,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-10-15 13:04:16,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-10-15 13:04:16,816 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 82 [2018-10-15 13:04:16,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:16,816 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-10-15 13:04:16,816 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 13:04:16,817 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-10-15 13:04:16,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-15 13:04:16,820 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:16,820 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:16,821 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:16,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:16,821 INFO L82 PathProgramCache]: Analyzing trace with hash 236957176, now seen corresponding path program 9 times [2018-10-15 13:04:16,822 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:16,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:18,282 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 0 proven. 333 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:18,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:18,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-15 13:04:18,283 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-15 13:04:18,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-15 13:04:18,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-10-15 13:04:18,284 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 48 states. [2018-10-15 13:04:19,249 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-15 13:04:23,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:23,332 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-10-15 13:04:23,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-15 13:04:23,332 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 91 [2018-10-15 13:04:23,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:23,333 INFO L225 Difference]: With dead ends: 108 [2018-10-15 13:04:23,334 INFO L226 Difference]: Without dead ends: 108 [2018-10-15 13:04:23,337 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2502 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=597, Invalid=13683, Unknown=0, NotChecked=0, Total=14280 [2018-10-15 13:04:23,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-10-15 13:04:23,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 101. [2018-10-15 13:04:23,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-10-15 13:04:23,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-10-15 13:04:23,343 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 91 [2018-10-15 13:04:23,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:23,344 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-10-15 13:04:23,344 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-15 13:04:23,344 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-10-15 13:04:23,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-15 13:04:23,345 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:23,345 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:23,345 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:23,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:23,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1618550889, now seen corresponding path program 10 times [2018-10-15 13:04:23,347 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:23,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:25,449 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 0 proven. 415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:25,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:25,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 13:04:25,450 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 13:04:25,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 13:04:25,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 13:04:25,451 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 53 states. [2018-10-15 13:04:31,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:31,015 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-10-15 13:04:31,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-15 13:04:31,016 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 100 [2018-10-15 13:04:31,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:31,017 INFO L225 Difference]: With dead ends: 117 [2018-10-15 13:04:31,017 INFO L226 Difference]: Without dead ends: 117 [2018-10-15 13:04:31,020 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3100 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=663, Invalid=16893, Unknown=0, NotChecked=0, Total=17556 [2018-10-15 13:04:31,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-10-15 13:04:31,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 110. [2018-10-15 13:04:31,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-10-15 13:04:31,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-10-15 13:04:31,025 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 100 [2018-10-15 13:04:31,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:31,025 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-10-15 13:04:31,025 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 13:04:31,025 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-10-15 13:04:31,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-15 13:04:31,027 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:31,027 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:31,027 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:31,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:31,028 INFO L82 PathProgramCache]: Analyzing trace with hash 722132248, now seen corresponding path program 11 times [2018-10-15 13:04:31,028 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:31,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:32,718 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:32,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:32,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-10-15 13:04:32,719 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-15 13:04:32,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-15 13:04:32,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-10-15 13:04:32,720 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 58 states. [2018-10-15 13:04:39,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:39,199 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2018-10-15 13:04:39,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-10-15 13:04:39,200 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 109 [2018-10-15 13:04:39,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:39,201 INFO L225 Difference]: With dead ends: 126 [2018-10-15 13:04:39,201 INFO L226 Difference]: Without dead ends: 126 [2018-10-15 13:04:39,203 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3762 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=729, Invalid=20441, Unknown=0, NotChecked=0, Total=21170 [2018-10-15 13:04:39,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-10-15 13:04:39,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 119. [2018-10-15 13:04:39,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-10-15 13:04:39,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-10-15 13:04:39,208 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 109 [2018-10-15 13:04:39,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:39,209 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-10-15 13:04:39,209 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-15 13:04:39,209 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-10-15 13:04:39,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-15 13:04:39,210 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:39,210 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:39,211 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:39,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:39,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1595869879, now seen corresponding path program 12 times [2018-10-15 13:04:39,212 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:39,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:41,606 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 0 proven. 606 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:41,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:41,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-15 13:04:41,607 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-15 13:04:41,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-15 13:04:41,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 13:04:41,609 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 63 states. [2018-10-15 13:04:49,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:49,209 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-10-15 13:04:49,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-10-15 13:04:49,210 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 118 [2018-10-15 13:04:49,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:49,211 INFO L225 Difference]: With dead ends: 135 [2018-10-15 13:04:49,211 INFO L226 Difference]: Without dead ends: 135 [2018-10-15 13:04:49,214 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4488 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=795, Invalid=24327, Unknown=0, NotChecked=0, Total=25122 [2018-10-15 13:04:49,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-10-15 13:04:49,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 128. [2018-10-15 13:04:49,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-10-15 13:04:49,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2018-10-15 13:04:49,218 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 118 [2018-10-15 13:04:49,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:49,218 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2018-10-15 13:04:49,218 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-15 13:04:49,219 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2018-10-15 13:04:49,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-15 13:04:49,220 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:49,220 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:49,220 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:49,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:49,221 INFO L82 PathProgramCache]: Analyzing trace with hash 7636024, now seen corresponding path program 13 times [2018-10-15 13:04:49,221 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:49,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:51,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:51,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:51,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-10-15 13:04:51,774 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-15 13:04:51,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-15 13:04:51,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-10-15 13:04:51,775 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 68 states. [2018-10-15 13:05:00,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:00,823 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2018-10-15 13:05:00,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-10-15 13:05:00,824 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 127 [2018-10-15 13:05:00,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:00,825 INFO L225 Difference]: With dead ends: 144 [2018-10-15 13:05:00,825 INFO L226 Difference]: Without dead ends: 144 [2018-10-15 13:05:00,826 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5278 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=861, Invalid=28551, Unknown=0, NotChecked=0, Total=29412 [2018-10-15 13:05:00,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-10-15 13:05:00,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 137. [2018-10-15 13:05:00,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-10-15 13:05:00,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-10-15 13:05:00,830 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 127 [2018-10-15 13:05:00,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:00,830 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-10-15 13:05:00,830 INFO L482 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-15 13:05:00,830 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-10-15 13:05:00,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-15 13:05:00,831 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:00,831 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:00,831 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:00,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:00,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1133597225, now seen corresponding path program 14 times [2018-10-15 13:05:00,833 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:00,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:04,358 INFO L134 CoverageAnalysis]: Checked inductivity of 833 backedges. 0 proven. 833 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:05:04,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:04,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-15 13:05:04,359 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-15 13:05:04,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-15 13:05:04,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-10-15 13:05:04,359 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 73 states. [2018-10-15 13:05:14,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:14,669 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-10-15 13:05:14,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-10-15 13:05:14,669 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 136 [2018-10-15 13:05:14,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:14,671 INFO L225 Difference]: With dead ends: 153 [2018-10-15 13:05:14,671 INFO L226 Difference]: Without dead ends: 153 [2018-10-15 13:05:14,673 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6132 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=927, Invalid=33113, Unknown=0, NotChecked=0, Total=34040 [2018-10-15 13:05:14,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-10-15 13:05:14,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 146. [2018-10-15 13:05:14,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-10-15 13:05:14,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2018-10-15 13:05:14,676 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 136 [2018-10-15 13:05:14,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:14,677 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2018-10-15 13:05:14,677 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-15 13:05:14,677 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2018-10-15 13:05:14,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-15 13:05:14,678 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:14,678 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:14,678 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:14,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:14,678 INFO L82 PathProgramCache]: Analyzing trace with hash -2001820840, now seen corresponding path program 15 times [2018-10-15 13:05:14,679 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:14,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:18,188 INFO L134 CoverageAnalysis]: Checked inductivity of 960 backedges. 0 proven. 960 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:05:18,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:18,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-10-15 13:05:18,189 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-15 13:05:18,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-15 13:05:18,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-10-15 13:05:18,190 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 78 states. [2018-10-15 13:05:29,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:29,635 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2018-10-15 13:05:29,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-10-15 13:05:29,636 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 145 [2018-10-15 13:05:29,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:29,637 INFO L225 Difference]: With dead ends: 162 [2018-10-15 13:05:29,638 INFO L226 Difference]: Without dead ends: 162 [2018-10-15 13:05:29,639 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7050 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=993, Invalid=38013, Unknown=0, NotChecked=0, Total=39006 [2018-10-15 13:05:29,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-10-15 13:05:29,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 155. [2018-10-15 13:05:29,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-10-15 13:05:29,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-10-15 13:05:29,643 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 145 [2018-10-15 13:05:29,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:29,643 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-10-15 13:05:29,643 INFO L482 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-15 13:05:29,643 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-10-15 13:05:29,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-15 13:05:29,644 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:29,644 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:29,645 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:29,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:29,645 INFO L82 PathProgramCache]: Analyzing trace with hash -898091255, now seen corresponding path program 16 times [2018-10-15 13:05:29,646 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:29,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:33,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1096 backedges. 0 proven. 1096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:05:33,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:33,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-15 13:05:33,158 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-15 13:05:33,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-15 13:05:33,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 13:05:33,159 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 83 states. [2018-10-15 13:05:45,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:45,967 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-10-15 13:05:45,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-10-15 13:05:45,968 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 154 [2018-10-15 13:05:45,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:45,969 INFO L225 Difference]: With dead ends: 171 [2018-10-15 13:05:45,969 INFO L226 Difference]: Without dead ends: 171 [2018-10-15 13:05:45,972 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8032 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=1059, Invalid=43251, Unknown=0, NotChecked=0, Total=44310 [2018-10-15 13:05:45,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-10-15 13:05:45,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 164. [2018-10-15 13:05:45,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-10-15 13:05:45,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2018-10-15 13:05:45,975 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 154 [2018-10-15 13:05:45,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:45,975 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2018-10-15 13:05:45,975 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-15 13:05:45,976 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2018-10-15 13:05:45,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-15 13:05:45,976 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:45,976 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:45,976 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:45,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:45,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1920255368, now seen corresponding path program 17 times [2018-10-15 13:05:45,977 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:45,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:49,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1241 backedges. 0 proven. 1241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:05:49,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:49,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-10-15 13:05:49,877 INFO L460 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-10-15 13:05:49,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-10-15 13:05:49,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2018-10-15 13:05:49,878 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand 88 states. [2018-10-15 13:06:04,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:06:04,382 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2018-10-15 13:06:04,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2018-10-15 13:06:04,383 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 163 [2018-10-15 13:06:04,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:06:04,384 INFO L225 Difference]: With dead ends: 180 [2018-10-15 13:06:04,385 INFO L226 Difference]: Without dead ends: 180 [2018-10-15 13:06:04,386 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9078 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=1125, Invalid=48827, Unknown=0, NotChecked=0, Total=49952 [2018-10-15 13:06:04,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-10-15 13:06:04,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 173. [2018-10-15 13:06:04,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-10-15 13:06:04,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-10-15 13:06:04,390 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 163 [2018-10-15 13:06:04,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:06:04,390 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-10-15 13:06:04,391 INFO L482 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-10-15 13:06:04,391 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-10-15 13:06:04,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-15 13:06:04,392 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:06:04,392 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:06:04,392 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:06:04,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:06:04,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1476633577, now seen corresponding path program 18 times [2018-10-15 13:06:04,393 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:06:04,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:06:09,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 0 proven. 1395 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:06:09,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:06:09,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-15 13:06:09,435 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-15 13:06:09,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-15 13:06:09,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=8373, Unknown=0, NotChecked=0, Total=8556 [2018-10-15 13:06:09,436 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 93 states. [2018-10-15 13:06:25,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:06:25,527 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2018-10-15 13:06:25,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2018-10-15 13:06:25,528 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 172 [2018-10-15 13:06:25,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:06:25,530 INFO L225 Difference]: With dead ends: 189 [2018-10-15 13:06:25,530 INFO L226 Difference]: Without dead ends: 189 [2018-10-15 13:06:25,531 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10188 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=1191, Invalid=54741, Unknown=0, NotChecked=0, Total=55932 [2018-10-15 13:06:25,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-10-15 13:06:25,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 182. [2018-10-15 13:06:25,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-10-15 13:06:25,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2018-10-15 13:06:25,535 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 172 [2018-10-15 13:06:25,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:06:25,536 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2018-10-15 13:06:25,536 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-15 13:06:25,536 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2018-10-15 13:06:25,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-15 13:06:25,537 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:06:25,537 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:06:25,537 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:06:25,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:06:25,538 INFO L82 PathProgramCache]: Analyzing trace with hash -933475944, now seen corresponding path program 19 times [2018-10-15 13:06:25,539 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:06:25,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:06:30,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1558 backedges. 0 proven. 1558 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:06:30,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:06:30,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-10-15 13:06:30,591 INFO L460 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-10-15 13:06:30,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-10-15 13:06:30,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=9313, Unknown=0, NotChecked=0, Total=9506 [2018-10-15 13:06:30,592 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 98 states. [2018-10-15 13:06:48,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:06:48,620 INFO L93 Difference]: Finished difference Result 198 states and 198 transitions. [2018-10-15 13:06:48,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-10-15 13:06:48,620 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 181 [2018-10-15 13:06:48,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:06:48,622 INFO L225 Difference]: With dead ends: 198 [2018-10-15 13:06:48,622 INFO L226 Difference]: Without dead ends: 198 [2018-10-15 13:06:48,624 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11362 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=1257, Invalid=60993, Unknown=0, NotChecked=0, Total=62250 [2018-10-15 13:06:48,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-10-15 13:06:48,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 191. [2018-10-15 13:06:48,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-10-15 13:06:48,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-10-15 13:06:48,628 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 181 [2018-10-15 13:06:48,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:06:48,629 INFO L481 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2018-10-15 13:06:48,629 INFO L482 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-10-15 13:06:48,629 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-10-15 13:06:48,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-15 13:06:48,630 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:06:48,630 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:06:48,630 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:06:48,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:06:48,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1893623607, now seen corresponding path program 20 times [2018-10-15 13:06:48,631 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:06:48,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:06:53,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1730 backedges. 0 proven. 1730 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:06:53,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:06:53,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-10-15 13:06:53,925 INFO L460 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-10-15 13:06:53,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-10-15 13:06:53,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 13:06:53,926 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 103 states. [2018-10-15 13:07:13,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:13,895 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2018-10-15 13:07:13,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2018-10-15 13:07:13,896 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 190 [2018-10-15 13:07:13,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:13,897 INFO L225 Difference]: With dead ends: 207 [2018-10-15 13:07:13,897 INFO L226 Difference]: Without dead ends: 207 [2018-10-15 13:07:13,899 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12600 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=1323, Invalid=67583, Unknown=0, NotChecked=0, Total=68906 [2018-10-15 13:07:13,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-10-15 13:07:13,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 200. [2018-10-15 13:07:13,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-10-15 13:07:13,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 200 transitions. [2018-10-15 13:07:13,903 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 200 transitions. Word has length 190 [2018-10-15 13:07:13,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:13,903 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 200 transitions. [2018-10-15 13:07:13,903 INFO L482 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-10-15 13:07:13,903 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 200 transitions. [2018-10-15 13:07:13,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-15 13:07:13,904 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:13,904 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:13,904 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:13,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:13,905 INFO L82 PathProgramCache]: Analyzing trace with hash 32755896, now seen corresponding path program 21 times [2018-10-15 13:07:13,905 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:13,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:19,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1911 backedges. 0 proven. 1911 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:19,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:19,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-10-15 13:07:19,711 INFO L460 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-10-15 13:07:19,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-10-15 13:07:19,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=11343, Unknown=0, NotChecked=0, Total=11556 [2018-10-15 13:07:19,711 INFO L87 Difference]: Start difference. First operand 200 states and 200 transitions. Second operand 108 states. [2018-10-15 13:07:41,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:41,118 INFO L93 Difference]: Finished difference Result 216 states and 216 transitions. [2018-10-15 13:07:41,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2018-10-15 13:07:41,121 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 199 [2018-10-15 13:07:41,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:41,122 INFO L225 Difference]: With dead ends: 216 [2018-10-15 13:07:41,123 INFO L226 Difference]: Without dead ends: 216 [2018-10-15 13:07:41,124 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 274 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13902 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=1389, Invalid=74511, Unknown=0, NotChecked=0, Total=75900 [2018-10-15 13:07:41,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-10-15 13:07:41,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 209. [2018-10-15 13:07:41,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-10-15 13:07:41,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2018-10-15 13:07:41,129 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 199 [2018-10-15 13:07:41,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:41,129 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2018-10-15 13:07:41,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-10-15 13:07:41,129 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2018-10-15 13:07:41,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-10-15 13:07:41,130 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:41,130 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:41,131 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:41,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:41,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1933579689, now seen corresponding path program 22 times [2018-10-15 13:07:41,132 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:41,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:47,544 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 0 proven. 2101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:47,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:47,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-10-15 13:07:47,545 INFO L460 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-10-15 13:07:47,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-10-15 13:07:47,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=12433, Unknown=0, NotChecked=0, Total=12656 [2018-10-15 13:07:47,546 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 113 states. [2018-10-15 13:08:11,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:08:11,105 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2018-10-15 13:08:11,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2018-10-15 13:08:11,106 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 208 [2018-10-15 13:08:11,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:08:11,107 INFO L225 Difference]: With dead ends: 225 [2018-10-15 13:08:11,107 INFO L226 Difference]: Without dead ends: 225 [2018-10-15 13:08:11,110 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 287 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15268 ImplicationChecksByTransitivity, 18.7s TimeCoverageRelationStatistics Valid=1455, Invalid=81777, Unknown=0, NotChecked=0, Total=83232 [2018-10-15 13:08:11,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-10-15 13:08:11,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 218. [2018-10-15 13:08:11,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-10-15 13:08:11,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 218 transitions. [2018-10-15 13:08:11,115 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 218 transitions. Word has length 208 [2018-10-15 13:08:11,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:08:11,115 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 218 transitions. [2018-10-15 13:08:11,115 INFO L482 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-10-15 13:08:11,115 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 218 transitions. [2018-10-15 13:08:11,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-10-15 13:08:11,116 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:08:11,116 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:08:11,117 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:08:11,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:08:11,117 INFO L82 PathProgramCache]: Analyzing trace with hash 849596376, now seen corresponding path program 23 times [2018-10-15 13:08:11,118 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:08:11,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:08:19,155 INFO L134 CoverageAnalysis]: Checked inductivity of 2300 backedges. 0 proven. 2300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:08:19,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:08:19,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2018-10-15 13:08:19,156 INFO L460 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-10-15 13:08:19,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-10-15 13:08:19,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=13573, Unknown=0, NotChecked=0, Total=13806 [2018-10-15 13:08:19,157 INFO L87 Difference]: Start difference. First operand 218 states and 218 transitions. Second operand 118 states. [2018-10-15 13:08:45,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:08:45,267 INFO L93 Difference]: Finished difference Result 234 states and 234 transitions. [2018-10-15 13:08:45,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 188 states. [2018-10-15 13:08:45,267 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 217 [2018-10-15 13:08:45,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:08:45,269 INFO L225 Difference]: With dead ends: 234 [2018-10-15 13:08:45,269 INFO L226 Difference]: Without dead ends: 234 [2018-10-15 13:08:45,272 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 300 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16698 ImplicationChecksByTransitivity, 21.9s TimeCoverageRelationStatistics Valid=1521, Invalid=89381, Unknown=0, NotChecked=0, Total=90902 [2018-10-15 13:08:45,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-10-15 13:08:45,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 227. [2018-10-15 13:08:45,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-10-15 13:08:45,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2018-10-15 13:08:45,276 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 217 [2018-10-15 13:08:45,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:08:45,276 INFO L481 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2018-10-15 13:08:45,277 INFO L482 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-10-15 13:08:45,277 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2018-10-15 13:08:45,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-10-15 13:08:45,278 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:08:45,278 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:08:45,278 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:08:45,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:08:45,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1213012617, now seen corresponding path program 24 times [2018-10-15 13:08:45,279 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:08:45,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:08:52,511 INFO L134 CoverageAnalysis]: Checked inductivity of 2508 backedges. 0 proven. 2508 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:08:52,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:08:52,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-10-15 13:08:52,512 INFO L460 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-10-15 13:08:52,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-10-15 13:08:52,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=14763, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 13:08:52,513 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 123 states. [2018-10-15 13:09:20,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:09:20,478 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2018-10-15 13:09:20,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 196 states. [2018-10-15 13:09:20,478 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 226 [2018-10-15 13:09:20,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:09:20,480 INFO L225 Difference]: With dead ends: 243 [2018-10-15 13:09:20,480 INFO L226 Difference]: Without dead ends: 243 [2018-10-15 13:09:20,483 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 313 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18192 ImplicationChecksByTransitivity, 21.9s TimeCoverageRelationStatistics Valid=1587, Invalid=97323, Unknown=0, NotChecked=0, Total=98910 [2018-10-15 13:09:20,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-10-15 13:09:20,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 236. [2018-10-15 13:09:20,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-10-15 13:09:20,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 236 transitions. [2018-10-15 13:09:20,487 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 236 transitions. Word has length 226 [2018-10-15 13:09:20,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:09:20,488 INFO L481 AbstractCegarLoop]: Abstraction has 236 states and 236 transitions. [2018-10-15 13:09:20,488 INFO L482 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-10-15 13:09:20,488 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 236 transitions. [2018-10-15 13:09:20,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-10-15 13:09:20,489 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:09:20,489 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:09:20,490 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:09:20,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:09:20,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1572976904, now seen corresponding path program 25 times [2018-10-15 13:09:20,491 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:09:20,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:09:29,164 INFO L134 CoverageAnalysis]: Checked inductivity of 2725 backedges. 0 proven. 2725 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:09:29,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:09:29,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [128] total 128 [2018-10-15 13:09:29,165 INFO L460 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-10-15 13:09:29,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-10-15 13:09:29,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=16003, Unknown=0, NotChecked=0, Total=16256 [2018-10-15 13:09:29,167 INFO L87 Difference]: Start difference. First operand 236 states and 236 transitions. Second operand 128 states. [2018-10-15 13:10:00,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:10:00,130 INFO L93 Difference]: Finished difference Result 252 states and 252 transitions. [2018-10-15 13:10:00,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 204 states. [2018-10-15 13:10:00,131 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 235 [2018-10-15 13:10:00,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:10:00,133 INFO L225 Difference]: With dead ends: 252 [2018-10-15 13:10:00,133 INFO L226 Difference]: Without dead ends: 252 [2018-10-15 13:10:00,135 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 326 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19750 ImplicationChecksByTransitivity, 25.0s TimeCoverageRelationStatistics Valid=1653, Invalid=105603, Unknown=0, NotChecked=0, Total=107256 [2018-10-15 13:10:00,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-10-15 13:10:00,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 245. [2018-10-15 13:10:00,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-10-15 13:10:00,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2018-10-15 13:10:00,140 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 235 [2018-10-15 13:10:00,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:10:00,140 INFO L481 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2018-10-15 13:10:00,140 INFO L482 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-10-15 13:10:00,140 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2018-10-15 13:10:00,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-10-15 13:10:00,142 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:10:00,142 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:10:00,142 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:10:00,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:10:00,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1924573033, now seen corresponding path program 26 times [2018-10-15 13:10:00,143 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:10:00,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:10:08,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2951 backedges. 0 proven. 2951 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:10:08,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:10:08,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-10-15 13:10:08,814 INFO L460 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-10-15 13:10:08,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-10-15 13:10:08,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=17293, Unknown=0, NotChecked=0, Total=17556 [2018-10-15 13:10:08,815 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 133 states. [2018-10-15 13:10:41,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:10:41,352 INFO L93 Difference]: Finished difference Result 261 states and 261 transitions. [2018-10-15 13:10:41,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 212 states. [2018-10-15 13:10:41,352 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 244 [2018-10-15 13:10:41,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:10:41,354 INFO L225 Difference]: With dead ends: 261 [2018-10-15 13:10:41,354 INFO L226 Difference]: Without dead ends: 261 [2018-10-15 13:10:41,357 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 339 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21372 ImplicationChecksByTransitivity, 25.6s TimeCoverageRelationStatistics Valid=1719, Invalid=114221, Unknown=0, NotChecked=0, Total=115940 [2018-10-15 13:10:41,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-10-15 13:10:41,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 254. [2018-10-15 13:10:41,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-10-15 13:10:41,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 254 transitions. [2018-10-15 13:10:41,362 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 254 transitions. Word has length 244 [2018-10-15 13:10:41,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:10:41,362 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 254 transitions. [2018-10-15 13:10:41,363 INFO L482 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-10-15 13:10:41,363 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 254 transitions. [2018-10-15 13:10:41,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-10-15 13:10:41,364 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:10:41,364 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:10:41,364 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:10:41,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:10:41,365 INFO L82 PathProgramCache]: Analyzing trace with hash 135607832, now seen corresponding path program 27 times [2018-10-15 13:10:41,365 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:10:41,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:10:51,238 INFO L134 CoverageAnalysis]: Checked inductivity of 3186 backedges. 0 proven. 3186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:10:51,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:10:51,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [138] total 138 [2018-10-15 13:10:51,238 INFO L460 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-10-15 13:10:51,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-10-15 13:10:51,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=18633, Unknown=0, NotChecked=0, Total=18906 [2018-10-15 13:10:51,239 INFO L87 Difference]: Start difference. First operand 254 states and 254 transitions. Second operand 138 states. [2018-10-15 13:11:26,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:11:26,699 INFO L93 Difference]: Finished difference Result 270 states and 270 transitions. [2018-10-15 13:11:26,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 220 states. [2018-10-15 13:11:26,699 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 253 [2018-10-15 13:11:26,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:11:26,700 INFO L225 Difference]: With dead ends: 270 [2018-10-15 13:11:26,701 INFO L226 Difference]: Without dead ends: 270 [2018-10-15 13:11:26,703 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 352 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23058 ImplicationChecksByTransitivity, 28.3s TimeCoverageRelationStatistics Valid=1785, Invalid=123177, Unknown=0, NotChecked=0, Total=124962 [2018-10-15 13:11:26,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-10-15 13:11:26,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 263. [2018-10-15 13:11:26,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-10-15 13:11:26,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 263 transitions. [2018-10-15 13:11:26,707 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 263 transitions. Word has length 253 [2018-10-15 13:11:26,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:11:26,707 INFO L481 AbstractCegarLoop]: Abstraction has 263 states and 263 transitions. [2018-10-15 13:11:26,707 INFO L482 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-10-15 13:11:26,707 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 263 transitions. [2018-10-15 13:11:26,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-10-15 13:11:26,708 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:11:26,709 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:11:26,709 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:11:26,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:11:26,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1466612809, now seen corresponding path program 28 times [2018-10-15 13:11:26,710 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:11:26,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:11:38,134 INFO L134 CoverageAnalysis]: Checked inductivity of 3430 backedges. 0 proven. 3430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:11:38,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:11:38,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2018-10-15 13:11:38,135 INFO L460 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-10-15 13:11:38,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-10-15 13:11:38,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=20023, Unknown=0, NotChecked=0, Total=20306 [2018-10-15 13:11:38,136 INFO L87 Difference]: Start difference. First operand 263 states and 263 transitions. Second operand 143 states. [2018-10-15 13:12:16,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:16,319 INFO L93 Difference]: Finished difference Result 279 states and 279 transitions. [2018-10-15 13:12:16,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 228 states. [2018-10-15 13:12:16,320 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 262 [2018-10-15 13:12:16,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:16,321 INFO L225 Difference]: With dead ends: 279 [2018-10-15 13:12:16,321 INFO L226 Difference]: Without dead ends: 279 [2018-10-15 13:12:16,324 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 365 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24808 ImplicationChecksByTransitivity, 31.4s TimeCoverageRelationStatistics Valid=1851, Invalid=132471, Unknown=0, NotChecked=0, Total=134322 [2018-10-15 13:12:16,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-10-15 13:12:16,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 272. [2018-10-15 13:12:16,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-10-15 13:12:16,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 272 transitions. [2018-10-15 13:12:16,328 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 272 transitions. Word has length 262 [2018-10-15 13:12:16,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:16,329 INFO L481 AbstractCegarLoop]: Abstraction has 272 states and 272 transitions. [2018-10-15 13:12:16,329 INFO L482 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-10-15 13:12:16,329 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 272 transitions. [2018-10-15 13:12:16,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-10-15 13:12:16,330 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:16,330 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:16,330 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:16,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:16,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1426416328, now seen corresponding path program 29 times [2018-10-15 13:12:16,331 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:16,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat